[{"date_updated":"2026-02-04T14:20:16Z","title":"Clustering with Rényi Divergence","year":"2025","status":"public","author":[{"first_name":"A","last_name":"Anonymous","full_name":"Anonymous, A"}],"user_id":"41047","language":[{"iso":"eng"}],"_id":"63408","citation":{"mla":"Anonymous, A. <i>Clustering with Rényi Divergence</i>. 2025.","bibtex":"@book{Anonymous_2025, title={Clustering with Rényi Divergence}, author={Anonymous, A}, year={2025} }","ama":"Anonymous A. <i>Clustering with Rényi Divergence</i>.; 2025.","ieee":"A. Anonymous, <i>Clustering with Rényi Divergence</i>. 2025.","apa":"Anonymous, A. (2025). <i>Clustering with Rényi Divergence</i>.","chicago":"Anonymous, A. <i>Clustering with Rényi Divergence</i>, 2025.","short":"A. Anonymous, Clustering with Rényi Divergence, 2025."},"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"type":"mastersthesis","department":[{"_id":"34"},{"_id":"64"}],"date_created":"2025-12-23T11:35:05Z"},{"citation":{"apa":"Anonymous, A. (2023). <i>Private Set Intersection using Third Generation FHE</i>.","ieee":"A. Anonymous, <i>Private Set Intersection using Third Generation FHE</i>. 2023.","chicago":"Anonymous, A. <i>Private Set Intersection Using Third Generation FHE</i>, 2023.","short":"A. Anonymous, Private Set Intersection Using Third Generation FHE, 2023.","mla":"Anonymous, A. <i>Private Set Intersection Using Third Generation FHE</i>. 2023.","ama":"Anonymous A. <i>Private Set Intersection Using Third Generation FHE</i>.; 2023.","bibtex":"@book{Anonymous_2023, title={Private Set Intersection using Third Generation FHE}, author={Anonymous, A.}, year={2023} }"},"date_created":"2023-10-05T13:55:55Z","department":[{"_id":"34"},{"_id":"64"}],"type":"mastersthesis","author":[{"full_name":"Anonymous, A.","last_name":"Anonymous","first_name":"A."}],"title":"Private Set Intersection using Third Generation FHE","year":"2023","status":"public","date_updated":"2023-10-05T13:56:00Z","language":[{"iso":"eng"}],"_id":"47658","user_id":"41047"},{"_id":"47659","language":[{"iso":"eng"}],"user_id":"41047","author":[{"last_name":"Anonymous","first_name":"A.","full_name":"Anonymous, A."}],"title":"Rational Models in Cryptography Applied to Matching","status":"public","year":"2023","date_updated":"2023-10-05T13:58:35Z","date_created":"2023-10-05T13:58:18Z","department":[{"_id":"34"},{"_id":"64"}],"type":"mastersthesis","citation":{"ama":"Anonymous A. <i>Rational Models in Cryptography Applied to Matching</i>.; 2023.","bibtex":"@book{Anonymous_2023, title={Rational Models in Cryptography Applied to Matching}, author={Anonymous, A.}, year={2023} }","mla":"Anonymous, A. <i>Rational Models in Cryptography Applied to Matching</i>. 2023.","short":"A. Anonymous, Rational Models in Cryptography Applied to Matching, 2023.","chicago":"Anonymous, A. <i>Rational Models in Cryptography Applied to Matching</i>, 2023.","apa":"Anonymous, A. (2023). <i>Rational Models in Cryptography Applied to Matching</i>.","ieee":"A. Anonymous, <i>Rational Models in Cryptography Applied to Matching</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"}],"extern":"1","citation":{"bibtex":"@book{Pilot_2023, title={Updatable Privacy-Preserving Reputation System based on Blockchain}, author={Pilot, Matthias}, year={2023} }","ama":"Pilot M. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>.; 2023.","mla":"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.","chicago":"Pilot, Matthias. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>, 2023.","ieee":"M. Pilot, <i>Updatable Privacy-Preserving Reputation System based on Blockchain</i>. 2023.","apa":"Pilot, M. (2023). <i>Updatable Privacy-Preserving Reputation System based on Blockchain</i>."},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"department":[{"_id":"7"},{"_id":"64"}],"type":"mastersthesis","date_created":"2023-01-26T16:07:19Z","date_updated":"2023-01-26T16:08:11Z","author":[{"last_name":"Pilot","first_name":"Matthias","full_name":"Pilot, Matthias"}],"year":"2023","status":"public","title":"Updatable Privacy-Preserving Reputation System based on Blockchain","user_id":"27207","language":[{"iso":"eng"}],"_id":"40440"},{"status":"public","title":" A Formal Comparison of Advanced Digital Signature Primitives","year":"2023","author":[{"last_name":"Schürmann","first_name":"Patrick","full_name":"Schürmann, Patrick"}],"date_updated":"2023-04-25T22:43:21Z","has_accepted_license":"1","_id":"43374","language":[{"iso":"eng"}],"user_id":"41047","ddc":["000"],"file_date_updated":"2023-04-25T10:49:36Z","citation":{"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.","apa":"Schürmann, P. (2023). <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.","ieee":"P. Schürmann, <i> A Formal Comparison of Advanced Digital Signature Primitives</i>. 2023.","ama":"Schürmann P. <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} }","mla":"Schürmann, Patrick. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>. 2023."},"supervisor":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"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"}],"file":[{"file_size":1367369,"access_level":"open_access","file_name":"masters_thesis_schuermann.pdf","date_updated":"2023-04-25T10:49:36Z","relation":"main_file","content_type":"application/pdf","file_id":"44177","title":" A Formal Comparison of Advanced Digital Signature Primitives","creator":"bhenrik","date_created":"2023-04-25T10:49:36Z"}],"date_created":"2023-04-03T14:07:32Z","type":"mastersthesis","department":[{"_id":"64"}],"oa":"1"},{"year":"2022","status":"public","title":"On Transforming Lattice-Based Cryptography to the Ring Setting","author":[{"id":"64594","first_name":"Paul","last_name":"Kramer","full_name":"Kramer, Paul"}],"date_updated":"2022-11-18T09:40:28Z","language":[{"iso":"eng"}],"_id":"31485","user_id":"477","citation":{"bibtex":"@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to the Ring Setting}, author={Kramer, Paul}, year={2022} }","ama":"Kramer P. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.; 2022.","mla":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","chicago":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>, 2022.","short":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","ieee":"P. Kramer, <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>."},"extern":"1","project":[{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"name":"SFB 901: SFB 901","_id":"1"}],"date_created":"2022-05-28T08:07:40Z","type":"mastersthesis","department":[{"_id":"7"},{"_id":"64"}]},{"status":"public","title":"Cost of Privacy-preserving SMPC Protocols for NN-Based Inference","year":"2022","author":[{"first_name":"A","last_name":"Anonymous","full_name":"Anonymous, A"}],"date_updated":"2023-01-10T10:31:49Z","_id":"34963","language":[{"iso":"eng"}],"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>.","short":"A. Anonymous, Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference, 2022.","chicago":"Anonymous, A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>, 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":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"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":"2022-12-24T00:16:39Z","type":"mastersthesis","department":[{"_id":"34"},{"_id":"64"}]},{"citation":{"bibtex":"@book{Anonymous_2022, title={ Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development}, author={Anonymous, Anonymous}, year={2022} }","ama":"Anonymous A. <i> Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development</i>.; 2022.","mla":"Anonymous, Anonymous. <i> Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development</i>. 2022.","short":"A. Anonymous,  Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development, 2022.","chicago":"Anonymous, Anonymous. <i> Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development</i>, 2022.","ieee":"A. Anonymous, <i> Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development</i>. 2022.","apa":"Anonymous, A. (2022). <i> Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development</i>."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"department":[{"_id":"64"}],"type":"mastersthesis","date_created":"2023-05-24T09:58:30Z","date_updated":"2023-05-24T09:58:33Z","author":[{"full_name":"Anonymous, Anonymous","last_name":"Anonymous","first_name":"Anonymous"}],"status":"public","title":" Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development","year":"2022","user_id":"47434","language":[{"iso":"eng"}],"_id":"45255"},{"date_created":"2023-05-24T09:59:34Z","department":[{"_id":"64"}],"type":"mastersthesis","supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"citation":{"bibtex":"@book{Anonymous_2022, title={A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries}, author={Anonymous, Anonymous}, year={2022} }","ama":"Anonymous A. <i>A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries</i>.; 2022.","mla":"Anonymous, Anonymous. <i>A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries</i>. 2022.","short":"A. Anonymous, A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries, 2022.","chicago":"Anonymous, Anonymous. <i>A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries</i>, 2022.","ieee":"A. Anonymous, <i>A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries</i>. 2022.","apa":"Anonymous, A. (2022). <i>A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries</i>."},"_id":"45256","language":[{"iso":"eng"}],"user_id":"47434","author":[{"full_name":"Anonymous, Anonymous","last_name":"Anonymous","first_name":"Anonymous"}],"status":"public","year":"2022","title":"A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries","date_updated":"2023-05-24T09:59:37Z"},{"date_created":"2022-07-20T11:37:41Z","type":"mastersthesis","department":[{"_id":"64"}],"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"citation":{"short":"A. Anonymous, Performance Analysis of FHE Libraries, 2021.","chicago":"Anonymous, Anonymous. <i>Performance Analysis of FHE Libraries</i>, 2021.","ieee":"A. Anonymous, <i>Performance Analysis of FHE Libraries</i>. 2021.","apa":"Anonymous, A. (2021). <i>Performance Analysis of FHE Libraries</i>.","bibtex":"@book{Anonymous_2021, title={Performance Analysis of FHE Libraries}, author={Anonymous, Anonymous}, year={2021} }","ama":"Anonymous A. <i>Performance Analysis of FHE Libraries</i>.; 2021.","mla":"Anonymous, Anonymous. <i>Performance Analysis of FHE Libraries</i>. 2021."},"language":[{"iso":"eng"}],"_id":"32400","user_id":"47434","year":"2021","title":"Performance Analysis of FHE Libraries","status":"public","author":[{"first_name":"Anonymous","last_name":"Anonymous","full_name":"Anonymous, Anonymous"}],"date_updated":"2023-01-10T11:54:39Z"},{"user_id":"47434","language":[{"iso":"eng"}],"_id":"45254","date_updated":"2023-05-24T09:57:21Z","author":[{"first_name":"Anonymous","last_name":"Anonymous","full_name":"Anonymous, Anonymous"}],"status":"public","title":"Device-Independent Security Proofs Via Entropy Accumulation","year":"2021","department":[{"_id":"64"}],"type":"mastersthesis","date_created":"2023-05-24T09:57:18Z","supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"citation":{"ieee":"A. Anonymous, <i>Device-Independent Security Proofs Via Entropy Accumulation</i>. 2021.","apa":"Anonymous, A. (2021). <i>Device-Independent Security Proofs Via Entropy Accumulation</i>.","chicago":"Anonymous, Anonymous. <i>Device-Independent Security Proofs Via Entropy Accumulation</i>, 2021.","short":"A. Anonymous, Device-Independent Security Proofs Via Entropy Accumulation, 2021.","mla":"Anonymous, Anonymous. <i>Device-Independent Security Proofs Via Entropy Accumulation</i>. 2021.","bibtex":"@book{Anonymous_2021, title={Device-Independent Security Proofs Via Entropy Accumulation}, author={Anonymous, Anonymous}, year={2021} }","ama":"Anonymous A. <i>Device-Independent Security Proofs Via Entropy Accumulation</i>.; 2021."}},{"_id":"15746","language":[{"iso":"eng"}],"user_id":"13703","author":[{"full_name":"Otte, Oliver","first_name":"Oliver","last_name":"Otte"}],"status":"public","year":"2019","title":"Outsourced Decryption of Attribute-based Ciphertexts","date_updated":"2022-01-06T06:52:32Z","date_created":"2020-02-03T09:43:19Z","department":[{"_id":"64"}],"type":"mastersthesis","citation":{"apa":"Otte, O. (2019). <i>Outsourced Decryption of Attribute-based Ciphertexts</i>.","ieee":"O. Otte, <i>Outsourced Decryption of Attribute-based Ciphertexts</i>. 2019.","short":"O. Otte, Outsourced Decryption of Attribute-Based Ciphertexts, 2019.","chicago":"Otte, Oliver. <i>Outsourced Decryption of Attribute-Based Ciphertexts</i>, 2019.","mla":"Otte, Oliver. <i>Outsourced Decryption of Attribute-Based Ciphertexts</i>. 2019.","ama":"Otte O. <i>Outsourced Decryption of Attribute-Based Ciphertexts</i>.; 2019.","bibtex":"@book{Otte_2019, title={Outsourced Decryption of Attribute-based Ciphertexts}, author={Otte, Oliver}, year={2019} }"}},{"date_updated":"2022-01-06T06:51:28Z","title":"Rational Secure Multiparty Computation","year":"2019","author":[{"id":"41047","full_name":"Bröcher, Henrik","last_name":"Bröcher","first_name":"Henrik"}],"language":[{"iso":"eng"}],"extern":"1","type":"mastersthesis","department":[{"_id":"64"}],"file":[{"creator":"bhenrik","date_created":"2019-09-04T07:59:31Z","relation":"main_file","date_updated":"2020-10-30T15:59:34Z","file_name":"thesis_broecher.pdf","access_level":"open_access","file_size":746819,"file_id":"13129","content_type":"application/pdf"}],"date_created":"2019-09-04T08:04:12Z","has_accepted_license":"1","status":"public","user_id":"25078","ddc":["000"],"_id":"13128","publisher":"Universität Paderborn","project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2020-10-30T15:59:34Z","citation":{"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.","apa":"Bröcher, H. (2019). <i>Rational Secure Multiparty Computation</i>. Universität Paderborn.","ieee":"H. Bröcher, <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019.","ama":"Bröcher H. <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} }","mla":"Bröcher, Henrik. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019."},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"oa":"1"},{"date_updated":"2022-01-06T06:50:36Z","has_accepted_license":"1","status":"public","title":"Post-Quantum Secure Group Signatures","year":"2019","author":[{"last_name":"Porzenheim","first_name":"Laurens Alexander","full_name":"Porzenheim, Laurens Alexander","id":"47434"}],"user_id":"47434","ddc":["000"],"_id":"10306","language":[{"iso":"eng"}],"file_date_updated":"2019-06-26T09:19:15Z","citation":{"mla":"Porzenheim, Laurens Alexander. <i>Post-Quantum Secure Group Signatures</i>. 2019.","bibtex":"@book{Porzenheim_2019, title={Post-Quantum Secure Group Signatures}, author={Porzenheim, Laurens Alexander}, year={2019} }","ama":"Porzenheim LA. <i>Post-Quantum Secure Group Signatures</i>.; 2019.","ieee":"L. A. Porzenheim, <i>Post-Quantum Secure Group Signatures</i>. 2019.","apa":"Porzenheim, L. A. (2019). <i>Post-Quantum Secure Group Signatures</i>.","short":"L.A. Porzenheim, Post-Quantum Secure Group Signatures, 2019.","chicago":"Porzenheim, Laurens Alexander. <i>Post-Quantum Secure Group Signatures</i>, 2019."},"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"type":"mastersthesis","department":[{"_id":"64"}],"oa":"1","file":[{"creator":"laurensp","date_created":"2019-06-26T09:08:23Z","date_updated":"2019-06-26T09:19:15Z","relation":"main_file","file_size":899233,"access_level":"open_access","file_name":"thesis_final.pdf","content_type":"application/pdf","file_id":"10307"}],"date_created":"2019-06-26T09:12:47Z"},{"date_updated":"2022-01-06T06:51:41Z","author":[{"full_name":"Scholz, Swante","first_name":"Swante","last_name":"Scholz"}],"title":"Implementation and Comparison of Elliptic Curve Algorithms in Java","year":"2019","language":[{"iso":"eng"}],"extern":"1","department":[{"_id":"7"},{"_id":"64"}],"type":"mastersthesis","date_created":"2019-10-07T09:56:58Z","file":[{"relation":"main_file","date_updated":"2020-04-27T10:33:59Z","file_name":"sscholz-MA-thesis-final.pdf","access_level":"open_access","file_size":1714805,"file_id":"16871","content_type":"application/pdf","creator":"jbobolz","date_created":"2020-04-27T10:32:00Z"}],"has_accepted_license":"1","status":"public","user_id":"477","ddc":["000"],"_id":"13648","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"citation":{"chicago":"Scholz, Swante. <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn, 2019.","short":"S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in Java, Universität Paderborn, 2019.","apa":"Scholz, S. (2019). <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn.","ieee":"S. Scholz, <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn, 2019.","ama":"Scholz S. <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. 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. <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn, 2019."},"supervisor":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"file_date_updated":"2020-04-27T10:33:59Z","oa":"1"},{"date_updated":"2022-01-06T07:02:49Z","status":"public","year":"2017","title":"Semantically Secure Attribute-based Searchable Encryption","author":[{"full_name":"Niehus, David","last_name":"Niehus","first_name":"David"}],"user_id":"477","publisher":"Universität Paderborn","_id":"60","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"bibtex":"@book{Niehus_2017, title={Semantically Secure Attribute-based Searchable Encryption}, publisher={Universität Paderborn}, author={Niehus, David}, year={2017} }","ama":"Niehus D. <i>Semantically Secure Attribute-Based Searchable Encryption</i>. Universität Paderborn; 2017.","mla":"Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>. Universität Paderborn, 2017.","chicago":"Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>. Universität Paderborn, 2017.","short":"D. Niehus, Semantically Secure Attribute-Based Searchable Encryption, Universität Paderborn, 2017.","ieee":"D. Niehus, <i>Semantically Secure Attribute-based Searchable Encryption</i>. Universität Paderborn, 2017.","apa":"Niehus, D. (2017). <i>Semantically Secure Attribute-based Searchable Encryption</i>. Universität Paderborn."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"type":"mastersthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:41:03Z"},{"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"citation":{"chicago":"Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>. Universität Paderborn, 2017.","ama":"Bemmann P. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>. Universität Paderborn; 2017.","short":"P. Bemmann, Attribute-Based Signatures Using Structure Preserving Signatures, Universität Paderborn, 2017.","bibtex":"@book{Bemmann_2017, title={Attribute-based Signatures using Structure Preserving Signatures}, publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2017} }","apa":"Bemmann, P. (2017). <i>Attribute-based Signatures using Structure Preserving Signatures</i>. Universität Paderborn.","mla":"Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>. Universität Paderborn, 2017.","ieee":"P. Bemmann, <i>Attribute-based Signatures using Structure Preserving Signatures</i>. Universität Paderborn, 2017."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:41:14Z","department":[{"_id":"64"}],"type":"mastersthesis","author":[{"id":"32571","full_name":"Bemmann, Pascal","last_name":"Bemmann","first_name":"Pascal"}],"title":"Attribute-based Signatures using Structure Preserving Signatures","year":"2017","status":"public","date_updated":"2022-01-06T06:51:06Z","publisher":"Universität Paderborn","_id":"117","user_id":"25078"},{"user_id":"25078","_id":"2898","date_updated":"2022-01-06T06:58:42Z","year":"2016","title":"Searchable Encryption","status":"public","author":[{"full_name":"Weis, Eduard","first_name":"Eduard","last_name":"Weis"}],"type":"mastersthesis","department":[{"_id":"64"}],"date_created":"2018-05-25T09:43:39Z","citation":{"mla":"Weis, Eduard. <i>Searchable Encryption</i>. 2016.","bibtex":"@book{Weis_2016, title={Searchable Encryption}, author={Weis, Eduard}, year={2016} }","ama":"Weis E. <i>Searchable Encryption</i>.; 2016.","ieee":"E. Weis, <i>Searchable Encryption</i>. 2016.","apa":"Weis, E. (2016). <i>Searchable Encryption</i>.","short":"E. Weis, Searchable Encryption, 2016.","chicago":"Weis, Eduard. <i>Searchable Encryption</i>, 2016."},"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}]},{"type":"mastersthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:41:20Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"citation":{"apa":"Hamm, J. (2016). <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn.","ieee":"J. Hamm, <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","chicago":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","short":"J. Hamm, Symmetric Anonymous Credentials with Protocols for Relations on Attributes, Universität Paderborn, 2016.","mla":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","ama":"Hamm J. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn; 2016.","bibtex":"@book{Hamm_2016, title={Symmetric Anonymous Credentials with Protocols for Relations on Attributes}, publisher={Universität Paderborn}, author={Hamm, Julian}, year={2016} }"},"user_id":"477","publisher":"Universität Paderborn","_id":"146","date_updated":"2022-01-06T06:52:03Z","status":"public","year":"2016","title":"Symmetric Anonymous Credentials with Protocols for Relations on Attributes","author":[{"full_name":"Hamm, Julian","last_name":"Hamm","first_name":"Julian"}]},{"type":"mastersthesis","department":[{"_id":"64"}],"file":[{"date_created":"2018-03-20T07:40:22Z","creator":"florida","file_id":"1432","success":1,"content_type":"application/pdf","file_name":"321-eidens_masterthesis_01.pdf","access_level":"closed","file_size":879285,"relation":"main_file","date_updated":"2018-03-20T07:40:22Z"}],"date_created":"2017-10-17T12:41:54Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-20T07:40:22Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"citation":{"short":"F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption, Universität Paderborn, 2015.","chicago":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","ieee":"F. Eidens, <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","apa":"Eidens, F. (2015). <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn.","bibtex":"@book{Eidens_2015, title={Anonymous credential system based on q-Strong Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2015} }","ama":"Eidens F. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn; 2015.","mla":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015."},"ddc":["040"],"user_id":"477","publisher":"Universität Paderborn","_id":"321","date_updated":"2022-01-06T06:59:05Z","has_accepted_license":"1","status":"public","year":"2015","title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption","author":[{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"}]}]