[{"year":"2016","citation":{"apa":"Porzenheim, L. (2016). <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn.","mla":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","bibtex":"@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim, Laurens}, year={2016} }","short":"L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes, Universität Paderborn, 2016.","ama":"Porzenheim L. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn; 2016.","chicago":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","ieee":"L. Porzenheim, <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn, 2016."},"date_updated":"2022-01-06T06:54:53Z","publisher":"Universität Paderborn","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:33Z","author":[{"full_name":"Porzenheim, Laurens","last_name":"Porzenheim","first_name":"Laurens"}],"title":"Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes","type":"bachelorsthesis","status":"public","_id":"213","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477"},{"status":"public","type":"bachelorsthesis","department":[{"_id":"64"}],"user_id":"477","_id":"214","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"mla":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","short":"K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität Paderborn, 2016.","bibtex":"@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants, and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören}, year={2016} }","apa":"Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn.","chicago":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","ieee":"K. S. Bemmann, <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","ama":"Bemmann KS. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn; 2016."},"year":"2016","title":"Commitment Schemes - Definitions, Variants, and Security","author":[{"first_name":"Kai Sören","full_name":"Bemmann, Kai Sören","last_name":"Bemmann"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:33Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:58Z"},{"ddc":["040"],"file_date_updated":"2018-03-21T12:43:21Z","_id":"167","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"25078","status":"public","file":[{"file_name":"167-thesis_peter_guenther.pdf","access_level":"closed","file_id":"1542","file_size":9456552,"creator":"florida","date_created":"2018-03-21T12:43:21Z","date_updated":"2018-03-21T12:43:21Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"type":"dissertation","title":"Physical attacks on pairing-based cryptography","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:54Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2017-10-17T12:41:24Z","author":[{"first_name":"Peter","last_name":"Günther","full_name":"Günther, Peter"}],"year":"2016","citation":{"mla":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","short":"P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016.","bibtex":"@book{Günther_2016, title={Physical attacks on pairing-based cryptography}, publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }","apa":"Günther, P. (2016). <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn.","ieee":"P. Günther, <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn, 2016.","chicago":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","ama":"Günther P. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn; 2016."},"has_accepted_license":"1"},{"date_created":"2017-10-17T12:41:20Z","author":[{"last_name":"Hamm","full_name":"Hamm, Julian","first_name":"Julian"}],"supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:03Z","title":"Symmetric Anonymous Credentials with Protocols for Relations on Attributes","citation":{"chicago":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","ieee":"J. Hamm, <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.","short":"J. Hamm, Symmetric Anonymous Credentials with Protocols for Relations on Attributes, 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} }","mla":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","apa":"Hamm, J. (2016). <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn."},"year":"2016","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"146","type":"mastersthesis","status":"public"},{"department":[{"_id":"64"}],"user_id":"477","_id":"152","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"type":"bachelorsthesis","status":"public","author":[{"full_name":"Dallmeier, Fynn","last_name":"Dallmeier","first_name":"Fynn"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"date_created":"2017-10-17T12:41:21Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:16Z","title":"Short Randomizable Aggregatable Signatures: Constructions and Security Analysis","citation":{"ieee":"F. Dallmeier, <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","chicago":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","ama":"Dallmeier F. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn; 2016.","apa":"Dallmeier, F. (2016). <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn.","mla":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","short":"F. Dallmeier, Short Randomizable Aggregatable Signatures: Constructions and Security Analysis, Universität Paderborn, 2016.","bibtex":"@book{Dallmeier_2016, title={Short Randomizable Aggregatable Signatures: Constructions and Security Analysis}, publisher={Universität Paderborn}, author={Dallmeier, Fynn}, year={2016} }"},"year":"2016"},{"language":[{"iso":"ger"}],"_id":"286","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"477","status":"public","type":"bachelorsthesis","title":"Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:10Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"author":[{"full_name":"Kalde, Benedikt","last_name":"Kalde","first_name":"Benedikt"}],"date_created":"2017-10-17T12:41:47Z","year":"2015","citation":{"chicago":"Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","ieee":"B. Kalde, <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","ama":"Kalde B. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn; 2015.","apa":"Kalde, B. (2015). <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn.","mla":"Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","short":"B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup, Universität Paderborn, 2015.","bibtex":"@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt}, year={2015} }"}},{"type":"bachelorsthesis","year":"2015","status":"public","citation":{"bibtex":"@book{Strotmann_2015, title={Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen}, author={Strotmann, Daniela}, year={2015} }","short":"D. Strotmann, Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen, 2015.","mla":"Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>. 2015.","apa":"Strotmann, D. (2015). <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>.","ieee":"D. Strotmann, <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>. 2015.","chicago":"Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>, 2015.","ama":"Strotmann D. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>.; 2015."},"_id":"2865","date_updated":"2022-01-06T06:58:12Z","department":[{"_id":"64"}],"author":[{"full_name":"Strotmann, Daniela","last_name":"Strotmann","first_name":"Daniela"}],"date_created":"2018-05-24T13:05:41Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"user_id":"25078","title":"Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen"},{"_id":"261","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:16Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"first_name":"Thorsten","last_name":"Eisenhofer","full_name":"Eisenhofer, Thorsten"}],"date_created":"2017-10-17T12:41:43Z","title":"Protokolle zur authentifizierten Schüsselvereinbarung","year":"2015","citation":{"ama":"Eisenhofer T. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn; 2015.","chicago":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","ieee":"T. Eisenhofer, <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","bibtex":"@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung}, publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015} }","short":"T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität Paderborn, 2015.","mla":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","apa":"Eisenhofer, T. (2015). <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn."}},{"date_updated":"2022-01-06T06:59:05Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"first_name":"Fabian","id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens"}],"date_created":"2017-10-17T12:41:54Z","title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption","has_accepted_license":"1","year":"2015","citation":{"ama":"Eidens F. <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.","chicago":"Eidens, Fabian. <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.","short":"F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption, Universität Paderborn, 2015.","mla":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","bibtex":"@book{Eidens_2015, title={Anonymous credential system based on q-Strong Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2015} }"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"321","user_id":"477","department":[{"_id":"64"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:40:22Z","type":"mastersthesis","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:40:22Z","creator":"florida","date_updated":"2018-03-20T07:40:22Z","file_name":"321-eidens_masterthesis_01.pdf","file_id":"1432","access_level":"closed","file_size":879285}],"status":"public"},{"title":"A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"author":[{"first_name":"Nils","id":"13703","full_name":"Löken, Nils","last_name":"Löken"}],"date_created":"2017-10-17T12:41:55Z","date_updated":"2022-01-06T06:59:07Z","publisher":"Universität Paderborn","citation":{"chicago":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","ieee":"N. Löken, <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","ama":"Löken N. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn; 2015.","bibtex":"@book{Löken_2015, title={A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2015} }","mla":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","short":"N. Löken, A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption, Universität Paderborn, 2015.","apa":"Löken, N. (2015). <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn."},"year":"2015","related_material":{"record":[{"id":"253","relation":"other","status":"public"}]},"department":[{"_id":"64"}],"user_id":"477","_id":"325","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","type":"mastersthesis"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"64"}],"user_id":"477","_id":"326","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"ieee":"F. Heihoff, <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn, 2015.","chicago":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015.","ama":"Heihoff F. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn; 2015.","bibtex":"@book{Heihoff_2015, title={A group signature scheme based on the LSRW assumption}, publisher={Universität Paderborn}, author={Heihoff, Frederic}, year={2015} }","short":"F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität Paderborn, 2015.","mla":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015.","apa":"Heihoff, F. (2015). <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn."},"year":"2015","date_created":"2017-10-17T12:41:55Z","author":[{"first_name":"Frederic","last_name":"Heihoff","full_name":"Heihoff, Frederic"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_updated":"2022-01-06T06:59:07Z","publisher":"Universität Paderborn","title":"A group signature scheme based on the LSRW assumption"},{"year":"2015","citation":{"ieee":"M. Sosniak, <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","chicago":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","ama":"Sosniak M. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn; 2015.","mla":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","short":"M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität Paderborn, 2015.","bibtex":"@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015} }","apa":"Sosniak, M. (2015). <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:49Z","date_created":"2017-10-17T12:41:50Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"author":[{"first_name":"Martin","last_name":"Sosniak","full_name":"Sosniak, Martin"}],"title":"Evaluation of Pairing Optimization for Embedded Platforms","type":"mastersthesis","status":"public","_id":"297","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"department":[{"_id":"64"}],"user_id":"25078"},{"_id":"299","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"department":[{"_id":"64"}],"user_id":"477","language":[{"iso":"ger"}],"type":"mastersthesis","status":"public","date_updated":"2022-01-06T06:58:50Z","publisher":"Universität Paderborn","author":[{"first_name":"Britta","full_name":"Gerken, Britta","last_name":"Gerken"}],"date_created":"2017-10-17T12:41:50Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"title":"Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie","year":"2015","citation":{"ama":"Gerken B. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn; 2015.","ieee":"B. Gerken, <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","chicago":"Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","apa":"Gerken, B. (2015). <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn.","mla":"Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","short":"B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie, Universität Paderborn, 2015.","bibtex":"@book{Gerken_2015, title={Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie}, publisher={Universität Paderborn}, author={Gerken, Britta}, year={2015} }"}},{"title":"Efficient Verifier-Local Revocation for Anonymous Credentials","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"author":[{"first_name":"Jan","last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207"}],"date_created":"2017-10-17T12:41:50Z","publisher":"Universität Paderborn","oa":"1","date_updated":"2022-01-06T06:58:51Z","citation":{"ama":"Bobolz J. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn; 2015.","chicago":"Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","ieee":"J. Bobolz, <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","mla":"Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","bibtex":"@book{Bobolz_2015, title={Efficient Verifier-Local Revocation for Anonymous Credentials}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2015} }","short":"J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials, Universität Paderborn, 2015.","apa":"Bobolz, J. (2015). <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn."},"year":"2015","has_accepted_license":"1","file_date_updated":"2018-07-20T09:54:22Z","ddc":["040"],"department":[{"_id":"64"}],"user_id":"27207","_id":"301","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","file":[{"creator":"florida","date_created":"2018-03-20T07:47:11Z","date_updated":"2018-07-20T09:54:22Z","file_id":"1443","access_level":"open_access","file_name":"301-thesis_jbobolz_final_02.pdf","file_size":1214027,"content_type":"application/pdf","relation":"main_file"}],"urn":"3016","type":"mastersthesis"},{"title":"Efficient Attributes for Pairing-Based Anonymous Credentials","author":[{"full_name":"Stroh, Christian","last_name":"Stroh","first_name":"Christian"}],"date_created":"2017-10-17T12:41:50Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_updated":"2022-01-06T06:58:51Z","publisher":"Universität Paderborn","citation":{"mla":"Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn, 2015.","short":"C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials, Universität Paderborn, 2015.","bibtex":"@book{Stroh_2015, title={Efficient Attributes for Pairing-Based Anonymous Credentials}, publisher={Universität Paderborn}, author={Stroh, Christian}, year={2015} }","apa":"Stroh, C. (2015). <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn.","ama":"Stroh C. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn; 2015.","ieee":"C. Stroh, <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn, 2015.","chicago":"Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn, 2015."},"year":"2015","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"302","status":"public","type":"mastersthesis"},{"type":"mastersthesis","file":[{"file_size":721996,"access_level":"closed","file_id":"1439","file_name":"312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf","date_updated":"2018-03-20T07:44:55Z","date_created":"2018-03-20T07:44:55Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"312","user_id":"477","department":[{"_id":"64"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:44:55Z","has_accepted_license":"1","year":"2015","citation":{"bibtex":"@book{Schleiter_2015, title={Constructions of Fully Secure Predicate Encryption Schemes}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2015} }","short":"P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes, Universität Paderborn, 2015.","mla":"Schleiter, Patrick. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn, 2015.","apa":"Schleiter, P. (2015). <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn.","ama":"Schleiter P. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn; 2015.","ieee":"P. Schleiter, <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn, 2015.","chicago":"Schleiter, Patrick. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn, 2015."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:57Z","date_created":"2017-10-17T12:41:52Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"author":[{"full_name":"Schleiter, Patrick","last_name":"Schleiter","first_name":"Patrick"}],"title":"Constructions of Fully Secure Predicate Encryption Schemes"},{"user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"273","status":"public","type":"mastersthesis","title":"Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:45Z","author":[{"last_name":"Kohn","full_name":"Kohn, Kathlén","first_name":"Kathlén"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:37Z","citation":{"short":"K. Kohn, Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms, Universität Paderborn, 2015.","bibtex":"@book{Kohn_2015, title={Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms}, publisher={Universität Paderborn}, author={Kohn, Kathlén}, year={2015} }","mla":"Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015.","apa":"Kohn, K. (2015). <i>Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms</i>. Universität Paderborn.","ama":"Kohn K. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn; 2015.","ieee":"K. Kohn, <i>Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms</i>. Universität Paderborn, 2015.","chicago":"Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015."},"year":"2015"},{"status":"public","type":"bachelorsthesis","user_id":"25078","department":[{"_id":"64"}],"_id":"2866","citation":{"apa":"Biermeier, F. (2014). <i>Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL</i>.","short":"F. Biermeier, Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen Bezüglich Den Komplexitätsklassen L Und SL, 2014.","mla":"Biermeier, Felix. <i>Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen Bezüglich Den Komplexitätsklassen L Und SL</i>. 2014.","bibtex":"@book{Biermeier_2014, title={Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL}, author={Biermeier, Felix}, year={2014} }","chicago":"Biermeier, Felix. <i>Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen Bezüglich Den Komplexitätsklassen L Und SL</i>, 2014.","ieee":"F. Biermeier, <i>Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL</i>. 2014.","ama":"Biermeier F. <i>Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen Bezüglich Den Komplexitätsklassen L Und SL</i>.; 2014."},"year":"2014","title":"Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL","date_created":"2018-05-24T13:08:41Z","author":[{"first_name":"Felix","full_name":"Biermeier, Felix","last_name":"Biermeier"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"date_updated":"2022-01-06T06:58:13Z"},{"title":"Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen","date_created":"2018-05-24T13:15:51Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"first_name":"Malte","last_name":"Sauer","full_name":"Sauer, Malte"}],"date_updated":"2022-01-06T06:58:16Z","citation":{"ama":"Sauer M. <i>Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen</i>.; 2014.","chicago":"Sauer, Malte. <i>Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen</i>, 2014.","ieee":"M. Sauer, <i>Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen</i>. 2014.","apa":"Sauer, M. (2014). <i>Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen</i>.","short":"M. Sauer, Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen, 2014.","bibtex":"@book{Sauer_2014, title={Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen}, author={Sauer, Malte}, year={2014} }","mla":"Sauer, Malte. <i>Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen</i>. 2014."},"year":"2014","department":[{"_id":"64"}],"user_id":"25078","_id":"2867","status":"public","type":"bachelorsthesis"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"369","user_id":"477","department":[{"_id":"64"}],"abstract":[{"text":"RSA Full Domain Hash ist im Zufallsorakelmodell ein EUF-CMA sicheres Signaturverfahren (existentially unforgeable under chosen-message attacks). Der Sicherheitsbeweis wird unter anderem in der Vorlesung Einf{\\\"u}hrung in die Kryptographie vorgestellt. Auch bei einer genaueren Analyse verliert man bei der Reduktion einen Faktor \\nicefrac{1}{q_{s}}(wobei q_{s}die Anzahl der Anfragen an das Signaturorakel darstellt), was f{\\\"u}r die Praxis in relativ großen Systemparametern (RSA-Modul) resultiert [1].Seit der Ver{\\\"o}ffentlichung von [2] wurde geglaubt, dass der Faktor \\nicefrac{1}{q_{s}}optimal ist. Erst zehn Jahre sp{\\\"a}ter offenbarten die Autoren von [3] einen Fehler in [2] und zeigten eine bessere Reduktion allerdings unter einer etwas st{\\\"a}rkeren Sicherheitsannahme.Die Ergebnisse aus [3] lassen sich auf PSS-Verfahren (Probabilistic Signature Scheme), das z.B. in PKCS #1 benutzt wird, {\\\"u}bertragen und sind somit von großer Bedeutung f{\\\"u}r die Praxis. Weiterhin sind die in den Beweisen verwendete Techniken n{\\\"u}tzlich auch bei anderen kryptographischen Verfahren.In Rahmen dieser Arbeit sollen die entsprechenden Sicherheitsbeweise aufgearbeitet und dessen Auswirkungen f{\\\"u}r die Praxis analysiert werden.[1] J.S. Coron, “On the Exact Security of Full Domain Hash”, CRYPTO 2000. LNCS 1880, pp. 229-235, 2000.[2] J.S. Coron, “Optimal security proofs for PPS and other signature schemes”, EUROCRYPT 2002. LNCS 2332, pp 272-287, 2002.[3] S.A. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited”, in EUROCRYPT 2012. LNCS 7237, pp 537-553, 2012.","lang":"eng"}],"status":"public","type":"bachelorsthesis","title":"RSA-Full Domain Hash Revisited","date_updated":"2022-01-06T06:59:30Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:04Z","author":[{"first_name":"Timo","last_name":"Rath","full_name":"Rath, Timo"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"year":"2014","citation":{"ama":"Rath T. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn; 2014.","ieee":"T. Rath, <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","chicago":"Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","apa":"Rath, T. (2014). <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn.","short":"T. Rath, RSA-Full Domain Hash Revisited, Universität Paderborn, 2014.","mla":"Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","bibtex":"@book{Rath_2014, title={RSA-Full Domain Hash Revisited}, publisher={Universität Paderborn}, author={Rath, Timo}, year={2014} }"}}]