[{"_id":"40440","date_updated":"2023-01-26T16:08:11Z","citation":{"ama":"Pilot M. Updatable Privacy-Preserving Reputation System Based on Blockchain.; 2023.","apa":"Pilot, M. (2023). Updatable Privacy-Preserving Reputation System based on Blockchain.","chicago":"Pilot, Matthias. Updatable Privacy-Preserving Reputation System Based on Blockchain, 2023.","mla":"Pilot, Matthias. Updatable Privacy-Preserving Reputation System Based on Blockchain. 2023.","bibtex":"@book{Pilot_2023, title={Updatable Privacy-Preserving Reputation System based on Blockchain}, author={Pilot, Matthias}, year={2023} }","short":"M. Pilot, Updatable Privacy-Preserving Reputation System Based on Blockchain, 2023.","ieee":"M. Pilot, Updatable Privacy-Preserving Reputation System based on Blockchain. 2023."},"type":"mastersthesis","year":"2023","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"language":[{"iso":"eng"}],"title":"Updatable Privacy-Preserving Reputation System based on Blockchain","user_id":"27207","extern":"1","status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"date_created":"2023-01-26T16:07:19Z","author":[{"first_name":"Matthias","full_name":"Pilot, Matthias","last_name":"Pilot"}],"department":[{"_id":"7"},{"_id":"64"}]},{"ddc":["000"],"title":" A Formal Comparison of Advanced Digital Signature Primitives","user_id":"41047","file_date_updated":"2023-04-25T10:49:36Z","department":[{"_id":"64"}],"author":[{"last_name":"Schürmann","full_name":"Schürmann, Patrick","first_name":"Patrick"}],"file":[{"title":" A Formal Comparison of Advanced Digital Signature Primitives","file_id":"44177","creator":"bhenrik","file_size":1367369,"relation":"main_file","date_updated":"2023-04-25T10:49:36Z","content_type":"application/pdf","file_name":"masters_thesis_schuermann.pdf","date_created":"2023-04-25T10:49:36Z","access_level":"open_access"}],"date_created":"2023-04-03T14:07:32Z","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"}],"status":"public","has_accepted_license":"1","_id":"43374","date_updated":"2023-04-25T22:43:21Z","oa":"1","citation":{"ieee":"P. Schürmann, A Formal Comparison of Advanced Digital Signature Primitives. 2023.","short":"P. Schürmann, A Formal Comparison of Advanced Digital Signature Primitives, 2023.","mla":"Schürmann, Patrick. A Formal Comparison of Advanced Digital Signature Primitives. 2023.","bibtex":"@book{Schürmann_2023, title={ A Formal Comparison of Advanced Digital Signature Primitives}, author={Schürmann, Patrick}, year={2023} }","chicago":"Schürmann, Patrick. A Formal Comparison of Advanced Digital Signature Primitives, 2023.","apa":"Schürmann, P. (2023). A Formal Comparison of Advanced Digital Signature Primitives.","ama":"Schürmann P. A Formal Comparison of Advanced Digital Signature Primitives.; 2023."},"type":"mastersthesis","year":"2023","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}]},{"title":"Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain","department":[{"_id":"7"},{"_id":"64"},{"_id":"19"},{"_id":"526"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"date_updated":"2023-05-23T10:12:32Z","language":[{"iso":"eng"}],"extern":"1","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."}],"ddc":["330"],"user_id":"27207","publication":"ECIS 2023 Research Papers","file_date_updated":"2023-05-23T10:11:03Z","author":[{"id":"83557","last_name":"Hemmrich","full_name":"Hemmrich, Simon","first_name":"Simon"},{"first_name":"Jan","full_name":"Bobolz, Jan","last_name":"Bobolz","id":"27207"},{"full_name":"Beverungen, Daniel","first_name":"Daniel","id":"59677","last_name":"Beverungen"},{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"file":[{"creator":"jbobolz","file_id":"45209","file_size":958740,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2023-05-23T10:11:03Z","file_name":"A_Blockchain_Based_Reputation_Ecosystem_for_Business___Payments_as_Ratings.pdf","date_created":"2023-05-23T10:11:03Z","access_level":"closed"}],"date_created":"2023-05-16T08:31:27Z","has_accepted_license":"1","status":"public","conference":{"name":"ECIS 2023"},"_id":"44855","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2023_rp/344"}],"year":"2023","citation":{"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.” ECIS 2023 Research Papers, 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.","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.","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.","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."},"type":"conference"},{"file_date_updated":"2023-05-30T11:43:18Z","department":[{"_id":"64"}],"author":[{"last_name":"Koch","first_name":"Angelina","full_name":"Koch, Angelina"}],"file":[{"date_created":"2023-05-26T07:07:39Z","file_name":"thesis_koch.pdf","access_level":"open_access","file_size":2275949,"creator":"feidens","file_id":"45303","content_type":"application/pdf","date_updated":"2023-05-30T11:43:18Z","relation":"main_file"}],"date_created":"2023-04-03T14:09:14Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"has_accepted_license":"1","status":"public","title":"Privacy-Preserving Collection and Evaluation of Log Files","ddc":["000"],"user_id":"25078","citation":{"short":"A. Koch, Privacy-Preserving Collection and Evaluation of Log Files, 2023.","ieee":"A. Koch, Privacy-Preserving Collection and Evaluation of Log Files. 2023.","apa":"Koch, A. (2023). Privacy-Preserving Collection and Evaluation of Log Files.","ama":"Koch A. Privacy-Preserving Collection and Evaluation of Log Files.; 2023.","chicago":"Koch, Angelina. Privacy-Preserving Collection and Evaluation of Log Files, 2023.","mla":"Koch, Angelina. Privacy-Preserving Collection and Evaluation of Log Files. 2023.","bibtex":"@book{Koch_2023, title={Privacy-Preserving Collection and Evaluation of Log Files}, author={Koch, Angelina}, year={2023} }"},"type":"bachelorsthesis","year":"2023","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"_id":"43375","date_updated":"2023-05-30T11:43:18Z","oa":"1"},{"oa":"1","date_updated":"2023-09-07T10:01:00Z","_id":"35014","conference":{"start_date":"2023-11-29","name":"TCC 2023","location":"Taipeh, Taiwan","end_date":"2023-12-02"},"language":[{"iso":"eng"}],"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} }","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.","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.","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.","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."},"type":"conference","year":"2023","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/1762"}],"user_id":"41047","title":"On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC","status":"public","date_created":"2022-12-28T16:02:11Z","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"id":"41047","last_name":"Bröcher","full_name":"Bröcher, Henrik","first_name":"Henrik"}],"department":[{"_id":"34"},{"_id":"64"}]},{"language":[{"iso":"eng"}],"type":"conference","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.","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.","mla":"Blömer, Johannes, et al. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. 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.","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."},"main_file_link":[{"url":"https://eprint.iacr.org/2023/464","open_access":"1"}],"oa":"1","conference":{"name":"Asiacrypt 2023","start_date":"2023-12-04","location":"Guangzhou, China","end_date":"2023-12-08"},"date_updated":"2023-09-07T09:53:26Z","_id":"43458","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"date_created":"2023-04-12T08:18:41Z","status":"public","department":[{"_id":"64"}],"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"},{"full_name":"Porzenheim, Laurens Alexander","first_name":"Laurens Alexander","id":"47434","last_name":"Porzenheim"}],"user_id":"47434","title":"A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices"},{"date_updated":"2023-10-05T13:56:00Z","_id":"47658","language":[{"iso":"eng"}],"citation":{"ieee":"A. Anonymous, Private Set Intersection using Third Generation FHE. 2023.","short":"A. Anonymous, Private Set Intersection Using Third Generation FHE, 2023.","mla":"Anonymous, A. Private Set Intersection Using Third Generation FHE. 2023.","bibtex":"@book{Anonymous_2023, title={Private Set Intersection using Third Generation FHE}, author={Anonymous, A.}, year={2023} }","chicago":"Anonymous, A. Private Set Intersection Using Third Generation FHE, 2023.","ama":"Anonymous A. Private Set Intersection Using Third Generation FHE.; 2023.","apa":"Anonymous, A. (2023). Private Set Intersection using Third Generation FHE."},"type":"mastersthesis","year":"2023","user_id":"41047","title":"Private Set Intersection using Third Generation FHE","date_created":"2023-10-05T13:55:55Z","status":"public","department":[{"_id":"34"},{"_id":"64"}],"author":[{"first_name":"A.","full_name":"Anonymous, A.","last_name":"Anonymous"}]},{"title":"Rational Models in Cryptography Applied to Matching","user_id":"41047","author":[{"first_name":"A.","full_name":"Anonymous, A.","last_name":"Anonymous"}],"department":[{"_id":"34"},{"_id":"64"}],"status":"public","date_created":"2023-10-05T13:58:18Z","date_updated":"2023-10-05T13:58:35Z","_id":"47659","year":"2023","type":"mastersthesis","citation":{"short":"A. Anonymous, Rational Models in Cryptography Applied to Matching, 2023.","ieee":"A. Anonymous, Rational Models in Cryptography Applied to Matching. 2023.","apa":"Anonymous, A. (2023). Rational Models in Cryptography Applied to Matching.","ama":"Anonymous A. Rational Models in Cryptography Applied to Matching.; 2023.","chicago":"Anonymous, A. Rational Models in Cryptography Applied to Matching, 2023.","mla":"Anonymous, A. Rational Models in Cryptography Applied to Matching. 2023.","bibtex":"@book{Anonymous_2023, title={Rational Models in Cryptography Applied to Matching}, author={Anonymous, A.}, year={2023} }"},"language":[{"iso":"eng"}]},{"_id":"32399","date_updated":"2022-07-26T14:31:54Z","type":"bachelorsthesis","citation":{"apa":"Vahle, E. (2022). Modelling and Proving Security for a Secure MPC Protocol for Stable Matching.","ama":"Vahle E. Modelling and Proving Security for a Secure MPC Protocol for Stable Matching.; 2022.","chicago":"Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol for Stable Matching, 2022.","bibtex":"@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }","mla":"Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol for Stable Matching. 2022.","short":"E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable Matching, 2022.","ieee":"E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable Matching. 2022."},"year":"2022","language":[{"iso":"eng"}],"supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"title":"Modelling and Proving Security for a Secure MPC Protocol for Stable Matching","user_id":"25078","department":[{"_id":"64"}],"author":[{"first_name":"Ella","full_name":"Vahle, Ella","last_name":"Vahle"}],"date_created":"2022-07-20T09:38:39Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"status":"public"},{"author":[{"full_name":"Siek, Hanna","first_name":"Hanna","last_name":"Siek"}],"department":[{"_id":"64"},{"_id":"7"}],"status":"public","date_created":"2022-07-20T09:36:39Z","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"},{"name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"}],"user_id":"477","title":"Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"language":[{"iso":"eng"}],"citation":{"apa":"Siek, H. (2022). Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes.","ama":"Siek H. Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes.; 2022.","chicago":"Siek, Hanna. Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","bibtex":"@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek, Hanna}, year={2022} }","mla":"Siek, Hanna. Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes. 2022.","short":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","ieee":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes. 2022."},"type":"bachelorsthesis","year":"2022","_id":"32398","date_updated":"2022-11-18T09:38:04Z"},{"user_id":"477","title":"On Transforming Lattice-Based Cryptography to the Ring Setting","extern":"1","status":"public","date_created":"2022-05-28T08:07:40Z","project":[{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"name":"SFB 901: SFB 901","_id":"1"}],"author":[{"full_name":"Kramer, Paul","first_name":"Paul","id":"64594","last_name":"Kramer"}],"department":[{"_id":"7"},{"_id":"64"}],"date_updated":"2022-11-18T09:40:28Z","_id":"31485","language":[{"iso":"eng"}],"type":"mastersthesis","year":"2022","citation":{"short":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","ieee":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting. 2022.","apa":"Kramer, P. (2022). On Transforming Lattice-Based Cryptography to the Ring Setting.","ama":"Kramer P. On Transforming Lattice-Based Cryptography to the Ring Setting.; 2022.","chicago":"Kramer, Paul. On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","bibtex":"@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to the Ring Setting}, author={Kramer, Paul}, year={2022} }","mla":"Kramer, Paul. On Transforming Lattice-Based Cryptography to the Ring Setting. 2022."}},{"status":"public","date_created":"2022-12-24T00:14:34Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"author":[{"last_name":"Anonymous","full_name":"Anonymous, A","first_name":"A"}],"department":[{"_id":"34"},{"_id":"64"}],"user_id":"41047","title":"Evaluating database systems relying on secure multiparty computation","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"year":"2022","type":"bachelorsthesis","citation":{"ama":"Anonymous A. Evaluating Database Systems Relying on Secure Multiparty Computation.; 2022.","apa":"Anonymous, A. (2022). Evaluating database systems relying on secure multiparty computation.","chicago":"Anonymous, A. Evaluating Database Systems Relying on Secure Multiparty Computation, 2022.","mla":"Anonymous, A. Evaluating Database Systems Relying on Secure Multiparty Computation. 2022.","bibtex":"@book{Anonymous_2022, title={Evaluating database systems relying on secure multiparty computation}, author={Anonymous, A}, year={2022} }","short":"A. Anonymous, Evaluating Database Systems Relying on Secure Multiparty Computation, 2022.","ieee":"A. Anonymous, Evaluating database systems relying on secure multiparty computation. 2022."},"date_updated":"2023-01-10T10:31:35Z","_id":"34962"},{"user_id":"41047","title":"Cost of Privacy-preserving SMPC Protocols for NN-Based Inference","author":[{"first_name":"A","full_name":"Anonymous, A","last_name":"Anonymous"}],"department":[{"_id":"34"},{"_id":"64"}],"status":"public","date_created":"2022-12-24T00:16:39Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"date_updated":"2023-01-10T10:31:49Z","_id":"34963","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"mla":"Anonymous, A. Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference. 2022.","bibtex":"@book{Anonymous_2022, title={Cost of Privacy-preserving SMPC Protocols for NN-Based Inference}, author={Anonymous, A}, year={2022} }","chicago":"Anonymous, A. Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference, 2022.","ama":"Anonymous A. Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference.; 2022.","apa":"Anonymous, A. (2022). Cost of Privacy-preserving SMPC Protocols for NN-Based Inference.","ieee":"A. Anonymous, Cost of Privacy-preserving SMPC Protocols for NN-Based Inference. 2022.","short":"A. Anonymous, Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference, 2022."},"type":"mastersthesis","year":"2022"},{"date_created":"2023-01-10T10:39:27Z","status":"public","department":[{"_id":"64"}],"author":[{"last_name":"Lohse","first_name":"Jan","full_name":"Lohse, Jan"}],"title":"Lattice Revocation Mechanisms","user_id":"47434","citation":{"mla":"Lohse, Jan. Lattice Revocation Mechanisms. 2022.","bibtex":"@book{Lohse_2022, title={Lattice Revocation Mechanisms}, author={Lohse, Jan}, year={2022} }","apa":"Lohse, J. (2022). Lattice Revocation Mechanisms.","ama":"Lohse J. Lattice Revocation Mechanisms.; 2022.","chicago":"Lohse, Jan. Lattice Revocation Mechanisms, 2022.","ieee":"J. Lohse, Lattice Revocation Mechanisms. 2022.","short":"J. Lohse, Lattice Revocation Mechanisms, 2022."},"year":"2022","type":"bachelorsthesis","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"language":[{"iso":"eng"}],"date_updated":"2023-01-10T11:54:43Z","_id":"35772"},{"language":[{"iso":"eng"}],"supervisor":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"}],"year":"2022","type":"dissertation","citation":{"chicago":"Eidens, Fabian. Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials, 2022. https://doi.org/10.17619/UNIPB/1-1653.","apa":"Eidens, F. (2022). Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials. https://doi.org/10.17619/UNIPB/1-1653","ama":"Eidens F. Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials.; 2022. doi:10.17619/UNIPB/1-1653","mla":"Eidens, Fabian. Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials. 2022, doi:10.17619/UNIPB/1-1653.","bibtex":"@book{Eidens_2022, title={Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials}, DOI={10.17619/UNIPB/1-1653}, author={Eidens, Fabian}, year={2022} }","short":"F. Eidens, Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials, 2022.","ieee":"F. Eidens, Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials. 2022."},"_id":"35188","date_updated":"2023-02-08T21:07:41Z","doi":"10.17619/UNIPB/1-1653","department":[{"_id":"64"}],"author":[{"id":"25078","last_name":"Eidens","full_name":"Eidens, Fabian","first_name":"Fabian"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"}],"date_created":"2023-01-04T09:01:48Z","status":"public","user_id":"25078","title":"Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials"},{"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"language":[{"iso":"eng"}],"type":"mastersthesis","year":"2022","citation":{"ieee":"A. Anonymous, Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development. 2022.","short":"A. Anonymous, Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development, 2022.","bibtex":"@book{Anonymous_2022, title={ Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development}, author={Anonymous, Anonymous}, year={2022} }","mla":"Anonymous, Anonymous. Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development. 2022.","apa":"Anonymous, A. (2022). Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development.","ama":"Anonymous A. Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development.; 2022.","chicago":"Anonymous, Anonymous. Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development, 2022."},"date_updated":"2023-05-24T09:58:33Z","_id":"45255","department":[{"_id":"64"}],"author":[{"last_name":"Anonymous","first_name":"Anonymous","full_name":"Anonymous, Anonymous"}],"date_created":"2023-05-24T09:58:30Z","status":"public","user_id":"47434","title":" Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development"},{"title":"A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries","user_id":"47434","author":[{"last_name":"Anonymous","full_name":"Anonymous, Anonymous","first_name":"Anonymous"}],"department":[{"_id":"64"}],"status":"public","date_created":"2023-05-24T09:59:34Z","_id":"45256","date_updated":"2023-05-24T09:59:37Z","citation":{"apa":"Anonymous, A. (2022). A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries.","ama":"Anonymous A. A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries.; 2022.","chicago":"Anonymous, Anonymous. A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries, 2022.","mla":"Anonymous, Anonymous. A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries. 2022.","bibtex":"@book{Anonymous_2022, title={A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries}, author={Anonymous, Anonymous}, year={2022} }","short":"A. Anonymous, A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries, 2022.","ieee":"A. Anonymous, A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries. 2022."},"year":"2022","type":"mastersthesis","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}]},{"supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"language":[{"iso":"eng"}],"citation":{"ieee":"M. Beckmann, Analysis of an Interactive Lattice Based Aggregated Signature Scheme. 2022.","short":"M. Beckmann, Analysis of an Interactive Lattice Based Aggregated Signature Scheme, 2022.","mla":"Beckmann, Marvin. Analysis of an Interactive Lattice Based Aggregated Signature Scheme. 2022.","bibtex":"@book{Beckmann_2022, title={Analysis of an Interactive Lattice Based Aggregated Signature Scheme}, author={Beckmann, Marvin}, year={2022} }","chicago":"Beckmann, Marvin. Analysis of an Interactive Lattice Based Aggregated Signature Scheme, 2022.","apa":"Beckmann, M. (2022). Analysis of an Interactive Lattice Based Aggregated Signature Scheme.","ama":"Beckmann M. Analysis of an Interactive Lattice Based Aggregated Signature Scheme.; 2022."},"year":"2022","type":"bachelorsthesis","_id":"45257","date_updated":"2023-05-24T10:01:36Z","date_created":"2023-05-24T10:01:33Z","status":"public","department":[{"_id":"64"}],"author":[{"last_name":"Beckmann","full_name":"Beckmann, Marvin","first_name":"Marvin"}],"user_id":"47434","title":"Analysis of an Interactive Lattice Based Aggregated Signature Scheme"},{"title":"Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes","user_id":"477","date_created":"2021-10-21T07:51:32Z","project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"82","name":"SFB 901 - Project Area T"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"status":"public","department":[{"_id":"64"}],"publisher":"IACR eprint","author":[{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"full_name":"Eidens, Fabian","first_name":"Fabian","id":"25078","last_name":"Eidens"},{"last_name":"Heitjohann","first_name":"Raphael","full_name":"Heitjohann, Raphael"},{"last_name":"Fell","full_name":"Fell, Jeremy","first_name":"Jeremy"}],"oa":"1","_id":"26645","date_updated":"2022-11-18T09:38:42Z","citation":{"short":"J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).","ieee":"J. Bobolz, F. Eidens, R. Heitjohann, and J. Fell, “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.","chicago":"Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.","apa":"Bobolz, J., Eidens, F., Heitjohann, R., & Fell, J. (2021). Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. IACR eprint.","ama":"Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 2021.","bibtex":"@article{Bobolz_Eidens_Heitjohann_Fell_2021, title={Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes}, publisher={IACR eprint}, author={Bobolz, Jan and Eidens, Fabian and Heitjohann, Raphael and Fell, Jeremy}, year={2021} }","mla":"Bobolz, Jan, et al. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. IACR eprint, 2021."},"year":"2021","type":"preprint","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2021/961","open_access":"1"}]},{"doi":"10.1007/978-3-030-92548-2_9","_id":"29566","date_updated":"2022-01-27T13:02:23Z","language":[{"iso":"eng"}],"year":"2021","type":"conference","citation":{"bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham}, title={Issuer-Hiding Attribute-Based Credentials}, DOI={10.1007/978-3-030-92548-2_9}, booktitle={Cryptology and Network Security}, publisher={Springer International Publishing}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Ramacher, Sebastian and Samelin, Kai}, year={2021} }","mla":"Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” Cryptology and Network Security, Springer International Publishing, 2021, doi:10.1007/978-3-030-92548-2_9.","apa":"Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., & Samelin, K. (2021). Issuer-Hiding Attribute-Based Credentials. Cryptology and Network Security. https://doi.org/10.1007/978-3-030-92548-2_9","ama":"Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based Credentials. In: Cryptology and Network Security. Springer International Publishing; 2021. doi:10.1007/978-3-030-92548-2_9","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai Samelin. “Issuer-Hiding Attribute-Based Credentials.” In Cryptology and Network Security. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-92548-2_9.","ieee":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding Attribute-Based Credentials,” 2021, doi: 10.1007/978-3-030-92548-2_9.","short":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021."},"user_id":"27207","title":"Issuer-Hiding Attribute-Based Credentials","place":"Cham","status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"date_created":"2022-01-27T13:00:21Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030925475","9783030925482"]},"publication_status":"published","publisher":"Springer International Publishing","author":[{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"last_name":"Eidens","id":"25078","first_name":"Fabian","full_name":"Eidens, Fabian"},{"last_name":"Krenn","first_name":"Stephan","full_name":"Krenn, Stephan"},{"full_name":"Ramacher, Sebastian","first_name":"Sebastian","last_name":"Ramacher"},{"last_name":"Samelin","first_name":"Kai","full_name":"Samelin, Kai"}],"department":[{"_id":"7"},{"_id":"64"}],"publication":"Cryptology and Network Security"},{"status":"public","date_created":"2022-07-20T11:40:28Z","author":[{"first_name":"Jan Niklas","full_name":"Siemer, Jan Niklas","last_name":"Siemer"}],"department":[{"_id":"64"}],"title":"Lattice reductions and their applications to cryptographic systems","user_id":"47434","type":"bachelorsthesis","year":"2021","citation":{"short":"J.N. Siemer, Lattice Reductions and Their Applications to Cryptographic Systems, 2021.","ieee":"J. N. Siemer, Lattice reductions and their applications to cryptographic systems. 2021.","apa":"Siemer, J. N. (2021). Lattice reductions and their applications to cryptographic systems.","ama":"Siemer JN. Lattice Reductions and Their Applications to Cryptographic Systems.; 2021.","chicago":"Siemer, Jan Niklas. Lattice Reductions and Their Applications to Cryptographic Systems, 2021.","bibtex":"@book{Siemer_2021, title={Lattice reductions and their applications to cryptographic systems}, author={Siemer, Jan Niklas}, year={2021} }","mla":"Siemer, Jan Niklas. Lattice Reductions and Their Applications to Cryptographic Systems. 2021."},"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"date_updated":"2023-01-10T10:49:33Z","_id":"32401"},{"supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"language":[{"iso":"eng"}],"type":"mastersthesis","year":"2021","citation":{"ieee":"A. Anonymous, Performance Analysis of FHE Libraries. 2021.","short":"A. Anonymous, Performance Analysis of FHE Libraries, 2021.","bibtex":"@book{Anonymous_2021, title={Performance Analysis of FHE Libraries}, author={Anonymous, Anonymous}, year={2021} }","mla":"Anonymous, Anonymous. Performance Analysis of FHE Libraries. 2021.","chicago":"Anonymous, Anonymous. Performance Analysis of FHE Libraries, 2021.","ama":"Anonymous A. Performance Analysis of FHE Libraries.; 2021.","apa":"Anonymous, A. (2021). Performance Analysis of FHE Libraries."},"date_updated":"2023-01-10T11:54:39Z","_id":"32400","department":[{"_id":"64"}],"author":[{"full_name":"Anonymous, Anonymous","first_name":"Anonymous","last_name":"Anonymous"}],"date_created":"2022-07-20T11:37:41Z","status":"public","user_id":"47434","title":"Performance Analysis of FHE Libraries"},{"user_id":"47434","title":"IND-CCA Secure PKE Schemes - Based on Lattices","author":[{"full_name":"Böttger, Meret Amalia Elisabeth","first_name":"Meret Amalia Elisabeth","last_name":"Böttger"}],"department":[{"_id":"64"}],"status":"public","date_created":"2022-07-20T11:42:08Z","_id":"32402","date_updated":"2023-01-23T13:03:05Z","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"citation":{"apa":"Böttger, M. A. E. (2021). IND-CCA Secure PKE Schemes - Based on Lattices.","ama":"Böttger MAE. IND-CCA Secure PKE Schemes - Based on Lattices.; 2021.","chicago":"Böttger, Meret Amalia Elisabeth. IND-CCA Secure PKE Schemes - Based on Lattices, 2021.","bibtex":"@book{Böttger_2021, title={IND-CCA Secure PKE Schemes - Based on Lattices}, author={Böttger, Meret Amalia Elisabeth}, year={2021} }","mla":"Böttger, Meret Amalia Elisabeth. IND-CCA Secure PKE Schemes - Based on Lattices. 2021.","short":"M.A.E. Böttger, IND-CCA Secure PKE Schemes - Based on Lattices, 2021.","ieee":"M. A. E. Böttger, IND-CCA Secure PKE Schemes - Based on Lattices. 2021."},"type":"bachelorsthesis","year":"2021"},{"date_updated":"2023-05-24T09:57:21Z","_id":"45254","year":"2021","type":"mastersthesis","citation":{"chicago":"Anonymous, Anonymous. Device-Independent Security Proofs Via Entropy Accumulation, 2021.","ama":"Anonymous A. Device-Independent Security Proofs Via Entropy Accumulation.; 2021.","apa":"Anonymous, A. (2021). Device-Independent Security Proofs Via Entropy Accumulation.","bibtex":"@book{Anonymous_2021, title={Device-Independent Security Proofs Via Entropy Accumulation}, author={Anonymous, Anonymous}, year={2021} }","mla":"Anonymous, Anonymous. Device-Independent Security Proofs Via Entropy Accumulation. 2021.","short":"A. Anonymous, Device-Independent Security Proofs Via Entropy Accumulation, 2021.","ieee":"A. Anonymous, Device-Independent Security Proofs Via Entropy Accumulation. 2021."},"language":[{"iso":"eng"}],"supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"title":"Device-Independent Security Proofs Via Entropy Accumulation","user_id":"47434","status":"public","date_created":"2023-05-24T09:57:18Z","author":[{"first_name":"Anonymous","full_name":"Anonymous, Anonymous","last_name":"Anonymous"}],"department":[{"_id":"64"}]},{"_id":"21117","date_updated":"2022-01-06T06:54:46Z","language":[{"iso":"eng"}],"citation":{"short":"P. Manegold, On Batch Proofs of Partial Knowledge, 2020.","ieee":"P. Manegold, On Batch Proofs of Partial Knowledge. 2020.","ama":"Manegold P. On Batch Proofs of Partial Knowledge.; 2020.","apa":"Manegold, P. (2020). On Batch Proofs of Partial Knowledge.","chicago":"Manegold, Philipp. On Batch Proofs of Partial Knowledge, 2020.","mla":"Manegold, Philipp. On Batch Proofs of Partial Knowledge. 2020.","bibtex":"@book{Manegold_2020, title={On Batch Proofs of Partial Knowledge}, author={Manegold, Philipp}, year={2020} }"},"type":"bachelorsthesis","year":"2020","extern":"1","user_id":"27207","title":"On Batch Proofs of Partial Knowledge","department":[{"_id":"7"},{"_id":"64"}],"author":[{"last_name":"Manegold","first_name":"Philipp","full_name":"Manegold, Philipp"}],"date_created":"2021-02-02T10:27:49Z","status":"public"},{"user_id":"27207","title":"Measuring the Performance of SNARK Libraries","extern":"1","date_created":"2021-02-02T10:29:30Z","status":"public","department":[{"_id":"7"},{"_id":"64"}],"author":[{"last_name":"Anonymous","first_name":"Anonymous","full_name":"Anonymous, Anonymous"}],"_id":"21118","date_updated":"2022-01-06T06:54:46Z","language":[{"iso":"eng"}],"type":"bachelorsthesis","year":"2020","citation":{"ieee":"A. Anonymous, Measuring the Performance of SNARK Libraries. 2020.","short":"A. Anonymous, Measuring the Performance of SNARK Libraries, 2020.","mla":"Anonymous, Anonymous. Measuring the Performance of SNARK Libraries. 2020.","bibtex":"@book{Anonymous_2020, title={Measuring the Performance of SNARK Libraries}, author={Anonymous, Anonymous}, year={2020} }","ama":"Anonymous A. Measuring the Performance of SNARK Libraries.; 2020.","apa":"Anonymous, A. (2020). Measuring the Performance of SNARK Libraries.","chicago":"Anonymous, Anonymous. Measuring the Performance of SNARK Libraries, 2020."}},{"language":[{"iso":"eng"}],"year":"2020","citation":{"ama":"Westerwelle M. Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions.; 2020.","apa":"Westerwelle, M. (2020). Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions.","chicago":"Westerwelle, Max. Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions, 2020.","bibtex":"@book{Westerwelle_2020, title={Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions}, author={Westerwelle, Max}, year={2020} }","mla":"Westerwelle, Max. Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions. 2020.","short":"M. Westerwelle, Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions, 2020.","ieee":"M. Westerwelle, Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions. 2020."},"type":"bachelorsthesis","_id":"21119","date_updated":"2022-01-06T06:54:46Z","status":"public","date_created":"2021-02-02T10:37:35Z","author":[{"full_name":"Westerwelle, Max","first_name":"Max","last_name":"Westerwelle"}],"department":[{"_id":"64"}],"user_id":"47434","title":"Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions"},{"_id":"21121","date_updated":"2022-01-06T06:54:46Z","type":"bachelorsthesis","year":"2020","citation":{"bibtex":"@book{Anonymous_2020, title={Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems}, author={Anonymous, Anonymous}, year={2020} }","mla":"Anonymous, Anonymous. Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems. 2020.","chicago":"Anonymous, Anonymous. Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems, 2020.","apa":"Anonymous, A. (2020). Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems.","ama":"Anonymous A. Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems.; 2020.","ieee":"A. Anonymous, Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems. 2020.","short":"A. Anonymous, Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems, 2020."},"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"language":[{"iso":"eng"}],"title":"Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems","user_id":"41047","department":[{"_id":"64"},{"_id":"7"}],"author":[{"last_name":"Anonymous","full_name":"Anonymous, Anonymous","first_name":"Anonymous"}],"date_created":"2021-02-02T10:50:08Z","status":"public"},{"page":"1-25","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.","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","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","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."},"type":"journal_article","year":"2020","intvolume":" 16","_id":"20888","issue":"4","publication":"ACM Transactions on Algorithms","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"full_name":"Brauer, Sascha","first_name":"Sascha","id":"13291","last_name":"Brauer"},{"last_name":"Bujna","first_name":"Kathrin","full_name":"Bujna, Kathrin"}],"volume":16,"date_created":"2021-01-08T08:51:42Z","status":"public","user_id":"13291","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:41Z","doi":"10.1145/3409385","department":[{"_id":"64"}],"publication_identifier":{"issn":["1549-6325","1549-6333"]},"publication_status":"published","project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"title":"A Complexity Theoretical Study of Fuzzy K-Means"},{"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"language":[{"iso":"eng"}],"citation":{"ama":"Heimann J. Distributed Key Generation for Attribute-Based Signatures.; 2020.","apa":"Heimann, J. (2020). Distributed Key Generation for Attribute-Based Signatures.","chicago":"Heimann, Jonas. Distributed Key Generation for Attribute-Based Signatures, 2020.","mla":"Heimann, Jonas. Distributed Key Generation for Attribute-Based Signatures. 2020.","bibtex":"@book{Heimann_2020, title={Distributed Key Generation for Attribute-Based Signatures}, author={Heimann, Jonas}, year={2020} }","short":"J. Heimann, Distributed Key Generation for Attribute-Based Signatures, 2020.","ieee":"J. Heimann, Distributed Key Generation for Attribute-Based Signatures. 2020."},"type":"bachelorsthesis","year":"2020","_id":"18085","date_updated":"2022-01-06T06:53:26Z","author":[{"first_name":"Jonas","full_name":"Heimann, Jonas","last_name":"Heimann"}],"department":[{"_id":"64"}],"status":"public","date_created":"2020-08-20T11:23:11Z","user_id":"13703","title":"Distributed Key Generation for Attribute-Based Signatures"},{"date_created":"2020-08-29T13:24:51Z","status":"public","has_accepted_license":"1","file_date_updated":"2020-10-23T08:36:34Z","publisher":"Universität Paderborn","author":[{"full_name":"Schürmann, Patrick","first_name":"Patrick","last_name":"Schürmann"}],"file":[{"access_level":"open_access","date_created":"2020-10-23T08:36:34Z","file_name":"thesis_schuermann_published.pdf","description":"This is a bachelor thesis.","relation":"main_file","date_updated":"2020-10-23T08:36:34Z","content_type":"application/pdf","file_id":"20186","creator":"feidens","file_size":1060142}],"ddc":["000"],"user_id":"25078","extern":"1","citation":{"mla":"Schürmann, Patrick. A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn, 2020.","bibtex":"@book{Schürmann_2020, title={A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes}, publisher={Universität Paderborn}, author={Schürmann, Patrick}, year={2020} }","apa":"Schürmann, P. (2020). A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn.","ama":"Schürmann P. A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn; 2020.","chicago":"Schürmann, Patrick. A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn, 2020.","ieee":"P. Schürmann, A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn, 2020.","short":"P. Schürmann, A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes, Universität Paderborn, 2020."},"year":"2020","type":"bachelorsthesis","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"_id":"18637","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"7"},{"_id":"64"}],"title":"A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes","language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:53:50Z"},{"title":"Enhancing Security by Usage of Universal One-Way Hash Functions","user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_created":"2020-08-29T13:30:56Z","status":"public","department":[{"_id":"7"},{"_id":"64"}],"author":[{"last_name":"Terfort","full_name":"Terfort, Tobias","first_name":"Tobias"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:50Z","_id":"18639","citation":{"chicago":"Terfort, Tobias. Enhancing Security by Usage of Universal One-Way Hash Functions. Universität Paderborn, 2020.","apa":"Terfort, T. (2020). Enhancing Security by Usage of Universal One-Way Hash Functions. Universität Paderborn.","ama":"Terfort T. Enhancing Security by Usage of Universal One-Way Hash Functions. Universität Paderborn; 2020.","bibtex":"@book{Terfort_2020, title={Enhancing Security by Usage of Universal One-Way Hash Functions}, publisher={Universität Paderborn}, author={Terfort, Tobias}, year={2020} }","mla":"Terfort, Tobias. Enhancing Security by Usage of Universal One-Way Hash Functions. Universität Paderborn, 2020.","short":"T. Terfort, Enhancing Security by Usage of Universal One-Way Hash Functions, Universität Paderborn, 2020.","ieee":"T. Terfort, Enhancing Security by Usage of Universal One-Way Hash Functions. Universität Paderborn, 2020."},"type":"bachelorsthesis","year":"2020","supervisor":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"}],"language":[{"iso":"eng"}]},{"user_id":"477","ddc":["000"],"has_accepted_license":"1","status":"public","date_created":"2020-04-09T10:00:29Z","file":[{"date_created":"2020-04-09T09:59:03Z","file_name":"main.pdf","access_level":"closed","file_size":553623,"file_id":"16488","creator":"feidens","date_updated":"2020-04-09T09:59:03Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"author":[{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"},{"first_name":"Fabian","full_name":"Eidens, Fabian","last_name":"Eidens","id":"25078"},{"full_name":"Krenn, Stephan","first_name":"Stephan","last_name":"Krenn"},{"first_name":"Daniel","full_name":"Slamanig, Daniel","last_name":"Slamanig"},{"last_name":"Striecks","first_name":"Christoph","full_name":"Striecks, Christoph"}],"publisher":"ACM","file_date_updated":"2020-04-09T09:59:03Z","publication":"Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),","_id":"16487","conference":{"name":"ASIA CCS'20","location":"Taiwan"},"type":"conference","citation":{"apa":"Bobolz, J., Eidens, F., Krenn, S., Slamanig, D., & Striecks, C. (2020). Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),. New York, NY, USA: ACM. https://doi.org/10.1145/3320269.3384769","ama":"Bobolz J, Eidens F, Krenn S, Slamanig D, Striecks C. Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),. New York, NY, USA: ACM; 2020. doi:10.1145/3320269.3384769","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph Striecks. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” In Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),. New York, NY, USA: ACM, 2020. https://doi.org/10.1145/3320269.3384769.","mla":"Bobolz, Jan, et al. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, 2020, doi:10.1145/3320269.3384769.","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Slamanig_Striecks_2020, place={New York, NY, USA}, title={Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection}, DOI={10.1145/3320269.3384769}, booktitle={Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),}, publisher={ACM}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Slamanig, Daniel and Striecks, Christoph}, year={2020} }","short":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, C. Striecks, in: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, New York, NY, USA, 2020.","ieee":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, and C. Striecks, “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection,” in Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), Taiwan, 2020."},"year":"2020","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2020/382"}],"title":"Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection","place":"New York, NY, USA","project":[{"name":"SFB 901","_id":"1"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"name":"SFB 901 - Project Area T","_id":"82"}],"department":[{"_id":"64"}],"oa":"1","doi":"10.1145/3320269.3384769","date_updated":"2022-01-06T06:52:51Z","language":[{"iso":"eng"}]},{"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"},{"first_name":"Kathrin","full_name":"Bujna, Kathrin","last_name":"Bujna"},{"last_name":"Kuntze","full_name":"Kuntze, Daniel","first_name":"Daniel"}],"department":[{"_id":"64"}],"publication":"Advances in Data Analysis and Classification","status":"public","date_created":"2019-07-11T08:08:25Z","project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"publication_status":"published","volume":14,"publication_identifier":{"issn":["1862-5347","1862-5355"]},"user_id":"13291","title":"How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models","language":[{"iso":"eng"}],"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.","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.","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","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."},"type":"journal_article","year":"2020","page":"147–173","_id":"10790","intvolume":" 14","date_updated":"2022-01-06T06:50:50Z","doi":"10.1007/s11634-019-00366-7"},{"author":[{"full_name":"Löken, Nils","first_name":"Nils","id":"13703","last_name":"Löken"}],"department":[{"_id":"64"},{"_id":"568"}],"status":"public","date_created":"2020-01-10T08:23:30Z","title":"Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work","user_id":"13703","year":"2020","type":"dissertation","citation":{"chicago":"Löken, Nils. Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work, 2020. https://doi.org/10.17619/UNIPB/1-854.","ama":"Löken N. Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work.; 2020. doi:10.17619/UNIPB/1-854","apa":"Löken, N. (2020). Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work. https://doi.org/10.17619/UNIPB/1-854","mla":"Löken, Nils. Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work. 2020, doi:10.17619/UNIPB/1-854.","bibtex":"@book{Löken_2020, title={Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work}, DOI={10.17619/UNIPB/1-854}, author={Löken, Nils}, year={2020} }","short":"N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work, 2020.","ieee":"N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work. 2020."},"supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:27Z","_id":"15482","doi":"10.17619/UNIPB/1-854"},{"publisher":"Universität Paderborn","author":[{"first_name":"Paul","full_name":"Kramer, Paul","last_name":"Kramer","id":"64594"}],"department":[{"_id":"7"},{"_id":"64"}],"status":"public","date_created":"2020-08-29T13:27:11Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"title":"Comparison of Zero-Knowledge Range Proofs","user_id":"25078","citation":{"mla":"Kramer, Paul. Comparison of Zero-Knowledge Range Proofs. Universität Paderborn, 2020.","bibtex":"@book{Kramer_2020, title={Comparison of Zero-Knowledge Range Proofs}, publisher={Universität Paderborn}, author={Kramer, Paul}, year={2020} }","chicago":"Kramer, Paul. Comparison of Zero-Knowledge Range Proofs. Universität Paderborn, 2020.","apa":"Kramer, P. (2020). Comparison of Zero-Knowledge Range Proofs. Universität Paderborn.","ama":"Kramer P. Comparison of Zero-Knowledge Range Proofs. Universität Paderborn; 2020.","ieee":"P. Kramer, Comparison of Zero-Knowledge Range Proofs. Universität Paderborn, 2020.","short":"P. Kramer, Comparison of Zero-Knowledge Range Proofs, Universität Paderborn, 2020."},"type":"bachelorsthesis","year":"2020","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"date_updated":"2022-10-17T10:56:59Z","_id":"18638"},{"user_id":"13291","volume":754,"date_created":"2018-05-25T11:10:36Z","status":"public","publication":"Theoretical Computer Science","author":[{"full_name":"Brauer, Sascha","first_name":"Sascha","id":"13291","last_name":"Brauer"}],"publisher":"Elsevier","_id":"2916","intvolume":" 754","page":"88-106","type":"journal_article","citation":{"bibtex":"@article{Brauer_2019, title={Complexity of single-swap heuristics for metric facility location and related problems}, volume={754}, DOI={10.1016/j.tcs.2018.04.048}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Brauer, Sascha}, year={2019}, pages={88–106} }","mla":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” Theoretical Computer Science, vol. 754, Elsevier, 2019, pp. 88–106, doi:10.1016/j.tcs.2018.04.048.","chicago":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” Theoretical Computer Science 754 (2019): 88–106. https://doi.org/10.1016/j.tcs.2018.04.048.","ama":"Brauer S. Complexity of single-swap heuristics for metric facility location and related problems. Theoretical Computer Science. 2019;754:88-106. doi:10.1016/j.tcs.2018.04.048","apa":"Brauer, S. (2019). Complexity of single-swap heuristics for metric facility location and related problems. Theoretical Computer Science, 754, 88–106. https://doi.org/10.1016/j.tcs.2018.04.048","ieee":"S. Brauer, “Complexity of single-swap heuristics for metric facility location and related problems,” Theoretical Computer Science, vol. 754, pp. 88–106, 2019.","short":"S. Brauer, Theoretical Computer Science 754 (2019) 88–106."},"year":"2019","title":"Complexity of single-swap heuristics for metric facility location and related problems","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"department":[{"_id":"64"}],"doi":"10.1016/j.tcs.2018.04.048","date_updated":"2022-01-06T06:58:46Z","language":[{"iso":"eng"}]},{"department":[{"_id":"64"}],"author":[{"last_name":"Otte","full_name":"Otte, Oliver","first_name":"Oliver"}],"date_created":"2020-02-03T09:43:19Z","status":"public","user_id":"13703","title":"Outsourced Decryption of Attribute-based Ciphertexts","language":[{"iso":"eng"}],"year":"2019","type":"mastersthesis","citation":{"ieee":"O. Otte, Outsourced Decryption of Attribute-based Ciphertexts. 2019.","short":"O. Otte, Outsourced Decryption of Attribute-Based Ciphertexts, 2019.","bibtex":"@book{Otte_2019, title={Outsourced Decryption of Attribute-based Ciphertexts}, author={Otte, Oliver}, year={2019} }","mla":"Otte, Oliver. Outsourced Decryption of Attribute-Based Ciphertexts. 2019.","chicago":"Otte, Oliver. Outsourced Decryption of Attribute-Based Ciphertexts, 2019.","apa":"Otte, O. (2019). Outsourced Decryption of Attribute-based Ciphertexts.","ama":"Otte O. Outsourced Decryption of Attribute-Based Ciphertexts.; 2019."},"_id":"15746","date_updated":"2022-01-06T06:52:32Z"},{"_id":"15747","date_updated":"2022-01-06T06:52:32Z","year":"2019","type":"bachelorsthesis","citation":{"ieee":"N. C. Wördenweber, On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model. 2019.","short":"N.C. Wördenweber, On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model, 2019.","bibtex":"@book{Wördenweber_2019, title={On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model}, author={Wördenweber, Nico Christof}, year={2019} }","mla":"Wördenweber, Nico Christof. On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model. 2019.","chicago":"Wördenweber, Nico Christof. On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model, 2019.","ama":"Wördenweber NC. On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model.; 2019.","apa":"Wördenweber, N. C. (2019). On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model."},"language":[{"iso":"eng"}],"title":"On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model","user_id":"13703","department":[{"_id":"64"}],"author":[{"last_name":"Wördenweber","first_name":"Nico Christof","full_name":"Wördenweber, Nico Christof"}],"date_created":"2020-02-03T09:45:01Z","status":"public"},{"user_id":"13291","title":"Experimentelle Untersuchung des SEM-Algorithmus","date_created":"2020-02-06T08:51:51Z","status":"public","department":[{"_id":"64"}],"author":[{"last_name":"Leutnant","first_name":"Matthias","full_name":"Leutnant, Matthias"}],"date_updated":"2022-01-06T06:52:37Z","_id":"15819","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"language":[{"iso":"eng"}],"citation":{"short":"M. Leutnant, Experimentelle Untersuchung Des SEM-Algorithmus, 2019.","ieee":"M. Leutnant, Experimentelle Untersuchung des SEM-Algorithmus. 2019.","chicago":"Leutnant, Matthias. Experimentelle Untersuchung Des SEM-Algorithmus, 2019.","ama":"Leutnant M. Experimentelle Untersuchung Des SEM-Algorithmus.; 2019.","apa":"Leutnant, M. (2019). Experimentelle Untersuchung des SEM-Algorithmus.","mla":"Leutnant, Matthias. Experimentelle Untersuchung Des SEM-Algorithmus. 2019.","bibtex":"@book{Leutnant_2019, title={Experimentelle Untersuchung des SEM-Algorithmus}, author={Leutnant, Matthias}, year={2019} }"},"type":"bachelorsthesis","year":"2019"},{"_id":"13128","year":"2019","type":"mastersthesis","citation":{"ieee":"H. Bröcher, Rational Secure Multiparty Computation. Universität Paderborn, 2019.","short":"H. Bröcher, Rational Secure Multiparty Computation, Universität Paderborn, 2019.","mla":"Bröcher, Henrik. Rational Secure Multiparty Computation. Universität Paderborn, 2019.","bibtex":"@book{Bröcher_2019, title={Rational Secure Multiparty Computation}, publisher={Universität Paderborn}, author={Bröcher, Henrik}, year={2019} }","chicago":"Bröcher, Henrik. Rational Secure Multiparty Computation. Universität Paderborn, 2019.","apa":"Bröcher, H. (2019). Rational Secure Multiparty Computation. Universität Paderborn.","ama":"Bröcher H. Rational Secure Multiparty Computation. Universität Paderborn; 2019."},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"extern":"1","ddc":["000"],"user_id":"25078","file_date_updated":"2020-10-30T15:59:34Z","publisher":"Universität Paderborn","author":[{"first_name":"Henrik","full_name":"Bröcher, Henrik","last_name":"Bröcher","id":"41047"}],"file":[{"date_updated":"2020-10-30T15:59:34Z","content_type":"application/pdf","relation":"main_file","file_size":746819,"creator":"bhenrik","file_id":"13129","access_level":"open_access","file_name":"thesis_broecher.pdf","date_created":"2019-09-04T07:59:31Z"}],"date_created":"2019-09-04T08:04:12Z","has_accepted_license":"1","status":"public","date_updated":"2022-01-06T06:51:28Z","oa":"1","language":[{"iso":"eng"}],"title":"Rational Secure Multiparty Computation","department":[{"_id":"64"}],"project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"status":"public","has_accepted_license":"1","date_created":"2019-06-26T09:12:47Z","file":[{"access_level":"open_access","date_created":"2019-06-26T09:08:23Z","file_name":"thesis_final.pdf","content_type":"application/pdf","date_updated":"2019-06-26T09:19:15Z","relation":"main_file","file_size":899233,"creator":"laurensp","file_id":"10307"}],"author":[{"first_name":"Laurens Alexander","full_name":"Porzenheim, Laurens Alexander","last_name":"Porzenheim","id":"47434"}],"department":[{"_id":"64"}],"file_date_updated":"2019-06-26T09:19:15Z","user_id":"47434","title":"Post-Quantum Secure Group Signatures","ddc":["000"],"language":[{"iso":"eng"}],"supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"type":"mastersthesis","citation":{"bibtex":"@book{Porzenheim_2019, title={Post-Quantum Secure Group Signatures}, author={Porzenheim, Laurens Alexander}, year={2019} }","mla":"Porzenheim, Laurens Alexander. Post-Quantum Secure Group Signatures. 2019.","ama":"Porzenheim LA. Post-Quantum Secure Group Signatures.; 2019.","apa":"Porzenheim, L. A. (2019). Post-Quantum Secure Group Signatures.","chicago":"Porzenheim, Laurens Alexander. Post-Quantum Secure Group Signatures, 2019.","ieee":"L. A. Porzenheim, Post-Quantum Secure Group Signatures. 2019.","short":"L.A. Porzenheim, Post-Quantum Secure Group Signatures, 2019."},"year":"2019","oa":"1","_id":"10306","date_updated":"2022-01-06T06:50:36Z"},{"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-030-31511-5_9","oa":"1","date_updated":"2022-01-06T06:51:38Z","department":[{"_id":"568"},{"_id":"64"}],"title":"Personal Cross-Platform Reputation","year":"2019","type":"conference","citation":{"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.","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","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","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} }","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.","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."},"intvolume":" 11738","_id":"13554","conference":{"name":"Security and Trust Management, STM 2019"},"volume":11738,"status":"public","has_accepted_license":"1","date_created":"2019-10-01T07:50:03Z","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"id":"13703","last_name":"Löken","full_name":"Löken, Nils","first_name":"Nils"}],"file_date_updated":"2019-10-01T07:45:17Z","publication":"Security and Trust Management, STM 2019","file":[{"access_level":"open_access","date_created":"2019-10-01T07:45:17Z","file_name":"informal.pdf","content_type":"application/pdf","date_updated":"2019-10-01T07:45:17Z","relation":"main_file","description":"This is an author's version of the paper presented at STM 2019.","file_size":507736,"file_id":"13555","creator":"nilo","title":"Personal cross-platform reputation, author's version"}],"ddc":["000"],"user_id":"13703","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."}]},{"language":[{"iso":"eng"}],"citation":{"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.","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.","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.","short":"J. Blömer, N. Löken, in: 12th International Symposium on Foundations and Practice of Security, FPS 2019, Springer, 2019."},"year":"2019","type":"conference","series_title":"LNCS","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2019/1038"}],"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","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"id":"13703","last_name":"Löken","full_name":"Löken, Nils","first_name":"Nils"}],"publisher":"Springer","user_id":"13703","title":"Dynamic Searchable Encryption with Access Control","abstract":[{"lang":"eng","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."}]},{"date_updated":"2022-01-06T06:51:40Z","_id":"13592","language":[{"iso":"eng"}],"supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"type":"bachelorsthesis","citation":{"chicago":"Pilot, Matthias. Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java. Universität Paderborn, 2019.","apa":"Pilot, M. (2019). Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java. Universität Paderborn.","ama":"Pilot M. Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java. Universität Paderborn; 2019.","bibtex":"@book{Pilot_2019, title={Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java}, publisher={Universität Paderborn}, author={Pilot, Matthias}, year={2019} }","mla":"Pilot, Matthias. Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java. Universität Paderborn, 2019.","short":"M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java, Universität Paderborn, 2019.","ieee":"M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java. Universität Paderborn, 2019."},"year":"2019","extern":"1","user_id":"477","title":"Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java","department":[{"_id":"7"},{"_id":"64"}],"author":[{"full_name":"Pilot, Matthias","first_name":"Matthias","last_name":"Pilot"}],"publisher":"Universität Paderborn","date_created":"2019-10-03T12:30:24Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"status":"public"},{"user_id":"477","ddc":["000"],"extern":"1","status":"public","has_accepted_license":"1","date_created":"2019-10-07T09:56:58Z","file":[{"access_level":"open_access","date_created":"2020-04-27T10:32:00Z","file_name":"sscholz-MA-thesis-final.pdf","content_type":"application/pdf","date_updated":"2020-04-27T10:33:59Z","relation":"main_file","file_size":1714805,"file_id":"16871","creator":"jbobolz"}],"publisher":"Universität Paderborn","author":[{"last_name":"Scholz","full_name":"Scholz, Swante","first_name":"Swante"}],"file_date_updated":"2020-04-27T10:33:59Z","_id":"13648","supervisor":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"}],"type":"mastersthesis","year":"2019","citation":{"ieee":"S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in Java. Universität Paderborn, 2019.","short":"S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in Java, Universität Paderborn, 2019.","bibtex":"@book{Scholz_2019, title={Implementation and Comparison of Elliptic Curve Algorithms in Java}, publisher={Universität Paderborn}, author={Scholz, Swante}, year={2019} }","mla":"Scholz, Swante. Implementation and Comparison of Elliptic Curve Algorithms in Java. Universität Paderborn, 2019.","chicago":"Scholz, Swante. Implementation and Comparison of Elliptic Curve Algorithms in Java. Universität Paderborn, 2019.","apa":"Scholz, S. (2019). Implementation and Comparison of Elliptic Curve Algorithms in Java. Universität Paderborn.","ama":"Scholz S. Implementation and Comparison of Elliptic Curve Algorithms in Java. Universität Paderborn; 2019."},"title":"Implementation and Comparison of Elliptic Curve Algorithms in Java","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"7"},{"_id":"64"}],"oa":"1","date_updated":"2022-01-06T06:51:41Z","language":[{"iso":"eng"}]},{"date_created":"2019-10-09T10:00:53Z","project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"status":"public","department":[{"_id":"64"}],"author":[{"last_name":"Brauer","id":"13291","first_name":"Sascha","full_name":"Brauer, Sascha"}],"user_id":"13291","title":"Classification and Approximation of Geometric Location Problems","place":"Paderborn","language":[{"iso":"eng"}],"supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"citation":{"chicago":"Brauer, Sascha. Classification and Approximation of Geometric Location Problems. Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-816.","ama":"Brauer S. Classification and Approximation of Geometric Location Problems. Paderborn; 2019. doi:10.17619/UNIPB/1-816","apa":"Brauer, S. (2019). Classification and Approximation of Geometric Location Problems. Paderborn. https://doi.org/10.17619/UNIPB/1-816","bibtex":"@book{Brauer_2019, place={Paderborn}, title={Classification and Approximation of Geometric Location Problems}, DOI={10.17619/UNIPB/1-816}, author={Brauer, Sascha}, year={2019} }","mla":"Brauer, Sascha. Classification and Approximation of Geometric Location Problems. 2019, doi:10.17619/UNIPB/1-816.","short":"S. Brauer, Classification and Approximation of Geometric Location Problems, Paderborn, 2019.","ieee":"S. Brauer, Classification and Approximation of Geometric Location Problems. Paderborn, 2019."},"type":"dissertation","year":"2019","doi":"10.17619/UNIPB/1-816","date_updated":"2022-01-06T06:51:41Z","_id":"13679"},{"ddc":["006"],"user_id":"25078","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."}],"date_created":"2019-10-18T08:09:44Z","has_accepted_license":"1","status":"public","file_date_updated":"2019-10-18T08:07:49Z","publication":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"id":"27207","last_name":"Bobolz","full_name":"Bobolz, Jan","first_name":"Jan"},{"first_name":"Denis Pascal","full_name":"Diemert, Denis Pascal","last_name":"Diemert","id":"44071"},{"id":"25078","last_name":"Eidens","full_name":"Eidens, Fabian","first_name":"Fabian"}],"file":[{"file_size":838949,"creator":"jbobolz","file_id":"13907","content_type":"application/pdf","date_updated":"2019-10-18T08:07:49Z","relation":"main_file","date_created":"2019-10-18T08:07:49Z","file_name":"full_eprinted_v2.pdf","access_level":"closed"}],"conference":{"name":"26th ACM Conference on Computer and Communications Security","start_date":"2019-11-11","location":"London","end_date":"2019-11-15"},"_id":"13904","type":"conference","citation":{"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.","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} }","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.","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","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","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."},"year":"2019","main_file_link":[{"url":"https://eprint.iacr.org/2019/169.pdf","open_access":"1"}],"title":"Updatable Anonymous Credentials and Applications to Incentive Systems","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"7"},{"_id":"64"}],"doi":"10.1145/3319535.3354223","oa":"1","date_updated":"2023-01-10T10:25:27Z","language":[{"iso":"eng"}],"series_title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19"},{"department":[{"_id":"7"},{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_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,"date_updated":"2018-11-02T13:45:40Z","content_type":"application/pdf","file_id":"5253","creator":"ups","file_size":3371773,"access_level":"closed","file_name":"PracticalAnonymousAndPubliclyL.pdf","date_created":"2018-11-02T13:45:40Z"}],"publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings","file_date_updated":"2018-11-02T13:45:40Z","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Fabian","full_name":"Eidens, Fabian","last_name":"Eidens","id":"25078"},{"full_name":"Juhnke, Jakob","first_name":"Jakob","id":"48090","last_name":"Juhnke"}],"publisher":"Springer International Publishing","date_created":"2018-05-24T11:14:02Z","has_accepted_license":"1","status":"public","user_id":"477","ddc":["004"],"main_file_link":[{"url":"https://eprint.iacr.org/2018/029","open_access":"1"}],"page":"470-490","year":"2018","type":"conference","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.","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","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.","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."},"conference":{"end_date":"2018-04-20","start_date":"2018-04-16","name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018","location":"San Francisco, CA, USA"},"_id":"2862"},{"issue":"2","intvolume":" 2","_id":"2685","page":"314-338","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","year":"2018","user_id":"477","ddc":["000"],"date_created":"2018-05-08T09:18:54Z","has_accepted_license":"1","status":"public","volume":2,"file":[{"file_size":1131048,"creator":"ups","file_id":"5300","date_updated":"2018-11-02T15:22:55Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T15:22:55Z","file_name":"17m1132045.pdf","access_level":"closed"}],"publication":"SIAM Journal on Applied Algebra and Geometry.","file_date_updated":"2018-11-02T15:22:55Z","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"first_name":"Kathlén","full_name":"Kohn, Kathlén","last_name":"Kohn"}],"doi":"10.1137/17M1132045","date_updated":"2022-01-06T06:57:29Z","language":[{"iso":"eng"}],"title":"Voronoi Cells of Lattices with Respect to Arbitrary Norms","project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"publication_identifier":{"eissn":["2470-6566"]},"publication_status":"epub_ahead","department":[{"_id":"7"},{"_id":"64"}]}]