[{"_id":"35772","department":[{"_id":"64"}],"user_id":"47434","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2023-01-10T11:54:43Z","author":[{"first_name":"Jan","last_name":"Lohse","full_name":"Lohse, Jan"}],"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2023-01-10T10:39:27Z","title":"Lattice Revocation Mechanisms","year":"2022","citation":{"ama":"Lohse J. <i>Lattice Revocation Mechanisms</i>.; 2022.","chicago":"Lohse, Jan. <i>Lattice Revocation Mechanisms</i>, 2022.","ieee":"J. Lohse, <i>Lattice Revocation Mechanisms</i>. 2022.","short":"J. Lohse, Lattice Revocation Mechanisms, 2022.","bibtex":"@book{Lohse_2022, title={Lattice Revocation Mechanisms}, author={Lohse, Jan}, year={2022} }","mla":"Lohse, Jan. <i>Lattice Revocation Mechanisms</i>. 2022.","apa":"Lohse, J. (2022). <i>Lattice Revocation Mechanisms</i>."}},{"_id":"35188","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"}],"department":[{"_id":"64"}],"user_id":"25078","language":[{"iso":"eng"}],"type":"dissertation","status":"public","date_updated":"2023-02-08T21:07:41Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_created":"2023-01-04T09:01:48Z","author":[{"full_name":"Eidens, Fabian","id":"25078","last_name":"Eidens","first_name":"Fabian"}],"title":"Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials","doi":"10.17619/UNIPB/1-1653","year":"2022","citation":{"ieee":"F. Eidens, <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>. 2022.","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>.","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>","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>","short":"F. Eidens, Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials, 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>.","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} }"}},{"citation":{"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.","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.","bibtex":"@book{Anonymous_2022, title={ Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development}, author={Anonymous, Anonymous}, year={2022} }","apa":"Anonymous, A. (2022). <i> Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development</i>."},"year":"2022","title":" Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_created":"2023-05-24T09:58:30Z","author":[{"first_name":"Anonymous","last_name":"Anonymous","full_name":"Anonymous, Anonymous"}],"date_updated":"2023-05-24T09:58:33Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"department":[{"_id":"64"}],"user_id":"47434","_id":"45255"},{"year":"2022","citation":{"apa":"Anonymous, A. (2022). <i>A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries</i>.","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.","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.","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."},"date_updated":"2023-05-24T09:59:37Z","author":[{"last_name":"Anonymous","full_name":"Anonymous, Anonymous","first_name":"Anonymous"}],"date_created":"2023-05-24T09:59:34Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"title":"A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries","type":"mastersthesis","status":"public","_id":"45256","department":[{"_id":"64"}],"user_id":"47434","language":[{"iso":"eng"}]},{"date_updated":"2023-05-24T10:01:36Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2023-05-24T10:01:33Z","author":[{"last_name":"Beckmann","full_name":"Beckmann, Marvin","first_name":"Marvin"}],"title":"Analysis of an Interactive Lattice Based Aggregated Signature Scheme","year":"2022","citation":{"apa":"Beckmann, M. (2022). <i>Analysis of an Interactive Lattice Based Aggregated Signature Scheme</i>.","mla":"Beckmann, Marvin. <i>Analysis of an Interactive Lattice Based Aggregated Signature Scheme</i>. 2022.","bibtex":"@book{Beckmann_2022, title={Analysis of an Interactive Lattice Based Aggregated Signature Scheme}, author={Beckmann, Marvin}, year={2022} }","short":"M. Beckmann, Analysis of an Interactive Lattice Based Aggregated Signature Scheme, 2022.","ama":"Beckmann M. <i>Analysis of an Interactive Lattice Based Aggregated Signature Scheme</i>.; 2022.","ieee":"M. Beckmann, <i>Analysis of an Interactive Lattice Based Aggregated Signature Scheme</i>. 2022.","chicago":"Beckmann, Marvin. <i>Analysis of an Interactive Lattice Based Aggregated Signature Scheme</i>, 2022."},"_id":"45257","user_id":"47434","department":[{"_id":"64"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"year":"2021","citation":{"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.","ama":"Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 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.","mla":"Bobolz, Jan, et al. <i>Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes</i>. IACR eprint, 2021.","short":"J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (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} }"},"date_updated":"2022-11-18T09:38:42Z","publisher":"IACR eprint","oa":"1","date_created":"2021-10-21T07:51:32Z","author":[{"first_name":"Jan","last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207"},{"last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian"},{"last_name":"Heitjohann","full_name":"Heitjohann, Raphael","first_name":"Raphael"},{"first_name":"Jeremy","full_name":"Fell, Jeremy","last_name":"Fell"}],"title":"Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes","main_file_link":[{"url":"https://eprint.iacr.org/2021/961","open_access":"1"}],"type":"preprint","status":"public","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Project Area T","_id":"82"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"26645","user_id":"477","department":[{"_id":"64"}],"language":[{"iso":"eng"}]},{"date_created":"2022-01-27T13:00:21Z","author":[{"id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz","first_name":"Jan"},{"first_name":"Fabian","last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian"},{"full_name":"Krenn, Stephan","last_name":"Krenn","first_name":"Stephan"},{"first_name":"Sebastian","last_name":"Ramacher","full_name":"Ramacher, Sebastian"},{"first_name":"Kai","last_name":"Samelin","full_name":"Samelin, Kai"}],"publisher":"Springer International Publishing","date_updated":"2022-01-27T13:02:23Z","doi":"10.1007/978-3-030-92548-2_9","title":"Issuer-Hiding Attribute-Based Credentials","publication_status":"published","publication_identifier":{"isbn":["9783030925475","9783030925482"],"issn":["0302-9743","1611-3349"]},"citation":{"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>","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>.","short":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021.","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} }","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>.","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>.","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>"},"place":"Cham","year":"2021","user_id":"27207","department":[{"_id":"7"},{"_id":"64"}],"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"}],"_id":"29566","language":[{"iso":"eng"}],"type":"conference","publication":"Cryptology and Network Security","status":"public"},{"year":"2021","citation":{"ama":"Siemer JN. <i>Lattice Reductions and Their Applications to Cryptographic Systems</i>.; 2021.","ieee":"J. N. Siemer, <i>Lattice reductions and their applications to cryptographic systems</i>. 2021.","chicago":"Siemer, Jan Niklas. <i>Lattice Reductions and Their Applications to Cryptographic Systems</i>, 2021.","apa":"Siemer, J. N. (2021). <i>Lattice reductions and their applications to cryptographic systems</i>.","bibtex":"@book{Siemer_2021, title={Lattice reductions and their applications to cryptographic systems}, author={Siemer, Jan Niklas}, year={2021} }","mla":"Siemer, Jan Niklas. <i>Lattice Reductions and Their Applications to Cryptographic Systems</i>. 2021.","short":"J.N. Siemer, Lattice Reductions and Their Applications to Cryptographic Systems, 2021."},"title":"Lattice reductions and their applications to cryptographic systems","date_updated":"2023-01-10T10:49:33Z","date_created":"2022-07-20T11:40:28Z","author":[{"first_name":"Jan Niklas","last_name":"Siemer","full_name":"Siemer, Jan Niklas"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"32401","user_id":"47434","department":[{"_id":"64"}]},{"title":"Performance Analysis of FHE Libraries","date_created":"2022-07-20T11:37:41Z","author":[{"last_name":"Anonymous","full_name":"Anonymous, Anonymous","first_name":"Anonymous"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_updated":"2023-01-10T11:54:39Z","citation":{"ama":"Anonymous A. <i>Performance Analysis of FHE Libraries</i>.; 2021.","ieee":"A. Anonymous, <i>Performance Analysis of FHE Libraries</i>. 2021.","chicago":"Anonymous, 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} }","short":"A. Anonymous, Performance Analysis of FHE Libraries, 2021.","mla":"Anonymous, Anonymous. <i>Performance Analysis of FHE Libraries</i>. 2021."},"year":"2021","language":[{"iso":"eng"}],"department":[{"_id":"64"}],"user_id":"47434","_id":"32400","status":"public","type":"mastersthesis"},{"user_id":"47434","department":[{"_id":"64"}],"_id":"32402","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2022-07-20T11:42:08Z","author":[{"full_name":"Böttger, Meret Amalia Elisabeth","last_name":"Böttger","first_name":"Meret Amalia Elisabeth"}],"date_updated":"2023-01-23T13:03:05Z","title":"IND-CCA Secure PKE Schemes - Based on Lattices","citation":{"chicago":"Böttger, Meret Amalia Elisabeth. <i>IND-CCA Secure PKE Schemes - Based on Lattices</i>, 2021.","ieee":"M. A. E. Böttger, <i>IND-CCA Secure PKE Schemes - Based on Lattices</i>. 2021.","ama":"Böttger MAE. <i>IND-CCA Secure PKE Schemes - Based on Lattices</i>.; 2021.","apa":"Böttger, M. A. E. (2021). <i>IND-CCA Secure PKE Schemes - Based on Lattices</i>.","mla":"Böttger, Meret Amalia Elisabeth. <i>IND-CCA Secure PKE Schemes - Based on Lattices</i>. 2021.","bibtex":"@book{Böttger_2021, title={IND-CCA Secure PKE Schemes - Based on Lattices}, author={Böttger, Meret Amalia Elisabeth}, year={2021} }","short":"M.A.E. Böttger, IND-CCA Secure PKE Schemes - Based on Lattices, 2021."},"year":"2021"},{"title":"Device-Independent Security Proofs Via Entropy Accumulation","date_updated":"2023-05-24T09:57:21Z","date_created":"2023-05-24T09:57:18Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"first_name":"Anonymous","last_name":"Anonymous","full_name":"Anonymous, Anonymous"}],"year":"2021","citation":{"ama":"Anonymous A. <i>Device-Independent Security Proofs Via Entropy Accumulation</i>.; 2021.","ieee":"A. Anonymous, <i>Device-Independent Security Proofs Via Entropy Accumulation</i>. 2021.","chicago":"Anonymous, Anonymous. <i>Device-Independent Security Proofs Via Entropy Accumulation</i>, 2021.","apa":"Anonymous, A. (2021). <i>Device-Independent Security Proofs Via Entropy Accumulation</i>.","mla":"Anonymous, Anonymous. <i>Device-Independent Security Proofs Via Entropy Accumulation</i>. 2021.","short":"A. Anonymous, Device-Independent Security Proofs Via Entropy Accumulation, 2021.","bibtex":"@book{Anonymous_2021, title={Device-Independent Security Proofs Via Entropy Accumulation}, author={Anonymous, Anonymous}, year={2021} }"},"language":[{"iso":"eng"}],"_id":"45254","user_id":"47434","department":[{"_id":"64"}],"status":"public","type":"mastersthesis"},{"year":"2020","citation":{"ama":"Manegold P. <i>On Batch Proofs of Partial Knowledge</i>.; 2020.","chicago":"Manegold, Philipp. <i>On Batch Proofs of Partial Knowledge</i>, 2020.","ieee":"P. Manegold, <i>On Batch Proofs of Partial Knowledge</i>. 2020.","apa":"Manegold, P. (2020). <i>On Batch Proofs of Partial Knowledge</i>.","short":"P. Manegold, On Batch Proofs of Partial Knowledge, 2020.","mla":"Manegold, Philipp. <i>On Batch Proofs of Partial Knowledge</i>. 2020.","bibtex":"@book{Manegold_2020, title={On Batch Proofs of Partial Knowledge}, author={Manegold, Philipp}, year={2020} }"},"title":"On Batch Proofs of Partial Knowledge","date_updated":"2022-01-06T06:54:46Z","date_created":"2021-02-02T10:27:49Z","author":[{"full_name":"Manegold, Philipp","last_name":"Manegold","first_name":"Philipp"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"extern":"1","_id":"21117","department":[{"_id":"7"},{"_id":"64"}],"user_id":"27207"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"7"},{"_id":"64"}],"user_id":"27207","_id":"21118","language":[{"iso":"eng"}],"extern":"1","citation":{"chicago":"Anonymous, Anonymous. <i>Measuring the Performance of SNARK Libraries</i>, 2020.","ieee":"A. Anonymous, <i>Measuring the Performance of SNARK Libraries</i>. 2020.","ama":"Anonymous A. <i>Measuring the Performance of SNARK Libraries</i>.; 2020.","short":"A. Anonymous, Measuring the Performance of SNARK Libraries, 2020.","mla":"Anonymous, Anonymous. <i>Measuring the Performance of SNARK Libraries</i>. 2020.","bibtex":"@book{Anonymous_2020, title={Measuring the Performance of SNARK Libraries}, author={Anonymous, Anonymous}, year={2020} }","apa":"Anonymous, A. (2020). <i>Measuring the Performance of SNARK Libraries</i>."},"year":"2020","author":[{"first_name":"Anonymous","full_name":"Anonymous, Anonymous","last_name":"Anonymous"}],"date_created":"2021-02-02T10:29:30Z","date_updated":"2022-01-06T06:54:46Z","title":"Measuring the Performance of SNARK Libraries"},{"language":[{"iso":"eng"}],"department":[{"_id":"64"}],"user_id":"47434","_id":"21119","status":"public","type":"bachelorsthesis","title":"Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions","date_created":"2021-02-02T10:37:35Z","author":[{"first_name":"Max","full_name":"Westerwelle, Max","last_name":"Westerwelle"}],"date_updated":"2022-01-06T06:54:46Z","citation":{"chicago":"Westerwelle, Max. <i>Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions</i>, 2020.","ieee":"M. Westerwelle, <i>Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions</i>. 2020.","ama":"Westerwelle M. <i>Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions</i>.; 2020.","bibtex":"@book{Westerwelle_2020, title={Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions}, author={Westerwelle, Max}, year={2020} }","short":"M. Westerwelle, Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions, 2020.","mla":"Westerwelle, Max. <i>Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions</i>. 2020.","apa":"Westerwelle, M. (2020). <i>Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions</i>."},"year":"2020"},{"language":[{"iso":"eng"}],"_id":"21121","user_id":"41047","department":[{"_id":"64"},{"_id":"7"}],"status":"public","type":"bachelorsthesis","title":"Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems","date_updated":"2022-01-06T06:54:46Z","date_created":"2021-02-02T10:50:08Z","author":[{"first_name":"Anonymous","last_name":"Anonymous","full_name":"Anonymous, Anonymous"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"year":"2020","citation":{"chicago":"Anonymous, Anonymous. <i>Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems</i>, 2020.","ieee":"A. Anonymous, <i>Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems</i>. 2020.","ama":"Anonymous A. <i>Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems</i>.; 2020.","apa":"Anonymous, A. (2020). <i>Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems</i>.","short":"A. Anonymous, Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems, 2020.","mla":"Anonymous, Anonymous. <i>Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems</i>. 2020.","bibtex":"@book{Anonymous_2020, title={Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems}, author={Anonymous, Anonymous}, year={2020} }"}},{"publication_identifier":{"issn":["1549-6325","1549-6333"]},"publication_status":"published","issue":"4","year":"2020","intvolume":"        16","page":"1-25","citation":{"bibtex":"@article{Blömer_Brauer_Bujna_2020, title={A Complexity Theoretical Study of Fuzzy K-Means}, volume={16}, DOI={<a href=\"https://doi.org/10.1145/3409385\">10.1145/3409385</a>}, number={4}, journal={ACM Transactions on Algorithms}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2020}, pages={1–25} }","mla":"Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.” <i>ACM Transactions on Algorithms</i>, vol. 16, no. 4, 2020, pp. 1–25, doi:<a href=\"https://doi.org/10.1145/3409385\">10.1145/3409385</a>.","short":"J. Blömer, S. Brauer, K. Bujna, ACM Transactions on Algorithms 16 (2020) 1–25.","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2020). A Complexity Theoretical Study of Fuzzy K-Means. <i>ACM Transactions on Algorithms</i>, <i>16</i>(4), 1–25. <a href=\"https://doi.org/10.1145/3409385\">https://doi.org/10.1145/3409385</a>","ama":"Blömer J, Brauer S, Bujna K. A Complexity Theoretical Study of Fuzzy K-Means. <i>ACM Transactions on Algorithms</i>. 2020;16(4):1-25. doi:<a href=\"https://doi.org/10.1145/3409385\">10.1145/3409385</a>","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical Study of Fuzzy K-Means.” <i>ACM Transactions on Algorithms</i> 16, no. 4 (2020): 1–25. <a href=\"https://doi.org/10.1145/3409385\">https://doi.org/10.1145/3409385</a>.","ieee":"J. Blömer, S. Brauer, and K. Bujna, “A Complexity Theoretical Study of Fuzzy K-Means,” <i>ACM Transactions on Algorithms</i>, vol. 16, no. 4, pp. 1–25, 2020."},"date_updated":"2022-01-06T06:54:41Z","volume":16,"date_created":"2021-01-08T08:51:42Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"id":"13291","full_name":"Brauer, Sascha","last_name":"Brauer","first_name":"Sascha"},{"first_name":"Kathrin","full_name":"Bujna, Kathrin","last_name":"Bujna"}],"title":"A Complexity Theoretical Study of Fuzzy K-Means","doi":"10.1145/3409385","publication":"ACM Transactions on Algorithms","type":"journal_article","status":"public","_id":"20888","project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"department":[{"_id":"64"}],"user_id":"13291","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:53:26Z","_id":"18085","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_created":"2020-08-20T11:23:11Z","user_id":"13703","author":[{"first_name":"Jonas","full_name":"Heimann, Jonas","last_name":"Heimann"}],"department":[{"_id":"64"}],"title":"Distributed Key Generation for Attribute-Based Signatures","language":[{"iso":"eng"}],"type":"bachelorsthesis","year":"2020","citation":{"apa":"Heimann, J. (2020). <i>Distributed Key Generation for Attribute-Based Signatures</i>.","short":"J. Heimann, Distributed Key Generation for Attribute-Based Signatures, 2020.","mla":"Heimann, Jonas. <i>Distributed Key Generation for Attribute-Based Signatures</i>. 2020.","bibtex":"@book{Heimann_2020, title={Distributed Key Generation for Attribute-Based Signatures}, author={Heimann, Jonas}, year={2020} }","ieee":"J. Heimann, <i>Distributed Key Generation for Attribute-Based Signatures</i>. 2020.","chicago":"Heimann, Jonas. <i>Distributed Key Generation for Attribute-Based Signatures</i>, 2020.","ama":"Heimann J. <i>Distributed Key Generation for Attribute-Based Signatures</i>.; 2020."},"status":"public"},{"type":"bachelorsthesis","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2020-10-23T08:36:34Z","creator":"feidens","date_created":"2020-10-23T08:36:34Z","description":"This is a bachelor thesis.","file_size":1060142,"file_id":"20186","access_level":"open_access","file_name":"thesis_schuermann_published.pdf"}],"status":"public","user_id":"25078","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"}],"_id":"18637","file_date_updated":"2020-10-23T08:36:34Z","language":[{"iso":"eng"}],"extern":"1","ddc":["000"],"has_accepted_license":"1","citation":{"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.","short":"P. Schürmann, A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes, 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.","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} }","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.","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."},"year":"2020","author":[{"full_name":"Schürmann, Patrick","last_name":"Schürmann","first_name":"Patrick"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_created":"2020-08-29T13:24:51Z","publisher":"Universität Paderborn","oa":"1","date_updated":"2022-01-06T06:53:50Z","title":"A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes"},{"year":"2020","citation":{"short":"T. Terfort, 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. <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.","ieee":"T. Terfort, <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn, 2020.","ama":"Terfort T. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn; 2020."},"date_updated":"2022-01-06T06:53:50Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"author":[{"first_name":"Tobias","last_name":"Terfort","full_name":"Terfort, Tobias"}],"date_created":"2020-08-29T13:30:56Z","title":"Enhancing Security by Usage of Universal One-Way Hash Functions","type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"18639","user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"language":[{"iso":"eng"}]},{"oa":"1","date_updated":"2022-01-06T06:52:51Z","author":[{"full_name":"Bobolz, Jan","id":"27207","last_name":"Bobolz","first_name":"Jan"},{"full_name":"Eidens, Fabian","id":"25078","last_name":"Eidens","first_name":"Fabian"},{"first_name":"Stephan","last_name":"Krenn","full_name":"Krenn, Stephan"},{"first_name":"Daniel","last_name":"Slamanig","full_name":"Slamanig, Daniel"},{"full_name":"Striecks, Christoph","last_name":"Striecks","first_name":"Christoph"}],"conference":{"location":"Taiwan","name":"ASIA CCS'20"},"doi":"10.1145/3320269.3384769","main_file_link":[{"url":"https://eprint.iacr.org/2020/382","open_access":"1"}],"has_accepted_license":"1","place":"New York, NY, USA","citation":{"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} }","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.","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>.","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>","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>","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.","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>."},"_id":"16487","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"_id":"82","name":"SFB 901 - Project Area T"}],"department":[{"_id":"64"}],"user_id":"477","file_date_updated":"2020-04-09T09:59:03Z","type":"conference","status":"public","publisher":"ACM","date_created":"2020-04-09T10:00:29Z","title":"Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection","year":"2020","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),","file":[{"date_updated":"2020-04-09T09:59:03Z","creator":"feidens","date_created":"2020-04-09T09:59:03Z","file_size":553623,"file_id":"16488","access_level":"closed","file_name":"main.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}]}]