[{"department":[{"_id":"34"},{"_id":"64"}],"user_id":"41047","_id":"63403","project":[{"name":"PhoQuant: Photonische Quantencomputer -  Quantencomputing Testplattform","_id":"191"}],"language":[{"iso":"eng"}],"keyword":["distributed state","hash-based signature","stateful hash-based signature","universal composability","secure enclave"],"type":"preprint","status":"public","abstract":[{"lang":"eng","text":"Stateful signatures like the NIST standardized signature schemes LMS and XMSS provide an efficient and mature realization of post-quantum secure signature schemes. They are recommended for long-term use cases like e.g. firmware signing. However, stateful signature schemes require to properly manage a so-called state. In stateful signature schemes like LMS and XMSS, signing keys consist of a set of keys of a one-time signature scheme and it has to be guaranteed that each one-time key is used only once. This is done by updating a state in each signature computation, basically recording which one-time keys have already been used. While this is straightforward in centralized systems, in distributed systems like secure enclaves consisting of e.g. multiple hardware security modules (HSMs) with limited communication keeping a distributed state that at any point in time is consistent among all parties involved presents a challenge. This challenge is not addressed by the current standardization processes. \r\nIn this paper we present a security model for the distributed key management of post-quantum secure stateful signatures like XMSS and LMS. We also present a simple, efficient, and easy to implement protocol proven secure in this security model, i.e. the protocol guarantees at any point in time a consistent state among the parties in a distributed system, like a distributed security enclave. The security model is defined in the universal composabilty (UC) framework by Ran Canetti by providing an ideal functionality for the distributed key management for stateful signatures. Hence our protocol remains secure even if arbitrarily composed with other instances of the same or other protocols, a necessity for the security of distributed key management protocols. Our main application are security enclaves consisting of HSMs, but the model and the protocol can easily be adapted to other scenarios of distributed key management of stateful signature schemes."}],"date_created":"2025-12-22T21:23:22Z","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"id":"41047","full_name":"Bröcher, Henrik","orcid":"0009-0008-3938-5485","last_name":"Bröcher","first_name":"Henrik"},{"first_name":"Volker","last_name":"Krummel","full_name":"Krummel, Volker"},{"last_name":"Porzenheim","id":"47434","full_name":"Porzenheim, Laurens Alexander","first_name":"Laurens Alexander"}],"oa":"1","date_updated":"2025-12-23T11:30:38Z","main_file_link":[{"url":"https://eprint.iacr.org/2025/2278.pdf","open_access":"1"}],"title":"Secure Distributed State Management for Stateful Signatures with a Practical and Universally Composable Protocol","publication_status":"submitted","page":"22","citation":{"apa":"Blömer, J., Bröcher, H., Krummel, V., &#38; Porzenheim, L. A. (n.d.). <i>Secure Distributed State Management for Stateful Signatures with a Practical and Universally Composable Protocol</i>.","short":"J. Blömer, H. Bröcher, V. Krummel, L.A. Porzenheim, (n.d.).","mla":"Blömer, Johannes, et al. <i>Secure Distributed State Management for Stateful Signatures with a Practical and Universally Composable Protocol</i>.","bibtex":"@article{Blömer_Bröcher_Krummel_Porzenheim, title={Secure Distributed State Management for Stateful Signatures with a Practical and Universally Composable Protocol}, author={Blömer, Johannes and Bröcher, Henrik and Krummel, Volker and Porzenheim, Laurens Alexander} }","ieee":"J. Blömer, H. Bröcher, V. Krummel, and L. A. Porzenheim, “Secure Distributed State Management for Stateful Signatures with a Practical and Universally Composable Protocol.” .","chicago":"Blömer, Johannes, Henrik Bröcher, Volker Krummel, and Laurens Alexander Porzenheim. “Secure Distributed State Management for Stateful Signatures with a Practical and Universally Composable Protocol,” n.d.","ama":"Blömer J, Bröcher H, Krummel V, Porzenheim LA. Secure Distributed State Management for Stateful Signatures with a Practical and Universally Composable Protocol."},"year":"2025"},{"citation":{"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 <i>ECIS 2023 Research Papers</i>, 2023.","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.","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: <i>ECIS 2023 Research Papers</i>. ; 2023.","apa":"Hemmrich, S., Bobolz, J., Beverungen, D., &#38; Blömer, J. (2023). Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. <i>ECIS 2023 Research Papers</i>. ECIS 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} }","mla":"Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” <i>ECIS 2023 Research Papers</i>, 2023.","short":"S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research Papers, 2023."},"year":"2023","has_accepted_license":"1","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2023_rp/344"}],"conference":{"name":"ECIS 2023"},"title":"Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain","author":[{"first_name":"Simon","last_name":"Hemmrich","full_name":"Hemmrich, Simon","id":"83557"},{"last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207","first_name":"Jan"},{"first_name":"Daniel","full_name":"Beverungen, Daniel","id":"59677","last_name":"Beverungen"},{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_created":"2023-05-16T08:31:27Z","date_updated":"2023-05-23T10:12:32Z","file":[{"date_updated":"2023-05-23T10:11:03Z","creator":"jbobolz","date_created":"2023-05-23T10:11:03Z","file_size":958740,"file_name":"A_Blockchain_Based_Reputation_Ecosystem_for_Business___Payments_as_Ratings.pdf","file_id":"45209","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","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."}],"type":"conference","publication":"ECIS 2023 Research Papers","extern":"1","language":[{"iso":"eng"}],"file_date_updated":"2023-05-23T10:11:03Z","ddc":["330"],"user_id":"27207","department":[{"_id":"7"},{"_id":"64"},{"_id":"19"},{"_id":"526"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"44855"},{"year":"2023","title":"Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems","date_created":"2023-07-07T08:41:44Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"T2-Chapter-SFB-Buch-Final.pdf","file_id":"45902","access_level":"open_access","file_size":5944790,"date_created":"2023-07-07T08:41:35Z","creator":"florida","date_updated":"2023-07-07T11:13:37Z"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","language":[{"iso":"eng"}],"ddc":["004"],"citation":{"apa":"Blömer, J., Bobolz, J., Eidens, F., Jager, T., &#38; 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, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 237–246). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068755\">https://doi.org/10.5281/zenodo.8068755</a>","mla":"Blömer, Johannes, et al. “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–46, doi:<a href=\"https://doi.org/10.5281/zenodo.8068755\">10.5281/zenodo.8068755</a>.","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.","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={<a href=\"https://doi.org/10.5281/zenodo.8068755\">10.5281/zenodo.8068755</a>}, 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 <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, 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. <a href=\"https://doi.org/10.5281/zenodo.8068755\">https://doi.org/10.5281/zenodo.8068755</a>.","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 <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, 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.","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. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:237-246. doi:<a href=\"https://doi.org/10.5281/zenodo.8068755\">10.5281/zenodo.8068755</a>"},"page":"237-246","intvolume":"       412","place":"Paderborn","has_accepted_license":"1","doi":"10.5281/zenodo.8068755","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207","first_name":"Jan"},{"first_name":"Fabian","last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian"},{"first_name":"Tibor","last_name":"Jager","id":"64669","full_name":"Jager, Tibor"},{"last_name":"Kramer","full_name":"Kramer, Paul","id":"64594","first_name":"Paul"}],"volume":412,"oa":"1","date_updated":"2023-07-07T11:13:37Z","status":"public","editor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"type":"book_chapter","file_date_updated":"2023-07-07T11:13:37Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","department":[{"_id":"7"}],"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"}],"_id":"45901"},{"ddc":["004"],"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2023-07-07T11:18:21Z","date_created":"2023-07-07T08:08:37Z","creator":"florida","file_size":320980,"file_id":"45892","file_name":"C1-Chapter-SFB-Buch-Final.pdf","access_level":"open_access"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","title":"Robustness and Security","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T08:08:47Z","year":"2023","file_date_updated":"2023-07-07T11:18:21Z","_id":"45891","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"department":[{"_id":"7"}],"user_id":"477","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","editor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"status":"public","type":"book_chapter","doi":"10.5281/zenodo.8068629","date_updated":"2023-07-07T11:18:21Z","oa":"1","volume":412,"author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Fabian","last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian"},{"first_name":"Tibor","full_name":"Jager, Tibor","id":"64669","last_name":"Jager"},{"last_name":"Niehues","id":"36113","full_name":"Niehues, David","first_name":"David"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"place":"Paderborn","intvolume":"       412","page":"145-164","citation":{"ieee":"J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness and Security,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, 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.","chicago":"Blömer, Johannes, Fabian Eidens, Tibor Jager, David Niehues, and Christian Scheideler. “Robustness and Security.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, 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. <a href=\"https://doi.org/10.5281/zenodo.8068629\">https://doi.org/10.5281/zenodo.8068629</a>.","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. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:145-164. doi:<a href=\"https://doi.org/10.5281/zenodo.8068629\">10.5281/zenodo.8068629</a>","apa":"Blömer, J., Eidens, F., Jager, T., Niehues, D., &#38; Scheideler, C. (2023). Robustness and Security. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 145–164). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068629\">https://doi.org/10.5281/zenodo.8068629</a>","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.","mla":"Blömer, Johannes, et al. “Robustness and Security.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:<a href=\"https://doi.org/10.5281/zenodo.8068629\">10.5281/zenodo.8068629</a>.","bibtex":"@inbook{Blömer_Eidens_Jager_Niehues_Scheideler_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Robustness and Security}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068629\">10.5281/zenodo.8068629</a>}, 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} }"},"has_accepted_license":"1"},{"type":"conference","status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"35014","user_id":"41047","department":[{"_id":"34"},{"_id":"64"}],"language":[{"iso":"eng"}],"year":"2023","citation":{"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.","mla":"Blömer, Johannes, et al. <i>On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC</i>. 2023.","short":"J. Blömer, J. Bobolz, H. Bröcher, in: 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., &#38; Bröcher, H. (2023). <i>On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC</i>. TCC 2023, Taipeh, Taiwan."},"date_updated":"2023-09-07T10:01:00Z","oa":"1","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"first_name":"Jan","last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan"},{"id":"41047","full_name":"Bröcher, Henrik","last_name":"Bröcher","first_name":"Henrik"}],"date_created":"2022-12-28T16:02:11Z","title":"On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC","main_file_link":[{"url":"https://eprint.iacr.org/2022/1762","open_access":"1"}],"conference":{"start_date":"2023-11-29","name":"TCC 2023","location":"Taipeh, Taiwan","end_date":"2023-12-02"}},{"language":[{"iso":"eng"}],"_id":"43458","project":[{"_id":"1","name":"SFB 901: SFB 901","grant_number":"160364472"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"47434","status":"public","type":"conference","title":"A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices","conference":{"name":"Asiacrypt 2023","start_date":"2023-12-04","end_date":"2023-12-08","location":"Guangzhou, China"},"main_file_link":[{"url":"https://eprint.iacr.org/2023/464","open_access":"1"}],"oa":"1","date_updated":"2023-09-07T09:53:26Z","date_created":"2023-04-12T08:18:41Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan","first_name":"Jan"},{"first_name":"Laurens Alexander","last_name":"Porzenheim","id":"47434","full_name":"Porzenheim, Laurens Alexander"}],"year":"2023","citation":{"chicago":"Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” 2023.","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.","ama":"Blömer J, Bobolz J, Porzenheim LA. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. 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} }","short":"J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.","mla":"Blömer, Johannes, et al. <i>A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices</i>. 2023.","apa":"Blömer, J., Bobolz, J., &#38; Porzenheim, L. A. (2023). <i>A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices</i>. Asiacrypt 2023, Guangzhou, China."}},{"title":"A Complexity Theoretical Study of Fuzzy K-Means","doi":"10.1145/3409385","date_updated":"2022-01-06T06:54:41Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"last_name":"Brauer","full_name":"Brauer, Sascha","id":"13291","first_name":"Sascha"},{"first_name":"Kathrin","last_name":"Bujna","full_name":"Bujna, Kathrin"}],"date_created":"2021-01-08T08:51:42Z","volume":16,"year":"2020","citation":{"ama":"Blömer J, Brauer S, Bujna K. A Complexity Theoretical Study of Fuzzy K-Means. <i>ACM Transactions on Algorithms</i>. 2020;16(4):1-25. doi:<a href=\"https://doi.org/10.1145/3409385\">10.1145/3409385</a>","ieee":"J. Blömer, S. Brauer, and K. Bujna, “A Complexity Theoretical Study of Fuzzy K-Means,” <i>ACM Transactions on Algorithms</i>, vol. 16, no. 4, pp. 1–25, 2020.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical Study of Fuzzy K-Means.” <i>ACM Transactions on Algorithms</i> 16, no. 4 (2020): 1–25. <a href=\"https://doi.org/10.1145/3409385\">https://doi.org/10.1145/3409385</a>.","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2020). A Complexity Theoretical Study of Fuzzy K-Means. <i>ACM Transactions on Algorithms</i>, <i>16</i>(4), 1–25. <a href=\"https://doi.org/10.1145/3409385\">https://doi.org/10.1145/3409385</a>","bibtex":"@article{Blömer_Brauer_Bujna_2020, title={A Complexity Theoretical Study of Fuzzy K-Means}, volume={16}, DOI={<a href=\"https://doi.org/10.1145/3409385\">10.1145/3409385</a>}, 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.","mla":"Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.” <i>ACM Transactions on Algorithms</i>, vol. 16, no. 4, 2020, pp. 1–25, doi:<a href=\"https://doi.org/10.1145/3409385\">10.1145/3409385</a>."},"intvolume":"        16","page":"1-25","publication_status":"published","publication_identifier":{"issn":["1549-6325","1549-6333"]},"issue":"4","language":[{"iso":"eng"}],"project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"_id":"20888","user_id":"13291","department":[{"_id":"64"}],"status":"public","type":"journal_article","publication":"ACM Transactions on Algorithms"},{"user_id":"13291","department":[{"_id":"64"}],"project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"_id":"10790","language":[{"iso":"eng"}],"type":"journal_article","publication":"Advances in Data Analysis and Classification","status":"public","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"last_name":"Brauer","id":"13291","full_name":"Brauer, Sascha","first_name":"Sascha"},{"last_name":"Bujna","full_name":"Bujna, Kathrin","first_name":"Kathrin"},{"first_name":"Daniel","full_name":"Kuntze, Daniel","last_name":"Kuntze"}],"date_created":"2019-07-11T08:08:25Z","volume":14,"date_updated":"2022-01-06T06:50:50Z","doi":"10.1007/s11634-019-00366-7","title":"How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models","publication_status":"published","publication_identifier":{"issn":["1862-5347","1862-5355"]},"citation":{"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={<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>}, 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} }","short":"J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and Classification 14 (2020) 147–173.","mla":"Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” <i>Advances in Data Analysis and Classification</i>, vol. 14, 2020, pp. 147–173, doi:<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>.","apa":"Blömer, J., Brauer, S., Bujna, K., &#38; Kuntze, D. (2020). How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. <i>Advances in Data Analysis and Classification</i>, <i>14</i>, 147–173. <a href=\"https://doi.org/10.1007/s11634-019-00366-7\">https://doi.org/10.1007/s11634-019-00366-7</a>","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. <i>Advances in Data Analysis and Classification</i>. 2020;14:147–173. doi:<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>","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.” <i>Advances in Data Analysis and Classification</i> 14 (2020): 147–173. <a href=\"https://doi.org/10.1007/s11634-019-00366-7\">https://doi.org/10.1007/s11634-019-00366-7</a>.","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,” <i>Advances in Data Analysis and Classification</i>, vol. 14, pp. 147–173, 2020."},"intvolume":"        14","page":"147–173","year":"2020"},{"date_created":"2019-10-01T07:50:03Z","title":"Personal Cross-Platform Reputation","year":"2019","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Security and Trust Management, STM 2019","file":[{"title":"Personal cross-platform reputation, author's version","description":"This is an author's version of the paper presented at STM 2019.","access_level":"open_access","file_id":"13555","date_updated":"2019-10-01T07:45:17Z","date_created":"2019-10-01T07:45:17Z","relation":"main_file","file_size":507736,"file_name":"informal.pdf","creator":"nilo","content_type":"application/pdf"}],"abstract":[{"lang":"eng","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."}],"author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Nils","id":"13703","full_name":"Löken, Nils","last_name":"Löken"}],"volume":11738,"date_updated":"2022-01-06T06:51:38Z","oa":"1","doi":"10.1007/978-3-030-31511-5_9","conference":{"name":"Security and Trust Management, STM 2019"},"has_accepted_license":"1","citation":{"chicago":"Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” In <i>Security and Trust Management, STM 2019</i>, Vol. 11738. LNCS, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">https://doi.org/10.1007/978-3-030-31511-5_9</a>.","ieee":"J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in <i>Security and Trust Management, STM 2019</i>, 2019, vol. 11738.","ama":"Blömer J, Löken N. Personal Cross-Platform Reputation. In: <i>Security and Trust Management, STM 2019</i>. Vol 11738. LNCS. ; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">10.1007/978-3-030-31511-5_9</a>","bibtex":"@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Personal Cross-Platform Reputation}, volume={11738}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">10.1007/978-3-030-31511-5_9</a>}, booktitle={Security and Trust Management, STM 2019}, author={Blömer, Johannes and Löken, Nils}, year={2019}, collection={LNCS} }","mla":"Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” <i>Security and Trust Management, STM 2019</i>, vol. 11738, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">10.1007/978-3-030-31511-5_9</a>.","short":"J. Blömer, N. Löken, in: Security and Trust Management, STM 2019, 2019.","apa":"Blömer, J., &#38; Löken, N. (2019). Personal Cross-Platform Reputation. In <i>Security and Trust Management, STM 2019</i> (Vol. 11738). <a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">https://doi.org/10.1007/978-3-030-31511-5_9</a>"},"intvolume":"     11738","series_title":"LNCS","user_id":"13703","department":[{"_id":"568"},{"_id":"64"}],"_id":"13554","file_date_updated":"2019-10-01T07:45:17Z","type":"conference","status":"public"},{"department":[{"_id":"64"},{"_id":"568"}],"series_title":"LNCS","user_id":"13703","_id":"13557","language":[{"iso":"eng"}],"publication":"12th International Symposium on Foundations and Practice of Security, FPS 2019","type":"conference","status":"public","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"}],"volume":12056,"date_created":"2019-10-01T08:05:31Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"first_name":"Nils","full_name":"Löken, Nils","id":"13703","last_name":"Löken"}],"date_updated":"2022-01-06T06:51:38Z","publisher":"Springer","oa":"1","main_file_link":[{"url":"http://eprint.iacr.org/2019/1038","open_access":"1"}],"title":"Dynamic Searchable Encryption with Access Control","intvolume":"     12056","citation":{"ieee":"J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,” in <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>, 2019, vol. 12056.","chicago":"Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” In <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>, Vol. 12056. LNCS. Springer, 2019.","ama":"Blömer J, Löken N. Dynamic Searchable Encryption with Access Control. In: <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>. 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.” <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>, 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.","apa":"Blömer, J., &#38; Löken, N. (2019). Dynamic Searchable Encryption with Access Control. In <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i> (Vol. 12056). Springer."},"year":"2019"},{"year":"2019","date_created":"2019-10-18T08:09:44Z","title":"Updatable Anonymous Credentials and Applications to Incentive Systems","publication":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","abstract":[{"lang":"eng","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."}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":838949,"file_name":"full_eprinted_v2.pdf","access_level":"closed","file_id":"13907","date_updated":"2019-10-18T08:07:49Z","creator":"jbobolz","date_created":"2019-10-18T08:07:49Z"}],"ddc":["006"],"language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"mla":"Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.” <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>, 2019, doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>.","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={<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>}, 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} }","apa":"Blömer, J., Bobolz, J., Diemert, D. P., &#38; Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. 26th ACM Conference on Computer and Communications Security, London. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>","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: <a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>.","chicago":"Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens. “Updatable Anonymous Credentials and Applications to Incentive Systems.” In <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>.","ama":"Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>"},"oa":"1","date_updated":"2023-01-10T10:25:27Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"full_name":"Bobolz, Jan","id":"27207","last_name":"Bobolz","first_name":"Jan"},{"first_name":"Denis Pascal","full_name":"Diemert, Denis Pascal","id":"44071","last_name":"Diemert"},{"first_name":"Fabian","last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/169.pdf"}],"doi":"10.1145/3319535.3354223","conference":{"end_date":"2019-11-15","location":"London","name":"26th ACM Conference on Computer and Communications Security","start_date":"2019-11-11"},"type":"conference","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"13904","user_id":"25078","series_title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","department":[{"_id":"7"},{"_id":"64"}],"file_date_updated":"2019-10-18T08:07:49Z"},{"file_date_updated":"2018-11-02T13:45:40Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"2862","user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"status":"public","type":"conference","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/029"}],"conference":{"end_date":"2018-04-20","location":"San Francisco, CA, USA","name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018","start_date":"2018-04-16"},"doi":"10.1007/978-3-319-76953-0_25","date_updated":"2022-01-06T06:58:12Z","oa":"1","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian"},{"first_name":"Jakob","last_name":"Juhnke","full_name":"Juhnke, Jakob","id":"48090"}],"place":"Cham","citation":{"chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, 470–90. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, San Francisco, CA, USA, 2018, pp. 470–490.","ama":"Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>. Cham: Springer International Publishing; 2018:470-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>","apa":"Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i> (pp. 470–490). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>","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.","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>}, 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.” <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, Springer International Publishing, 2018, pp. 470–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>."},"page":"470-490","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319769523","9783319769530"]},"has_accepted_license":"1","ddc":["004"],"language":[{"iso":"eng"}],"file":[{"date_updated":"2018-11-02T13:45:40Z","date_created":"2018-11-02T13:45:40Z","creator":"ups","file_size":3371773,"access_level":"closed","file_id":"5253","file_name":"PracticalAnonymousAndPubliclyL.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings","title":"Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems","publisher":"Springer International Publishing","date_created":"2018-05-24T11:14:02Z","year":"2018"},{"language":[{"iso":"eng"}],"ddc":["000"],"publication":"SIAM Journal on Applied Algebra and Geometry.","file":[{"date_updated":"2018-11-02T15:22:55Z","date_created":"2018-11-02T15:22:55Z","creator":"ups","file_size":1131048,"file_name":"17m1132045.pdf","access_level":"closed","file_id":"5300","content_type":"application/pdf","success":1,"relation":"main_file"}],"date_created":"2018-05-08T09:18:54Z","title":"Voronoi Cells of Lattices with Respect to Arbitrary Norms","issue":"2","year":"2018","user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"2685","file_date_updated":"2018-11-02T15:22:55Z","type":"journal_article","status":"public","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Kathlén","full_name":"Kohn, Kathlén","last_name":"Kohn"}],"volume":2,"date_updated":"2022-01-06T06:57:29Z","doi":"10.1137/17M1132045","publication_status":"epub_ahead","publication_identifier":{"eissn":["2470-6566"]},"has_accepted_license":"1","citation":{"bibtex":"@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect to Arbitrary Norms}, volume={2}, DOI={<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>}, number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer, Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }","short":"J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018) 314–338.","mla":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, 2018, pp. 314–38, doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>.","apa":"Blömer, J., &#38; Kohn, K. (2018). Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry.</i>, <i>2</i>(2), 314–338. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>","chicago":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i> 2, no. 2 (2018): 314–38. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>.","ieee":"J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, pp. 314–338, 2018.","ama":"Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry</i>. 2018;2(2):314-338. doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>"},"page":"314-338","intvolume":"         2"},{"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18","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."}],"file":[{"date_updated":"2018-11-08T10:17:39Z","creator":"feidens","date_created":"2018-11-08T10:17:39Z","file_size":920843,"file_name":"react_acs.pdf","file_id":"5428","access_level":"closed","content_type":"application/pdf","relation":"main_file"}],"publisher":"ACM","date_created":"2018-06-14T11:19:29Z","title":"Fully-Featured Anonymous Credentials with Reputation System","quality_controlled":"1","year":"2018","_id":"3265","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"44","name":"KogniHome - die mitdenkende Wohnung"}],"department":[{"_id":"64"}],"user_id":"25078","file_date_updated":"2018-11-08T10:17:39Z","type":"conference","status":"public","date_updated":"2022-01-06T06:59:07Z","oa":"1","author":[{"first_name":"Kai","full_name":"Bemmann, Kai","last_name":"Bemmann"},{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz","first_name":"Jan"},{"id":"41047","full_name":"Bröcher, Henrik","last_name":"Bröcher","first_name":"Henrik"},{"id":"44071","full_name":"Diemert, Denis Pascal","last_name":"Diemert","first_name":"Denis Pascal"},{"first_name":"Fabian","last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian"},{"first_name":"Lukas","full_name":"Eilers, Lukas","last_name":"Eilers"},{"first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik","id":"44413","last_name":"Haltermann"},{"id":"48090","full_name":"Juhnke, Jakob","last_name":"Juhnke","first_name":"Jakob"},{"full_name":"Otour, Burhan","last_name":"Otour","first_name":"Burhan"},{"first_name":"Laurens Alexander","last_name":"Porzenheim","id":"47434","full_name":"Porzenheim, Laurens Alexander"},{"full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon"},{"first_name":"Erik","full_name":"Schilling, Erik","last_name":"Schilling"},{"first_name":"Michael","full_name":"Schlichtig, Michael","id":"32312","last_name":"Schlichtig"},{"first_name":"Marcel","full_name":"Stienemeier, Marcel","last_name":"Stienemeier"}],"conference":{"location":"Hamburg, Germany","end_date":"2018-08-30","start_date":"2018-08-27","name":"ARES 2018 - SECPID"},"doi":"10.1145/3230833.3234517","main_file_link":[{"url":"https://eprint.iacr.org/2018/835","open_access":"1"}],"publication_identifier":{"isbn":["978-1-4503-6448-5"]},"has_accepted_license":"1","publication_status":"accepted","related_material":{"link":[{"url":"https://github.com/upbcuk","relation":"software"}]},"place":"New York, NY, USA","citation":{"ama":"Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>","ieee":"K. Bemmann <i>et al.</i>, “Fully-Featured Anonymous Credentials with Reputation System,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, Hamburg, Germany.","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 <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>.","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 <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>","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={<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>}, 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.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, ACM, doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>.","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."}},{"file_date_updated":"2018-11-02T14:39:46Z","user_id":"13703","department":[{"_id":"64"},{"_id":"568"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"2965","status":"public","type":"conference","conference":{"name":"ARES 2018","location":"Hamburg, Germany"},"doi":"10.1145/3230833.3230853","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Nils","id":"13703","full_name":"Löken, Nils","last_name":"Löken"}],"date_updated":"2022-01-06T06:58:49Z","citation":{"chicago":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, 25:1--25:10. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>.","ieee":"J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, Hamburg, Germany, pp. 25:1--25:10.","ama":"Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>. New York, NY, USA: ACM; :25:1--25:10. doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>","apa":"Blömer, J., &#38; Löken, N. (n.d.). Cloud Architectures for Searchable Encryption. In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i> (pp. 25:1--25:10). New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>","bibtex":"@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures for Searchable Encryption}, DOI={<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>}, 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} }","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.","mla":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, ACM, pp. 25:1--25:10, doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>."},"page":"25:1--25:10","place":"New York, NY, USA","publication_status":"accepted","has_accepted_license":"1","publication_identifier":{"isbn":["978-1-4503-6448-5"]},"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5278","access_level":"closed","file_name":"a25-Blomer.pdf","file_size":769807,"creator":"ups","date_created":"2018-11-02T14:39:46Z","date_updated":"2018-11-02T14:39:46Z"}],"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018","title":"Cloud Architectures for Searchable Encryption","date_created":"2018-06-04T11:33:15Z","publisher":"ACM","year":"2018","quality_controlled":"1"},{"user_id":"27207","department":[{"_id":"7"},{"_id":"64"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"5820","file_date_updated":"2018-12-31T09:55:30Z","language":[{"iso":"eng"}],"ddc":["000"],"type":"working_paper","file":[{"file_size":470968,"access_level":"closed","file_name":"draft-2018.pdf","file_id":"6435","date_updated":"2018-12-31T09:55:30Z","date_created":"2018-12-31T09:55:30Z","creator":"jbobolz","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","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."}],"date_created":"2018-11-25T08:08:40Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan","first_name":"Jan"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Alexander","full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer"}],"date_updated":"2022-01-06T07:02:43Z","title":"Provably Anonymous Communication Based on Trusted Execution Environments","publication_status":"draft","has_accepted_license":"1","citation":{"ama":"Blömer J, Bobolz J, Scheideler C, Setzer A. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","ieee":"J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>. .","chicago":"Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>, n.d.","apa":"Blömer, J., Bobolz, J., Scheideler, C., &#38; Setzer, A. (n.d.). <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","short":"J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","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} }","mla":"Blömer, Johannes, et al. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>."},"year":"2018"},{"publication":"29th International Symposium on Algorithms and Computation  (ISAAC 2018)","type":"conference","status":"public","_id":"4344","project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"department":[{"_id":"64"}],"user_id":"13291","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-95977-094-1"]},"publication_status":"published","year":"2018","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.","bibtex":"@inproceedings{Blömer_Brauer_Bujna_2018, title={Coresets for Fuzzy K-Means with Applications}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">10.4230/LIPIcs.ISAAC.2018.46</a>}, 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.” <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">10.4230/LIPIcs.ISAAC.2018.46</a>.","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2018). Coresets for Fuzzy K-Means with Applications. In <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i> (pp. 46:1--46:12). Jiaoxi, Yilan County, Taiwan: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>","ieee":"J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,” in <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.” In <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>.","ama":"Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications. In: <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">10.4230/LIPIcs.ISAAC.2018.46</a>"},"date_updated":"2022-01-06T07:00:57Z","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","date_created":"2018-09-03T08:04:19Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"last_name":"Brauer","id":"13291","full_name":"Brauer, Sascha","first_name":"Sascha"},{"first_name":"Kathrin","last_name":"Bujna","full_name":"Bujna, Kathrin"}],"title":"Coresets for Fuzzy K-Means with Applications","conference":{"end_date":"2018-12-19","location":"Jiaoxi, Yilan County, Taiwan","name":"29th International Symposium on Algorithms and Computation (ISAAC)","start_date":"2018-12-17"},"doi":"10.4230/LIPIcs.ISAAC.2018.46"},{"publication":"The International Conference on Cryptology And Network Security (CANS)","file":[{"file_size":574228,"file_name":"uc_abs.pdf","file_id":"5427","access_level":"closed","date_updated":"2018-11-08T10:15:00Z","date_created":"2018-11-08T10:15:00Z","creator":"feidens","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2018","date_created":"2018-08-10T09:44:09Z","publisher":"Springer","title":"Enhanced Security of Attribute-Based Signatures","type":"conference","status":"public","series_title":"Lecture Notes in Computer Science","user_id":"25078","department":[{"_id":"64"}],"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"1","name":"SFB 901"}],"_id":"3873","file_date_updated":"2018-11-08T10:15:00Z","publication_status":"published","publication_identifier":{"isbn":["978-3-030-00434-7"]},"has_accepted_license":"1","citation":{"apa":"Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Enhanced Security of Attribute-Based Signatures. <i>The International Conference on Cryptology And Network Security (CANS)</i>, <i>11124</i>, 235–255. <a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">https://doi.org/10.1007/978-3-030-00434-7_12</a>","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, series={Lecture Notes in Computer Science}, title={Enhanced Security of Attribute-Based Signatures}, volume={11124}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">10.1007/978-3-030-00434-7_12</a>}, 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.” <i>The International Conference on Cryptology And Network Security (CANS)</i>, vol. 11124, Springer, 2018, pp. 235–55, doi:<a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">10.1007/978-3-030-00434-7_12</a>.","short":"J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology And Network Security (CANS), Springer, 2018, pp. 235–255.","chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Enhanced Security of Attribute-Based Signatures.” In <i>The International Conference on Cryptology And Network Security (CANS)</i>, 11124:235–55. Lecture Notes in Computer Science. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">https://doi.org/10.1007/978-3-030-00434-7_12</a>.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based Signatures,” in <i>The International Conference on Cryptology And Network Security (CANS)</i>, Naples, Italy, 2018, vol. 11124, pp. 235–255, doi: <a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">10.1007/978-3-030-00434-7_12</a>.","ama":"Blömer J, Eidens F, Juhnke J. Enhanced Security of Attribute-Based Signatures. In: <i>The International Conference on Cryptology And Network Security (CANS)</i>. Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:<a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">10.1007/978-3-030-00434-7_12</a>"},"intvolume":"     11124","page":"235-255","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Fabian","id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens"},{"id":"48090","full_name":"Juhnke, Jakob","last_name":"Juhnke","first_name":"Jakob"}],"volume":11124,"oa":"1","date_updated":"2023-01-10T10:26:13Z","main_file_link":[{"url":"https://eprint.iacr.org/2018/874","open_access":"1"}],"conference":{"name":"The International Conference on Cryptology And Network Security (CANS)","location":"Naples, Italy"},"doi":"10.1007/978-3-030-00434-7_12"},{"publication":"ACNS 2018 Applied Cryptography & Network security","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"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T13:41:16Z","date_updated":"2018-11-02T13:41:16Z","access_level":"closed","file_id":"5252","file_name":"2018-340.pdf","file_size":542171}],"ddc":["004"],"language":[{"iso":"eng"}],"year":"2018","date_created":"2018-04-17T12:28:25Z","title":"Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures","type":"conference","status":"public","_id":"2379","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"7"},{"_id":"64"}],"series_title":"LNCS","user_id":"25078","file_date_updated":"2018-11-02T13:41:16Z","has_accepted_license":"1","publication_status":"accepted","citation":{"ama":"Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. In: <i>ACNS 2018 Applied Cryptography &#38; Network Security</i>. LNCS. doi:<a href=\"https://doi.org/10.1007/978-3-319-93387-0_12\">10.1007/978-3-319-93387-0_12</a>","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: <a href=\"https://doi.org/10.1007/978-3-319-93387-0_12\">10.1007/978-3-319-93387-0_12</a>.","chicago":"Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.” In <i>ACNS 2018 Applied Cryptography &#38; Network Security</i>. LNCS, n.d. <a href=\"https://doi.org/10.1007/978-3-319-93387-0_12\">https://doi.org/10.1007/978-3-319-93387-0_12</a>.","apa":"Blömer, J., &#38; Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. <i>ACNS 2018 Applied Cryptography &#38; Network Security</i>. The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium. <a href=\"https://doi.org/10.1007/978-3-319-93387-0_12\">https://doi.org/10.1007/978-3-319-93387-0_12</a>","mla":"Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.” <i>ACNS 2018 Applied Cryptography &#38; Network Security</i>, doi:<a href=\"https://doi.org/10.1007/978-3-319-93387-0_12\">10.1007/978-3-319-93387-0_12</a>.","short":"J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography &#38; Network Security, n.d.","bibtex":"@inproceedings{Blömer_Bobolz, series={LNCS}, title={Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-93387-0_12\">10.1007/978-3-319-93387-0_12</a>}, booktitle={ACNS 2018 Applied Cryptography &#38; Network security}, author={Blömer, Johannes and Bobolz, Jan}, collection={LNCS} }"},"date_updated":"2023-01-10T10:28:43Z","oa":"1","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"first_name":"Jan","id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz"}],"doi":"10.1007/978-3-319-93387-0_12","conference":{"location":"Leuven, Belgium","name":"The 16th International Conference on Applied Cryptography and Network Security"},"main_file_link":[{"url":"https://eprint.iacr.org/2018/340","open_access":"1"}]},{"type":"conference","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"2967","user_id":"477","series_title":"Lecture Notes in Computer Science","department":[{"_id":"64"}],"file_date_updated":"2018-11-02T14:52:10Z","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319724522","9783319724539"]},"place":"Cham","citation":{"mla":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, vol. 10693, Springer International Publishing, 2017, pp. 438–53, doi:<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>.","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={<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>}, 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} }","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.","apa":"Blömer, J., &#38; Liske, G. (2017). Subtleties in Security Definitions for Predicate Encryption with Public Index. In <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (Vol. 10693, pp. 438–453). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">https://doi.org/10.1007/978-3-319-72453-9_35</a>","ieee":"J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate Encryption with Public Index,” in <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2017, vol. 10693, pp. 438–453.","chicago":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” In <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 10693:438–53. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">https://doi.org/10.1007/978-3-319-72453-9_35</a>.","ama":"Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption with Public Index. In: <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. Vol 10693. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>"},"intvolume":"     10693","page":"438-453","oa":"1","date_updated":"2022-01-06T06:58:49Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Gennadij","full_name":"Liske, Gennadij","last_name":"Liske"}],"volume":10693,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/453.pdf"}],"doi":"10.1007/978-3-319-72453-9_35","publication":"Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":463904,"access_level":"closed","file_id":"5286","file_name":"SubtletiesInSecurityDefinition.pdf","date_updated":"2018-11-02T14:52:10Z","creator":"ups","date_created":"2018-11-02T14:52:10Z"}],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2017","publisher":"Springer International Publishing","date_created":"2018-06-04T12:17:48Z","title":"Subtleties in Security Definitions for Predicate Encryption with Public Index"}]