[{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"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.","ieee":"L. Porzenheim, <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn, 2016.","ama":"Porzenheim L. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn; 2016.","short":"L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes, Universität Paderborn, 2016.","chicago":"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} }"},"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:41:33Z","date_updated":"2022-01-06T06:54:53Z","author":[{"full_name":"Porzenheim, Laurens","last_name":"Porzenheim","first_name":"Laurens"}],"status":"public","year":"2016","title":"Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes","user_id":"477","publisher":"Universität Paderborn","_id":"213"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"mla":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. 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} }","ama":"Bemmann KS. <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.","apa":"Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn.","short":"K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität Paderborn, 2016.","chicago":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016."},"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:41:33Z","date_updated":"2022-01-06T06:54:58Z","year":"2016","title":"Commitment Schemes - Definitions, Variants, and Security","status":"public","author":[{"first_name":"Kai Sören","last_name":"Bemmann","full_name":"Bemmann, Kai Sören"}],"user_id":"477","publisher":"Universität Paderborn","_id":"214"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-21T12:43:21Z","citation":{"short":"P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016.","chicago":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 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.","ama":"Günther P. <i>Physical Attacks on Pairing-Based Cryptography</i>. 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} }","mla":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016."},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"type":"dissertation","department":[{"_id":"64"}],"file":[{"date_updated":"2018-03-21T12:43:21Z","relation":"main_file","access_level":"closed","file_size":9456552,"file_name":"167-thesis_peter_guenther.pdf","success":1,"content_type":"application/pdf","file_id":"1542","creator":"florida","date_created":"2018-03-21T12:43:21Z"}],"date_created":"2017-10-17T12:41:24Z","date_updated":"2022-01-06T06:52:54Z","has_accepted_license":"1","title":"Physical attacks on pairing-based cryptography","year":"2016","status":"public","author":[{"last_name":"Günther","first_name":"Peter","full_name":"Günther, Peter"}],"user_id":"25078","ddc":["040"],"main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853"}],"_id":"167","publisher":"Universität Paderborn"},{"author":[{"last_name":"Hamm","first_name":"Julian","full_name":"Hamm, Julian"}],"title":"Symmetric Anonymous Credentials with Protocols for Relations on Attributes","status":"public","year":"2016","date_updated":"2022-01-06T06:52:03Z","publisher":"Universität Paderborn","_id":"146","user_id":"477","supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"citation":{"bibtex":"@book{Hamm_2016, title={Symmetric Anonymous Credentials with Protocols for Relations on Attributes}, publisher={Universität Paderborn}, author={Hamm, Julian}, year={2016} }","ama":"Hamm J. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn; 2016.","mla":"Hamm, Julian. <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.","ieee":"J. Hamm, <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."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:41:20Z","department":[{"_id":"64"}],"type":"mastersthesis"},{"date_created":"2017-10-17T12:41:21Z","type":"bachelorsthesis","department":[{"_id":"64"}],"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"chicago":"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.","apa":"Dallmeier, F. (2016). <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn.","ieee":"F. Dallmeier, <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.","bibtex":"@book{Dallmeier_2016, title={Short Randomizable Aggregatable Signatures: Constructions and Security Analysis}, publisher={Universität Paderborn}, author={Dallmeier, Fynn}, year={2016} }","mla":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"publisher":"Universität Paderborn","_id":"152","user_id":"477","status":"public","title":"Short Randomizable Aggregatable Signatures: Constructions and Security Analysis","year":"2016","author":[{"full_name":"Dallmeier, Fynn","first_name":"Fynn","last_name":"Dallmeier"}],"date_updated":"2022-01-06T06:52:16Z"},{"user_id":"477","_id":"286","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2022-01-06T06:58:10Z","author":[{"last_name":"Kalde","first_name":"Benedikt","full_name":"Kalde, Benedikt"}],"year":"2015","title":"Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup","status":"public","department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:41:47Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"bibtex":"@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt}, year={2015} }","ama":"Kalde B. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn; 2015.","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.","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.","apa":"Kalde, B. (2015). <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn."},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}]},{"_id":"2865","user_id":"25078","status":"public","title":"Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen","year":"2015","author":[{"first_name":"Daniela","last_name":"Strotmann","full_name":"Strotmann, Daniela"}],"date_updated":"2022-01-06T06:58:12Z","date_created":"2018-05-24T13:05:41Z","type":"bachelorsthesis","department":[{"_id":"64"}],"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.","ama":"Strotmann D. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>.; 2015.","chicago":"Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>, 2015.","ieee":"D. Strotmann, <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>. 2015.","apa":"Strotmann, D. (2015). <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>.","mla":"Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>. 2015."},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}]},{"date_created":"2017-10-17T12:41:43Z","type":"bachelorsthesis","department":[{"_id":"64"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"citation":{"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.","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.","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."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"publisher":"Universität Paderborn","_id":"261","language":[{"iso":"ger"}],"user_id":"477","year":"2015","title":"Protokolle zur authentifizierten Schüsselvereinbarung","status":"public","author":[{"full_name":"Eisenhofer, Thorsten","last_name":"Eisenhofer","first_name":"Thorsten"}],"date_updated":"2022-01-06T06:57:16Z"},{"date_created":"2017-10-17T12:41:54Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1432","file_size":879285,"access_level":"closed","file_name":"321-eidens_masterthesis_01.pdf","date_updated":"2018-03-20T07:40:22Z","relation":"main_file","date_created":"2018-03-20T07:40:22Z","creator":"florida"}],"department":[{"_id":"64"}],"type":"mastersthesis","citation":{"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.","chicago":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","short":"F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption, 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."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"file_date_updated":"2018-03-20T07:40:22Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"321","publisher":"Universität Paderborn","user_id":"477","ddc":["040"],"author":[{"id":"25078","first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian"}],"year":"2015","status":"public","title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption","has_accepted_license":"1","date_updated":"2022-01-06T06:59:05Z"},{"date_updated":"2022-01-06T06:59:07Z","author":[{"first_name":"Nils","last_name":"Löken","full_name":"Löken, Nils","id":"13703"}],"year":"2015","status":"public","title":"A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption","user_id":"477","_id":"325","publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"related_material":{"record":[{"relation":"other","id":"253","status":"public"}]},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"citation":{"mla":"Löken, Nils. <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} }","ama":"Löken N. <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.","apa":"Löken, N. (2015). <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn.","chicago":"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."},"department":[{"_id":"64"}],"type":"mastersthesis","date_created":"2017-10-17T12:41:55Z"},{"status":"public","title":"A group signature scheme based on the LSRW assumption","year":"2015","author":[{"last_name":"Heihoff","first_name":"Frederic","full_name":"Heihoff, Frederic"}],"date_updated":"2022-01-06T06:59:07Z","_id":"326","publisher":"Universität Paderborn","user_id":"477","citation":{"mla":"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} }","apa":"Heihoff, F. (2015). <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn.","ieee":"F. Heihoff, <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn, 2015.","short":"F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität Paderborn, 2015.","chicago":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015."},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:41:55Z","type":"bachelorsthesis","department":[{"_id":"64"}]},{"date_updated":"2022-01-06T06:58:49Z","author":[{"full_name":"Sosniak, Martin","last_name":"Sosniak","first_name":"Martin"}],"status":"public","year":"2015","title":"Evaluation of Pairing Optimization for Embedded Platforms","user_id":"25078","publisher":"Universität Paderborn","_id":"297","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"citation":{"apa":"Sosniak, M. (2015). <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn.","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.","short":"M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität Paderborn, 2015.","mla":"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.","bibtex":"@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015} }"},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"department":[{"_id":"64"}],"type":"mastersthesis","date_created":"2017-10-17T12:41:50Z"},{"_id":"299","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","user_id":"477","status":"public","title":"Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie","year":"2015","author":[{"first_name":"Britta","last_name":"Gerken","full_name":"Gerken, Britta"}],"date_updated":"2022-01-06T06:58:50Z","date_created":"2017-10-17T12:41:50Z","type":"mastersthesis","department":[{"_id":"64"}],"citation":{"ieee":"B. Gerken, <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.","chicago":"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.","mla":"Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","bibtex":"@book{Gerken_2015, title={Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie}, publisher={Universität Paderborn}, author={Gerken, Britta}, year={2015} }","ama":"Gerken B. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn; 2015."},"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}]},{"date_created":"2017-10-17T12:41:50Z","file":[{"date_created":"2018-03-20T07:47:11Z","creator":"florida","file_id":"1443","content_type":"application/pdf","relation":"main_file","date_updated":"2018-07-20T09:54:22Z","file_name":"301-thesis_jbobolz_final_02.pdf","file_size":1214027,"access_level":"open_access"}],"oa":"1","department":[{"_id":"64"}],"type":"mastersthesis","supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"apa":"Bobolz, J. (2015). <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn.","ieee":"J. Bobolz, <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.","short":"J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials, Universität Paderborn, 2015.","mla":"Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","ama":"Bobolz J. <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} }"},"file_date_updated":"2018-07-20T09:54:22Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"301","publisher":"Universität Paderborn","urn":"3016","ddc":["040"],"user_id":"27207","author":[{"id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz","first_name":"Jan"}],"title":"Efficient Verifier-Local Revocation for Anonymous Credentials","year":"2015","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:58:51Z"},{"date_updated":"2022-01-06T06:58:51Z","author":[{"full_name":"Stroh, Christian","first_name":"Christian","last_name":"Stroh"}],"title":"Efficient Attributes for Pairing-Based Anonymous Credentials","status":"public","year":"2015","user_id":"477","_id":"302","publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"mla":"Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn, 2015.","ama":"Stroh C. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. 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.","ieee":"C. Stroh, <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.","chicago":"Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn, 2015."},"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"department":[{"_id":"64"}],"type":"mastersthesis","date_created":"2017-10-17T12:41:50Z"},{"file_date_updated":"2018-03-20T07:44:55Z","supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"citation":{"ieee":"P. Schleiter, <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. 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.","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.","ama":"Schleiter P. <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."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file":[{"date_created":"2018-03-20T07:44:55Z","creator":"florida","file_id":"1439","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-20T07:44:55Z","file_name":"312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf","file_size":721996,"access_level":"closed"}],"date_created":"2017-10-17T12:41:52Z","type":"mastersthesis","department":[{"_id":"64"}],"title":"Constructions of Fully Secure Predicate Encryption Schemes","year":"2015","status":"public","author":[{"last_name":"Schleiter","first_name":"Patrick","full_name":"Schleiter, Patrick"}],"date_updated":"2022-01-06T06:58:57Z","has_accepted_license":"1","_id":"312","publisher":"Universität Paderborn","ddc":["040"],"user_id":"477"},{"user_id":"477","_id":"273","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:37Z","status":"public","title":"Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms","year":"2015","author":[{"first_name":"Kathlén","last_name":"Kohn","full_name":"Kohn, Kathlén"}],"type":"mastersthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:41:45Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"citation":{"mla":"Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015.","ama":"Kohn K. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. 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} }","apa":"Kohn, K. (2015). <i>Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms</i>. Universität Paderborn.","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.","short":"K. Kohn, Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms, Universität Paderborn, 2015."}},{"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2018-05-24T13:08:41Z","citation":{"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} }","ama":"Biermeier F. <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.","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.","chicago":"Biermeier, Felix. <i>Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen Bezüglich Den Komplexitätsklassen L Und SL</i>, 2014."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"user_id":"25078","_id":"2866","date_updated":"2022-01-06T06:58:13Z","author":[{"last_name":"Biermeier","first_name":"Felix","full_name":"Biermeier, Felix"}],"year":"2014","title":"Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL","status":"public"},{"date_created":"2018-05-24T13:15:51Z","department":[{"_id":"64"}],"type":"bachelorsthesis","supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"citation":{"mla":"Sauer, Malte. <i>Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen</i>. 2014.","bibtex":"@book{Sauer_2014, title={Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen}, author={Sauer, Malte}, year={2014} }","ama":"Sauer M. <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.","chicago":"Sauer, Malte. <i>Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen</i>, 2014."},"_id":"2867","user_id":"25078","author":[{"full_name":"Sauer, Malte","last_name":"Sauer","first_name":"Malte"}],"year":"2014","status":"public","title":"Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen","date_updated":"2022-01-06T06:58:16Z"},{"title":"RSA-Full Domain Hash Revisited","status":"public","year":"2014","author":[{"last_name":"Rath","first_name":"Timo","full_name":"Rath, Timo"}],"date_updated":"2022-01-06T06:59:30Z","_id":"369","publisher":"Universität Paderborn","user_id":"477","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"citation":{"ama":"Rath T. <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} }","mla":"Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","short":"T. Rath, RSA-Full Domain Hash Revisited, 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.","ieee":"T. Rath, <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014."},"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"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:42:04Z","type":"bachelorsthesis","department":[{"_id":"64"}]}]