[{"date_created":"2023-01-26T16:07:19Z","department":[{"_id":"7"},{"_id":"64"}],"type":"mastersthesis","citation":{"ama":"Pilot M. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>.; 2023.","bibtex":"@book{Pilot_2023, title={Updatable Privacy-Preserving Reputation System based on Blockchain}, author={Pilot, Matthias}, year={2023} }","mla":"Pilot, Matthias. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>. 2023.","chicago":"Pilot, Matthias. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>, 2023.","short":"M. Pilot, Updatable Privacy-Preserving Reputation System Based on Blockchain, 2023.","apa":"Pilot, M. (2023). <i>Updatable Privacy-Preserving Reputation System based on Blockchain</i>.","ieee":"M. Pilot, <i>Updatable Privacy-Preserving Reputation System based on Blockchain</i>. 2023."},"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"extern":"1","language":[{"iso":"eng"}],"_id":"40440","user_id":"27207","author":[{"first_name":"Matthias","last_name":"Pilot","full_name":"Pilot, Matthias"}],"status":"public","title":"Updatable Privacy-Preserving Reputation System based on Blockchain","year":"2023","date_updated":"2023-01-26T16:08:11Z"},{"ddc":["000"],"user_id":"41047","language":[{"iso":"eng"}],"_id":"43374","date_updated":"2023-04-25T22:43:21Z","has_accepted_license":"1","title":" A Formal Comparison of Advanced Digital Signature Primitives","status":"public","year":"2023","author":[{"first_name":"Patrick","last_name":"Schürmann","full_name":"Schürmann, Patrick"}],"type":"mastersthesis","oa":"1","department":[{"_id":"64"}],"file":[{"date_created":"2023-04-25T10:49:36Z","creator":"bhenrik","title":" A Formal Comparison of Advanced Digital Signature Primitives","file_id":"44177","content_type":"application/pdf","relation":"main_file","date_updated":"2023-04-25T10:49:36Z","file_name":"masters_thesis_schuermann.pdf","access_level":"open_access","file_size":1367369}],"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"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"file_date_updated":"2023-04-25T10:49:36Z","supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"ieee":"P. Schürmann, <i> A Formal Comparison of Advanced Digital Signature Primitives</i>. 2023.","apa":"Schürmann, P. (2023). <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.","chicago":"Schürmann, Patrick. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>, 2023.","short":"P. Schürmann,  A Formal Comparison of Advanced Digital Signature Primitives, 2023.","mla":"Schürmann, Patrick. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>. 2023.","bibtex":"@book{Schürmann_2023, title={ A Formal Comparison of Advanced Digital Signature Primitives}, author={Schürmann, Patrick}, year={2023} }","ama":"Schürmann P. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.; 2023."}},{"file_date_updated":"2023-05-23T10:11:03Z","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} }","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.","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.","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.","short":"S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, 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.","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."},"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"}],"status":"public","conference":{"name":"ECIS 2023"},"has_accepted_license":"1","_id":"44855","ddc":["330"],"user_id":"27207","publication":"ECIS 2023 Research Papers","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."}],"extern":"1","file":[{"relation":"main_file","date_updated":"2023-05-23T10:11:03Z","file_name":"A_Blockchain_Based_Reputation_Ecosystem_for_Business___Payments_as_Ratings.pdf","access_level":"closed","file_size":958740,"file_id":"45209","success":1,"content_type":"application/pdf","creator":"jbobolz","date_created":"2023-05-23T10:11:03Z"}],"date_created":"2023-05-16T08:31:27Z","type":"conference","department":[{"_id":"7"},{"_id":"64"},{"_id":"19"},{"_id":"526"}],"year":"2023","title":"Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain","author":[{"full_name":"Hemmrich, Simon","first_name":"Simon","last_name":"Hemmrich","id":"83557"},{"id":"27207","last_name":"Bobolz","first_name":"Jan","full_name":"Bobolz, Jan"},{"id":"59677","first_name":"Daniel","last_name":"Beverungen","full_name":"Beverungen, Daniel"},{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"date_updated":"2023-05-23T10:12:32Z","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2023_rp/344"}],"language":[{"iso":"eng"}]},{"file_date_updated":"2023-05-30T11:43:18Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"citation":{"ieee":"A. Koch, <i>Privacy-Preserving Collection and Evaluation of Log Files</i>. 2023.","apa":"Koch, A. (2023). <i>Privacy-Preserving Collection and Evaluation of Log Files</i>.","chicago":"Koch, Angelina. <i>Privacy-Preserving Collection and Evaluation of Log Files</i>, 2023.","short":"A. Koch, Privacy-Preserving Collection and Evaluation of Log Files, 2023.","mla":"Koch, Angelina. <i>Privacy-Preserving Collection and Evaluation of Log Files</i>. 2023.","bibtex":"@book{Koch_2023, title={Privacy-Preserving Collection and Evaluation of Log Files}, author={Koch, Angelina}, year={2023} }","ama":"Koch A. <i>Privacy-Preserving Collection and Evaluation of Log Files</i>.; 2023."},"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"}],"file":[{"date_updated":"2023-05-30T11:43:18Z","relation":"main_file","file_size":2275949,"access_level":"open_access","file_name":"thesis_koch.pdf","content_type":"application/pdf","file_id":"45303","creator":"feidens","date_created":"2023-05-26T07:07:39Z"}],"date_created":"2023-04-03T14:09:14Z","type":"bachelorsthesis","oa":"1","department":[{"_id":"64"}],"year":"2023","title":"Privacy-Preserving Collection and Evaluation of Log Files","status":"public","author":[{"full_name":"Koch, Angelina","last_name":"Koch","first_name":"Angelina"}],"date_updated":"2023-05-30T11:43:18Z","has_accepted_license":"1","_id":"43375","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"25078"},{"project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"citation":{"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.","short":"J. Blömer, J. Bobolz, H. Bröcher, in: 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.","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.","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.","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} }","mla":"Blömer, Johannes, et al. <i>On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC</i>. 2023."},"oa":"1","department":[{"_id":"34"},{"_id":"64"}],"type":"conference","date_created":"2022-12-28T16:02:11Z","date_updated":"2023-09-07T10:01:00Z","conference":{"name":"TCC 2023","start_date":"2023-11-29","location":"Taipeh, Taiwan","end_date":"2023-12-02"},"author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"last_name":"Bobolz","first_name":"Jan","full_name":"Bobolz, Jan","id":"27207"},{"id":"41047","last_name":"Bröcher","first_name":"Henrik","full_name":"Bröcher, Henrik"}],"title":"On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC","year":"2023","status":"public","user_id":"41047","language":[{"iso":"eng"}],"_id":"35014","main_file_link":[{"url":"https://eprint.iacr.org/2022/1762","open_access":"1"}]},{"oa":"1","department":[{"_id":"64"}],"type":"conference","date_created":"2023-04-12T08:18:41Z","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"citation":{"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} }","mla":"Blömer, Johannes, et al. <i>A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices</i>. 2023.","short":"J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.","chicago":"Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” 2023.","apa":"Blömer, J., Bobolz, J., &#38; Porzenheim, L. A. (2023). <i>A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices</i>. Asiacrypt 2023, Guangzhou, China.","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."},"user_id":"47434","language":[{"iso":"eng"}],"_id":"43458","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/464"}],"date_updated":"2023-09-07T09:53:26Z","conference":{"end_date":"2023-12-08","location":"Guangzhou, China","name":"Asiacrypt 2023","start_date":"2023-12-04"},"author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"first_name":"Jan","last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207"},{"full_name":"Porzenheim, Laurens Alexander","first_name":"Laurens Alexander","last_name":"Porzenheim","id":"47434"}],"title":"A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices","year":"2023","status":"public"},{"user_id":"25078","language":[{"iso":"eng"}],"_id":"32399","date_updated":"2022-07-26T14:31:54Z","year":"2022","title":"Modelling and Proving Security for a Secure MPC Protocol for Stable Matching","status":"public","author":[{"full_name":"Vahle, Ella","last_name":"Vahle","first_name":"Ella"}],"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2022-07-20T09:38:39Z","project":[{"_id":"1","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"}],"citation":{"ieee":"E. Vahle, <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>. 2022.","apa":"Vahle, E. (2022). <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>.","chicago":"Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>, 2022.","short":"E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable Matching, 2022.","mla":"Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>. 2022.","bibtex":"@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }","ama":"Vahle E. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>.; 2022."},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}]},{"date_updated":"2022-11-18T09:38:04Z","author":[{"full_name":"Siek, Hanna","first_name":"Hanna","last_name":"Siek"}],"status":"public","year":"2022","title":"Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes","user_id":"477","_id":"32398","language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"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"}],"citation":{"short":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","chicago":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>, 2022.","apa":"Siek, H. (2022). <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.","ieee":"H. Siek, <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022.","ama":"Siek H. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.; 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. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"department":[{"_id":"64"},{"_id":"7"}],"type":"bachelorsthesis","date_created":"2022-07-20T09:36:39Z"},{"citation":{"short":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","chicago":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>, 2022.","apa":"Kramer, P. (2022). <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.","ieee":"P. Kramer, <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","ama":"Kramer P. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.; 2022.","bibtex":"@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to the Ring Setting}, author={Kramer, Paul}, year={2022} }","mla":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022."},"extern":"1","project":[{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901: SFB 901","_id":"1"}],"date_created":"2022-05-28T08:07:40Z","type":"mastersthesis","department":[{"_id":"7"},{"_id":"64"}],"status":"public","title":"On Transforming Lattice-Based Cryptography to the Ring Setting","year":"2022","author":[{"first_name":"Paul","last_name":"Kramer","full_name":"Kramer, Paul","id":"64594"}],"date_updated":"2022-11-18T09:40:28Z","_id":"31485","language":[{"iso":"eng"}],"user_id":"477"},{"user_id":"41047","language":[{"iso":"eng"}],"_id":"34962","date_updated":"2023-01-10T10:31:35Z","author":[{"full_name":"Anonymous, A","first_name":"A","last_name":"Anonymous"}],"title":"Evaluating database systems relying on secure multiparty computation","status":"public","year":"2022","department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis","date_created":"2022-12-24T00:14:34Z","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"}],"citation":{"apa":"Anonymous, A. (2022). <i>Evaluating database systems relying on secure multiparty computation</i>.","ieee":"A. Anonymous, <i>Evaluating database systems relying on secure multiparty computation</i>. 2022.","chicago":"Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>, 2022.","short":"A. Anonymous, Evaluating Database Systems Relying on Secure Multiparty Computation, 2022.","mla":"Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>. 2022.","ama":"Anonymous A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>.; 2022.","bibtex":"@book{Anonymous_2022, title={Evaluating database systems relying on secure multiparty computation}, author={Anonymous, A}, year={2022} }"},"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}]},{"author":[{"full_name":"Anonymous, A","last_name":"Anonymous","first_name":"A"}],"title":"Cost of Privacy-preserving SMPC Protocols for NN-Based Inference","year":"2022","status":"public","date_updated":"2023-01-10T10:31:49Z","language":[{"iso":"eng"}],"_id":"34963","user_id":"41047","citation":{"ieee":"A. Anonymous, <i>Cost of Privacy-preserving SMPC Protocols for NN-Based Inference</i>. 2022.","apa":"Anonymous, A. (2022). <i>Cost of Privacy-preserving SMPC Protocols for NN-Based Inference</i>.","chicago":"Anonymous, A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>, 2022.","short":"A. Anonymous, Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference, 2022.","mla":"Anonymous, A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>. 2022.","bibtex":"@book{Anonymous_2022, title={Cost of Privacy-preserving SMPC Protocols for NN-Based Inference}, author={Anonymous, A}, year={2022} }","ama":"Anonymous A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>.; 2022."},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"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_created":"2022-12-24T00:16:39Z","department":[{"_id":"34"},{"_id":"64"}],"type":"mastersthesis"},{"citation":{"chicago":"Eidens, Fabian. <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1653\">https://doi.org/10.17619/UNIPB/1-1653</a>.","short":"F. Eidens, Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials, 2022.","apa":"Eidens, F. (2022). <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1653\">https://doi.org/10.17619/UNIPB/1-1653</a>","ieee":"F. Eidens, <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>. 2022.","ama":"Eidens F. <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1653\">10.17619/UNIPB/1-1653</a>","bibtex":"@book{Eidens_2022, title={Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1653\">10.17619/UNIPB/1-1653</a>}, author={Eidens, Fabian}, year={2022} }","mla":"Eidens, Fabian. <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1653\">10.17619/UNIPB/1-1653</a>."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"}],"date_created":"2023-01-04T09:01:48Z","type":"dissertation","department":[{"_id":"64"}],"status":"public","title":"Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials","year":"2022","author":[{"id":"25078","first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian"}],"date_updated":"2023-02-08T21:07:41Z","language":[{"iso":"eng"}],"_id":"35188","user_id":"25078","doi":"10.17619/UNIPB/1-1653"},{"date_created":"2021-10-21T07:51:32Z","type":"preprint","oa":"1","department":[{"_id":"64"}],"citation":{"mla":"Bobolz, Jan, et al. <i>Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes</i>. IACR eprint, 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} }","ama":"Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 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.","apa":"Bobolz, J., Eidens, F., Heitjohann, R., &#38; Fell, J. (2021). <i>Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes</i>. IACR eprint.","short":"J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (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."},"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"82","name":"SFB 901 - Project Area T"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"main_file_link":[{"url":"https://eprint.iacr.org/2021/961","open_access":"1"}],"_id":"26645","publisher":"IACR eprint","language":[{"iso":"eng"}],"user_id":"477","status":"public","year":"2021","title":"Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes","author":[{"id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz","first_name":"Jan"},{"id":"25078","last_name":"Eidens","first_name":"Fabian","full_name":"Eidens, Fabian"},{"full_name":"Heitjohann, Raphael","last_name":"Heitjohann","first_name":"Raphael"},{"full_name":"Fell, Jeremy","last_name":"Fell","first_name":"Jeremy"}],"date_updated":"2022-11-18T09:38:42Z"},{"doi":"10.1007/978-3-030-92548-2_9","user_id":"27207","language":[{"iso":"eng"}],"_id":"29566","publisher":"Springer International Publishing","date_updated":"2022-01-27T13:02:23Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030925475","9783030925482"]},"author":[{"full_name":"Bobolz, Jan","first_name":"Jan","last_name":"Bobolz","id":"27207"},{"last_name":"Eidens","first_name":"Fabian","full_name":"Eidens, Fabian","id":"25078"},{"full_name":"Krenn, Stephan","first_name":"Stephan","last_name":"Krenn"},{"first_name":"Sebastian","last_name":"Ramacher","full_name":"Ramacher, Sebastian"},{"full_name":"Samelin, Kai","first_name":"Kai","last_name":"Samelin"}],"status":"public","title":"Issuer-Hiding Attribute-Based Credentials","year":"2021","department":[{"_id":"7"},{"_id":"64"}],"type":"conference","place":"Cham","date_created":"2022-01-27T13:00:21Z","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"}],"citation":{"mla":"Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” <i>Cryptology and Network Security</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>.","ama":"Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based Credentials. In: <i>Cryptology and Network Security</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham}, title={Issuer-Hiding Attribute-Based Credentials}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>}, 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} }","apa":"Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., &#38; Samelin, K. (2021). Issuer-Hiding Attribute-Based Credentials. <i>Cryptology and Network Security</i>. <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">https://doi.org/10.1007/978-3-030-92548-2_9</a>","ieee":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding Attribute-Based Credentials,” 2021, doi: <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>.","short":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021.","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai Samelin. “Issuer-Hiding Attribute-Based Credentials.” In <i>Cryptology and Network Security</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">https://doi.org/10.1007/978-3-030-92548-2_9</a>."},"publication":"Cryptology and Network Security"},{"language":[{"iso":"eng"}],"title":"A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes","year":"2020","author":[{"first_name":"Patrick","last_name":"Schürmann","full_name":"Schürmann, Patrick"}],"date_updated":"2022-01-06T06:53:50Z","file":[{"date_created":"2020-10-23T08:36:34Z","description":"This is a bachelor thesis.","creator":"feidens","content_type":"application/pdf","file_id":"20186","access_level":"open_access","file_size":1060142,"file_name":"thesis_schuermann_published.pdf","date_updated":"2020-10-23T08:36:34Z","relation":"main_file"}],"date_created":"2020-08-29T13:24:51Z","type":"bachelorsthesis","department":[{"_id":"7"},{"_id":"64"}],"extern":"1","publisher":"Universität Paderborn","_id":"18637","ddc":["000"],"user_id":"25078","status":"public","has_accepted_license":"1","oa":"1","file_date_updated":"2020-10-23T08:36:34Z","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"citation":{"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} }","ama":"Schürmann P. <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn; 2020.","mla":"Schürmann, Patrick. <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. 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.","chicago":"Schürmann, Patrick. <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn, 2020.","ieee":"P. Schürmann, <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn, 2020.","apa":"Schürmann, P. (2020). <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}]},{"user_id":"477","_id":"18639","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:50Z","author":[{"first_name":"Tobias","last_name":"Terfort","full_name":"Terfort, Tobias"}],"year":"2020","status":"public","title":"Enhancing Security by Usage of Universal One-Way Hash Functions","department":[{"_id":"7"},{"_id":"64"}],"type":"bachelorsthesis","date_created":"2020-08-29T13:30:56Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"citation":{"mla":"Terfort, Tobias. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. 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} }","ama":"Terfort T. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn; 2020.","ieee":"T. Terfort, <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn, 2020.","apa":"Terfort, T. (2020). <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn.","chicago":"Terfort, Tobias. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn, 2020.","short":"T. Terfort, Enhancing Security by Usage of Universal One-Way Hash Functions, Universität Paderborn, 2020."},"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}]},{"publisher":"ACM","_id":"16487","user_id":"477","ddc":["000"],"conference":{"name":"ASIA CCS'20","location":"Taiwan"},"status":"public","has_accepted_license":"1","place":"New York, NY, USA","oa":"1","citation":{"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.","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph Striecks. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” In <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM, 2020. <a href=\"https://doi.org/10.1145/3320269.3384769\">https://doi.org/10.1145/3320269.3384769</a>.","ieee":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, and C. Striecks, “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection,” in <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i> Taiwan, 2020.","apa":"Bobolz, J., Eidens, F., Krenn, S., Slamanig, D., &#38; Striecks, C. (2020). Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3320269.3384769\">https://doi.org/10.1145/3320269.3384769</a>","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Slamanig_Striecks_2020, place={New York, NY, USA}, title={Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection}, DOI={<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>}, 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} }","ama":"Bobolz J, Eidens F, Krenn S, Slamanig D, Striecks C. Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In: <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>","mla":"Bobolz, Jan, et al. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i> ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>."},"file_date_updated":"2020-04-09T09:59:03Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"_id":"82","name":"SFB 901 - Project Area T"}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2020/382","open_access":"1"}],"doi":"10.1145/3320269.3384769","author":[{"full_name":"Bobolz, Jan","first_name":"Jan","last_name":"Bobolz","id":"27207"},{"full_name":"Eidens, Fabian","last_name":"Eidens","first_name":"Fabian","id":"25078"},{"first_name":"Stephan","last_name":"Krenn","full_name":"Krenn, Stephan"},{"last_name":"Slamanig","first_name":"Daniel","full_name":"Slamanig, Daniel"},{"last_name":"Striecks","first_name":"Christoph","full_name":"Striecks, Christoph"}],"title":"Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection","year":"2020","date_updated":"2022-01-06T06:52:51Z","date_created":"2020-04-09T10:00:29Z","file":[{"date_created":"2020-04-09T09:59:03Z","creator":"feidens","success":1,"content_type":"application/pdf","file_id":"16488","access_level":"closed","file_size":553623,"file_name":"main.pdf","date_updated":"2020-04-09T09:59:03Z","relation":"main_file"}],"department":[{"_id":"64"}],"type":"conference","publication":"Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),"},{"date_updated":"2022-10-17T10:56:59Z","author":[{"full_name":"Kramer, Paul","last_name":"Kramer","first_name":"Paul","id":"64594"}],"status":"public","title":"Comparison of Zero-Knowledge Range Proofs","year":"2020","user_id":"25078","_id":"18638","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"citation":{"bibtex":"@book{Kramer_2020, title={Comparison of Zero-Knowledge Range Proofs}, publisher={Universität Paderborn}, author={Kramer, Paul}, year={2020} }","ama":"Kramer P. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn; 2020.","mla":"Kramer, Paul. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","chicago":"Kramer, Paul. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","short":"P. Kramer, Comparison of Zero-Knowledge Range Proofs, Universität Paderborn, 2020.","ieee":"P. Kramer, <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","apa":"Kramer, P. (2020). <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"department":[{"_id":"7"},{"_id":"64"}],"type":"bachelorsthesis","date_created":"2020-08-29T13:27:11Z"},{"type":"mastersthesis","department":[{"_id":"64"}],"file":[{"relation":"main_file","date_updated":"2020-10-30T15:59:34Z","file_name":"thesis_broecher.pdf","file_size":746819,"access_level":"open_access","file_id":"13129","content_type":"application/pdf","creator":"bhenrik","date_created":"2019-09-04T07:59:31Z"}],"date_created":"2019-09-04T08:04:12Z","extern":"1","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:28Z","year":"2019","title":"Rational Secure Multiparty Computation","author":[{"full_name":"Bröcher, Henrik","first_name":"Henrik","last_name":"Bröcher","id":"41047"}],"oa":"1","project":[{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2020-10-30T15:59:34Z","supervisor":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"citation":{"ieee":"H. Bröcher, <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019.","apa":"Bröcher, H. (2019). <i>Rational Secure Multiparty Computation</i>. Universität Paderborn.","chicago":"Bröcher, Henrik. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019.","short":"H. Bröcher, Rational Secure Multiparty Computation, Universität Paderborn, 2019.","mla":"Bröcher, Henrik. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019.","bibtex":"@book{Bröcher_2019, title={Rational Secure Multiparty Computation}, publisher={Universität Paderborn}, author={Bröcher, Henrik}, year={2019} }","ama":"Bröcher H. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn; 2019."},"ddc":["000"],"user_id":"25078","_id":"13128","publisher":"Universität Paderborn","has_accepted_license":"1","status":"public"},{"date_created":"2019-10-03T12:30:24Z","department":[{"_id":"7"},{"_id":"64"}],"type":"bachelorsthesis","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"citation":{"mla":"Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn, 2019.","ama":"Pilot M. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. 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} }","apa":"Pilot, M. (2019). <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn.","ieee":"M. Pilot, <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn, 2019.","short":"M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java, Universität Paderborn, 2019.","chicago":"Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn, 2019."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"extern":"1","language":[{"iso":"eng"}],"_id":"13592","publisher":"Universität Paderborn","user_id":"477","author":[{"full_name":"Pilot, Matthias","first_name":"Matthias","last_name":"Pilot"}],"title":"Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java","year":"2019","status":"public","date_updated":"2022-01-06T06:51:40Z"}]