[{"department":[{"_id":"64"}],"project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"publication_identifier":{"issn":["1549-6325","1549-6333"]},"publication_status":"published","title":"A Complexity Theoretical Study of Fuzzy K-Means","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:41Z","doi":"10.1145/3409385","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Brauer","id":"13291","first_name":"Sascha","full_name":"Brauer, Sascha"},{"last_name":"Bujna","first_name":"Kathrin","full_name":"Bujna, Kathrin"}],"publication":"ACM Transactions on Algorithms","status":"public","date_created":"2021-01-08T08:51:42Z","volume":16,"user_id":"13291","type":"journal_article","citation":{"chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical Study of Fuzzy K-Means.” ACM Transactions on Algorithms 16, no. 4 (2020): 1–25. https://doi.org/10.1145/3409385.","apa":"Blömer, J., Brauer, S., & Bujna, K. (2020). A Complexity Theoretical Study of Fuzzy K-Means. ACM Transactions on Algorithms, 16(4), 1–25. https://doi.org/10.1145/3409385","ama":"Blömer J, Brauer S, Bujna K. A Complexity Theoretical Study of Fuzzy K-Means. ACM Transactions on Algorithms. 2020;16(4):1-25. doi:10.1145/3409385","mla":"Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.” ACM Transactions on Algorithms, vol. 16, no. 4, 2020, pp. 1–25, doi:10.1145/3409385.","bibtex":"@article{Blömer_Brauer_Bujna_2020, title={A Complexity Theoretical Study of Fuzzy K-Means}, volume={16}, DOI={10.1145/3409385}, number={4}, journal={ACM Transactions on Algorithms}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2020}, pages={1–25} }","short":"J. Blömer, S. Brauer, K. Bujna, ACM Transactions on Algorithms 16 (2020) 1–25.","ieee":"J. Blömer, S. Brauer, and K. Bujna, “A Complexity Theoretical Study of Fuzzy K-Means,” ACM Transactions on Algorithms, vol. 16, no. 4, pp. 1–25, 2020."},"year":"2020","page":"1-25","intvolume":" 16","_id":"20888","issue":"4"},{"doi":"10.1007/978-3-540-24632-9_1","date_updated":"2022-01-06T06:58:51Z","title":"A Generalized Wiener Attack on RSA","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540210184","9783540246329"]},"department":[{"_id":"64"}],"_id":"3012","citation":{"chicago":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-24632-9_1.","ama":"Blömer J, May A. A Generalized Wiener Attack on RSA. In: Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:10.1007/978-3-540-24632-9_1","apa":"Blömer, J., & May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_1","bibtex":"@inbook{Blömer_May_2004, place={Berlin, Heidelberg}, title={A Generalized Wiener Attack on RSA}, DOI={10.1007/978-3-540-24632-9_1}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2004}, pages={1–13} }","mla":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:10.1007/978-3-540-24632-9_1.","short":"J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.","ieee":"J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13."},"type":"book_chapter","year":"2004","page":"1-13","ddc":["000"],"user_id":"25078","has_accepted_license":"1","status":"public","date_created":"2018-06-05T08:20:59Z","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"}],"publisher":"Springer Berlin Heidelberg","file_date_updated":"2018-06-05T08:21:31Z","publication":"Public Key Cryptography – PKC 2004","file":[{"creator":"feidens","file_id":"3013","file_size":198120,"relation":"main_file","success":1,"date_updated":"2018-06-05T08:21:31Z","content_type":"application/pdf","date_created":"2018-06-05T08:21:31Z","file_name":"keys.pdf","access_level":"closed"}]},{"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"first_name":"Laurens Alexander","full_name":"Porzenheim, Laurens Alexander","last_name":"Porzenheim","id":"47434"}],"department":[{"_id":"64"}],"status":"public","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"date_created":"2023-04-12T08:18:41Z","title":"A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices","user_id":"47434","main_file_link":[{"url":"https://eprint.iacr.org/2023/464","open_access":"1"}],"citation":{"ieee":"J. Blömer, J. Bobolz, and L. A. Porzenheim, “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” presented at the Asiacrypt 2023, Guangzhou, China, 2023.","short":"J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.","bibtex":"@inproceedings{Blömer_Bobolz_Porzenheim_2023, title={A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices}, author={Blömer, Johannes and Bobolz, Jan and Porzenheim, Laurens Alexander}, year={2023} }","mla":"Blömer, Johannes, et al. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. 2023.","chicago":"Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” 2023.","apa":"Blömer, J., Bobolz, J., & Porzenheim, L. A. (2023). A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. Asiacrypt 2023, Guangzhou, China.","ama":"Blömer J, Bobolz J, Porzenheim LA. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. In: ; 2023."},"year":"2023","type":"conference","language":[{"iso":"eng"}],"_id":"43458","date_updated":"2023-09-07T09:53:26Z","conference":{"end_date":"2023-12-08","location":"Guangzhou, China","name":"Asiacrypt 2023","start_date":"2023-12-04"},"oa":"1"},{"file_date_updated":"2018-06-05T08:32:27Z","department":[{"_id":"64"}],"publication":"Technical report/Departement of Computer Science, ETH Zürich","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"first_name":"Beat","full_name":"Trachsler, Beat","last_name":"Trachsler"}],"file":[{"access_level":"closed","file_name":"code_lower.pdf","date_created":"2018-06-05T08:32:27Z","success":1,"relation":"main_file","date_updated":"2018-06-05T08:32:27Z","content_type":"application/pdf","file_id":"3031","creator":"feidens","file_size":173369}],"publication_status":"published","date_created":"2018-06-05T08:29:47Z","has_accepted_license":"1","status":"public","extern":"1","title":"A lower bound for a class of graph based loss resilient codes","ddc":["000"],"user_id":"25078","citation":{"chicago":"Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH Zürich, 1998.","ama":"Blömer J, Trachsler B. A lower bound for a class of graph based loss resilient codes. Technical report/Departement of Computer Science, ETH Zürich. 1998.","apa":"Blömer, J., & Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. Technical Report/Departement of Computer Science, ETH Zürich.","bibtex":"@article{Blömer_Trachsler_1998, title={A lower bound for a class of graph based loss resilient codes}, journal={Technical report/Departement of Computer Science, ETH Zürich}, author={Blömer, Johannes and Trachsler, Beat}, year={1998} }","mla":"Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH Zürich, 1998.","short":"J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (1998).","ieee":"J. Blömer and B. Trachsler, “A lower bound for a class of graph based loss resilient codes,” Technical report/Departement of Computer Science, ETH Zürich, 1998."},"year":"1998","type":"journal_article","_id":"3028","date_updated":"2022-01-06T06:58:52Z"},{"doi":"10.1145/948109.948151","date_updated":"2022-01-06T06:58:51Z","_id":"3017","year":"2004","type":"conference","citation":{"ieee":"J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against bellcore attacks,” in Proceedings of the 10th ACM conference on Computer and communication security - CCS ’03, 2004.","short":"J. Blömer, M. Otto, J.-P. Seifert, in: Proceedings of the 10th ACM Conference on Computer and Communication Security - CCS ’03, ACM Press, 2004.","bibtex":"@inproceedings{Blömer_Otto_Seifert_2004, title={A new CRT-RSA algorithm secure against bellcore attacks}, DOI={10.1145/948109.948151}, booktitle={Proceedings of the 10th ACM conference on Computer and communication security - CCS ’03}, publisher={ACM Press}, author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2004} }","mla":"Blömer, Johannes, et al. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” Proceedings of the 10th ACM Conference on Computer and Communication Security - CCS ’03, ACM Press, 2004, doi:10.1145/948109.948151.","apa":"Blömer, J., Otto, M., & Seifert, J.-P. (2004). A new CRT-RSA algorithm secure against bellcore attacks. In Proceedings of the 10th ACM conference on Computer and communication security - CCS ’03. ACM Press. https://doi.org/10.1145/948109.948151","ama":"Blömer J, Otto M, Seifert J-P. A new CRT-RSA algorithm secure against bellcore attacks. In: Proceedings of the 10th ACM Conference on Computer and Communication Security - CCS ’03. ACM Press; 2004. doi:10.1145/948109.948151","chicago":"Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” In Proceedings of the 10th ACM Conference on Computer and Communication Security - CCS ’03. ACM Press, 2004. https://doi.org/10.1145/948109.948151."},"user_id":"25078","title":"A new CRT-RSA algorithm secure against bellcore attacks","status":"public","date_created":"2018-06-05T08:24:48Z","publication_status":"published","publication_identifier":{"isbn":["1581137389"]},"publisher":"ACM Press","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Otto","full_name":"Otto, Martin","first_name":"Martin"},{"full_name":"Seifert, Jean-Pierre","first_name":"Jean-Pierre","last_name":"Seifert"}],"publication":"Proceedings of the 10th ACM conference on Computer and communication security - CCS '03","department":[{"_id":"64"}]},{"doi":"10.1109/FDTC.2014.22","date_updated":"2022-01-06T07:01:16Z","_id":"463","page":"123--136","citation":{"ieee":"J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.","short":"J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, J.-P. Seifert, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.","mla":"Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136, doi:10.1109/FDTC.2014.22.","bibtex":"@inproceedings{Blömer_Gomes da Silva_Günther_Krämer_Seifert_2014, title={A Practical Second-Order Fault Attack against a Real-World Pairing Implementation}, DOI={10.1109/FDTC.2014.22}, booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}, author={Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer, Juliane and Seifert, Jean-Pierre}, year={2014}, pages={123--136} }","apa":"Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., & Seifert, J.-P. (2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp. 123--136). https://doi.org/10.1109/FDTC.2014.22","ama":"Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:123--136. doi:10.1109/FDTC.2014.22","chicago":"Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 123--136, 2014. https://doi.org/10.1109/FDTC.2014.22."},"year":"2014","type":"conference","ddc":["040"],"title":"A Practical Second-Order Fault Attack against a Real-World Pairing Implementation","user_id":"25078","abstract":[{"text":"Several fault attacks against pairing-based cryptography have been described theoretically in recent years. Interestingly, none of these have been practically evaluated. We accomplished this task and prove that fault attacks against pairing-based cryptography are indeed possible and are even practical — thus posing a serious threat. Moreover, we successfully conducted a second-order fault attack against an open source implementation of the eta pairing on an AVR XMEGA A1. We injected the first fault into the computation of the Miller Algorithm and applied the second fault to skip the final exponentiation completely. We introduce a low-cost setup that allowed us to generate multiple independent faults in one computation. The setup implements these faults by clock glitches which induce instruction skips. With this setup we conducted the first practical fault attack against a complete pairing computation.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"date_created":"2017-10-17T12:42:22Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-03-16T11:20:54Z","publication":"Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)","department":[{"_id":"64"}],"author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Ricardo","full_name":"Gomes da Silva, Ricardo","last_name":"Gomes da Silva"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"},{"full_name":"Krämer, Juliane","first_name":"Juliane","last_name":"Krämer"},{"first_name":"Jean-Pierre","full_name":"Seifert, Jean-Pierre","last_name":"Seifert"}],"file":[{"file_id":"1336","creator":"florida","file_size":437518,"relation":"main_file","success":1,"date_updated":"2018-03-16T11:20:54Z","content_type":"application/pdf","date_created":"2018-03-16T11:20:54Z","file_name":"463-FDTC14.pdf","access_level":"closed"}]},{"year":"2007","type":"book_chapter","citation":{"chicago":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” In Algorithms — ESA’ 98, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-68530-8_13.","apa":"Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-68530-8_13","ama":"Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: Algorithms — ESA’ 98. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:151-162. doi:10.1007/3-540-68530-8_13","bibtex":"@inbook{Blömer_2007, place={Berlin, Heidelberg}, title={A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers}, DOI={10.1007/3-540-68530-8_13}, booktitle={Algorithms — ESA’ 98}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2007}, pages={151–162} }","mla":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” Algorithms — ESA’ 98, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.","short":"J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.","ieee":"J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162."},"page":"151-162","date_updated":"2022-01-06T06:58:51Z","_id":"3026","doi":"10.1007/3-540-68530-8_13","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"publisher":"Springer Berlin Heidelberg","publication":"Algorithms — ESA’ 98","department":[{"_id":"64"}],"status":"public","date_created":"2018-06-05T08:28:39Z","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540648482","9783540685302"]},"place":"Berlin, Heidelberg","user_id":"25078","title":"A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers"},{"conference":{"location":"Barcelona, Spain","start_date":"2016-12-12","name":"IEEE 16th International Conference on Data Mining (ICDM)","end_date":"2016-12-15"},"_id":"2367","page":"805-810","year":"2016","citation":{"mla":"Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.” 2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–10, doi:10.1109/icdm.2016.0094.","bibtex":"@inproceedings{Blömer_Brauer_Bujna_2016, title={A Theoretical Analysis of the Fuzzy K-Means Problem}, DOI={10.1109/icdm.2016.0094}, booktitle={2016 IEEE 16th International Conference on Data Mining (ICDM)}, publisher={IEEE}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2016}, pages={805–810} }","ama":"Blömer J, Brauer S, Bujna K. A Theoretical Analysis of the Fuzzy K-Means Problem. In: 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE; 2016:805-810. doi:10.1109/icdm.2016.0094","apa":"Blömer, J., Brauer, S., & Bujna, K. (2016). A Theoretical Analysis of the Fuzzy K-Means Problem. In 2016 IEEE 16th International Conference on Data Mining (ICDM) (pp. 805–810). Barcelona, Spain: IEEE. https://doi.org/10.1109/icdm.2016.0094","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis of the Fuzzy K-Means Problem.” In 2016 IEEE 16th International Conference on Data Mining (ICDM), 805–10. IEEE, 2016. https://doi.org/10.1109/icdm.2016.0094.","ieee":"J. Blömer, S. Brauer, and K. Bujna, “A Theoretical Analysis of the Fuzzy K-Means Problem,” in 2016 IEEE 16th International Conference on Data Mining (ICDM), Barcelona, Spain, 2016, pp. 805–810.","short":"J. Blömer, S. Brauer, K. Bujna, in: 2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–810."},"type":"conference","abstract":[{"lang":"eng","text":"One of the most popular fuzzy clustering techniques is the fuzzy K-means algorithm (also known as fuzzy-c-means or FCM algorithm). In contrast to the K-means and K-median problem, the underlying fuzzy K-means problem has not been studied from a theoretical point of view. In particular, there are no algorithms with approximation guarantees similar to the famous K-means++ algorithm known for the fuzzy K-means problem. This work initiates the study of the fuzzy K-means problem from an algorithmic and complexity theoretic perspective. We show that optimal solutions for the fuzzy K-means problem cannot, in general, be expressed by radicals over the input points. Surprisingly, this already holds for simple inputs in one-dimensional space. Hence, one cannot expect to compute optimal solutions exactly. We give the first (1+eps)-approximation algorithms for the fuzzy K-means problem. First, we present a deterministic approximation algorithm whose runtime is polynomial in N and linear in the dimension D of the input set, given that K is constant, i.e. a polynomial time approximation scheme (PTAS) for fixed K. We achieve this result by showing that for each soft clustering there exists a hard clustering with similar properties. Second, by using techniques known from coreset constructions for the K-means problem, we develop a deterministic approximation algorithm that runs in time almost linear in N but exponential in the dimension D. We complement these results with a randomized algorithm which imposes some natural restrictions on the sought solution and whose runtime is comparable to some of the most efficient approximation algorithms for K-means, i.e. linear in the number of points and the dimension, but exponential in the number of clusters."}],"user_id":"25078","keyword":["unsolvability by radicals","clustering","fuzzy k-means","probabilistic method","approximation algorithms","randomized algorithms"],"publication":"2016 IEEE 16th International Conference on Data Mining (ICDM)","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"first_name":"Sascha","full_name":"Brauer, Sascha","last_name":"Brauer","id":"13291"},{"full_name":"Bujna, Kathrin","first_name":"Kathrin","last_name":"Bujna"}],"publisher":"IEEE","date_created":"2018-04-17T11:46:07Z","status":"public","date_updated":"2022-01-06T06:55:58Z","doi":"10.1109/icdm.2016.0094","language":[{"iso":"eng"}],"title":"A Theoretical Analysis of the Fuzzy K-Means Problem","department":[{"_id":"64"}],"publication_status":"published","publication_identifier":{"isbn":["9781509054732"]}},{"user_id":"25078","title":"A Theoretical and Experimental Comparison of the EM and SEM Algorithm","date_created":"2018-06-05T07:29:15Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781479952090"]},"department":[{"_id":"64"}],"publication":"2014 22nd International Conference on Pattern Recognition","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Kathrin","full_name":"Bujna, Kathrin","last_name":"Bujna"},{"full_name":"Kuntze, Daniel","first_name":"Daniel","last_name":"Kuntze"}],"publisher":"IEEE","doi":"10.1109/icpr.2014.253","date_updated":"2022-01-06T06:58:49Z","_id":"2977","citation":{"ieee":"J. Blömer, K. Bujna, and D. Kuntze, “A Theoretical and Experimental Comparison of the EM and SEM Algorithm,” in 2014 22nd International Conference on Pattern Recognition, 2014.","short":"J. Blömer, K. Bujna, D. Kuntze, in: 2014 22nd International Conference on Pattern Recognition, IEEE, 2014.","bibtex":"@inproceedings{Blömer_Bujna_Kuntze_2014, title={A Theoretical and Experimental Comparison of the EM and SEM Algorithm}, DOI={10.1109/icpr.2014.253}, booktitle={2014 22nd International Conference on Pattern Recognition}, publisher={IEEE}, author={Blömer, Johannes and Bujna, Kathrin and Kuntze, Daniel}, year={2014} }","mla":"Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.” 2014 22nd International Conference on Pattern Recognition, IEEE, 2014, doi:10.1109/icpr.2014.253.","chicago":"Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.” In 2014 22nd International Conference on Pattern Recognition. IEEE, 2014. https://doi.org/10.1109/icpr.2014.253.","apa":"Blömer, J., Bujna, K., & Kuntze, D. (2014). A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In 2014 22nd International Conference on Pattern Recognition. IEEE. https://doi.org/10.1109/icpr.2014.253","ama":"Blömer J, Bujna K, Kuntze D. A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In: 2014 22nd International Conference on Pattern Recognition. IEEE; 2014. doi:10.1109/icpr.2014.253"},"year":"2014","type":"conference"},{"publication_identifier":{"isbn":["9783540259107","9783540320555"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","department":[{"_id":"64"}],"title":"A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers","place":"Berlin, Heidelberg","series_title":"Lecture Notes in Computer Science","doi":"10.1007/11426639_15","date_updated":"2022-01-06T06:58:50Z","date_created":"2018-06-05T08:16:47Z","has_accepted_license":"1","status":"public","file":[{"date_updated":"2018-06-05T08:18:20Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":333655,"creator":"feidens","file_id":"3008","access_level":"closed","date_created":"2018-06-05T08:18:20Z","file_name":"toolkit.pdf"}],"publication":"EUROCRYPT 2005","file_date_updated":"2018-06-05T08:18:20Z","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"}],"publisher":"Springer Berlin Heidelberg","user_id":"25078","ddc":["000"],"page":"251-267","citation":{"short":"J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.","ieee":"J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.","apa":"Blömer, J., & May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_15","ama":"Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: EUROCRYPT 2005. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:10.1007/11426639_15","chicago":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11426639_15.","mla":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:10.1007/11426639_15.","bibtex":"@inbook{Blömer_May_2005, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers}, DOI={10.1007/11426639_15}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2005}, pages={251–267}, collection={Lecture Notes in Computer Science} }"},"type":"book_chapter","year":"2005","_id":"3006"},{"year":"2016","type":"book_chapter","citation":{"short":"J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.","ieee":"J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in Advances in Knowledge Discovery and Data Mining, Cham: Springer International Publishing, 2016, pp. 296–308.","chicago":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-31750-2_24.","ama":"Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances in Knowledge Discovery and Data Mining. Cham: Springer International Publishing; 2016:296-308. doi:10.1007/978-3-319-31750-2_24","apa":"Blömer, J., & Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In Advances in Knowledge Discovery and Data Mining (pp. 296–308). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-31750-2_24","mla":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.","bibtex":"@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian Mixture Models}, DOI={10.1007/978-3-319-31750-2_24}, booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016}, pages={296–308} }"},"page":"296-308","_id":"2970","date_updated":"2022-01-06T06:58:49Z","doi":"10.1007/978-3-319-31750-2_24","publisher":"Springer International Publishing","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"full_name":"Bujna, Kathrin","first_name":"Kathrin","last_name":"Bujna"}],"department":[{"_id":"64"}],"publication":"Advances in Knowledge Discovery and Data Mining","status":"public","date_created":"2018-06-04T12:27:21Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319317496","9783319317502"]},"publication_status":"published","place":"Cham","user_id":"25078","title":"Adaptive Seeding for Gaussian Mixture Models"},{"user_id":"25078","title":"Adaptive Seeding for Gaussian Mixture Models","place":"Cham","status":"public","date_created":"2018-06-05T07:31:39Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319317496","9783319317502"]},"author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"full_name":"Bujna, Kathrin","first_name":"Kathrin","last_name":"Bujna"}],"publisher":"Springer International Publishing","department":[{"_id":"64"}],"publication":"Advances in Knowledge Discovery and Data Mining","doi":"10.1007/978-3-319-31750-2_24","date_updated":"2023-01-10T13:49:50Z","_id":"2978","type":"book_chapter","citation":{"short":"J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.","ieee":"J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in Advances in Knowledge Discovery and Data Mining, Cham: Springer International Publishing, 2016, pp. 296–308.","chicago":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-31750-2_24.","ama":"Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances in Knowledge Discovery and Data Mining. Springer International Publishing; 2016:296-308. doi:10.1007/978-3-319-31750-2_24","apa":"Blömer, J., & Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In Advances in Knowledge Discovery and Data Mining (pp. 296–308). Springer International Publishing. https://doi.org/10.1007/978-3-319-31750-2_24","mla":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.","bibtex":"@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian Mixture Models}, DOI={10.1007/978-3-319-31750-2_24}, booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016}, pages={296–308} }"},"year":"2016","page":"296-308"},{"type":"report","year":"1995","citation":{"ama":"Blömer J, Kalfane M, Karp R, Karpinski M, Luby M, Zuckerman D. An XOR-Based Erasure-Resilient Coding Scheme. Berkeley, USA; 1995.","apa":"Blömer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., & Zuckerman, D. (1995). An XOR-based erasure-resilient coding scheme. Berkeley, USA.","chicago":"Blömer, Johannes, Malik Kalfane, Richard Karp, Marek Karpinski, Michael Luby, and David Zuckerman. An XOR-Based Erasure-Resilient Coding Scheme. Technical Report, International Computer Science Institute. Berkeley, USA, 1995.","bibtex":"@book{Blömer_Kalfane_Karp_Karpinski_Luby_Zuckerman_1995, place={Berkeley, USA}, series={Technical Report, International Computer Science Institute}, title={An XOR-based erasure-resilient coding scheme}, author={Blömer, Johannes and Kalfane, Malik and Karp, Richard and Karpinski, Marek and Luby, Michael and Zuckerman, David}, year={1995}, collection={Technical Report, International Computer Science Institute} }","mla":"Blömer, Johannes, et al. An XOR-Based Erasure-Resilient Coding Scheme. 1995.","short":"J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, D. Zuckerman, An XOR-Based Erasure-Resilient Coding Scheme, Berkeley, USA, 1995.","ieee":"J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, An XOR-based erasure-resilient coding scheme. Berkeley, USA, 1995."},"series_title":"Technical Report, International Computer Science Institute","date_updated":"2022-01-06T06:58:53Z","_id":"3038","has_accepted_license":"1","status":"public","date_created":"2018-06-05T08:40:26Z","file":[{"file_size":261338,"creator":"feidens","file_id":"3039","date_updated":"2018-06-05T08:42:49Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"erasure.pdf","date_created":"2018-06-05T08:42:49Z","access_level":"closed"}],"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Kalfane","first_name":"Malik","full_name":"Kalfane, Malik"},{"full_name":"Karp, Richard","first_name":"Richard","last_name":"Karp"},{"full_name":"Karpinski, Marek","first_name":"Marek","last_name":"Karpinski"},{"full_name":"Luby, Michael","first_name":"Michael","last_name":"Luby"},{"first_name":"David","full_name":"Zuckerman, David","last_name":"Zuckerman"}],"department":[{"_id":"64"}],"file_date_updated":"2018-06-05T08:42:49Z","user_id":"25078","title":"An XOR-based erasure-resilient coding scheme","ddc":["000"],"place":"Berkeley, USA","extern":"1"},{"date_created":"2018-06-05T07:28:52Z","status":"public","volume":69,"publication_status":"published","publication_identifier":{"eissn":["0178-4617"]},"department":[{"_id":"64"}],"publication":"Algorithmica","author":[{"last_name":"Ackermann","full_name":"Ackermann, Marcel Rudolf","first_name":"Marcel Rudolf"},{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"first_name":"Daniel","full_name":"Kuntze, Daniel","last_name":"Kuntze"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"publisher":"Springer US","user_id":"25078","title":"Analysis of Agglomerative Clustering","citation":{"ieee":"M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative Clustering,” Algorithmica, vol. 69, 2014.","short":"M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014).","bibtex":"@article{Ackermann_Blömer_Kuntze_Sohler_2014, title={Analysis of Agglomerative Clustering}, volume={69}, DOI={10.1007/s00453-012-9717-4}, journal={Algorithmica}, publisher={Springer US}, author={Ackermann, Marcel Rudolf and Blömer, Johannes and Kuntze, Daniel and Sohler, Christian}, year={2014} }","mla":"Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.” Algorithmica, vol. 69, Springer US, 2014, doi:10.1007/s00453-012-9717-4.","chicago":"Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian Sohler. “Analysis of Agglomerative Clustering.” Algorithmica 69 (2014). https://doi.org/10.1007/s00453-012-9717-4.","apa":"Ackermann, M. R., Blömer, J., Kuntze, D., & Sohler, C. (2014). Analysis of Agglomerative Clustering. Algorithmica, 69. https://doi.org/10.1007/s00453-012-9717-4","ama":"Ackermann MR, Blömer J, Kuntze D, Sohler C. Analysis of Agglomerative Clustering. Algorithmica. 2014;69. doi:10.1007/s00453-012-9717-4"},"type":"journal_article","year":"2014","doi":"10.1007/s00453-012-9717-4","_id":"2976","date_updated":"2022-01-06T06:58:49Z","intvolume":" 69"},{"citation":{"chicago":"Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.” In Selected Areas in Cryptography, 96–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/978-3-540-77360-3_7.","apa":"Blömer, J., & Krummel, V. (2007). Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In Selected Areas in Cryptography (pp. 96–109). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77360-3_7","ama":"Blömer J, Krummel V. Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:96-109. doi:10.1007/978-3-540-77360-3_7","mla":"Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 96–109, doi:10.1007/978-3-540-77360-3_7.","bibtex":"@inbook{Blömer_Krummel_2007, place={Berlin, Heidelberg}, title={Analysis of Countermeasures Against Access Driven Cache Attacks on AES}, DOI={10.1007/978-3-540-77360-3_7}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Krummel, Volker}, year={2007}, pages={96–109} }","short":"J. Blömer, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 96–109.","ieee":"J. Blömer and V. Krummel, “Analysis of Countermeasures Against Access Driven Cache Attacks on AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 96–109."},"year":"2007","type":"book_chapter","page":"96-109","main_file_link":[{"url":"https://eprint.iacr.org/2007/282","open_access":"1"}],"doi":"10.1007/978-3-540-77360-3_7","oa":"1","date_updated":"2022-01-06T06:58:50Z","_id":"3002","publication_status":"published","publication_identifier":{"isbn":["9783540773597"]},"status":"public","date_created":"2018-06-05T08:12:18Z","publisher":"Springer Berlin Heidelberg","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"full_name":"Krummel, Volker","first_name":"Volker","last_name":"Krummel"}],"publication":"Selected Areas in Cryptography","department":[{"_id":"64"}],"title":"Analysis of Countermeasures Against Access Driven Cache Attacks on AES","user_id":"25078","place":"Berlin, Heidelberg"},{"_id":"322","page":"478--488","citation":{"ieee":"J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.","short":"J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.","mla":"Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.” Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488, doi:10.1007/978-3-662-47854-7_29.","bibtex":"@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous and Publicly Linkable Reputation Systems}, DOI={10.1007/978-3-662-47854-7_29}, booktitle={Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)}, author={Blömer, Johannes and Juhnke, Jakob and Kolb, Christina}, year={2015}, pages={478--488}, collection={LNCS} }","ama":"Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC). LNCS. ; 2015:478--488. doi:10.1007/978-3-662-47854-7_29","apa":"Blömer, J., Juhnke, J., & Kolb, C. (2015). Anonymous and Publicly Linkable Reputation Systems. In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC) (pp. 478--488). https://doi.org/10.1007/978-3-662-47854-7_29","chicago":"Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.” In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 478--488. LNCS, 2015. https://doi.org/10.1007/978-3-662-47854-7_29."},"type":"conference","year":"2015","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/546"}],"ddc":["040"],"user_id":"48090","abstract":[{"lang":"eng","text":"Reputation systems are used to compute and publish reputation scores for services or products. We consider reputation systems where users are allowed to rate products that they purchased previously. To obtain trustworthy reputations, they are allowed to rate these products only once. As long as users rate products once, they stay anonymous. Everybody is able to detect users deviating from the rate-products-only-once policy and the anonymity of such dishonest users can be revoked by a system manager. In this paper we present formal models for such reputation systems and their security. Based on group signatures presented by Boneh, Boyen, and Shacham we design an efficient reputation system that meets all our requirements."}],"date_created":"2017-10-17T12:41:54Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-20T07:39:54Z","publication":"Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Juhnke","id":"48090","first_name":"Jakob","full_name":"Juhnke, Jakob"},{"id":"43647","last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"}],"file":[{"access_level":"closed","file_name":"322-546_01.pdf","date_created":"2018-03-20T07:39:54Z","content_type":"application/pdf","date_updated":"2018-03-20T07:39:54Z","success":1,"relation":"main_file","file_size":499568,"creator":"florida","file_id":"1431"}],"doi":"10.1007/978-3-662-47854-7_29","oa":"1","date_updated":"2022-01-06T06:59:05Z","series_title":"LNCS","title":"Anonymous and Publicly Linkable Reputation Systems","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}]},{"_id":"3037","intvolume":" 13","issue":"3","type":"journal_article","year":"1995","citation":{"ieee":"H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.","short":"H. Alt, B. Behrends, J. Blömer, Annals of Mathematics and Artificial Intelligence 13 (1995).","bibtex":"@article{Alt_Behrends_Blömer_1995, title={Approximate matching of polygonal shapes}, volume={13}, number={3}, journal={Annals of Mathematics and Artificial Intelligence}, author={Alt, Helmut and Behrends, Bernd and Blömer, Johannes}, year={1995} }","mla":"Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.","chicago":"Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence 13, no. 3 (1995).","apa":"Alt, H., Behrends, B., & Blömer, J. (1995). Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence, 13(3).","ama":"Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence. 1995;13(3)."},"extern":"1","abstract":[{"text":"For two given simple polygonsP, Q, the problem is to determine a rigid motionI ofQ giving the best possible match betweenP andQ, i.e. minimizing the Hausdorff distance betweenP andI(Q). Faster algorithms as the one for the general problem are obtained for special cases, namely thatI is restricted to translations or even to translations only in one specified direction. It turns out that determining pseudo-optimal solutions, i.e. ones that differ from the optimum by just a constant factor, can be done much more efficiently than determining optimal solutions. In the most general case, the algorithm for the pseudo-optimal solution is based on the surprising fact that for the optimal possible match betweenP and an imageI(Q) ofQ, the distance between the centroids of the edges of the convex hulls ofP andI(Q) is a constant multiple of the Hausdorff distance betweenP andI(Q). It is also shown that the Hausdorff distance between two polygons can be determined in timeO(n logn), wheren is the total number of vertices.","lang":"eng"}],"user_id":"25078","publication":"Annals of Mathematics and Artificial Intelligence","quality_controlled":"1","author":[{"first_name":"Helmut","full_name":"Alt, Helmut","last_name":"Alt"},{"last_name":"Behrends","full_name":"Behrends, Bernd","first_name":"Bernd"},{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"volume":13,"date_created":"2018-06-05T08:38:41Z","status":"public","date_updated":"2022-01-06T06:58:53Z","language":[{"iso":"eng"}],"title":"Approximate matching of polygonal shapes","department":[{"_id":"64"}],"publication_identifier":{"issn":["1573-7470"]},"publication_status":"published"},{"date_updated":"2022-01-06T06:58:54Z","_id":"3048","doi":"10.1145/109648.109669","year":"1991","type":"conference","citation":{"bibtex":"@inproceedings{Alt_Behrends_Blömer_1991, title={Approximate matching of polygonal shapes (extended abstract)}, DOI={10.1145/109648.109669}, booktitle={Proceedings of the seventh annual symposium on Computational geometry - SCG ’91}, publisher={ACM Press}, author={Alt, Helmut and Behrends, Bernd and Blömer, Johannes}, year={1991} }","mla":"Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes (Extended Abstract).” Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91, ACM Press, 1991, doi:10.1145/109648.109669.","apa":"Alt, H., Behrends, B., & Blömer, J. (1991). Approximate matching of polygonal shapes (extended abstract). In Proceedings of the seventh annual symposium on Computational geometry - SCG ’91. ACM Press. https://doi.org/10.1145/109648.109669","ama":"Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes (extended abstract). In: Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91. ACM Press; 1991. doi:10.1145/109648.109669","chicago":"Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes (Extended Abstract).” In Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91. ACM Press, 1991. https://doi.org/10.1145/109648.109669.","ieee":"H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes (extended abstract),” in Proceedings of the seventh annual symposium on Computational geometry - SCG ’91, 1991.","short":"H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91, ACM Press, 1991."},"extern":"1","user_id":"25078","title":"Approximate matching of polygonal shapes (extended abstract)","author":[{"last_name":"Alt","first_name":"Helmut","full_name":"Alt, Helmut"},{"last_name":"Behrends","full_name":"Behrends, Bernd","first_name":"Bernd"},{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"publisher":"ACM Press","department":[{"_id":"64"}],"publication":"Proceedings of the seventh annual symposium on Computational geometry - SCG '91","status":"public","date_created":"2018-06-05T08:54:37Z","publication_status":"published","publication_identifier":{"isbn":["0897914260"]}},{"doi":"10.1007/bfb0032068","date_updated":"2022-01-06T06:58:54Z","_id":"3050","language":[{"iso":"eng"}],"page":"703-716","type":"book_chapter","citation":{"short":"H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.","ieee":"H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.","chicago":"Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. https://doi.org/10.1007/bfb0032068.","apa":"Alt, H., Blömer, J., & Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. https://doi.org/10.1007/bfb0032068","ama":"Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata, Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:10.1007/bfb0032068","bibtex":"@inbook{Alt_Blömer_Wagener_1990, place={Berlin/Heidelberg}, title={Approximation of convex polygons}, DOI={10.1007/bfb0032068}, booktitle={Automata, Languages and Programming}, publisher={Springer-Verlag}, author={Alt, Helmut and Blömer, Johannes and Wagener, Hubert}, year={1990}, pages={703–716} }","mla":"Alt, Helmut, et al. “Approximation of Convex Polygons.” Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068."},"year":"1990","user_id":"14955","title":"Approximation of convex polygons","place":"Berlin/Heidelberg","extern":"1","date_created":"2018-06-05T08:56:43Z","status":"public","publication_identifier":{"isbn":["3540528261"]},"publication_status":"published","department":[{"_id":"64"},{"_id":"63"}],"publication":"Automata, Languages and Programming","publisher":"Springer-Verlag","author":[{"first_name":"Helmut","full_name":"Alt, Helmut","last_name":"Alt"},{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"last_name":"Wagener","full_name":"Wagener, Hubert","first_name":"Hubert"}]},{"place":"Cham","title":"Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations","department":[{"_id":"64"}],"publication_identifier":{"isbn":["9783319756493","9783319756509"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901","_id":"1"},{"name":"Securing the Financial Cloud","_id":"43"}],"date_updated":"2022-01-06T06:55:55Z","doi":"10.1007/978-3-319-75650-9_1","oa":"1","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"13703","file_date_updated":"2018-11-08T09:53:34Z","publication":"Foundations and Practice of Security","publisher":"Springer International Publishing","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"},{"first_name":"Volker","full_name":"Krummel, Volker","last_name":"Krummel"},{"first_name":"Nils","full_name":"Löken, Nils","last_name":"Löken","id":"13703"}],"file":[{"file_size":634736,"file_id":"5292","creator":"ups","date_updated":"2018-11-02T15:04:13Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"Attribute-BasedEncryptionAsASe.pdf","date_created":"2018-11-02T15:04:13Z","access_level":"closed"},{"date_updated":"2018-11-08T09:53:34Z","content_type":"application/pdf","relation":"main_file","file_size":522516,"creator":"nilo","file_id":"5425","access_level":"open_access","date_created":"2018-11-08T09:53:34Z","file_name":"abe_aas.pdf"}],"date_created":"2018-04-13T11:40:48Z","status":"public","has_accepted_license":"1","_id":"2344","page":"3-17","year":"2017","type":"conference","citation":{"ieee":"J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations,” in Foundations and Practice of Security, 2017, pp. 3–17.","short":"J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.","bibtex":"@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={10.1007/978-3-319-75650-9_1}, booktitle={Foundations and Practice of Security}, publisher={Springer International Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and Löken, Nils}, year={2017}, pages={3–17} }","mla":"Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” Foundations and Practice of Security, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-75650-9_1.","apa":"Blömer, J., Günther, P., Krummel, V., & Löken, N. (2017). Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In Foundations and Practice of Security (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-75650-9_1","ama":"Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In: Foundations and Practice of Security. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-75650-9_1","chicago":"Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” In Foundations and Practice of Security, 3–17. Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-75650-9_1."}},{"publisher":"Springer Berlin Heidelberg","author":[{"first_name":"Marcel R.","full_name":"Ackermann, Marcel R.","last_name":"Ackermann"},{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"publication":"SWAT 2010","department":[{"_id":"64"}],"status":"public","date_created":"2018-06-05T07:51:51Z","publication_status":"published","publication_identifier":{"isbn":["9783642137303","9783642137310"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","user_id":"25078","title":"Bregman Clustering for Separable Instances","series_title":"Lecture Notes in Computer Science","type":"book_chapter","year":"2010","citation":{"ieee":"M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.","short":"M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 212–223.","mla":"Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.","bibtex":"@inbook{Ackermann_Blömer_2010, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Bregman Clustering for Separable Instances}, DOI={10.1007/978-3-642-13731-0_21}, booktitle={SWAT 2010}, publisher={Springer Berlin Heidelberg}, author={Ackermann, Marcel R. and Blömer, Johannes}, year={2010}, pages={212–223}, collection={Lecture Notes in Computer Science} }","apa":"Ackermann, M. R., & Blömer, J. (2010). Bregman Clustering for Separable Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_21","ama":"Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: SWAT 2010. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:212-223. doi:10.1007/978-3-642-13731-0_21","chicago":"Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13731-0_21."},"page":"212-223","_id":"2988","date_updated":"2022-01-06T06:58:50Z","doi":"10.1007/978-3-642-13731-0_21"},{"page":"248-259","citation":{"mla":"Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” Automata, Languages and Programming, Springer Berlin Heidelberg, 2000, pp. 248–59, doi:10.1007/3-540-45022-x_22.","bibtex":"@inbook{Blömer_2000, place={Berlin, Heidelberg}, title={Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices}, DOI={10.1007/3-540-45022-x_22}, booktitle={Automata, Languages and Programming}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2000}, pages={248–259} }","chicago":"Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. https://doi.org/10.1007/3-540-45022-x_22.","apa":"Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22","ama":"Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: Automata, Languages and Programming. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:10.1007/3-540-45022-x_22","ieee":"J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.","short":"J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259."},"year":"2000","type":"book_chapter","date_updated":"2022-01-06T06:58:51Z","_id":"3023","doi":"10.1007/3-540-45022-x_22","publication":"Automata, Languages and Programming","department":[{"_id":"64"}],"publisher":"Springer Berlin Heidelberg","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"date_created":"2018-06-05T08:27:28Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783540677154","9783540450221"],"issn":["0302-9743"]},"place":"Berlin, Heidelberg","user_id":"25078","title":"Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"publication_identifier":{"isbn":["978-1-4503-6448-5"]},"publication_status":"accepted","department":[{"_id":"64"},{"_id":"568"}],"title":"Cloud Architectures for Searchable Encryption","place":"New York, NY, USA","language":[{"iso":"eng"}],"doi":"10.1145/3230833.3230853","date_updated":"2022-01-06T06:58:49Z","status":"public","has_accepted_license":"1","date_created":"2018-06-04T11:33:15Z","file":[{"access_level":"closed","date_created":"2018-11-02T14:39:46Z","file_name":"a25-Blomer.pdf","date_updated":"2018-11-02T14:39:46Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":769807,"file_id":"5278","creator":"ups"}],"quality_controlled":"1","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Nils","full_name":"Löken, Nils","last_name":"Löken","id":"13703"}],"publisher":"ACM","file_date_updated":"2018-11-02T14:39:46Z","publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018","user_id":"13703","ddc":["000"],"year":"2018","type":"conference","citation":{"bibtex":"@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures for Searchable Encryption}, DOI={10.1145/3230833.3230853}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken, Nils}, pages={25:1--25:10} }","mla":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, pp. 25:1--25:10, doi:10.1145/3230833.3230853.","chicago":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, 25:1--25:10. New York, NY, USA: ACM, n.d. https://doi.org/10.1145/3230833.3230853.","apa":"Blömer, J., & Löken, N. (n.d.). Cloud Architectures for Searchable Encryption. In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018 (pp. 25:1--25:10). New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3230853","ama":"Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018. New York, NY, USA: ACM; :25:1--25:10. doi:10.1145/3230833.3230853","ieee":"J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, Hamburg, Germany, pp. 25:1--25:10.","short":"J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10."},"page":"25:1--25:10","_id":"2965","conference":{"name":"ARES 2018","location":"Hamburg, Germany"}},{"user_id":"25078","title":"Clustering for Metric and Nonmetric Distance Measures","date_created":"2018-06-05T07:52:41Z","status":"public","publication_identifier":{"issn":["1549-6325"]},"publication_status":"published","publication":"ACM Trans. Algorithms","keyword":["k-means clustering","k-median clustering","Approximation algorithm","Bregman divergences","Itakura-Saito divergence","Kullback-Leibler divergence","Mahalanobis distance","random sampling"],"department":[{"_id":"64"}],"author":[{"first_name":"Marcel R.","full_name":"Ackermann, Marcel R.","last_name":"Ackermann"},{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"issue":"4","doi":"10.1145/1824777.1824779","date_updated":"2022-01-06T06:58:50Z","_id":"2990","page":"59:1--59:26","citation":{"ieee":"M. R. Ackermann, J. Blömer, and C. Sohler, “Clustering for Metric and Nonmetric Distance Measures,” ACM Trans. Algorithms, no. 4, pp. 59:1--59:26, 2010.","short":"M.R. Ackermann, J. Blömer, C. Sohler, ACM Trans. Algorithms (2010) 59:1--59:26.","bibtex":"@article{Ackermann_Blömer_Sohler_2010, title={Clustering for Metric and Nonmetric Distance Measures}, DOI={10.1145/1824777.1824779}, number={4}, journal={ACM Trans. Algorithms}, author={Ackermann, Marcel R. and Blömer, Johannes and Sohler, Christian}, year={2010}, pages={59:1--59:26} }","mla":"Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance Measures.” ACM Trans. Algorithms, no. 4, 2010, pp. 59:1--59:26, doi:10.1145/1824777.1824779.","apa":"Ackermann, M. R., Blömer, J., & Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. ACM Trans. Algorithms, (4), 59:1--59:26. https://doi.org/10.1145/1824777.1824779","ama":"Ackermann MR, Blömer J, Sohler C. Clustering for Metric and Nonmetric Distance Measures. ACM Trans Algorithms. 2010;(4):59:1--59:26. doi:10.1145/1824777.1824779","chicago":"Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.” ACM Trans. Algorithms, no. 4 (2010): 59:1--59:26. https://doi.org/10.1145/1824777.1824779."},"year":"2010","type":"journal_article"},{"doi":"10.1109/sfcs.1991.185434","_id":"3049","date_updated":"2022-01-06T06:58:54Z","year":"1991","type":"conference","citation":{"ieee":"J. Blömer, “Computing sums of radicals in polynomial time,” in Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991.","short":"J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.","mla":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991, doi:10.1109/sfcs.1991.185434.","bibtex":"@inproceedings{Blömer_1991, title={Computing sums of radicals in polynomial time}, DOI={10.1109/sfcs.1991.185434}, booktitle={Proceedings 32nd Annual Symposium of Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Blömer, Johannes}, year={1991} }","chicago":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 1991. https://doi.org/10.1109/sfcs.1991.185434.","ama":"Blömer J. Computing sums of radicals in polynomial time. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 1991. doi:10.1109/sfcs.1991.185434","apa":"Blömer, J. (1991). Computing sums of radicals in polynomial time. In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1991.185434"},"title":"Computing sums of radicals in polynomial time","user_id":"25078","extern":"1","publication_identifier":{"isbn":["0818624450"]},"publication_status":"published","status":"public","date_created":"2018-06-05T08:56:01Z","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"publisher":"IEEE Comput. Soc. Press","publication":"Proceedings 32nd Annual Symposium of Foundations of Computer Science","department":[{"_id":"64"}]},{"date_updated":"2023-01-10T13:49:25Z","doi":"10.1109/sfcs.1991.185434","title":"Computing sums of radicals in polynomial time","department":[{"_id":"64"}],"publication_status":"published","publication_identifier":{"isbn":["0818624450"]},"_id":"3041","type":"conference","year":"2002","citation":{"bibtex":"@inproceedings{Blömer_2002, title={Computing sums of radicals in polynomial time}, DOI={10.1109/sfcs.1991.185434}, booktitle={[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Blömer, Johannes}, year={2002} }","mla":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002, doi:10.1109/sfcs.1991.185434.","chicago":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1991.185434.","apa":"Blömer, J. (2002). Computing sums of radicals in polynomial time. [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. https://doi.org/10.1109/sfcs.1991.185434","ama":"Blömer J. Computing sums of radicals in polynomial time. In: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 2002. doi:10.1109/sfcs.1991.185434","ieee":"J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: 10.1109/sfcs.1991.185434.","short":"J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002."},"extern":"1","user_id":"25078","ddc":["000"],"file":[{"content_type":"application/pdf","date_updated":"2018-06-05T08:45:15Z","relation":"main_file","success":1,"file_size":335754,"file_id":"3042","creator":"feidens","access_level":"closed","file_name":"ComputingSumsOfRadicals_01.pdf","date_created":"2018-06-05T08:45:15Z"}],"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"publisher":"IEEE Comput. Soc. Press","file_date_updated":"2018-06-05T08:45:15Z","publication":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","has_accepted_license":"1","status":"public","date_created":"2018-06-05T08:44:18Z"},{"ddc":["000"],"user_id":"25078","abstract":[{"lang":"eng","text":"We present a new transformation of chosen-plaintext secure predicate encryption schemes with public index into chosen-ciphertext secure schemes. Our construction requires only a universal one-way hash function and is selectively secure in the standard model. The transformation is not generic but can be applied to various existing schemes constructed from bilinear groups. Using common structural properties of these schemes we provide an efficient and simple transformation without overhead in form of one-time signatures or message authentication codes as required in the known generic transformations."}],"date_created":"2017-10-17T12:42:18Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-16T11:28:34Z","publisher":"Universität Paderborn","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"first_name":"Gennadij","full_name":"Liske, Gennadij","last_name":"Liske"}],"file":[{"date_created":"2018-03-16T11:28:34Z","file_name":"442-P-KEM.pdf","access_level":"closed","file_size":377945,"file_id":"1351","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-16T11:28:34Z","success":1,"relation":"main_file"}],"_id":"442","type":"preprint","citation":{"bibtex":"@article{Blömer_Liske_2014, title={Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2014} }","mla":"Blömer, Johannes, and Gennadij Liske. Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions. Universität Paderborn, 2014.","ama":"Blömer J, Liske G. Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. 2014.","apa":"Blömer, J., & Liske, G. (2014). Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. Universität Paderborn.","chicago":"Blömer, Johannes, and Gennadij Liske. “Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.” Universität Paderborn, 2014.","ieee":"J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn, 2014.","short":"J. Blömer, G. Liske, (2014)."},"year":"2014","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/511.pdf"}],"title":"Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"department":[{"_id":"64"}],"oa":"1","date_updated":"2022-01-06T07:01:03Z"},{"abstract":[{"text":"This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic transformations from CPA-secure to CCA-secure schemes. The reduction costs of our framework are comparable to the reduction costs of the underlying CPA-secure framework. We achieve this last result by applying the dual system encryption methodology in a novel way.","lang":"eng"}],"ddc":["040"],"user_id":"477","publication":"Proceedings of the CT-RSA 2016","file_date_updated":"2018-03-21T10:43:36Z","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"full_name":"Liske, Gennadij","first_name":"Gennadij","last_name":"Liske"}],"file":[{"file_name":"208-aCCA_P-KEM_final.pdf","date_created":"2018-03-21T10:43:36Z","access_level":"closed","file_size":462666,"file_id":"1521","creator":"florida","date_updated":"2018-03-21T10:43:36Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"date_created":"2017-10-17T12:41:32Z","status":"public","has_accepted_license":"1","_id":"208","page":"431-447","type":"conference","year":"2016","citation":{"bibtex":"@inproceedings{Blömer_Liske_2016, series={LNCS}, title={Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}, DOI={10.1007/978-3-319-29485-8_25}, booktitle={Proceedings of the CT-RSA 2016}, author={Blömer, Johannes and Liske, Gennadij}, year={2016}, pages={431–447}, collection={LNCS} }","mla":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” Proceedings of the CT-RSA 2016, 2016, pp. 431–47, doi:10.1007/978-3-319-29485-8_25.","apa":"Blömer, J., & Liske, G. (2016). Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In Proceedings of the CT-RSA 2016 (pp. 431–447). https://doi.org/10.1007/978-3-319-29485-8_25","ama":"Blömer J, Liske G. Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In: Proceedings of the CT-RSA 2016. LNCS. ; 2016:431-447. doi:10.1007/978-3-319-29485-8_25","chicago":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” In Proceedings of the CT-RSA 2016, 431–47. LNCS, 2016. https://doi.org/10.1007/978-3-319-29485-8_25.","ieee":"J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes,” in Proceedings of the CT-RSA 2016, 2016, pp. 431–447.","short":"J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447."},"title":"Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_updated":"2022-01-06T06:54:39Z","doi":"10.1007/978-3-319-29485-8_25","series_title":"LNCS"},{"date_updated":"2022-01-06T06:58:50Z","_id":"2995","doi":"10.1137/1.9781611973068.118","language":[{"iso":"eng"}],"page":"1088-1097","type":"book_chapter","year":"2009","citation":{"apa":"Ackermann, M. R., & Blömer, J. (2009). Coresets and Approximate Clustering for Bregman Divergences. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1088–1097). Philadelphia, PA: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973068.118","ama":"Ackermann MR, Blömer J. Coresets and Approximate Clustering for Bregman Divergences. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics; 2009:1088-1097. doi:10.1137/1.9781611973068.118","chicago":"Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 1088–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. https://doi.org/10.1137/1.9781611973068.118.","bibtex":"@inbook{Ackermann_Blömer_2009, place={Philadelphia, PA}, title={Coresets and Approximate Clustering for Bregman Divergences}, DOI={10.1137/1.9781611973068.118}, booktitle={Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms}, publisher={Society for Industrial and Applied Mathematics}, author={Ackermann, Marcel R. and Blömer, Johannes}, year={2009}, pages={1088–1097} }","mla":"Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2009, pp. 1088–97, doi:10.1137/1.9781611973068.118.","short":"M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009, pp. 1088–1097.","ieee":"M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman Divergences,” in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009, pp. 1088–1097."},"place":"Philadelphia, PA","user_id":"25078","title":"Coresets and Approximate Clustering for Bregman Divergences","department":[{"_id":"64"}],"publication":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":[{"last_name":"Ackermann","full_name":"Ackermann, Marcel R.","first_name":"Marcel R."},{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"publisher":"Society for Industrial and Applied Mathematics","date_created":"2018-06-05T08:05:17Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9780898716801","9781611973068"]}},{"language":[{"iso":"eng"}],"page":"46:1--46:12","citation":{"short":"J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms and Computation (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12.","ieee":"J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,” in 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.","ama":"Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications. In: 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:10.4230/LIPIcs.ISAAC.2018.46","apa":"Blömer, J., Brauer, S., & Bujna, K. (2018). Coresets for Fuzzy K-Means with Applications. In 29th International Symposium on Algorithms and Computation (ISAAC 2018) (pp. 46:1--46:12). Jiaoxi, Yilan County, Taiwan: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2018.46","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.” In 29th International Symposium on Algorithms and Computation (ISAAC 2018), 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.ISAAC.2018.46.","bibtex":"@inproceedings{Blömer_Brauer_Bujna_2018, title={Coresets for Fuzzy K-Means with Applications}, DOI={10.4230/LIPIcs.ISAAC.2018.46}, booktitle={29th International Symposium on Algorithms and Computation (ISAAC 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2018}, pages={46:1--46:12} }","mla":"Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.” 29th International Symposium on Algorithms and Computation (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:10.4230/LIPIcs.ISAAC.2018.46."},"year":"2018","type":"conference","doi":"10.4230/LIPIcs.ISAAC.2018.46","conference":{"end_date":"2018-12-19","start_date":"2018-12-17","name":"29th International Symposium on Algorithms and Computation (ISAAC)","location":"Jiaoxi, Yilan County, Taiwan"},"_id":"4344","date_updated":"2022-01-06T07:00:57Z","date_created":"2018-09-03T08:04:19Z","project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"status":"public","publication_identifier":{"isbn":["978-3-95977-094-1"]},"publication_status":"published","department":[{"_id":"64"}],"publication":"29th International Symposium on Algorithms and Computation (ISAAC 2018)","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Brauer","id":"13291","first_name":"Sascha","full_name":"Brauer, Sascha"},{"last_name":"Bujna","full_name":"Bujna, Kathrin","first_name":"Kathrin"}],"user_id":"13291","title":"Coresets for Fuzzy K-Means with Applications"},{"publication_status":"accepted","project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"7"},{"_id":"64"}],"title":"Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures","language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-93387-0_12","oa":"1","date_updated":"2023-01-10T10:28:43Z","has_accepted_license":"1","status":"public","date_created":"2018-04-17T12:28:25Z","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"}],"publication":"ACNS 2018 Applied Cryptography & Network security","file_date_updated":"2018-11-02T13:41:16Z","file":[{"access_level":"closed","file_name":"2018-340.pdf","date_created":"2018-11-02T13:41:16Z","content_type":"application/pdf","date_updated":"2018-11-02T13:41:16Z","success":1,"relation":"main_file","file_size":542171,"file_id":"5252","creator":"ups"}],"ddc":["004"],"user_id":"25078","abstract":[{"text":"In this paper, we introduce the notion of delegatable attribute-based anonymous credentials (DAAC). Such systems offer fine-grained anonymous access control and they give the credential holder the ability to issue more restricted credentials to other users. In our model, credentials are parameterized with attributes that (1) express what the credential holder himself has been certified and (2) define which attributes he may issue to others. Furthermore, we present a practical construction of DAAC. For this construction, we deviate from the usual approach of embedding a certificate chain in the credential. Instead, we introduce a novel approach for which we identify a new primitive we call dynamically malleable signatures (DMS) as the main ingredient. This primitive may be of independent interest. We also give a first instantiation of DMS with efficient protocols. ","lang":"eng"}],"type":"conference","citation":{"ieee":"J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures,” presented at the The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi: 10.1007/978-3-319-93387-0_12.","short":"J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography & Network Security, n.d.","mla":"Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.” ACNS 2018 Applied Cryptography & Network Security, doi:10.1007/978-3-319-93387-0_12.","bibtex":"@inproceedings{Blömer_Bobolz, series={LNCS}, title={Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures}, DOI={10.1007/978-3-319-93387-0_12}, booktitle={ACNS 2018 Applied Cryptography & Network security}, author={Blömer, Johannes and Bobolz, Jan}, collection={LNCS} }","ama":"Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. In: ACNS 2018 Applied Cryptography & Network Security. LNCS. doi:10.1007/978-3-319-93387-0_12","apa":"Blömer, J., & Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. ACNS 2018 Applied Cryptography & Network Security. The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium. https://doi.org/10.1007/978-3-319-93387-0_12","chicago":"Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.” In ACNS 2018 Applied Cryptography & Network Security. LNCS, n.d. https://doi.org/10.1007/978-3-319-93387-0_12."},"year":"2018","main_file_link":[{"url":"https://eprint.iacr.org/2018/340","open_access":"1"}],"_id":"2379","conference":{"name":"The 16th International Conference on Applied Cryptography and Network Security","location":"Leuven, Belgium"}},{"doi":"10.1007/3-540-63397-9_5","date_updated":"2022-01-06T06:58:52Z","publication_status":"published","publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]},"department":[{"_id":"64"}],"title":"Denesting by bounded degree radicals","place":"Berlin, Heidelberg","type":"book_chapter","citation":{"short":"J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.","ieee":"J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.","chicago":"Blömer, Johannes. “Denesting by Bounded Degree Radicals.” In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. https://doi.org/10.1007/3-540-63397-9_5.","ama":"Blömer J. Denesting by bounded degree radicals. In: Algorithms — ESA ’97. Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:10.1007/3-540-63397-9_5","apa":"Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-63397-9_5","mla":"Blömer, Johannes. “Denesting by Bounded Degree Radicals.” Algorithms — ESA ’97, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:10.1007/3-540-63397-9_5.","bibtex":"@inbook{Blömer_1997, place={Berlin, Heidelberg}, title={Denesting by bounded degree radicals}, DOI={10.1007/3-540-63397-9_5}, booktitle={Algorithms — ESA ’97}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={1997}, pages={53–63} }"},"year":"1997","page":"53-63","_id":"3029","status":"public","has_accepted_license":"1","date_created":"2018-06-05T08:30:40Z","file":[{"file_id":"3030","creator":"feidens","file_size":1656133,"success":1,"relation":"main_file","date_updated":"2018-06-05T08:31:35Z","content_type":"application/pdf","date_created":"2018-06-05T08:31:35Z","file_name":"DenestingByBoundedDegreeRevised.pdf","access_level":"closed"}],"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"publisher":"Springer Berlin Heidelberg","publication":"Algorithms — ESA '97","file_date_updated":"2018-06-05T08:31:35Z","user_id":"25078","ddc":["000"]},{"citation":{"ieee":"S. Hemmrich, J. Bobolz, D. Beverungen, and J. Blömer, “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain,” presented at the ECIS 2023, 2023.","short":"S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research Papers, 2023.","mla":"Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” ECIS 2023 Research Papers, 2023.","bibtex":"@inproceedings{Hemmrich_Bobolz_Beverungen_Blömer_2023, title={Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain}, booktitle={ECIS 2023 Research Papers}, author={Hemmrich, Simon and Bobolz, Jan and Beverungen, Daniel and Blömer, Johannes}, year={2023} }","chicago":"Hemmrich, Simon, Jan Bobolz, Daniel Beverungen, and Johannes Blömer. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” In ECIS 2023 Research Papers, 2023.","ama":"Hemmrich S, Bobolz J, Beverungen D, Blömer J. Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. In: ECIS 2023 Research Papers. ; 2023.","apa":"Hemmrich, S., Bobolz, J., Beverungen, D., & Blömer, J. (2023). Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. ECIS 2023 Research Papers. ECIS 2023."},"year":"2023","type":"conference","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2023_rp/344"}],"_id":"44855","conference":{"name":"ECIS 2023"},"has_accepted_license":"1","status":"public","date_created":"2023-05-16T08:31:27Z","file":[{"file_size":958740,"creator":"jbobolz","file_id":"45209","date_updated":"2023-05-23T10:11:03Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"A_Blockchain_Based_Reputation_Ecosystem_for_Business___Payments_as_Ratings.pdf","date_created":"2023-05-23T10:11:03Z","access_level":"closed"}],"author":[{"last_name":"Hemmrich","id":"83557","first_name":"Simon","full_name":"Hemmrich, Simon"},{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"},{"first_name":"Daniel","full_name":"Beverungen, Daniel","last_name":"Beverungen","id":"59677"},{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"file_date_updated":"2023-05-23T10:11:03Z","publication":"ECIS 2023 Research Papers","user_id":"27207","ddc":["330"],"abstract":[{"text":"Market transactions are subject to information asymmetry about the delivered value proposition, causing transaction costs and adverse market effects among buyers and sellers. Information systems research has investigated how review systems can reduce information asymmetry in business-to-consumer markets. However, these systems cannot be readily applied to business-to-business markets, are vulnerable to manipulation, and suffer from conceptual weak spots since they use textual data or star ratings. Building on design science research, we conceptualize a new class of reputation systems based on monetary-based payments as quantitative ratings for each transaction stored on a blockchain. Using cryptography, we show that our system assures content confidentiality so that buyers can share and sell their ratings selectively, establishing a reputation ecosystem. Our prescriptive insights advance the design of reputation systems and offer new paths to understanding the antecedents, dynamics, and consequences to reduce information asymmetry in B2B transactions.","lang":"eng"}],"extern":"1","language":[{"iso":"eng"}],"date_updated":"2023-05-23T10:12:32Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"7"},{"_id":"64"},{"_id":"19"},{"_id":"526"}],"title":"Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain"},{"abstract":[{"text":"We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes: a key-policy attribute-based KEM that is based on Goyal's key-policy ABE and a ciphertext-policy attribute-based KEM that is based on Waters' ciphertext-policy ABE. To achieve our goals, we use an appropriate hash function and need to extend the public parameters and the ciphertexts of the underlying CPA-secure encryption schemes only by a single group element. Moreover, we use the same hardness assumptions as the underlying CPA-secure encryption schemes.","lang":"eng"}],"ddc":["040"],"user_id":"25078","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"full_name":"Liske, Gennadij","first_name":"Gennadij","last_name":"Liske"}],"publisher":"Universität Paderborn","file_date_updated":"2018-03-15T10:35:04Z","file":[{"file_size":389797,"file_id":"1292","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-15T10:35:04Z","relation":"main_file","success":1,"date_created":"2018-03-15T10:35:04Z","file_name":"538-AB-KEM_01.pdf","access_level":"closed"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:37Z","_id":"538","main_file_link":[{"url":"https://eprint.iacr.org/2013/646","open_access":"1"}],"citation":{"short":"J. Blömer, G. Liske, (2013).","ieee":"J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","chicago":"Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","apa":"Blömer, J., & Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.","ama":"Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013.","bibtex":"@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2013} }","mla":"Blömer, Johannes, and Gennadij Liske. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn, 2013."},"type":"preprint","year":"2013","title":"Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"date_updated":"2022-01-06T07:01:51Z","oa":"1"},{"language":[{"iso":"eng"}],"type":"conference","citation":{"ama":"Blömer J, Löken N. Dynamic Searchable Encryption with Access Control. In: 12th International Symposium on Foundations and Practice of Security, FPS 2019. Vol 12056. LNCS. Springer; 2019.","apa":"Blömer, J., & Löken, N. (2019). Dynamic Searchable Encryption with Access Control. In 12th International Symposium on Foundations and Practice of Security, FPS 2019 (Vol. 12056). Springer.","chicago":"Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” In 12th International Symposium on Foundations and Practice of Security, FPS 2019, Vol. 12056. LNCS. Springer, 2019.","bibtex":"@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Dynamic Searchable Encryption with Access Control}, volume={12056}, booktitle={12th International Symposium on Foundations and Practice of Security, FPS 2019}, publisher={Springer}, author={Blömer, Johannes and Löken, Nils}, year={2019}, collection={LNCS} }","mla":"Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” 12th International Symposium on Foundations and Practice of Security, FPS 2019, vol. 12056, Springer, 2019.","short":"J. Blömer, N. Löken, in: 12th International Symposium on Foundations and Practice of Security, FPS 2019, Springer, 2019.","ieee":"J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,” in 12th International Symposium on Foundations and Practice of Security, FPS 2019, 2019, vol. 12056."},"year":"2019","main_file_link":[{"url":"http://eprint.iacr.org/2019/1038","open_access":"1"}],"series_title":"LNCS","oa":"1","_id":"13557","intvolume":" 12056","date_updated":"2022-01-06T06:51:38Z","date_created":"2019-10-01T08:05:31Z","status":"public","volume":12056,"department":[{"_id":"64"},{"_id":"568"}],"publication":"12th International Symposium on Foundations and Practice of Security, FPS 2019","publisher":"Springer","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Löken","id":"13703","first_name":"Nils","full_name":"Löken, Nils"}],"user_id":"13703","title":"Dynamic Searchable Encryption with Access Control","abstract":[{"text":"We present a searchable encryption scheme for dynamic document collections in a multi-user scenario. Our scheme features fine-grained access control to search results, as well as access control to operations such as adding documents to the document collection, or changing individual documents. The scheme features verifiability of search results. Our scheme also satisfies the forward privacy notion crucial for the security of dynamic searchable encryption schemes.","lang":"eng"}]},{"department":[{"_id":"64"}],"publisher":"Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"}],"publication_status":"published","date_created":"2018-06-05T07:21:25Z","status":"public","title":"Effizienz und Sicherheit paarungsbasierter Kryptographie","user_id":"25078","citation":{"ieee":"J. Blömer and P. Günther, Effizienz und Sicherheit paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","short":"J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie, Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","bibtex":"@book{Blömer_Günther_2016, title={Effizienz und Sicherheit paarungsbasierter Kryptographie}, publisher={Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops}, author={Blömer, Johannes and Günther, Peter}, year={2016} }","mla":"Blömer, Johannes, and Peter Günther. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","chicago":"Blömer, Johannes, and Peter Günther. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","apa":"Blömer, J., & Günther, P. (2016). Effizienz und Sicherheit paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.","ama":"Blömer J, Günther P. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops; 2016."},"type":"report","year":"2016","date_updated":"2022-01-06T06:58:49Z","_id":"2971"},{"year":"2010","citation":{"apa":"Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels, G., … Reif, W. (2010). Engineering self-coordinating software intensive systems. In Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10. ACM Press. https://doi.org/10.1145/1882362.1882428","ama":"Schäfer W, Trächtler A, Birattari M, et al. Engineering self-coordinating software intensive systems. In: Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10. ACM Press; 2010. doi:10.1145/1882362.1882428","chicago":"Schäfer, Wilhelm, Ansgar Trächtler, Mauro Birattari, Johannes Blömer, Marco Dorigo, Gregor Engels, Rehan O’Grady, Marco Platzner, Franz Rammig, and Wolfgang Reif. “Engineering Self-Coordinating Software Intensive Systems.” In Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10. ACM Press, 2010. https://doi.org/10.1145/1882362.1882428.","mla":"Schäfer, Wilhelm, et al. “Engineering Self-Coordinating Software Intensive Systems.” Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010, doi:10.1145/1882362.1882428.","bibtex":"@inproceedings{Schäfer_Trächtler_Birattari_Blömer_Dorigo_Engels_O’Grady_Platzner_Rammig_Reif_2010, title={Engineering self-coordinating software intensive systems}, DOI={10.1145/1882362.1882428}, booktitle={Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10}, publisher={ACM Press}, author={Schäfer, Wilhelm and Trächtler, Ansgar and Birattari, Mauro and Blömer, Johannes and Dorigo, Marco and Engels, Gregor and O’Grady, Rehan and Platzner, Marco and Rammig, Franz and Reif, Wolfgang}, year={2010} }","short":"W. Schäfer, A. Trächtler, M. Birattari, J. Blömer, M. Dorigo, G. Engels, R. O’Grady, M. Platzner, F. Rammig, W. Reif, in: Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010.","ieee":"W. Schäfer et al., “Engineering self-coordinating software intensive systems,” in Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10, 2010."},"type":"conference","_id":"2994","date_updated":"2022-01-06T06:58:50Z","doi":"10.1145/1882362.1882428","publisher":"ACM Press","author":[{"first_name":"Wilhelm","full_name":"Schäfer, Wilhelm","last_name":"Schäfer"},{"first_name":"Ansgar","full_name":"Trächtler, Ansgar","last_name":"Trächtler"},{"last_name":"Birattari","first_name":"Mauro","full_name":"Birattari, Mauro"},{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Dorigo","first_name":"Marco","full_name":"Dorigo, Marco"},{"full_name":"Engels, Gregor","first_name":"Gregor","id":"107","last_name":"Engels"},{"last_name":"O'Grady","full_name":"O'Grady, Rehan","first_name":"Rehan"},{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"},{"first_name":"Franz","full_name":"Rammig, Franz","last_name":"Rammig"},{"last_name":"Reif","full_name":"Reif, Wolfgang","first_name":"Wolfgang"}],"publication":"Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER '10","department":[{"_id":"64"}],"status":"public","date_created":"2018-06-05T08:03:49Z","publication_identifier":{"isbn":["9781450304276"]},"publication_status":"published","user_id":"25078","title":"Engineering self-coordinating software intensive systems"},{"title":"Enhanced Security of Attribute-Based Signatures","publication_identifier":{"isbn":["978-3-030-00434-7"]},"publication_status":"published","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"64"}],"doi":"10.1007/978-3-030-00434-7_12","oa":"1","date_updated":"2023-01-10T10:26:13Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","ddc":["000"],"user_id":"25078","volume":11124,"has_accepted_license":"1","status":"public","date_created":"2018-08-10T09:44:09Z","publisher":"Springer","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Eidens","id":"25078","first_name":"Fabian","full_name":"Eidens, Fabian"},{"full_name":"Juhnke, Jakob","first_name":"Jakob","id":"48090","last_name":"Juhnke"}],"publication":"The International Conference on Cryptology And Network Security (CANS)","file_date_updated":"2018-11-08T10:15:00Z","file":[{"date_created":"2018-11-08T10:15:00Z","file_name":"uc_abs.pdf","access_level":"closed","creator":"feidens","file_id":"5427","file_size":574228,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-08T10:15:00Z"}],"intvolume":" 11124","_id":"3873","conference":{"name":"The International Conference on Cryptology And Network Security (CANS)","location":"Naples, Italy"},"citation":{"short":"J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology And Network Security (CANS), Springer, 2018, pp. 235–255.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based Signatures,” in The International Conference on Cryptology And Network Security (CANS), Naples, Italy, 2018, vol. 11124, pp. 235–255, doi: 10.1007/978-3-030-00434-7_12.","chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Enhanced Security of Attribute-Based Signatures.” In The International Conference on Cryptology And Network Security (CANS), 11124:235–55. Lecture Notes in Computer Science. Springer, 2018. https://doi.org/10.1007/978-3-030-00434-7_12.","apa":"Blömer, J., Eidens, F., & Juhnke, J. (2018). Enhanced Security of Attribute-Based Signatures. The International Conference on Cryptology And Network Security (CANS), 11124, 235–255. https://doi.org/10.1007/978-3-030-00434-7_12","ama":"Blömer J, Eidens F, Juhnke J. Enhanced Security of Attribute-Based Signatures. In: The International Conference on Cryptology And Network Security (CANS). Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:10.1007/978-3-030-00434-7_12","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, series={Lecture Notes in Computer Science}, title={Enhanced Security of Attribute-Based Signatures}, volume={11124}, DOI={10.1007/978-3-030-00434-7_12}, booktitle={The International Conference on Cryptology And Network Security (CANS)}, publisher={Springer}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={235–255}, collection={Lecture Notes in Computer Science} }","mla":"Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.” The International Conference on Cryptology And Network Security (CANS), vol. 11124, Springer, 2018, pp. 235–55, doi:10.1007/978-3-030-00434-7_12."},"year":"2018","type":"conference","page":"235-255","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/874"}]},{"publication":"Lecture Notes in Computer Science","department":[{"_id":"64"}],"author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Krummel","full_name":"Krummel, Volker","first_name":"Volker"}],"publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:14:42Z","status":"public","publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","user_id":"25078","title":"Fault Based Collision Attacks on AES","page":"106-120","year":"2006","citation":{"ama":"Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:106-120. doi:10.1007/11889700_11","apa":"Blömer, J., & Krummel, V. (2006). Fault Based Collision Attacks on AES. In Lecture Notes in Computer Science (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_11","chicago":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” In Lecture Notes in Computer Science, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_11.","mla":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:10.1007/11889700_11.","bibtex":"@inbook{Blömer_Krummel_2006, place={Berlin, Heidelberg}, title={Fault Based Collision Attacks on AES}, DOI={10.1007/11889700_11}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Krummel, Volker}, year={2006}, pages={106–120} }","short":"J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.","ieee":"J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120."},"type":"book_chapter","_id":"3004","date_updated":"2022-01-06T06:58:50Z","doi":"10.1007/11889700_11"},{"place":"Berlin, Heidelberg","user_id":"25078","title":"Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)","department":[{"_id":"64"}],"publication":"Financial Cryptography","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"full_name":"Seifert, Jean-Pierre","first_name":"Jean-Pierre","last_name":"Seifert"}],"publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:25:18Z","status":"public","publication_identifier":{"isbn":["9783540406631","9783540451266"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","_id":"3018","date_updated":"2022-01-06T06:58:51Z","doi":"10.1007/978-3-540-45126-6_12","page":"162-181","citation":{"apa":"Blömer, J., & Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In Financial Cryptography (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45126-6_12","ama":"Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In: Financial Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:162-181. doi:10.1007/978-3-540-45126-6_12","chicago":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45126-6_12.","mla":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” Financial Cryptography, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:10.1007/978-3-540-45126-6_12.","bibtex":"@inbook{Blömer_Seifert_2003, place={Berlin, Heidelberg}, title={Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)}, DOI={10.1007/978-3-540-45126-6_12}, booktitle={Financial Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Seifert, Jean-Pierre}, year={2003}, pages={162–181} }","short":"J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181.","ieee":"J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181."},"year":"2003","type":"book_chapter"},{"file":[{"creator":"feidens","file_id":"5428","file_size":920843,"relation":"main_file","date_updated":"2018-11-08T10:17:39Z","content_type":"application/pdf","date_created":"2018-11-08T10:17:39Z","file_name":"react_acs.pdf","access_level":"closed"}],"author":[{"full_name":"Bemmann, Kai","first_name":"Kai","last_name":"Bemmann"},{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"full_name":"Bröcher, Henrik","first_name":"Henrik","id":"41047","last_name":"Bröcher"},{"full_name":"Diemert, Denis Pascal","first_name":"Denis Pascal","id":"44071","last_name":"Diemert"},{"id":"25078","last_name":"Eidens","full_name":"Eidens, Fabian","first_name":"Fabian"},{"last_name":"Eilers","first_name":"Lukas","full_name":"Eilers, Lukas"},{"last_name":"Haltermann","id":"44413","first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik"},{"id":"48090","last_name":"Juhnke","full_name":"Juhnke, Jakob","first_name":"Jakob"},{"full_name":"Otour, Burhan","first_name":"Burhan","last_name":"Otour"},{"full_name":"Porzenheim, Laurens Alexander","first_name":"Laurens Alexander","id":"47434","last_name":"Porzenheim"},{"full_name":"Pukrop, Simon","first_name":"Simon","last_name":"Pukrop"},{"last_name":"Schilling","first_name":"Erik","full_name":"Schilling, Erik"},{"last_name":"Schlichtig","id":"32312","first_name":"Michael","full_name":"Schlichtig, Michael"},{"full_name":"Stienemeier, Marcel","first_name":"Marcel","last_name":"Stienemeier"}],"publisher":"ACM","quality_controlled":"1","file_date_updated":"2018-11-08T10:17:39Z","publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18","status":"public","has_accepted_license":"1","date_created":"2018-06-14T11:19:29Z","abstract":[{"lang":"eng","text":"We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials), an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing CLARC, users can receive attribute-based credentials from issuers. They can efficiently prove that their credentials satisfy complex (access) policies in a privacy-preserving way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore, CLARC is the first ACS that is combined with an anonymous reputation system where users can anonymously rate services. A user who gets access to a service via a credential, also anonymously receives a review token to rate the service. If a user creates more than a single rating, this can be detected by anyone, preventing users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility of our construction, we present an open-source prototype implementation."}],"user_id":"25078","ddc":["000"],"main_file_link":[{"url":"https://eprint.iacr.org/2018/835","open_access":"1"}],"citation":{"ieee":"K. Bemmann et al., “Fully-Featured Anonymous Credentials with Reputation System,” in Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, Hamburg, Germany.","short":"K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L. Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling, M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA, n.d.","bibtex":"@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with Reputation System}, DOI={10.1145/3230833.3234517}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan and et al.} }","mla":"Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.” Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, doi:10.1145/3230833.3234517.","apa":"Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation System. In Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3234517","ama":"Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM. doi:10.1145/3230833.3234517","chicago":"Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials with Reputation System.” In Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM, n.d. https://doi.org/10.1145/3230833.3234517."},"year":"2018","type":"conference","_id":"3265","conference":{"location":"Hamburg, Germany","name":"ARES 2018 - SECPID","start_date":"2018-08-27","end_date":"2018-08-30"},"department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"44","name":"KogniHome - die mitdenkende Wohnung"}],"publication_status":"accepted","publication_identifier":{"isbn":["978-1-4503-6448-5"]},"place":"New York, NY, USA","related_material":{"link":[{"relation":"software","url":"https://github.com/upbcuk"}]},"title":"Fully-Featured Anonymous Credentials with Reputation System","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:07Z","oa":"1","doi":"10.1145/3230833.3234517"},{"user_id":"25078","title":"Hard-Clustering with Gaussian Mixture Models","publisher":"Computing Research Repository","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"id":"13291","last_name":"Brauer","full_name":"Brauer, Sascha","first_name":"Sascha"},{"last_name":"Bujna","first_name":"Kathrin","full_name":"Bujna, Kathrin"}],"department":[{"_id":"64"}],"status":"public","date_created":"2018-06-04T12:26:51Z","_id":"2969","date_updated":"2022-01-06T06:58:49Z","oa":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1603.06478"}],"citation":{"short":"J. Blömer, S. Brauer, K. Bujna, (2016).","ieee":"J. Blömer, S. Brauer, and K. Bujna, “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.","apa":"Blömer, J., Brauer, S., & Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.","ama":"Blömer J, Brauer S, Bujna K. Hard-Clustering with Gaussian Mixture Models. 2016.","mla":"Blömer, Johannes, et al. Hard-Clustering with Gaussian Mixture Models. Computing Research Repository, 2016.","bibtex":"@article{Blömer_Brauer_Bujna_2016, title={Hard-Clustering with Gaussian Mixture Models}, publisher={Computing Research Repository}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2016} }"},"type":"preprint","year":"2016"},{"publication_status":"published","date_created":"2018-06-05T07:47:21Z","status":"public","department":[{"_id":"64"}],"author":[{"full_name":"Ackermann, Marcel R","first_name":"Marcel R","last_name":"Ackermann"},{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"first_name":"Christoph","full_name":"Scholz, Christoph","last_name":"Scholz"}],"title":"Hardness and Non-Approximability of Bregman Clustering Problems.","user_id":"25078","year":"2011","type":"conference","citation":{"ieee":"M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011.","short":"M.R. Ackermann, J. Blömer, C. Scholz, (2011).","mla":"Ackermann, Marcel R., et al. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.","bibtex":"@article{Ackermann_Blömer_Scholz_2011, series={Electronic Colloquium on Computational Complexity (ECCC)}, title={Hardness and Non-Approximability of Bregman Clustering Problems.}, author={Ackermann, Marcel R and Blömer, Johannes and Scholz, Christoph}, year={2011}, collection={Electronic Colloquium on Computational Complexity (ECCC)} }","ama":"Ackermann MR, Blömer J, Scholz C. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.","apa":"Ackermann, M. R., Blömer, J., & Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.","chicago":"Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011."},"series_title":"Electronic Colloquium on Computational Complexity (ECCC)","_id":"2985","date_updated":"2022-01-06T06:58:50Z"},{"year":"1992","type":"conference","citation":{"ieee":"J. Blömer, “How to denest Ramanujan’s nested radicals,” in Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992.","short":"J. Blömer, in: Proceedings., 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992.","mla":"Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” Proceedings., 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, doi:10.1109/sfcs.1992.267807.","bibtex":"@inproceedings{Blömer_1992, title={How to denest Ramanujan’s nested radicals}, DOI={10.1109/sfcs.1992.267807}, booktitle={Proceedings., 33rd Annual Symposium on Foundations of Computer Science}, publisher={IEEE}, author={Blömer, Johannes}, year={1992} }","ama":"Blömer J. How to denest Ramanujan’s nested radicals. In: Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE; 1992. doi:10.1109/sfcs.1992.267807","apa":"Blömer, J. (1992). How to denest Ramanujan’s nested radicals. In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE. https://doi.org/10.1109/sfcs.1992.267807","chicago":"Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE, 1992. https://doi.org/10.1109/sfcs.1992.267807."},"doi":"10.1109/sfcs.1992.267807","_id":"3047","date_updated":"2022-01-06T06:58:54Z","status":"public","date_created":"2018-06-05T08:52:51Z","publication_identifier":{"isbn":["0818629002"]},"publication_status":"published","publisher":"IEEE","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"department":[{"_id":"64"}],"publication":"Proceedings., 33rd Annual Symposium on Foundations of Computer Science","user_id":"25078","title":"How to denest Ramanujan's nested radicals","extern":"1"},{"year":"2011","type":"book_chapter","citation":{"short":"J. Blömer, in: Algorithms Unplugged, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 159–168.","ieee":"J. Blömer, “How to Share a Secret,” in Algorithms Unplugged, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.","apa":"Blömer, J. (2011). How to Share a Secret. In Algorithms Unplugged (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_17","ama":"Blömer J. How to Share a Secret. In: Algorithms Unplugged. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:159-168. doi:10.1007/978-3-642-15328-0_17","chicago":"Blömer, Johannes. “How to Share a Secret.” In Algorithms Unplugged, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. https://doi.org/10.1007/978-3-642-15328-0_17.","mla":"Blömer, Johannes. “How to Share a Secret.” Algorithms Unplugged, Springer Berlin Heidelberg, 2011, pp. 159–68, doi:10.1007/978-3-642-15328-0_17.","bibtex":"@inbook{Blömer_2011, place={Berlin, Heidelberg}, title={How to Share a Secret}, DOI={10.1007/978-3-642-15328-0_17}, booktitle={Algorithms Unplugged}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2011}, pages={159–168} }"},"page":"159-168","doi":"10.1007/978-3-642-15328-0_17","date_updated":"2022-01-06T06:58:50Z","_id":"2986","status":"public","date_created":"2018-06-05T07:48:25Z","publication_status":"published","publication_identifier":{"isbn":["9783642153273","9783642153280"]},"publisher":"Springer Berlin Heidelberg","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"department":[{"_id":"64"}],"publication":"Algorithms Unplugged","user_id":"25078","title":"How to Share a Secret","place":"Berlin, Heidelberg"},{"project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"date_created":"2019-07-11T08:08:25Z","status":"public","publication_status":"published","volume":14,"publication_identifier":{"issn":["1862-5347","1862-5355"]},"publication":"Advances in Data Analysis and Classification","department":[{"_id":"64"}],"author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"id":"13291","last_name":"Brauer","full_name":"Brauer, Sascha","first_name":"Sascha"},{"last_name":"Bujna","full_name":"Bujna, Kathrin","first_name":"Kathrin"},{"last_name":"Kuntze","first_name":"Daniel","full_name":"Kuntze, Daniel"}],"user_id":"13291","title":"How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models","language":[{"iso":"eng"}],"page":"147–173","year":"2020","type":"journal_article","citation":{"short":"J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and Classification 14 (2020) 147–173.","ieee":"J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models,” Advances in Data Analysis and Classification, vol. 14, pp. 147–173, 2020.","ama":"Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Advances in Data Analysis and Classification. 2020;14:147–173. doi:10.1007/s11634-019-00366-7","apa":"Blömer, J., Brauer, S., Bujna, K., & Kuntze, D. (2020). How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Advances in Data Analysis and Classification, 14, 147–173. https://doi.org/10.1007/s11634-019-00366-7","chicago":"Blömer, Johannes, Sascha Brauer, Kathrin Bujna, and Daniel Kuntze. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” Advances in Data Analysis and Classification 14 (2020): 147–173. https://doi.org/10.1007/s11634-019-00366-7.","bibtex":"@article{Blömer_Brauer_Bujna_Kuntze_2020, title={How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models}, volume={14}, DOI={10.1007/s11634-019-00366-7}, journal={Advances in Data Analysis and Classification}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin and Kuntze, Daniel}, year={2020}, pages={147–173} }","mla":"Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” Advances in Data Analysis and Classification, vol. 14, 2020, pp. 147–173, doi:10.1007/s11634-019-00366-7."},"doi":"10.1007/s11634-019-00366-7","_id":"10790","intvolume":" 14","date_updated":"2022-01-06T06:50:50Z"},{"status":"public","date_created":"2018-06-05T07:33:22Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642400254","9783642400261"]},"publisher":"Springer Berlin Heidelberg","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"},{"last_name":"Liske","first_name":"Gennadij","full_name":"Liske, Gennadij"}],"department":[{"_id":"64"}],"publication":"Constructive Side-Channel Analysis and Secure Design","user_id":"25078","title":"Improved Side Channel Attacks on Pairing Based Cryptography","place":"Berlin, Heidelberg","type":"book_chapter","year":"2013","citation":{"ieee":"J. Blömer, P. Günther, and G. Liske, “Improved Side Channel Attacks on Pairing Based Cryptography,” in Constructive Side-Channel Analysis and Secure Design, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 154–168.","short":"J. Blömer, P. Günther, G. Liske, in: Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 154–168.","bibtex":"@inbook{Blömer_Günther_Liske_2013, place={Berlin, Heidelberg}, title={Improved Side Channel Attacks on Pairing Based Cryptography}, DOI={10.1007/978-3-642-40026-1_10}, booktitle={Constructive Side-Channel Analysis and Secure Design}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2013}, pages={154–168} }","mla":"Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.” Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, 2013, pp. 154–68, doi:10.1007/978-3-642-40026-1_10.","chicago":"Blömer, Johannes, Peter Günther, and Gennadij Liske. “Improved Side Channel Attacks on Pairing Based Cryptography.” In Constructive Side-Channel Analysis and Secure Design, 154–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-40026-1_10.","ama":"Blömer J, Günther P, Liske G. Improved Side Channel Attacks on Pairing Based Cryptography. In: Constructive Side-Channel Analysis and Secure Design. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:154-168. doi:10.1007/978-3-642-40026-1_10","apa":"Blömer, J., Günther, P., & Liske, G. (2013). Improved Side Channel Attacks on Pairing Based Cryptography. In Constructive Side-Channel Analysis and Secure Design (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-40026-1_10"},"page":"154-168","doi":"10.1007/978-3-642-40026-1_10","_id":"2979","date_updated":"2022-01-06T06:58:49Z"},{"status":"public","date_created":"2018-06-05T08:26:50Z","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540430667","9783540455370"]},"publication_status":"published","publisher":"Springer Berlin Heidelberg","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"}],"department":[{"_id":"64"}],"publication":"Selected Areas in Cryptography","user_id":"25078","title":"Key Revocation with Interval Cover Families","place":"Berlin, Heidelberg","type":"book_chapter","year":"2007","citation":{"short":"J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 325–341.","ieee":"J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.","apa":"Blömer, J., & May, A. (2007). Key Revocation with Interval Cover Families. In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45537-x_26","ama":"Blömer J, May A. Key Revocation with Interval Cover Families. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341. doi:10.1007/3-540-45537-x_26","chicago":"Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” In Selected Areas in Cryptography, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45537-x_26.","bibtex":"@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Key Revocation with Interval Cover Families}, DOI={10.1007/3-540-45537-x_26}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2007}, pages={325–341} }","mla":"Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26."},"page":"325-341","doi":"10.1007/3-540-45537-x_26","_id":"3021","date_updated":"2022-01-06T06:58:51Z"},{"title":"Low Secret Exponent RSA Revisited","user_id":"25078","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424888","9783540446705"]},"status":"public","date_created":"2018-06-05T08:26:29Z","publisher":"Springer Berlin Heidelberg","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"department":[{"_id":"64"}],"publication":"Lecture Notes in Computer Science","doi":"10.1007/3-540-44670-2_2","_id":"3020","date_updated":"2022-01-06T06:58:51Z","citation":{"short":"J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.","ieee":"J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.","apa":"Blömer, J., & May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44670-2_2","ama":"Blömer J, May A. Low Secret Exponent RSA Revisited. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19. doi:10.1007/3-540-44670-2_2","chicago":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” In Lecture Notes in Computer Science, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-44670-2_2.","mla":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.","bibtex":"@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Low Secret Exponent RSA Revisited}, DOI={10.1007/3-540-44670-2_2}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2007}, pages={4–19} }"},"year":"2007","type":"book_chapter","page":"4-19"},{"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"publisher":"Springer Berlin Heidelberg","department":[{"_id":"64"}],"publication":"Advances in Cryptology - CRYPTO 2003","status":"public","date_created":"2018-06-05T08:24:11Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540406747","9783540451464"]},"publication_status":"published","place":"Berlin, Heidelberg","user_id":"25078","title":"New Partial Key Exposure Attacks on RSA","citation":{"mla":"Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2.","bibtex":"@inbook{Blömer_May_2003, place={Berlin, Heidelberg}, title={New Partial Key Exposure Attacks on RSA}, DOI={10.1007/978-3-540-45146-4_2}, booktitle={Advances in Cryptology - CRYPTO 2003}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2003}, pages={27–43} }","chicago":"Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45146-4_2.","ama":"Blömer J, May A. New Partial Key Exposure Attacks on RSA. In: Advances in Cryptology - CRYPTO 2003. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:27-43. doi:10.1007/978-3-540-45146-4_2","apa":"Blömer, J., & May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45146-4_2","ieee":"J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.","short":"J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43."},"year":"2003","type":"book_chapter","page":"27-43","date_updated":"2022-01-06T06:58:51Z","_id":"3016","doi":"10.1007/978-3-540-45146-4_2"},{"citation":{"ieee":"J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,” 1999, doi: 10.1145/301250.301441.","short":"J. Blömer, J.-P. Seifert, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99, ACM Press, 1999.","bibtex":"@inproceedings{Blömer_Seifert_1999, title={On the complexity of computing short linearly independent vectors and short bases in a lattice}, DOI={10.1145/301250.301441}, booktitle={Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC ’99}, publisher={ACM Press}, author={Blömer, Johannes and Seifert, Jean-Pierre}, year={1999} }","mla":"Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.” Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99, ACM Press, 1999, doi:10.1145/301250.301441.","ama":"Blömer J, Seifert J-P. On the complexity of computing short linearly independent vectors and short bases in a lattice. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99. ACM Press; 1999. doi:10.1145/301250.301441","apa":"Blömer, J., & Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99. https://doi.org/10.1145/301250.301441","chicago":"Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.” In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99. ACM Press, 1999. https://doi.org/10.1145/301250.301441."},"type":"conference","year":"1999","_id":"3024","date_updated":"2023-01-10T13:49:15Z","doi":"10.1145/301250.301441","file":[{"date_updated":"2018-06-05T08:28:14Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":313561,"creator":"feidens","file_id":"3025","access_level":"closed","date_created":"2018-06-05T08:28:14Z","file_name":"short.pdf"}],"publisher":"ACM Press","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"full_name":"Seifert, Jean-Pierre","first_name":"Jean-Pierre","last_name":"Seifert"}],"file_date_updated":"2018-06-05T08:28:14Z","department":[{"_id":"64"}],"publication":"Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99","has_accepted_license":"1","status":"public","date_created":"2018-06-05T08:27:53Z","publication_status":"published","publication_identifier":{"isbn":["1581130678"]},"user_id":"23","title":"On the complexity of computing short linearly independent vectors and short bases in a lattice","ddc":["000"]},{"conference":{"location":"Taipeh, Taiwan","start_date":"2023-11-29","name":"TCC 2023","end_date":"2023-12-02"},"_id":"35014","date_updated":"2023-09-07T10:01:00Z","oa":"1","main_file_link":[{"url":"https://eprint.iacr.org/2022/1762","open_access":"1"}],"type":"conference","year":"2023","citation":{"mla":"Blömer, Johannes, et al. On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC. 2023.","bibtex":"@inproceedings{Blömer_Bobolz_Bröcher_2023, title={On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC}, author={Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik}, year={2023} }","apa":"Blömer, J., Bobolz, J., & Bröcher, H. (2023). On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. TCC 2023, Taipeh, Taiwan.","ama":"Blömer J, Bobolz J, Bröcher H. On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. In: ; 2023.","chicago":"Blömer, Johannes, Jan Bobolz, and Henrik Bröcher. “On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC,” 2023.","ieee":"J. Blömer, J. Bobolz, and H. Bröcher, “On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC,” presented at the TCC 2023, Taipeh, Taiwan, 2023.","short":"J. Blömer, J. Bobolz, H. Bröcher, in: 2023."},"language":[{"iso":"eng"}],"title":"On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC","user_id":"41047","department":[{"_id":"34"},{"_id":"64"}],"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"first_name":"Jan","full_name":"Bobolz, Jan","last_name":"Bobolz","id":"27207"},{"id":"41047","last_name":"Bröcher","full_name":"Bröcher, Henrik","first_name":"Henrik"}],"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"date_created":"2022-12-28T16:02:11Z","status":"public"},{"date_updated":"2022-01-06T06:58:50Z","_id":"2991","year":"2010","citation":{"mla":"Krueger, Alexander, et al. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.","bibtex":"@article{Krueger_Leutnant_Haeb-Umbach_Ackermann_Blömer_2010, title={On the initialization of dynamic models for speech features}, journal={Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany}, author={Krueger, Alexander and Leutnant, Volker and Haeb-Umbach, Reinhold and Ackermann, Marcel and Blömer, Johannes}, year={2010} }","apa":"Krueger, A., Leutnant, V., Haeb-Umbach, R., Ackermann, M., & Blömer, J. (2010). On the initialization of dynamic models for speech features. Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany.","ama":"Krueger A, Leutnant V, Haeb-Umbach R, Ackermann M, Blömer J. On the initialization of dynamic models for speech features. Proc of ITG Fachtagung Sprachkommunikation ITG, Bochum, Germany. 2010.","chicago":"Krueger, Alexander, Volker Leutnant, Reinhold Haeb-Umbach, Marcel Ackermann, and Johannes Blömer. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.","ieee":"A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, and J. Blömer, “On the initialization of dynamic models for speech features,” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.","short":"A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, J. Blömer, Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany (2010)."},"type":"journal_article","title":"On the initialization of dynamic models for speech features","user_id":"25078","department":[{"_id":"64"}],"publication":"Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany","author":[{"full_name":"Krueger, Alexander","first_name":"Alexander","last_name":"Krueger"},{"last_name":"Leutnant","first_name":"Volker","full_name":"Leutnant, Volker"},{"last_name":"Haeb-Umbach","first_name":"Reinhold","full_name":"Haeb-Umbach, Reinhold"},{"last_name":"Ackermann","first_name":"Marcel","full_name":"Ackermann, Marcel"},{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"publication_status":"published","date_created":"2018-06-05T07:53:41Z","status":"public"},{"department":[{"_id":"568"},{"_id":"64"}],"title":"Personal Cross-Platform Reputation","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:38Z","oa":"1","doi":"10.1007/978-3-030-31511-5_9","file":[{"file_name":"informal.pdf","date_created":"2019-10-01T07:45:17Z","access_level":"open_access","title":"Personal cross-platform reputation, author's version","creator":"nilo","file_id":"13555","file_size":507736,"description":"This is an author's version of the paper presented at STM 2019.","relation":"main_file","content_type":"application/pdf","date_updated":"2019-10-01T07:45:17Z"}],"author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Löken","id":"13703","first_name":"Nils","full_name":"Löken, Nils"}],"publication":"Security and Trust Management, STM 2019","file_date_updated":"2019-10-01T07:45:17Z","has_accepted_license":"1","status":"public","date_created":"2019-10-01T07:50:03Z","volume":11738,"abstract":[{"text":"We propose a novel personal reputation system for cross-platform reputation. We observe that, in certain usage scenarios, e.g. crowd work, the rater anonymity property typically imposed on reputation systems is not necessary. Instead, we propose a relaxed notion of rater anonymity that is more applicable in the crowd work scenario. This allows us to construct a secure personal reputation system from simple cryptographic primitives.","lang":"eng"}],"user_id":"13703","ddc":["000"],"year":"2019","citation":{"short":"J. Blömer, N. Löken, in: Security and Trust Management, STM 2019, 2019.","ieee":"J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in Security and Trust Management, STM 2019, 2019, vol. 11738.","ama":"Blömer J, Löken N. Personal Cross-Platform Reputation. In: Security and Trust Management, STM 2019. Vol 11738. LNCS. ; 2019. doi:10.1007/978-3-030-31511-5_9","apa":"Blömer, J., & Löken, N. (2019). Personal Cross-Platform Reputation. In Security and Trust Management, STM 2019 (Vol. 11738). https://doi.org/10.1007/978-3-030-31511-5_9","chicago":"Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” In Security and Trust Management, STM 2019, Vol. 11738. LNCS, 2019. https://doi.org/10.1007/978-3-030-31511-5_9.","mla":"Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” Security and Trust Management, STM 2019, vol. 11738, 2019, doi:10.1007/978-3-030-31511-5_9.","bibtex":"@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Personal Cross-Platform Reputation}, volume={11738}, DOI={10.1007/978-3-030-31511-5_9}, booktitle={Security and Trust Management, STM 2019}, author={Blömer, Johannes and Löken, Nils}, year={2019}, collection={LNCS} }"},"type":"conference","_id":"13554","intvolume":" 11738","conference":{"name":"Security and Trust Management, STM 2019"}},{"doi":"10.5281/zenodo.8068755","oa":"1","date_updated":"2023-07-07T11:13:37Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","title":"Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems","place":"Paderborn","editor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"}],"department":[{"_id":"7"}],"_id":"45901","intvolume":" 412","page":"237-246","type":"book_chapter","year":"2023","citation":{"ieee":"J. Blömer, J. Bobolz, F. Eidens, T. Jager, and P. Kramer, “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–246.","short":"J. Blömer, J. Bobolz, F. Eidens, T. Jager, P. Kramer, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 237–246.","mla":"Blömer, Johannes, et al. “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–46, doi:10.5281/zenodo.8068755.","bibtex":"@inbook{Blömer_Bobolz_Eidens_Jager_Kramer_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems}, volume={412}, DOI={10.5281/zenodo.8068755}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Blömer, Johannes and Bobolz, Jan and Eidens, Fabian and Jager, Tibor and Kramer, Paul}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={237–246}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","chicago":"Blömer, Johannes, Jan Bobolz, Fabian Eidens, Tibor Jager, and Paul Kramer. “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:237–46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068755.","ama":"Blömer J, Bobolz J, Eidens F, Jager T, Kramer P. Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:237-246. doi:10.5281/zenodo.8068755","apa":"Blömer, J., Bobolz, J., Eidens, F., Jager, T., & Kramer, P. (2023). Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 237–246). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068755"},"ddc":["004"],"user_id":"477","volume":412,"date_created":"2023-07-07T08:41:44Z","status":"public","has_accepted_license":"1","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file_date_updated":"2023-07-07T11:13:37Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"id":"27207","last_name":"Bobolz","full_name":"Bobolz, Jan","first_name":"Jan"},{"full_name":"Eidens, Fabian","first_name":"Fabian","id":"25078","last_name":"Eidens"},{"full_name":"Jager, Tibor","first_name":"Tibor","id":"64669","last_name":"Jager"},{"last_name":"Kramer","id":"64594","first_name":"Paul","full_name":"Kramer, Paul"}],"file":[{"access_level":"open_access","file_name":"T2-Chapter-SFB-Buch-Final.pdf","date_created":"2023-07-07T08:41:35Z","relation":"main_file","content_type":"application/pdf","date_updated":"2023-07-07T11:13:37Z","file_id":"45902","creator":"florida","file_size":5944790}]},{"department":[{"_id":"7"},{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"publication_identifier":{"isbn":["9783319769523","9783319769530"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Cham","title":"Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:58:12Z","oa":"1","doi":"10.1007/978-3-319-76953-0_25","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-11-02T13:45:40Z","creator":"ups","file_id":"5253","file_size":3371773,"access_level":"closed","date_created":"2018-11-02T13:45:40Z","file_name":"PracticalAnonymousAndPubliclyL.pdf"}],"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Eidens","id":"25078","first_name":"Fabian","full_name":"Eidens, Fabian"},{"id":"48090","last_name":"Juhnke","full_name":"Juhnke, Jakob","first_name":"Jakob"}],"publisher":"Springer International Publishing","publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings","file_date_updated":"2018-11-02T13:45:40Z","status":"public","has_accepted_license":"1","date_created":"2018-05-24T11:14:02Z","user_id":"477","ddc":["004"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/029"}],"type":"conference","year":"2018","citation":{"short":"J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, San Francisco, CA, USA, 2018, pp. 470–490.","chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” In Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-76953-0_25.","ama":"Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings. Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25","apa":"Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings (pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={10.1007/978-3-319-76953-0_25}, booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490} }","mla":"Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, 2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25."},"page":"470-490","_id":"2862","conference":{"name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018","start_date":"2018-04-16","location":"San Francisco, CA, USA","end_date":"2018-04-20"}},{"publication":"IEEE Transactions on Information Theory","file_date_updated":"2018-06-05T08:37:48Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","author":[{"last_name":"Albanese","first_name":"Andres","full_name":"Albanese, Andres"},{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Jeff","full_name":"Edmonds, Jeff","last_name":"Edmonds"},{"last_name":"Luby","first_name":"Michael","full_name":"Luby, Michael"},{"full_name":"Sudan, Madhu","first_name":"Madhu","last_name":"Sudan"}],"file":[{"content_type":"application/pdf","date_updated":"2018-06-05T08:37:48Z","success":1,"relation":"main_file","file_size":260143,"creator":"feidens","file_id":"3035","access_level":"closed","date_created":"2018-06-05T08:37:48Z","file_name":"pet.pdf"}],"volume":42,"date_created":"2018-06-05T08:36:14Z","has_accepted_license":"1","status":"public","extern":"1","ddc":["000"],"user_id":"25078","page":"1737-1744","type":"journal_article","citation":{"mla":"Albanese, Andres, et al. “Priority Encoding Transmission.” IEEE Transactions on Information Theory, vol. 42, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2002, pp. 1737–44, doi:10.1109/18.556670.","bibtex":"@article{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority encoding transmission}, volume={42}, DOI={10.1109/18.556670}, number={6}, journal={IEEE Transactions on Information Theory}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Albanese, Andres and Blömer, Johannes and Edmonds, Jeff and Luby, Michael and Sudan, Madhu}, year={2002}, pages={1737–1744} }","chicago":"Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.” IEEE Transactions on Information Theory 42, no. 6 (2002): 1737–44. https://doi.org/10.1109/18.556670.","apa":"Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. IEEE Transactions on Information Theory, 42(6), 1737–1744. https://doi.org/10.1109/18.556670","ama":"Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. IEEE Transactions on Information Theory. 2002;42(6):1737-1744. doi:10.1109/18.556670","ieee":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1737–1744, 2002.","short":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, IEEE Transactions on Information Theory 42 (2002) 1737–1744."},"year":"2002","intvolume":" 42","_id":"3034","issue":"6","department":[{"_id":"64"}],"publication_status":"published","publication_identifier":{"issn":["0018-9448"]},"title":"Priority encoding transmission","date_updated":"2022-01-06T06:58:53Z","doi":"10.1109/18.556670"},{"extern":"1","title":"Priority encoding transmission","user_id":"25078","publisher":"IEEE Comput. Soc. Press","author":[{"last_name":"Albanese","first_name":"A.","full_name":"Albanese, A."},{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Edmonds","full_name":"Edmonds, J.","first_name":"J."},{"last_name":"Luby","full_name":"Luby, M.","first_name":"M."},{"full_name":"Sudan, M.","first_name":"M.","last_name":"Sudan"}],"department":[{"_id":"64"}],"publication":"Proceedings 35th Annual Symposium on Foundations of Computer Science","publication_identifier":{"isbn":["0818665807"]},"publication_status":"published","status":"public","date_created":"2018-06-05T08:43:13Z","_id":"3040","date_updated":"2022-01-06T06:58:53Z","doi":"10.1109/sfcs.1994.365731","type":"conference","citation":{"short":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, in: Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.","ieee":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002.","chicago":"Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.” In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1994.365731.","apa":"Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1994.365731","ama":"Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. In: Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press; 2002. doi:10.1109/sfcs.1994.365731","bibtex":"@inproceedings{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority encoding transmission}, DOI={10.1109/sfcs.1994.365731}, booktitle={Proceedings 35th Annual Symposium on Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Albanese, A. and Blömer, Johannes and Edmonds, J. and Luby, M. and Sudan, M.}, year={2002} }","mla":"Albanese, A., et al. “Priority Encoding Transmission.” Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002, doi:10.1109/sfcs.1994.365731."},"year":"2002"},{"citation":{"ieee":"J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments. .","short":"J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","mla":"Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.","bibtex":"@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander} }","apa":"Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.","ama":"Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication Based on Trusted Execution Environments.","chicago":"Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. Provably Anonymous Communication Based on Trusted Execution Environments, n.d."},"year":"2018","type":"working_paper","language":[{"iso":"eng"}],"_id":"5820","date_updated":"2022-01-06T07:02:43Z","publication_status":"draft","status":"public","has_accepted_license":"1","date_created":"2018-11-25T08:08:40Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Setzer","id":"11108","first_name":"Alexander","full_name":"Setzer, Alexander"}],"file_date_updated":"2018-12-31T09:55:30Z","department":[{"_id":"7"},{"_id":"64"},{"_id":"79"}],"file":[{"content_type":"application/pdf","date_updated":"2018-12-31T09:55:30Z","relation":"main_file","success":1,"file_size":470968,"creator":"jbobolz","file_id":"6435","access_level":"closed","file_name":"draft-2018.pdf","date_created":"2018-12-31T09:55:30Z"}],"ddc":["000"],"title":"Provably Anonymous Communication Based on Trusted Execution Environments","user_id":"27207","abstract":[{"lang":"eng","text":"In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks.\r\nFor this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes.\r\nIn our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks. \r\nOur techniques are very general and can be used as a basis for future constructions with similar goals."}]},{"page":"69-83","type":"book_chapter","year":"2004","citation":{"ieee":"J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.","short":"J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.","mla":"Blömer, Johannes, et al. “Provably Secure Masking of AES.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:10.1007/978-3-540-30564-4_5.","bibtex":"@inbook{Blömer_Guajardo_Krummel_2004, place={Berlin, Heidelberg}, title={Provably Secure Masking of AES}, DOI={10.1007/978-3-540-30564-4_5}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Guajardo, Jorge and Krummel, Volker}, year={2004}, pages={69–83} }","apa":"Blömer, J., Guajardo, J., & Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_5","ama":"Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:10.1007/978-3-540-30564-4_5","chicago":"Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In Selected Areas in Cryptography, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30564-4_5."},"_id":"3011","date_updated":"2022-01-06T06:58:51Z","doi":"10.1007/978-3-540-30564-4_5","publication":"Selected Areas in Cryptography","department":[{"_id":"64"}],"author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Guajardo","full_name":"Guajardo, Jorge","first_name":"Jorge"},{"first_name":"Volker","full_name":"Krummel, Volker","last_name":"Krummel"}],"publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:20:20Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783540243274","9783540305644"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","user_id":"25078","title":"Provably Secure Masking of AES"},{"_id":"3003","date_updated":"2022-01-06T06:58:50Z","issue":"6","doi":"10.3217/jucs-012-06-0654","citation":{"short":"J. Blömer, Journal of Universal Computer Science (J.UCS) (2006) 654--671.","ieee":"J. Blömer, “Randomness and Secrecy - A Brief Introduction,” Journal of Universal Computer Science (J.UCS), no. 6, pp. 654--671, 2006.","chicago":"Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” Journal of Universal Computer Science (J.UCS), no. 6 (2006): 654--671. https://doi.org/10.3217/jucs-012-06-0654.","ama":"Blömer J. Randomness and Secrecy - A Brief Introduction. Journal of Universal Computer Science (JUCS). 2006;(6):654--671. doi:10.3217/jucs-012-06-0654","apa":"Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. Journal of Universal Computer Science (J.UCS), (6), 654--671. https://doi.org/10.3217/jucs-012-06-0654","mla":"Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” Journal of Universal Computer Science (J.UCS), no. 6, 2006, pp. 654--671, doi:10.3217/jucs-012-06-0654.","bibtex":"@article{Blömer_2006, title={Randomness and Secrecy - A Brief Introduction}, DOI={10.3217/jucs-012-06-0654}, number={6}, journal={Journal of Universal Computer Science (J.UCS)}, author={Blömer, Johannes}, year={2006}, pages={654--671} }"},"year":"2006","type":"journal_article","page":"654--671","abstract":[{"lang":"eng","text":"We give a brief introduction to probabilistic encryptions. This serves as an example how randomness plays a pivotal role in cryptographic systems that satisfy advanced security concepts."}],"user_id":"25078","title":"Randomness and Secrecy - A Brief Introduction","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"publication":"Journal of Universal Computer Science (J.UCS)","department":[{"_id":"64"}],"status":"public","date_created":"2018-06-05T08:13:39Z","publication_status":"published"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540554882","9783540471035"]},"publication_status":"published","status":"public","date_created":"2018-06-05T08:51:15Z","publisher":"Springer Berlin Heidelberg","author":[{"full_name":"Alt, Helmut","first_name":"Helmut","last_name":"Alt"},{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"publication":"Data structures and efficient algorithms","department":[{"_id":"64"}],"title":"Resemblance and symmetries of geometric patterns","user_id":"25078","place":"Berlin, Heidelberg","year":"1992","citation":{"bibtex":"@inbook{Alt_Blömer_1992, place={Berlin, Heidelberg}, title={Resemblance and symmetries of geometric patterns}, DOI={10.1007/3-540-55488-2_19}, booktitle={Data structures and efficient algorithms}, publisher={Springer Berlin Heidelberg}, author={Alt, Helmut and Blömer, Johannes}, year={1992}, pages={1–24} }","mla":"Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, 1992, pp. 1–24, doi:10.1007/3-540-55488-2_19.","apa":"Alt, H., & Blömer, J. (1992). Resemblance and symmetries of geometric patterns. In Data structures and efficient algorithms (pp. 1–24). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55488-2_19","ama":"Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg; 1992:1-24. doi:10.1007/3-540-55488-2_19","chicago":"Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” In Data Structures and Efficient Algorithms, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_19.","ieee":"H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.","short":"H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24."},"type":"book_chapter","page":"1-24","doi":"10.1007/3-540-55488-2_19","date_updated":"2022-01-06T06:58:54Z","_id":"3046"},{"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","oa":"1","doi":"10.5281/zenodo.8068629","date_updated":"2023-07-07T11:18:21Z","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"editor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"department":[{"_id":"7"}],"title":"Robustness and Security","place":"Paderborn","type":"book_chapter","citation":{"bibtex":"@inbook{Blömer_Eidens_Jager_Niehues_Scheideler_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Robustness and Security}, volume={412}, DOI={10.5281/zenodo.8068629}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Blömer, Johannes and Eidens, Fabian and Jager, Tibor and Niehues, David and Scheideler, Christian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={145–164}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Blömer, Johannes, et al. “Robustness and Security.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:10.5281/zenodo.8068629.","apa":"Blömer, J., Eidens, F., Jager, T., Niehues, D., & Scheideler, C. (2023). Robustness and Security. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 145–164). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068629","ama":"Blömer J, Eidens F, Jager T, Niehues D, Scheideler C. Robustness and Security. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:145-164. doi:10.5281/zenodo.8068629","chicago":"Blömer, Johannes, Fabian Eidens, Tibor Jager, David Niehues, and Christian Scheideler. “Robustness and Security.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:145–64. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068629.","ieee":"J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness and Security,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–164.","short":"J. Blömer, F. Eidens, T. Jager, D. Niehues, C. Scheideler, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 145–164."},"year":"2023","page":"145-164","intvolume":" 412","_id":"45891","status":"public","has_accepted_license":"1","date_created":"2023-07-07T08:08:47Z","volume":412,"file":[{"file_size":320980,"file_id":"45892","creator":"florida","content_type":"application/pdf","date_updated":"2023-07-07T11:18:21Z","relation":"main_file","date_created":"2023-07-07T08:08:37Z","file_name":"C1-Chapter-SFB-Buch-Final.pdf","access_level":"open_access"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"full_name":"Eidens, Fabian","first_name":"Fabian","id":"25078","last_name":"Eidens"},{"first_name":"Tibor","full_name":"Jager, Tibor","last_name":"Jager","id":"64669"},{"last_name":"Niehues","id":"36113","first_name":"David","full_name":"Niehues, David"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file_date_updated":"2023-07-07T11:18:21Z","user_id":"477","ddc":["004"]},{"type":"journal_article","citation":{"short":"J. Blömer, S. Naewe, Theoretical Computer Science (2009) 1648–1665.","ieee":"J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” Theoretical Computer Science, no. 18, pp. 1648–1665, 2009.","ama":"Blömer J, Naewe S. Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science. 2009;(18):1648-1665. doi:10.1016/j.tcs.2008.12.045","apa":"Blömer, J., & Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science, (18), 1648–1665. https://doi.org/10.1016/j.tcs.2008.12.045","chicago":"Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” Theoretical Computer Science, no. 18 (2009): 1648–65. https://doi.org/10.1016/j.tcs.2008.12.045.","bibtex":"@article{Blömer_Naewe_2009, title={Sampling methods for shortest vectors, closest vectors and successive minima}, DOI={10.1016/j.tcs.2008.12.045}, number={18}, journal={Theoretical Computer Science}, author={Blömer, Johannes and Naewe, Stefanie}, year={2009}, pages={1648–1665} }","mla":"Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” Theoretical Computer Science, no. 18, 2009, pp. 1648–65, doi:10.1016/j.tcs.2008.12.045."},"year":"2009","page":"1648 - 1665","_id":"2999","date_updated":"2022-01-06T06:58:50Z","doi":"10.1016/j.tcs.2008.12.045","issue":"18","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Naewe","first_name":"Stefanie","full_name":"Naewe, Stefanie"}],"department":[{"_id":"64"}],"keyword":["Geometry of numbers","Lattices","Shortest vectors"],"publication":"Theoretical Computer Science","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","status":"public","date_created":"2018-06-05T08:07:24Z","title":"Sampling methods for shortest vectors, closest vectors and successive minima","user_id":"25078"},{"abstract":[{"text":"Unattended systems are key ingredients of various critical infrastruc-tures like networks of self service terminals or automated teller machines.For cost and efficiency reasons they should mostly run autonomously.Unattended systems are attractive and lucrative targets for various kindsof attacks, including attacks on the integrity of their components and thecommunication between components. In this paper, we propose a gen-eral cryptographic framework to protect unattended systems. We alsodemonstrate that instantiating the framework with techniques from iden-tity based cryptography is particularly well-suited to efficiently secureunattended systems.","lang":"eng"}],"user_id":"477","ddc":["040"],"title":"Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study","file":[{"relation":"main_file","success":1,"date_updated":"2018-03-15T13:46:52Z","content_type":"application/pdf","creator":"florida","file_id":"1317","file_size":301962,"access_level":"closed","date_created":"2018-03-15T13:46:52Z","file_name":"488-MACIS13.pdf"}],"department":[{"_id":"64"}],"publication":"Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)","file_date_updated":"2018-03-15T13:46:52Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"first_name":"Peter","full_name":"Günther, Peter","last_name":"Günther"},{"first_name":"Volker","full_name":"Krummel, Volker","last_name":"Krummel"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:42:27Z","status":"public","has_accepted_license":"1","_id":"488","date_updated":"2022-01-06T07:01:28Z","page":"98-105","type":"conference","year":"2013","citation":{"chicago":"Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” In Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 98–105, 2013.","apa":"Blömer, J., Günther, P., & Krummel, V. (2013). Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS) (pp. 98–105).","ama":"Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS). ; 2013:98-105.","bibtex":"@inproceedings{Blömer_Günther_Krummel_2013, title={Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study}, booktitle={Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker}, year={2013}, pages={98–105} }","mla":"Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.","short":"J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.","ieee":"J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study,” in Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105."}},{"series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:07Z","doi":"10.1007/978-3-319-32859-1_14","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"44","name":"KogniHome - die mitdenkende Wohnung"}],"title":"Short Group Signatures with Distributed Traceability","related_material":{"record":[{"status":"public","id":"325","relation":"other"}]},"page":"166-180","type":"conference","year":"2015","citation":{"short":"J. Blömer, J. Juhnke, N. Löken, in: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.","ieee":"J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed Traceability,” in Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.","apa":"Blömer, J., Juhnke, J., & Löken, N. (2015). Short Group Signatures with Distributed Traceability. In Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS) (pp. 166–180). https://doi.org/10.1007/978-3-319-32859-1_14","ama":"Blömer J, Juhnke J, Löken N. Short Group Signatures with Distributed Traceability. In: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS). LNCS. ; 2015:166-180. doi:10.1007/978-3-319-32859-1_14","chicago":"Blömer, Johannes, Jakob Juhnke, and Nils Löken. “Short Group Signatures with Distributed Traceability.” In Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 166–80. LNCS, 2015. https://doi.org/10.1007/978-3-319-32859-1_14.","mla":"Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.” Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–80, doi:10.1007/978-3-319-32859-1_14.","bibtex":"@inproceedings{Blömer_Juhnke_Löken_2015, series={LNCS}, title={Short Group Signatures with Distributed Traceability}, DOI={10.1007/978-3-319-32859-1_14}, booktitle={Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Juhnke, Jakob and Löken, Nils}, year={2015}, pages={166–180}, collection={LNCS} }"},"_id":"253","file_date_updated":"2018-11-02T14:08:23Z","publication":"Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Juhnke","id":"48090","first_name":"Jakob","full_name":"Juhnke, Jakob"},{"full_name":"Löken, Nils","first_name":"Nils","id":"13703","last_name":"Löken"}],"file":[{"file_size":262436,"creator":"ups","file_id":"5262","content_type":"application/pdf","date_updated":"2018-11-02T14:08:23Z","relation":"main_file","success":1,"file_name":"ShortGroupSignaturesWithDistri.pdf","date_created":"2018-11-02T14:08:23Z","access_level":"closed"}],"date_created":"2017-10-17T12:41:41Z","status":"public","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Group signatures, introduced by Chaum and van Heyst [15], are an important primitive in cryptography. In group signature schemes every group member can anonymously sign messages on behalf of the group. In case of disputes a dedicated opening manager is able to trace signatures - he can extract the identity of the producer of a given signature. A formal model for static group signatures schemes and their security is defined by Bellare, Micciancio, and Warinschi [4], the case of dynamic groups is considered by Bellare, Shi, and Zhang [5]. Both models define group signature schemes with a single opening manager. The main difference between these models is that the number of group members in static schemes is fixed, while in dynamic schemes group members can join the group over time."}],"ddc":["000"],"user_id":"13703"},{"status":"public","has_accepted_license":"1","date_created":"2018-06-05T08:17:12Z","file":[{"access_level":"closed","date_created":"2018-06-05T08:18:56Z","file_name":"SignChangeFaultAttacksOnECC.pdf","content_type":"application/pdf","date_updated":"2018-06-05T08:18:56Z","relation":"main_file","success":1,"file_size":259146,"creator":"feidens","file_id":"3009"}],"author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Otto","first_name":"Martin","full_name":"Otto, Martin"},{"first_name":"Jean-Pierre","full_name":"Seifert, Jean-Pierre","last_name":"Seifert"}],"publisher":"Springer Berlin Heidelberg","publication":"Lecture Notes in Computer Science","file_date_updated":"2018-06-05T08:18:56Z","user_id":"25078","ddc":["000"],"type":"book_chapter","citation":{"apa":"Blömer, J., Otto, M., & Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In Lecture Notes in Computer Science (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_4","ama":"Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:36-52. doi:10.1007/11889700_4","chicago":"Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” In Lecture Notes in Computer Science, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_4.","bibtex":"@inbook{Blömer_Otto_Seifert_2006, place={Berlin, Heidelberg}, title={Sign Change Fault Attacks on Elliptic Curve Cryptosystems}, DOI={10.1007/11889700_4}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2006}, pages={36–52} }","mla":"Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:10.1007/11889700_4.","short":"J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.","ieee":"J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52."},"year":"2006","page":"36-52","_id":"3007","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540462507","9783540462514"]},"publication_status":"published","department":[{"_id":"64"}],"title":"Sign Change Fault Attacks on Elliptic Curve Cryptosystems","place":"Berlin, Heidelberg","doi":"10.1007/11889700_4","date_updated":"2022-01-06T06:58:50Z"},{"_id":"3043","date_updated":"2022-01-06T06:58:54Z","type":"dissertation","citation":{"chicago":"Blömer, Johannes. Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.","apa":"Blömer, J. (1992). Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik.","ama":"Blömer J. Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik; 1992.","bibtex":"@book{Blömer_1992, title={Simplifying Expressions Involving Radicals}, publisher={PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik}, author={Blömer, Johannes}, year={1992} }","mla":"Blömer, Johannes. Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.","short":"J. Blömer, Simplifying Expressions Involving Radicals, PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.","ieee":"J. Blömer, Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992."},"year":"1992","extern":"1","title":"Simplifying Expressions Involving Radicals","ddc":["000"],"user_id":"25078","department":[{"_id":"64"}],"file_date_updated":"2018-06-05T08:47:26Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"publisher":"PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik","file":[{"creator":"feidens","file_id":"3044","file_size":40741,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-06-05T08:47:26Z","date_created":"2018-06-05T08:47:26Z","file_name":"JohannesThesisAbstract.pdf","access_level":"closed"}],"publication_status":"published","date_created":"2018-06-05T08:46:51Z","status":"public","has_accepted_license":"1"},{"date_updated":"2022-01-06T06:58:48Z","_id":"2947","doi":"10.1109/fdtc.2015.17","year":"2016","citation":{"short":"J. Blömer, P. Günther, in: 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016.","ieee":"J. Blömer and P. Günther, “Singular Curve Point Decompression Attack,” in 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), 2016.","apa":"Blömer, J., & Günther, P. (2016). Singular Curve Point Decompression Attack. In 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE. https://doi.org/10.1109/fdtc.2015.17","ama":"Blömer J, Günther P. Singular Curve Point Decompression Attack. In: 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE; 2016. doi:10.1109/fdtc.2015.17","chicago":"Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.” In 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE, 2016. https://doi.org/10.1109/fdtc.2015.17.","mla":"Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.” 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016, doi:10.1109/fdtc.2015.17.","bibtex":"@inproceedings{Blömer_Günther_2016, title={Singular Curve Point Decompression Attack}, DOI={10.1109/fdtc.2015.17}, booktitle={2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)}, publisher={IEEE}, author={Blömer, Johannes and Günther, Peter}, year={2016} }"},"type":"conference","user_id":"25078","title":"Singular Curve Point Decompression Attack","department":[{"_id":"64"}],"publication":"2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)","publisher":"IEEE","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"}],"project":[{"_id":"43","name":"Securing the Financial Cloud"}],"date_created":"2018-05-29T11:25:43Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781467375795"]}},{"citation":{"ieee":"J. Blömer and S. Naewe, “Solving the Closest Vector Problem with respect to Lp Norms,” arXiv:1104.3720. 2011.","short":"J. Blömer, S. Naewe, ArXiv:1104.3720 (2011).","bibtex":"@article{Blömer_Naewe_2011, title={Solving the Closest Vector Problem with respect to Lp Norms}, journal={arXiv:1104.3720}, author={Blömer, Johannes and Naewe, Stefanie}, year={2011} }","mla":"Blömer, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.","chicago":"Blömer, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.","apa":"Blömer, J., & Naewe, S. (2011). Solving the Closest Vector Problem with respect to Lp Norms. ArXiv:1104.3720.","ama":"Blömer J, Naewe S. Solving the Closest Vector Problem with respect to Lp Norms. arXiv:11043720. 2011."},"year":"2011","type":"preprint","date_updated":"2022-01-06T06:58:50Z","_id":"2987","date_created":"2018-06-05T07:49:32Z","status":"public","department":[{"_id":"64"}],"publication":"arXiv:1104.3720","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Naewe","first_name":"Stefanie","full_name":"Naewe, Stefanie"}],"user_id":"25078","title":"Solving the Closest Vector Problem with respect to Lp Norms","abstract":[{"lang":"eng","text":"In this paper, we present a deterministic algorithm for the closest vector\r\nproblem for all l_p-norms, 1 < p < \\infty, and all polyhedral norms, especially\r\nfor the l_1-norm and the l_{\\infty}-norm. We achieve our results by introducing\r\na new lattice problem, the lattice membership problem. We describe a\r\ndeterministic algorithm for the lattice membership problem, which is a\r\ngeneralization of Lenstra's algorithm for integer programming. We also describe\r\na polynomial time reduction from the closest vector problem to the lattice\r\nmembership problem. This approach leads to a deterministic algorithm that\r\nsolves the closest vector problem for all l_p-norms, 1 < p < \\infty, in time p\r\nlog_2 (r)^{O (1)} n^{(5/2+o(1))n} and for all polyhedral norms in time (s log_2\r\n(r))^{O (1)} n^{(2+o(1))n}, where s is the number of constraints defining the\r\npolytope and r is an upper bound on the coefficients used to describe the\r\nconvex body."}]},{"_id":"2967","intvolume":" 10693","page":"438-453","year":"2017","type":"conference","citation":{"chicago":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” In Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), 10693:438–53. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-72453-9_35.","ama":"Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption with Public Index. In: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS). Vol 10693. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:10.1007/978-3-319-72453-9_35","apa":"Blömer, J., & Liske, G. (2017). Subtleties in Security Definitions for Predicate Encryption with Public Index. In Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS) (Vol. 10693, pp. 438–453). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-72453-9_35","bibtex":"@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption with Public Index}, volume={10693}, DOI={10.1007/978-3-319-72453-9_35}, booktitle={Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)}, publisher={Springer International Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453}, collection={Lecture Notes in Computer Science} }","mla":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), vol. 10693, Springer International Publishing, 2017, pp. 438–53, doi:10.1007/978-3-319-72453-9_35.","short":"J. Blömer, G. Liske, in: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International Publishing, Cham, 2017, pp. 438–453.","ieee":"J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate Encryption with Public Index,” in Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), 2017, vol. 10693, pp. 438–453."},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/453.pdf"}],"user_id":"477","ddc":["000"],"date_created":"2018-06-04T12:17:48Z","has_accepted_license":"1","status":"public","volume":10693,"file":[{"relation":"main_file","success":1,"date_updated":"2018-11-02T14:52:10Z","content_type":"application/pdf","file_id":"5286","creator":"ups","file_size":463904,"access_level":"closed","date_created":"2018-11-02T14:52:10Z","file_name":"SubtletiesInSecurityDefinition.pdf"}],"publication":"Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)","file_date_updated":"2018-11-02T14:52:10Z","publisher":"Springer International Publishing","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"first_name":"Gennadij","full_name":"Liske, Gennadij","last_name":"Liske"}],"oa":"1","doi":"10.1007/978-3-319-72453-9_35","date_updated":"2022-01-06T06:58:49Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"Subtleties in Security Definitions for Predicate Encryption with Public Index","place":"Cham","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319724522","9783319724539"]},"publication_status":"published","department":[{"_id":"64"}]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"date_created":"2017-10-17T12:42:01Z","has_accepted_license":"1","status":"public","file":[{"file_size":293394,"file_id":"1412","creator":"florida","date_updated":"2018-03-20T07:22:29Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"355-Bloemer2014.pdf","date_created":"2018-03-20T07:22:29Z","access_level":"closed"}],"publication":"Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)","department":[{"_id":"64"}],"file_date_updated":"2018-03-20T07:22:29Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"first_name":"Peter","full_name":"Günther, Peter","last_name":"Günther"},{"first_name":"Gennadij","full_name":"Liske, Gennadij","last_name":"Liske"}],"user_id":"25078","title":"Tampering attacks in pairing-based cryptography","ddc":["040"],"abstract":[{"lang":"eng","text":"In the last decade pairings have become an important, and often indispensable, ingredient in the construction of identity-based and attribute-based cryptosystems, as well as group signatures and credential systems. Consequently, the applicability of timing, power, or fault attacks to implementations of pairings is an important research topic. We will review some of the known results in this area."}],"page":"1--7","citation":{"short":"J. Blömer, P. Günther, G. Liske, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.","ieee":"J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.","ama":"Blömer J, Günther P, Liske G. Tampering attacks in pairing-based cryptography. In: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:1--7. doi:10.1109/FDTC.2014.10","apa":"Blömer, J., Günther, P., & Liske, G. (2014). Tampering attacks in pairing-based cryptography. In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp. 1--7). https://doi.org/10.1109/FDTC.2014.10","chicago":"Blömer, Johannes, Peter Günther, and Gennadij Liske. “Tampering Attacks in Pairing-Based Cryptography.” In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 1--7, 2014. https://doi.org/10.1109/FDTC.2014.10.","bibtex":"@inproceedings{Blömer_Günther_Liske_2014, title={Tampering attacks in pairing-based cryptography}, DOI={10.1109/FDTC.2014.10}, booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}, author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2014}, pages={1--7} }","mla":"Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.” Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7, doi:10.1109/FDTC.2014.10."},"type":"conference","year":"2014","doi":"10.1109/FDTC.2014.10","_id":"355","date_updated":"2022-01-06T06:59:23Z"},{"page":"407-419","type":"journal_article","citation":{"apa":"Blömer, J., Karp, R., & Welzl, E. (1997). The rank of sparse random matrices over finite fields. Random Structures \\& Algorithms, (4), 407–419. https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y","ama":"Blömer J, Karp R, Welzl E. The rank of sparse random matrices over finite fields. Random Structures \\& Algorithms. 1997;(4):407-419. doi:10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y","chicago":"Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random Matrices over Finite Fields.” Random Structures \\& Algorithms, no. 4 (1997): 407–19. https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y.","mla":"Blömer, Johannes, et al. “The Rank of Sparse Random Matrices over Finite Fields.” Random Structures \\& Algorithms, no. 4, 1997, pp. 407–19, doi:10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y.","bibtex":"@article{Blömer_Karp_Welzl_1997, title={The rank of sparse random matrices over finite fields}, DOI={10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y}, number={4}, journal={Random Structures \\& Algorithms}, author={Blömer, Johannes and Karp, Richard and Welzl, Emo}, year={1997}, pages={407–419} }","short":"J. Blömer, R. Karp, E. Welzl, Random Structures \\& Algorithms (1997) 407–419.","ieee":"J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” Random Structures \\& Algorithms, no. 4, pp. 407–419, 1997."},"year":"1997","doi":"10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y","issue":"4","date_updated":"2022-01-06T06:58:52Z","_id":"3033","publication_status":"published","date_created":"2018-06-05T08:34:49Z","status":"public","keyword":["random matrices","rank","finite fields"],"publication":"Random Structures \\& Algorithms","department":[{"_id":"64"}],"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"first_name":"Richard","full_name":"Karp, Richard","last_name":"Karp"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"title":"The rank of sparse random matrices over finite fields","user_id":"25078","extern":"1"},{"place":"Cham","user_id":"25078","title":"Theoretical Analysis of the k-Means Algorithm – A Survey","department":[{"_id":"64"}],"publication":"Algorithm Engineering","publisher":"Springer International Publishing","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"first_name":"Christiane","full_name":"Lammersen, Christiane","last_name":"Lammersen"},{"last_name":"Schmidt","first_name":"Melanie","full_name":"Schmidt, Melanie"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"date_created":"2018-06-04T12:22:40Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783319494869","9783319494876"],"issn":["0302-9743","1611-3349"]},"_id":"2968","date_updated":"2022-01-06T06:58:49Z","doi":"10.1007/978-3-319-49487-6_3","page":"81-116","type":"book_chapter","year":"2016","citation":{"short":"J. Blömer, C. Lammersen, M. Schmidt, C. Sohler, in: Algorithm Engineering, Springer International Publishing, Cham, 2016, pp. 81–116.","ieee":"J. Blömer, C. Lammersen, M. Schmidt, and C. Sohler, “Theoretical Analysis of the k-Means Algorithm – A Survey,” in Algorithm Engineering, Cham: Springer International Publishing, 2016, pp. 81–116.","apa":"Blömer, J., Lammersen, C., Schmidt, M., & Sohler, C. (2016). Theoretical Analysis of the k-Means Algorithm – A Survey. In Algorithm Engineering (pp. 81–116). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-49487-6_3","ama":"Blömer J, Lammersen C, Schmidt M, Sohler C. Theoretical Analysis of the k-Means Algorithm – A Survey. In: Algorithm Engineering. Cham: Springer International Publishing; 2016:81-116. doi:10.1007/978-3-319-49487-6_3","chicago":"Blömer, Johannes, Christiane Lammersen, Melanie Schmidt, and Christian Sohler. “Theoretical Analysis of the K-Means Algorithm – A Survey.” In Algorithm Engineering, 81–116. Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-49487-6_3.","bibtex":"@inbook{Blömer_Lammersen_Schmidt_Sohler_2016, place={Cham}, title={Theoretical Analysis of the k-Means Algorithm – A Survey}, DOI={10.1007/978-3-319-49487-6_3}, booktitle={Algorithm Engineering}, publisher={Springer International Publishing}, author={Blömer, Johannes and Lammersen, Christiane and Schmidt, Melanie and Sohler, Christian}, year={2016}, pages={81–116} }","mla":"Blömer, Johannes, et al. “Theoretical Analysis of the K-Means Algorithm – A Survey.” Algorithm Engineering, Springer International Publishing, 2016, pp. 81–116, doi:10.1007/978-3-319-49487-6_3."}},{"volume":35,"date_created":"2018-06-05T07:42:38Z","status":"public","publication":"Informatik-Spektrum","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"quality_controlled":"1","user_id":"25078","abstract":[{"lang":"eng","text":"Ich beschreibe die deutsche Enigma-Verschlüsselungsmaschine und skizziere, wie sie von den Codebrechern von Bletchely Park um Alan Turing gebrochen wurde. Besonderes Augenmerk lege ich auf die Beiträge Alan Turings und die Bedeutung seiner Leistung für die Entwicklung moderner Kryptografie. "}],"type":"journal_article","year":"2012","citation":{"ieee":"J. Blömer, “Turing und Kryptografie,” Informatik-Spektrum, vol. 35, no. 4, 2012.","short":"J. Blömer, Informatik-Spektrum 35 (2012).","bibtex":"@article{Blömer_2012, title={Turing und Kryptografie}, volume={35}, DOI={10.1007/s00287-012-0622-7}, number={4}, journal={Informatik-Spektrum}, author={Blömer, Johannes}, year={2012} }","mla":"Blömer, Johannes. “Turing Und Kryptografie.” Informatik-Spektrum, vol. 35, no. 4, 2012, doi:10.1007/s00287-012-0622-7.","ama":"Blömer J. Turing und Kryptografie. Informatik-Spektrum. 2012;35(4). doi:10.1007/s00287-012-0622-7","apa":"Blömer, J. (2012). Turing und Kryptografie. Informatik-Spektrum, 35(4). https://doi.org/10.1007/s00287-012-0622-7","chicago":"Blömer, Johannes. “Turing Und Kryptografie.” Informatik-Spektrum 35, no. 4 (2012). https://doi.org/10.1007/s00287-012-0622-7."},"issue":"4","intvolume":" 35","_id":"2984","publication_identifier":{"issn":["1432-122X"]},"publication_status":"published","department":[{"_id":"64"}],"title":"Turing und Kryptografie","language":[{"iso":"eng"}],"doi":"10.1007/s00287-012-0622-7","date_updated":"2022-01-06T06:58:50Z"},{"abstract":[{"text":"In this paper, we introduce updatable anonymous credential systems (UACS) and use them to construct a new privacy-preserving incentive system. In a UACS, a user holding a credential certifying some attributes can interact with the corresponding issuer to update his attributes. During this, the issuer knows which update function is run, but does not learn the user's previous attributes. Hence the update process preserves anonymity of the user. One example for a class of update functions are additive updates of integer attributes, where the issuer increments an unknown integer attribute value v by some known value k. This kind of update is motivated by an application of UACS to incentive systems. Users in an incentive system can anonymously accumulate points, e.g. in a shop at checkout, and spend them later, e.g. for a discount.","lang":"eng"}],"ddc":["006"],"user_id":"25078","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"},{"full_name":"Diemert, Denis Pascal","first_name":"Denis Pascal","id":"44071","last_name":"Diemert"},{"full_name":"Eidens, Fabian","first_name":"Fabian","id":"25078","last_name":"Eidens"}],"publication":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","file_date_updated":"2019-10-18T08:07:49Z","file":[{"access_level":"closed","file_name":"full_eprinted_v2.pdf","date_created":"2019-10-18T08:07:49Z","content_type":"application/pdf","date_updated":"2019-10-18T08:07:49Z","relation":"main_file","file_size":838949,"file_id":"13907","creator":"jbobolz"}],"status":"public","has_accepted_license":"1","date_created":"2019-10-18T08:09:44Z","_id":"13904","conference":{"name":"26th ACM Conference on Computer and Communications Security","start_date":"2019-11-11","location":"London","end_date":"2019-11-15"},"main_file_link":[{"url":"https://eprint.iacr.org/2019/169.pdf","open_access":"1"}],"citation":{"ieee":"J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,” presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi: 10.1145/3319535.3354223.","short":"J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.","bibtex":"@inproceedings{Blömer_Bobolz_Diemert_Eidens_2019, series={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, title={Updatable Anonymous Credentials and Applications to Incentive Systems}, DOI={10.1145/3319535.3354223}, booktitle={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, author={Blömer, Johannes and Bobolz, Jan and Diemert, Denis Pascal and Eidens, Fabian}, year={2019}, collection={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19} }","mla":"Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.” Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019, doi:10.1145/3319535.3354223.","chicago":"Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens. “Updatable Anonymous Credentials and Applications to Incentive Systems.” In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019. https://doi.org/10.1145/3319535.3354223.","ama":"Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:10.1145/3319535.3354223","apa":"Blömer, J., Bobolz, J., Diemert, D. P., & Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. 26th ACM Conference on Computer and Communications Security, London. https://doi.org/10.1145/3319535.3354223"},"type":"conference","year":"2019","title":"Updatable Anonymous Credentials and Applications to Incentive Systems","department":[{"_id":"7"},{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_updated":"2023-01-10T10:25:27Z","doi":"10.1145/3319535.3354223","oa":"1","series_title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1137/17M1132045","date_updated":"2022-01-06T06:57:29Z","project":[{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"publication_identifier":{"eissn":["2470-6566"]},"publication_status":"epub_ahead","department":[{"_id":"7"},{"_id":"64"}],"title":"Voronoi Cells of Lattices with Respect to Arbitrary Norms","year":"2018","citation":{"short":"J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018) 314–338.","ieee":"J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, pp. 314–338, 2018.","ama":"Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry. 2018;2(2):314-338. doi:10.1137/17M1132045","apa":"Blömer, J., & Kohn, K. (2018). Voronoi Cells of Lattices with Respect to Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry., 2(2), 314–338. https://doi.org/10.1137/17M1132045","chicago":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” SIAM Journal on Applied Algebra and Geometry. 2, no. 2 (2018): 314–38. https://doi.org/10.1137/17M1132045.","bibtex":"@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect to Arbitrary Norms}, volume={2}, DOI={10.1137/17M1132045}, number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer, Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }","mla":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, 2018, pp. 314–38, doi:10.1137/17M1132045."},"type":"journal_article","page":"314-338","issue":"2","_id":"2685","intvolume":" 2","has_accepted_license":"1","status":"public","date_created":"2018-05-08T09:18:54Z","volume":2,"file":[{"date_updated":"2018-11-02T15:22:55Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":1131048,"creator":"ups","file_id":"5300","access_level":"closed","file_name":"17m1132045.pdf","date_created":"2018-11-02T15:22:55Z"}],"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"last_name":"Kohn","first_name":"Kathlén","full_name":"Kohn, Kathlén"}],"publication":"SIAM Journal on Applied Algebra and Geometry.","file_date_updated":"2018-11-02T15:22:55Z","user_id":"477","ddc":["000"]},{"publisher":"Universität Paderborn","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"first_name":"Kathlén","full_name":"Kohn, Kathlén","last_name":"Kohn"}],"file_date_updated":"2018-03-21T10:30:18Z","file":[{"creator":"florida","file_id":"1501","file_size":1231102,"relation":"main_file","success":1,"date_updated":"2018-03-21T10:30:18Z","content_type":"application/pdf","file_name":"233-1512.00720v1.pdf","date_created":"2018-03-21T10:30:18Z","access_level":"closed"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:37Z","abstract":[{"text":"Motivated by the deterministic single exponential time algorithm of Micciancio and Voulgaris for solving the shortest and closest vector problem for the Euclidean norm, we study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms.On the positive side, we show that for strictly convex and smooth norms the geometry of Voronoi cells of lattices in any dimension is similar to the Euclidean case, i.e., the Voronoi cells are defined by the so-called Voronoi-relevant vectors and the facets of a Voronoi cell are in one-to-one correspondence with these vectors. On the negative side, we show that combinatorially Voronoi cells for arbitrary strictly convex and smooth norms are much more complicated than in the Euclidean case.In particular, we construct a family of three-dimensional lattices whose number of Voronoi-relevant vectors with respect to the l_3-norm is unbounded.Since the algorithm of Micciancio and Voulgaris and its run time analysis crucially dependonthefactthatfortheEuclidean normthenumber of Voronoi-relevant vectors is single exponential in the lattice dimension, this indicates that the techniques of Micciancio and Voulgaris cannot be extended to achieve deterministic single exponential time algorithms for lattice problems with respect to arbitrary l_p-norms.","lang":"eng"}],"ddc":["040"],"user_id":"25078","main_file_link":[{"url":"http://arxiv.org/pdf/1512.00720v1.pdf","open_access":"1"}],"year":"2015","type":"report","citation":{"ieee":"J. Blömer and K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.","short":"J. Blömer, K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms, Universität Paderborn, 2015.","bibtex":"@book{Blömer_Kohn_2015, title={Voronoi Cells of Lattices with Respect to Arbitrary Norms}, publisher={Universität Paderborn}, author={Blömer, Johannes and Kohn, Kathlén}, year={2015} }","mla":"Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.","chicago":"Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.","ama":"Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn; 2015.","apa":"Blömer, J., & Kohn, K. (2015). Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn."},"_id":"233","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Voronoi Cells of Lattices with Respect to Arbitrary Norms","date_updated":"2022-01-06T06:55:49Z","oa":"1"},{"type":"book_chapter","year":"2006","citation":{"ieee":"J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.","short":"J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.","bibtex":"@inbook{Blömer_Otto_2006, place={Berlin, Heidelberg}, title={Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}, DOI={10.1007/11889700_2}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Otto, Martin}, year={2006}, pages={13–23} }","mla":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:10.1007/11889700_2.","chicago":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” In Lecture Notes in Computer Science, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_2.","ama":"Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:13-23. doi:10.1007/11889700_2","apa":"Blömer, J., & Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In Lecture Notes in Computer Science (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_2"},"page":"13-23","doi":"10.1007/11889700_2","_id":"3005","date_updated":"2022-01-06T06:58:50Z","publication_status":"published","publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"status":"public","date_created":"2018-06-05T08:15:48Z","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Otto","full_name":"Otto, Martin","first_name":"Martin"}],"publisher":"Springer Berlin Heidelberg","department":[{"_id":"64"}],"publication":"Lecture Notes in Computer Science","title":"Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered","user_id":"25078","place":"Berlin, Heidelberg"}]