[{"date_created":"2017-10-17T12:41:41Z","title":"Short Group Signatures with Distributed Traceability","year":"2015","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T14:08:23Z","creator":"ups","date_updated":"2018-11-02T14:08:23Z","file_id":"5262","file_name":"ShortGroupSignaturesWithDistri.pdf","access_level":"closed","file_size":262436}],"abstract":[{"lang":"eng","text":"Group signatures, introduced by Chaum and van Heyst [15], are an important primitive in cryptography. In group signature schemes every group member can anonymously sign messages on behalf of the group. In case of disputes a dedicated opening manager is able to trace signatures - he can extract the identity of the producer of a given signature. A formal model for static group signatures schemes and their security is defined by Bellare, Micciancio, and Warinschi [4], the case of dynamic groups is considered by Bellare, Shi, and Zhang [5]. Both models define group signature schemes with a single opening manager. The main difference between these models is that the number of group members in static schemes is fixed, while in dynamic schemes group members can join the group over time."}],"author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"last_name":"Juhnke","id":"48090","full_name":"Juhnke, Jakob","first_name":"Jakob"},{"first_name":"Nils","full_name":"Löken, Nils","id":"13703","last_name":"Löken"}],"date_updated":"2022-01-06T06:59:07Z","doi":"10.1007/978-3-319-32859-1_14","related_material":{"record":[{"status":"public","id":"325","relation":"other"}]},"has_accepted_license":"1","page":"166-180","citation":{"mla":"Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.” <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2015, pp. 166–80, doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">10.1007/978-3-319-32859-1_14</a>.","short":"J. Blömer, J. Juhnke, N. Löken, in: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.","bibtex":"@inproceedings{Blömer_Juhnke_Löken_2015, series={LNCS}, title={Short Group Signatures with Distributed Traceability}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">10.1007/978-3-319-32859-1_14</a>}, booktitle={Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Juhnke, Jakob and Löken, Nils}, year={2015}, pages={166–180}, collection={LNCS} }","apa":"Blömer, J., Juhnke, J., &#38; Löken, N. (2015). Short Group Signatures with Distributed Traceability. In <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (pp. 166–180). <a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">https://doi.org/10.1007/978-3-319-32859-1_14</a>","ama":"Blömer J, Juhnke J, Löken N. Short Group Signatures with Distributed Traceability. In: <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. LNCS. ; 2015:166-180. doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">10.1007/978-3-319-32859-1_14</a>","ieee":"J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed Traceability,” in <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2015, pp. 166–180.","chicago":"Blömer, Johannes, Jakob Juhnke, and Nils Löken. “Short Group Signatures with Distributed Traceability.” In <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 166–80. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">https://doi.org/10.1007/978-3-319-32859-1_14</a>."},"department":[{"_id":"64"}],"series_title":"LNCS","user_id":"13703","_id":"253","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"KogniHome - die mitdenkende Wohnung","_id":"44"}],"file_date_updated":"2018-11-02T14:08:23Z","type":"conference","status":"public"},{"date_created":"2017-10-17T12:41:47Z","author":[{"first_name":"Martina","full_name":"Eikel, Martina","last_name":"Eikel"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T06:58:03Z","publisher":"ACM","doi":"10.1145/2809806","title":"IRIS: A Robust Information System Against Insider DoS Attacks","issue":"3","has_accepted_license":"1","citation":{"bibtex":"@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System Against Insider DoS Attacks}, DOI={<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>}, number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel, Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }","short":"M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.","mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>, no. 3, ACM, 2015, pp. 18:1--18:33, doi:<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>.","apa":"Eikel, M., &#38; Scheideler, C. (2015). IRIS: A Robust Information System Against Insider DoS Attacks. <i>Transactions on Parallel Computing</i>, (3), 18:1--18:33. <a href=\"https://doi.org/10.1145/2809806\">https://doi.org/10.1145/2809806</a>","ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS Attacks. <i>Transactions on Parallel Computing</i>. 2015;(3):18:1--18:33. doi:<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>","ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS Attacks,” <i>Transactions on Parallel Computing</i>, no. 3, pp. 18:1--18:33, 2015.","chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>, no. 3 (2015): 18:1--18:33. <a href=\"https://doi.org/10.1145/2809806\">https://doi.org/10.1145/2809806</a>."},"page":"18:1--18:33","year":"2015","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"284","file_date_updated":"2018-03-21T09:25:04Z","ddc":["040"],"type":"journal_article","publication":"Transactions on Parallel Computing","file":[{"creator":"florida","date_created":"2018-03-21T09:25:04Z","date_updated":"2018-03-21T09:25:04Z","file_name":"284-Eikel-Scheideler-ACM2015.pdf","file_id":"1468","access_level":"closed","file_size":651726,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to block any ϵ-fraction of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task of the system is to serve any collection of lookup requests with at most one per nonblocked server in an efficient way despite this attack. Previously, scalable solutions were only known for DoS attacks of past insiders, where a past insider only has complete knowledge about some past time point t0 of the information system. Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed that in this case, it is possible to design an information system so that any information that was inserted or last updated after t0 is safe against a DoS attack. But their constructions would not work at all for a current insider. The key idea behind our IRIS system is to make extensive use of coding. More precisely, we present two alternative distributed coding strategies with an at most logarithmic storage overhead that can handle up to a constant fraction of blocked servers.","lang":"eng"}]},{"citation":{"apa":"Kalde, B. (2015). <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn.","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} }","mla":"Kalde, Benedikt. <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.","ieee":"B. Kalde, <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","chicago":"Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015."},"year":"2015","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:47Z","author":[{"first_name":"Benedikt","full_name":"Kalde, Benedikt","last_name":"Kalde"}],"date_updated":"2022-01-06T06:58:10Z","publisher":"Universität Paderborn","title":"Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup","type":"bachelorsthesis","status":"public","department":[{"_id":"64"}],"user_id":"477","_id":"286","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"language":[{"iso":"ger"}]},{"title":"Protokolle zur authentifizierten Schüsselvereinbarung","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:16Z","date_created":"2017-10-17T12:41:43Z","author":[{"first_name":"Thorsten","full_name":"Eisenhofer, Thorsten","last_name":"Eisenhofer"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"year":"2015","citation":{"ieee":"T. Eisenhofer, <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.","ama":"Eisenhofer T. <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.","short":"T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität Paderborn, 2015.","bibtex":"@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung}, publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015} }","mla":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015."},"language":[{"iso":"ger"}],"_id":"261","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"477","status":"public","type":"bachelorsthesis"},{"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1432","file_name":"321-eidens_masterthesis_01.pdf","access_level":"closed","file_size":879285,"date_created":"2018-03-20T07:40:22Z","creator":"florida","date_updated":"2018-03-20T07:40:22Z"}],"type":"mastersthesis","file_date_updated":"2018-03-20T07:40:22Z","ddc":["040"],"department":[{"_id":"64"}],"user_id":"477","_id":"321","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"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.","ama":"Eidens F. <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} }"},"year":"2015","has_accepted_license":"1","title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption","author":[{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:54Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:05Z"},{"ddc":["040"],"publication":"Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)","file":[{"file_size":499568,"access_level":"closed","file_id":"1431","file_name":"322-546_01.pdf","date_updated":"2018-03-20T07:39:54Z","date_created":"2018-03-20T07:39:54Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Reputation systems are used to compute and publish reputation scores for services or products. We consider reputation systems where users are allowed to rate products that they purchased previously. To obtain trustworthy reputations, they are allowed to rate these products only once. As long as users rate products once, they stay anonymous. Everybody is able to detect users deviating from the rate-products-only-once policy and the anonymity of such dishonest users can be revoked by a system manager. In this paper we present formal models for such reputation systems and their security. Based on group signatures presented by Boneh, Boyen, and Shacham we design an efficient reputation system that meets all our requirements."}],"date_created":"2017-10-17T12:41:54Z","title":"Anonymous and Publicly Linkable Reputation Systems","year":"2015","user_id":"48090","series_title":"LNCS","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"322","file_date_updated":"2018-03-20T07:39:54Z","type":"conference","status":"public","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"Juhnke, Jakob","id":"48090","last_name":"Juhnke","first_name":"Jakob"},{"first_name":"Christina","last_name":"Kolb","id":"43647","full_name":"Kolb, Christina"}],"oa":"1","date_updated":"2022-01-06T06:59:05Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/546"}],"doi":"10.1007/978-3-662-47854-7_29","has_accepted_license":"1","citation":{"short":"J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.","bibtex":"@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous and Publicly Linkable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>}, booktitle={Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)}, author={Blömer, Johannes and Juhnke, Jakob and Kolb, Christina}, year={2015}, pages={478--488}, collection={LNCS} }","mla":"Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.” <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488, doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>.","apa":"Blömer, J., Juhnke, J., &#38; Kolb, C. (2015). Anonymous and Publicly Linkable Reputation Systems. In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i> (pp. 478--488). <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>","chicago":"Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.” In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 478--488. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>.","ieee":"J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488.","ama":"Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>. LNCS. ; 2015:478--488. doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>"},"page":"478--488"},{"status":"public","type":"mastersthesis","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"325","citation":{"apa":"Löken, N. (2015). <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn.","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.","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} }","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."},"year":"2015","related_material":{"record":[{"id":"253","relation":"other","status":"public"}]},"title":"A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption","date_created":"2017-10-17T12:41:55Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"last_name":"Löken","full_name":"Löken, Nils","id":"13703","first_name":"Nils"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:07Z"},{"status":"public","type":"bachelorsthesis","department":[{"_id":"64"}],"user_id":"477","_id":"326","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"apa":"Heihoff, F. (2015). <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn.","short":"F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, 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} }","mla":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015.","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."},"year":"2015","title":"A group signature scheme based on the LSRW assumption","date_created":"2017-10-17T12:41:55Z","author":[{"first_name":"Frederic","full_name":"Heihoff, Frederic","last_name":"Heihoff"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:07Z"},{"title":"Evaluation of Pairing Optimization for Embedded Platforms","author":[{"full_name":"Sosniak, Martin","last_name":"Sosniak","first_name":"Martin"}],"date_created":"2017-10-17T12:41:50Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:49Z","citation":{"apa":"Sosniak, M. (2015). <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn.","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.","bibtex":"@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015} }","chicago":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","ieee":"M. Sosniak, <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."},"year":"2015","user_id":"25078","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"297","status":"public","type":"mastersthesis"},{"citation":{"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} }","apa":"Gerken, B. (2015). <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn.","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."},"year":"2015","date_created":"2017-10-17T12:41:50Z","author":[{"first_name":"Britta","last_name":"Gerken","full_name":"Gerken, Britta"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:50Z","title":"Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie","type":"mastersthesis","status":"public","department":[{"_id":"64"}],"user_id":"477","_id":"299","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"language":[{"iso":"ger"}]},{"title":"Efficient Verifier-Local Revocation for Anonymous Credentials","author":[{"last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan","first_name":"Jan"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:50Z","publisher":"Universität Paderborn","oa":"1","date_updated":"2022-01-06T06:58:51Z","citation":{"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.","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} }","mla":"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.","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"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-07-20T09:54:22Z","creator":"florida","date_created":"2018-03-20T07:47:11Z","file_size":1214027,"access_level":"open_access","file_name":"301-thesis_jbobolz_final_02.pdf","file_id":"1443"}],"urn":"3016","type":"mastersthesis"},{"status":"public","type":"mastersthesis","department":[{"_id":"64"}],"user_id":"477","_id":"302","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"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.","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.","ama":"Stroh C. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn; 2015."},"year":"2015","title":"Efficient Attributes for Pairing-Based Anonymous Credentials","date_created":"2017-10-17T12:41:50Z","author":[{"last_name":"Stroh","full_name":"Stroh, Christian","first_name":"Christian"}],"supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_updated":"2022-01-06T06:58:51Z","publisher":"Universität Paderborn"},{"citation":{"bibtex":"@book{Kniesburges_2015, title={Distributed Data Structures and the Power of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges, Sebastian}, year={2015} }","mla":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","short":"S. Kniesburges, Distributed Data Structures and the Power of Topological Self-Stabilization, Universität Paderborn, 2015.","apa":"Kniesburges, S. (2015). <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn.","chicago":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ieee":"S. Kniesburges, <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn, 2015.","ama":"Kniesburges S. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn; 2015."},"year":"2015","has_accepted_license":"1","title":"Distributed Data Structures and the Power of topological Self-Stabilization","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_created":"2017-10-17T12:41:51Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:54Z","status":"public","file":[{"file_id":"1206","file_name":"305-Dissertation_-_Kniesburges.pdf","access_level":"closed","file_size":1709094,"date_created":"2018-03-13T09:14:43Z","creator":"florida","date_updated":"2018-03-13T09:14:43Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"type":"dissertation","file_date_updated":"2018-03-13T09:14:43Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"305","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject C1","_id":"13"}]},{"ddc":["040"],"file_date_updated":"2018-03-20T07:44:55Z","_id":"312","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"477","status":"public","file":[{"file_id":"1439","access_level":"closed","file_name":"312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf","file_size":721996,"creator":"florida","date_created":"2018-03-20T07:44:55Z","date_updated":"2018-03-20T07:44:55Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"type":"mastersthesis","title":"Constructions of Fully Secure Predicate Encryption Schemes","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:57Z","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"author":[{"first_name":"Patrick","last_name":"Schleiter","full_name":"Schleiter, Patrick"}],"date_created":"2017-10-17T12:41:52Z","year":"2015","citation":{"short":"P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes, Universität Paderborn, 2015.","bibtex":"@book{Schleiter_2015, title={Constructions of Fully Secure Predicate Encryption Schemes}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={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.","chicago":"Schleiter, Patrick. <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."},"has_accepted_license":"1"},{"_id":"273","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477","type":"mastersthesis","status":"public","date_updated":"2022-01-06T06:57:37Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:45Z","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"author":[{"last_name":"Kohn","full_name":"Kohn, Kathlén","first_name":"Kathlén"}],"title":"Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms","year":"2015","citation":{"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.","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} }","mla":"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.","apa":"Kohn, K. (2015). <i>Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms</i>. Universität Paderborn."}},{"ddc":["040"],"file_date_updated":"2018-03-21T10:30:18Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"233","user_id":"25078","department":[{"_id":"64"}],"abstract":[{"lang":"eng","text":"Motivated by the deterministic single exponential time algorithm of Micciancio and Voulgaris for solving the shortest and closest vector problem for the Euclidean norm, we study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms.On the positive side, we show that for strictly convex and smooth norms the geometry of Voronoi cells of lattices in any dimension is similar to the Euclidean case, i.e., the Voronoi cells are defined by the so-called Voronoi-relevant vectors and the facets of a Voronoi cell are in one-to-one correspondence with these vectors. On the negative side, we show that combinatorially Voronoi cells for arbitrary strictly convex and smooth norms are much more complicated than in the Euclidean case.In particular, we construct a family of three-dimensional lattices whose number of Voronoi-relevant vectors with respect to the l_3-norm is unbounded.Since the algorithm of Micciancio and Voulgaris and its run time analysis crucially dependonthefactthatfortheEuclidean normthenumber of Voronoi-relevant vectors is single exponential in the lattice dimension, this indicates that the techniques of Micciancio and Voulgaris cannot be extended to achieve deterministic single exponential time algorithms for lattice problems with respect to arbitrary l_p-norms."}],"file":[{"date_updated":"2018-03-21T10:30:18Z","creator":"florida","date_created":"2018-03-21T10:30:18Z","file_size":1231102,"access_level":"closed","file_name":"233-1512.00720v1.pdf","file_id":"1501","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"report","title":"Voronoi Cells of Lattices with Respect to Arbitrary Norms","main_file_link":[{"url":"http://arxiv.org/pdf/1512.00720v1.pdf","open_access":"1"}],"date_updated":"2022-01-06T06:55:49Z","oa":"1","publisher":"Universität Paderborn","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Kathlén","last_name":"Kohn","full_name":"Kohn, Kathlén"}],"date_created":"2017-10-17T12:41:37Z","year":"2015","citation":{"ieee":"J. Blömer and K. Kohn, <i>Voronoi Cells of Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015.","chicago":"Blömer, Johannes, and Kathlén Kohn. <i>Voronoi Cells of Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015.","ama":"Blömer J, Kohn K. <i>Voronoi Cells of Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn; 2015.","apa":"Blömer, J., &#38; Kohn, K. (2015). <i>Voronoi Cells of Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn.","bibtex":"@book{Blömer_Kohn_2015, title={Voronoi Cells of Lattices with Respect to Arbitrary Norms}, publisher={Universität Paderborn}, author={Blömer, Johannes and Kohn, Kathlén}, year={2015} }","mla":"Blömer, Johannes, and Kathlén Kohn. <i>Voronoi Cells of Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015.","short":"J. Blömer, K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms, Universität Paderborn, 2015."},"has_accepted_license":"1"},{"has_accepted_license":"1","year":"2014","page":"49-57","citation":{"apa":"Brangewitz, S., Jungmann, A., Petrlic, R., &#38; Platenius, M. C. (2014). Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 49–57).","bibtex":"@inproceedings{Brangewitz_Jungmann_Petrlic_Platenius_2014, title={Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services}, booktitle={Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Brangewitz, Sonja and Jungmann, Alexander and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={49–57} }","mla":"Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","short":"S. Brangewitz, A. Jungmann, R. Petrlic, M.C. Platenius, in: Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp. 49–57.","chicago":"Brangewitz, Sonja, Alexander Jungmann, Ronald Petrlic, and Marie Christin Platenius. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 49–57, 2014.","ieee":"S. Brangewitz, A. Jungmann, R. Petrlic, and M. C. Platenius, “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services,” in <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","ama":"Brangewitz S, Jungmann A, Petrlic R, Platenius MC. Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In: <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2014:49-57."},"date_updated":"2022-01-06T06:59:18Z","author":[{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"},{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"first_name":"Ronald","last_name":"Petrlic","full_name":"Petrlic, Ronald"},{"full_name":"Platenius, Marie Christin","last_name":"Platenius","first_name":"Marie Christin"}],"date_created":"2017-10-17T12:41:59Z","title":"Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services","publication":"Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","type":"conference","abstract":[{"lang":"eng","text":"One future goal of service-oriented computing is to realize global markets of composed services. On such markets, service providers offer services that can be flexibly combined with each other. However, most often, market participants are not able to individually estimate the quality of traded services in advance. As a consequence, even potentially profitable transactions between customers and providers might not take place. In the worst case, this can induce a market failure. To overcome this problem, we propose the incorporation of reputation information as an indicator for expected service quality. We address On-The-Fly Computing as a representative environment of markets of composed services. In this environment, customers provide feedback on transactions. We present a conceptual design of a reputation system which collects and processes user feedback, and provides it to participants in the market. Our contribution includes the identification of requirements for such a reputation system from a technical and an economic perspective. Based on these requirements, we propose a flexible solution that facilitates the incorporation of reputation information into markets of composed services while simultaneously preserving privacy of customers who provide feedback. The requirements we formulate in this paper have just been partially met in literature. An integrated approach, however, has not been addressed yet."}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:26:49Z","creator":"florida","date_created":"2018-03-20T07:26:49Z","file_size":334101,"access_level":"closed","file_id":"1418","file_name":"346-service_computation_2014_3_10_10005.pdf"}],"_id":"346","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"205"},{"_id":"76"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-20T07:26:49Z","language":[{"iso":"eng"}]},{"related_material":{"link":[{"url":"https://eprint.iacr.org/2013/271","relation":"confirmation"}]},"has_accepted_license":"1","citation":{"ieee":"C. Sorge, <i>The Legal Classification of Identity-Based Signatures</i>. 2014.","chicago":"Sorge, Christoph. <i>The Legal Classification of Identity-Based Signatures</i>, 2014.","ama":"Sorge C. <i>The Legal Classification of Identity-Based Signatures</i>.; 2014.","apa":"Sorge, C. (2014). <i>The Legal Classification of Identity-Based Signatures</i>.","mla":"Sorge, Christoph. <i>The Legal Classification of Identity-Based Signatures</i>. 2014.","short":"C. Sorge, The Legal Classification of Identity-Based Signatures, 2014.","bibtex":"@book{Sorge_2014, title={The Legal Classification of Identity-Based Signatures}, author={Sorge, Christoph}, year={2014} }"},"year":"2014","date_created":"2017-10-17T12:42:00Z","author":[{"full_name":"Sorge, Christoph","last_name":"Sorge","first_name":"Christoph"}],"date_updated":"2022-01-06T06:59:19Z","title":"The Legal Classification of Identity-Based Signatures","type":"report","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":232052,"file_id":"1568","access_level":"closed","file_name":"349-CompLawSorge14.pdf","date_updated":"2018-03-21T13:08:36Z","creator":"florida","date_created":"2018-03-21T13:08:36Z"}],"status":"public","abstract":[{"lang":"eng","text":"Identity-based cryptography has attracted attention in the cryptographic research communityin recent years. Despite the importance of cryptographic schemes for applicationsin business and law, the legal implications of identity-based cryptography have not yetbeen discussed. We investigate how identity-based signatures fit into the legal framework.We focus on the European Signature Directive, but also take the UNCITRAL Model Law onElectronic Signatures into account. In contrast to previous assumptions, identity-basedsignature schemes can, in principle, be used even for qualified electronic signatures,which can replace handwritten signatures in the member states of the European Union.We derive requirements to be taken into account in the development of future identitybasedsignature schemes."}],"user_id":"15504","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"349","file_date_updated":"2018-03-21T13:08:36Z","ddc":["040"]},{"type":"conference","publication":"Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)","abstract":[{"lang":"eng","text":"In the last decade pairings have become an important, and often indispensable, ingredient in the construction of identity-based and attribute-based cryptosystems, as well as group signatures and credential systems. Consequently, the applicability of timing, power, or fault attacks to implementations of pairings is an important research topic. We will review some of the known results in this area."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"355-Bloemer2014.pdf","file_id":"1412","access_level":"closed","file_size":293394,"creator":"florida","date_created":"2018-03-20T07:22:29Z","date_updated":"2018-03-20T07:22:29Z"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"_id":"355","user_id":"25078","department":[{"_id":"64"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:22:29Z","has_accepted_license":"1","year":"2014","citation":{"ieee":"J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,” in <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 1--7.","chicago":"Blömer, Johannes, Peter Günther, and Gennadij Liske. “Tampering Attacks in Pairing-Based Cryptography.” In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 1--7, 2014. <a href=\"https://doi.org/10.1109/FDTC.2014.10\">https://doi.org/10.1109/FDTC.2014.10</a>.","ama":"Blömer J, Günther P, Liske G. Tampering attacks in pairing-based cryptography. In: <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>. ; 2014:1--7. doi:<a href=\"https://doi.org/10.1109/FDTC.2014.10\">10.1109/FDTC.2014.10</a>","apa":"Blömer, J., Günther, P., &#38; Liske, G. (2014). Tampering attacks in pairing-based cryptography. In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i> (pp. 1--7). <a href=\"https://doi.org/10.1109/FDTC.2014.10\">https://doi.org/10.1109/FDTC.2014.10</a>","mla":"Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.” <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 1--7, doi:<a href=\"https://doi.org/10.1109/FDTC.2014.10\">10.1109/FDTC.2014.10</a>.","bibtex":"@inproceedings{Blömer_Günther_Liske_2014, title={Tampering attacks in pairing-based cryptography}, DOI={<a href=\"https://doi.org/10.1109/FDTC.2014.10\">10.1109/FDTC.2014.10</a>}, booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}, author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2014}, pages={1--7} }","short":"J. Blömer, P. Günther, G. Liske, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7."},"page":"1--7","date_updated":"2022-01-06T06:59:23Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"last_name":"Günther","full_name":"Günther, Peter","first_name":"Peter"},{"full_name":"Liske, Gennadij","last_name":"Liske","first_name":"Gennadij"}],"date_created":"2017-10-17T12:42:01Z","title":"Tampering attacks in pairing-based cryptography","doi":"10.1109/FDTC.2014.10"},{"has_accepted_license":"1","year":"2014","citation":{"apa":"Petrlic, R., Jungmann, A., Platenius, M. C., Schäfer, W., &#38; Sorge, C. (2014). Security and Privacy Challenges in On-The-Fly Computing. In <i>Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)</i> (pp. 131–142).","mla":"Petrlic, Ronald, et al. “Security and Privacy Challenges in On-The-Fly Computing.” <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>, 2014, pp. 131–42.","bibtex":"@inproceedings{Petrlic_Jungmann_Platenius_Schäfer_Sorge_2014, title={Security and Privacy Challenges in On-The-Fly Computing}, booktitle={Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)}, author={Petrlic, Ronald and Jungmann, Alexander and Platenius, Marie Christin and Schäfer, Wilhelm and Sorge, Christoph}, year={2014}, pages={131–142} }","short":"R. Petrlic, A. Jungmann, M.C. Platenius, W. Schäfer, C. Sorge, in: Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014), 2014, pp. 131–142.","ama":"Petrlic R, Jungmann A, Platenius MC, Schäfer W, Sorge C. Security and Privacy Challenges in On-The-Fly Computing. In: <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>. ; 2014:131-142.","ieee":"R. Petrlic, A. Jungmann, M. C. Platenius, W. Schäfer, and C. Sorge, “Security and Privacy Challenges in On-The-Fly Computing,” in <i>Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)</i>, 2014, pp. 131–142.","chicago":"Petrlic, Ronald, Alexander Jungmann, Marie Christin Platenius, Wilhelm Schäfer, and Christoph Sorge. “Security and Privacy Challenges in On-The-Fly Computing.” In <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>, 131–42, 2014."},"page":"131-142","date_updated":"2022-01-06T06:59:29Z","author":[{"full_name":"Petrlic, Ronald","last_name":"Petrlic","first_name":"Ronald"},{"first_name":"Alexander","full_name":"Jungmann, Alexander","last_name":"Jungmann"},{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"},{"first_name":"Christoph","last_name":"Sorge","full_name":"Sorge, Christoph"}],"date_created":"2017-10-17T12:42:03Z","title":"Security and Privacy Challenges in On-The-Fly Computing","type":"conference","publication":"Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)","abstract":[{"lang":"eng","text":"On-The-Fly (OTF) Computing constitutes an approach towards highly dynamic and individualized software markets. Based on service-oriented computing, OTF Computing is about realizing global markets of services that can be flexibly combined. We report on our current research activities, the security and privacy implications thereof, and our approaches to tackle the challenges. Furthermore, we discuss how the security and privacy challenges are addressed in research projects similar to OTF Computing."}],"file":[{"file_size":74488,"access_level":"closed","file_name":"366-otf-security-privacy-final.pdf","file_id":"1405","date_updated":"2018-03-20T07:18:47Z","date_created":"2018-03-20T07:18:47Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"_id":"366","user_id":"477","department":[{"_id":"76"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-20T07:18:47Z"}]