[{"title":"Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain","department":[{"_id":"7"},{"_id":"64"},{"_id":"19"},{"_id":"526"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"date_updated":"2023-05-23T10:12:32Z","language":[{"iso":"eng"}],"extern":"1","abstract":[{"lang":"eng","text":"Market transactions are subject to information asymmetry about the delivered value proposition, causing transaction costs and adverse market effects among buyers and sellers. Information systems research has investigated how review systems can reduce information asymmetry in business-to-consumer markets. However, these systems cannot be readily applied to business-to-business markets, are vulnerable to manipulation, and suffer from conceptual weak spots since they use textual data or star ratings. Building on design science research, we conceptualize a new class of reputation systems based on monetary-based payments as quantitative ratings for each transaction stored on a blockchain. Using cryptography, we show that our system assures content confidentiality so that buyers can share and sell their ratings selectively, establishing a reputation ecosystem. Our prescriptive insights advance the design of reputation systems and offer new paths to understanding the antecedents, dynamics, and consequences to reduce information asymmetry in B2B transactions."}],"ddc":["330"],"user_id":"27207","author":[{"first_name":"Simon","full_name":"Hemmrich, Simon","last_name":"Hemmrich","id":"83557"},{"id":"27207","last_name":"Bobolz","full_name":"Bobolz, Jan","first_name":"Jan"},{"id":"59677","last_name":"Beverungen","full_name":"Beverungen, Daniel","first_name":"Daniel"},{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"publication":"ECIS 2023 Research Papers","file_date_updated":"2023-05-23T10:11:03Z","file":[{"file_id":"45209","creator":"jbobolz","file_size":958740,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2023-05-23T10:11:03Z","date_created":"2023-05-23T10:11:03Z","file_name":"A_Blockchain_Based_Reputation_Ecosystem_for_Business___Payments_as_Ratings.pdf","access_level":"closed"}],"has_accepted_license":"1","status":"public","date_created":"2023-05-16T08:31:27Z","_id":"44855","conference":{"name":"ECIS 2023"},"main_file_link":[{"url":"https://aisel.aisnet.org/ecis2023_rp/344"}],"citation":{"apa":"Hemmrich, S., Bobolz, J., Beverungen, D., & Blömer, J. (2023). Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. ECIS 2023 Research Papers. ECIS 2023.","ama":"Hemmrich S, Bobolz J, Beverungen D, Blömer J. Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. In: ECIS 2023 Research Papers. ; 2023.","chicago":"Hemmrich, Simon, Jan Bobolz, Daniel Beverungen, and Johannes Blömer. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” In ECIS 2023 Research Papers, 2023.","bibtex":"@inproceedings{Hemmrich_Bobolz_Beverungen_Blömer_2023, title={Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain}, booktitle={ECIS 2023 Research Papers}, author={Hemmrich, Simon and Bobolz, Jan and Beverungen, Daniel and Blömer, Johannes}, year={2023} }","mla":"Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” ECIS 2023 Research Papers, 2023.","short":"S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research Papers, 2023.","ieee":"S. Hemmrich, J. Bobolz, D. Beverungen, and J. Blömer, “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain,” presented at the ECIS 2023, 2023."},"year":"2023","type":"conference"},{"date_updated":"2023-07-07T11:13:37Z","oa":"1","doi":"10.5281/zenodo.8068755","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"place":"Paderborn","title":"Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems","department":[{"_id":"7"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"}],"editor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"_id":"45901","intvolume":" 412","page":"237-246","type":"book_chapter","citation":{"mla":"Blömer, Johannes, et al. “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–46, doi:10.5281/zenodo.8068755.","bibtex":"@inbook{Blömer_Bobolz_Eidens_Jager_Kramer_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems}, volume={412}, DOI={10.5281/zenodo.8068755}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Blömer, Johannes and Bobolz, Jan and Eidens, Fabian and Jager, Tibor and Kramer, Paul}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={237–246}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","apa":"Blömer, J., Bobolz, J., Eidens, F., Jager, T., & Kramer, P. (2023). Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 237–246). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068755","ama":"Blömer J, Bobolz J, Eidens F, Jager T, Kramer P. Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:237-246. doi:10.5281/zenodo.8068755","chicago":"Blömer, Johannes, Jan Bobolz, Fabian Eidens, Tibor Jager, and Paul Kramer. “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:237–46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068755.","ieee":"J. Blömer, J. Bobolz, F. Eidens, T. Jager, and P. Kramer, “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–246.","short":"J. Blömer, J. Bobolz, F. Eidens, T. Jager, P. Kramer, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 237–246."},"year":"2023","user_id":"477","ddc":["004"],"file":[{"access_level":"open_access","file_name":"T2-Chapter-SFB-Buch-Final.pdf","date_created":"2023-07-07T08:41:35Z","content_type":"application/pdf","date_updated":"2023-07-07T11:13:37Z","relation":"main_file","file_size":5944790,"file_id":"45902","creator":"florida"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file_date_updated":"2023-07-07T11:13:37Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"id":"27207","last_name":"Bobolz","full_name":"Bobolz, Jan","first_name":"Jan"},{"full_name":"Eidens, Fabian","first_name":"Fabian","id":"25078","last_name":"Eidens"},{"id":"64669","last_name":"Jager","full_name":"Jager, Tibor","first_name":"Tibor"},{"full_name":"Kramer, Paul","first_name":"Paul","id":"64594","last_name":"Kramer"}],"date_created":"2023-07-07T08:41:44Z","status":"public","has_accepted_license":"1","volume":412},{"title":"On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC","user_id":"41047","status":"public","date_created":"2022-12-28T16:02:11Z","project":[{"_id":"1","name":"SFB 901: SFB 901","grant_number":"160364472"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"last_name":"Bröcher","id":"41047","first_name":"Henrik","full_name":"Bröcher, Henrik"}],"department":[{"_id":"34"},{"_id":"64"}],"oa":"1","date_updated":"2023-09-07T10:01:00Z","_id":"35014","conference":{"location":"Taipeh, Taiwan","start_date":"2023-11-29","name":"TCC 2023","end_date":"2023-12-02"},"citation":{"chicago":"Blömer, Johannes, Jan Bobolz, and Henrik Bröcher. “On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC,” 2023.","apa":"Blömer, J., Bobolz, J., & Bröcher, H. (2023). On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. TCC 2023, Taipeh, Taiwan.","ama":"Blömer J, Bobolz J, Bröcher H. On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. In: ; 2023.","bibtex":"@inproceedings{Blömer_Bobolz_Bröcher_2023, title={On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC}, author={Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik}, year={2023} }","mla":"Blömer, Johannes, et al. On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC. 2023.","short":"J. Blömer, J. Bobolz, H. Bröcher, in: 2023.","ieee":"J. Blömer, J. Bobolz, and H. Bröcher, “On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC,” presented at the TCC 2023, Taipeh, Taiwan, 2023."},"type":"conference","year":"2023","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/1762"}]},{"main_file_link":[{"url":"https://eprint.iacr.org/2023/464","open_access":"1"}],"type":"conference","year":"2023","citation":{"chicago":"Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” 2023.","apa":"Blömer, J., Bobolz, J., & Porzenheim, L. A. (2023). A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. Asiacrypt 2023, Guangzhou, China.","ama":"Blömer J, Bobolz J, Porzenheim LA. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. In: ; 2023.","bibtex":"@inproceedings{Blömer_Bobolz_Porzenheim_2023, title={A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices}, author={Blömer, Johannes and Bobolz, Jan and Porzenheim, Laurens Alexander}, year={2023} }","mla":"Blömer, Johannes, et al. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. 2023.","short":"J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.","ieee":"J. Blömer, J. Bobolz, and L. A. Porzenheim, “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” presented at the Asiacrypt 2023, Guangzhou, China, 2023."},"language":[{"iso":"eng"}],"_id":"43458","date_updated":"2023-09-07T09:53:26Z","conference":{"end_date":"2023-12-08","location":"Guangzhou, China","start_date":"2023-12-04","name":"Asiacrypt 2023"},"oa":"1","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"full_name":"Porzenheim, Laurens Alexander","first_name":"Laurens Alexander","id":"47434","last_name":"Porzenheim"}],"department":[{"_id":"64"}],"status":"public","date_created":"2023-04-12T08:18:41Z","project":[{"name":"SFB 901: SFB 901","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"title":"A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices","user_id":"47434"},{"title":"Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes","user_id":"477","date_created":"2021-10-21T07:51:32Z","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"82","name":"SFB 901 - Project Area T"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"status":"public","department":[{"_id":"64"}],"author":[{"first_name":"Jan","full_name":"Bobolz, Jan","last_name":"Bobolz","id":"27207"},{"id":"25078","last_name":"Eidens","full_name":"Eidens, Fabian","first_name":"Fabian"},{"full_name":"Heitjohann, Raphael","first_name":"Raphael","last_name":"Heitjohann"},{"first_name":"Jeremy","full_name":"Fell, Jeremy","last_name":"Fell"}],"publisher":"IACR eprint","oa":"1","date_updated":"2022-11-18T09:38:42Z","_id":"26645","year":"2021","type":"preprint","citation":{"short":"J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).","ieee":"J. Bobolz, F. Eidens, R. Heitjohann, and J. Fell, “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.","chicago":"Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.","apa":"Bobolz, J., Eidens, F., Heitjohann, R., & Fell, J. (2021). Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. IACR eprint.","ama":"Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 2021.","mla":"Bobolz, Jan, et al. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. IACR eprint, 2021.","bibtex":"@article{Bobolz_Eidens_Heitjohann_Fell_2021, title={Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes}, publisher={IACR eprint}, author={Bobolz, Jan and Eidens, Fabian and Heitjohann, Raphael and Fell, Jeremy}, year={2021} }"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2021/961","open_access":"1"}]},{"date_updated":"2022-01-27T13:02:23Z","_id":"29566","doi":"10.1007/978-3-030-92548-2_9","language":[{"iso":"eng"}],"citation":{"short":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021.","ieee":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding Attribute-Based Credentials,” 2021, doi: 10.1007/978-3-030-92548-2_9.","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai Samelin. “Issuer-Hiding Attribute-Based Credentials.” In Cryptology and Network Security. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-92548-2_9.","apa":"Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., & Samelin, K. (2021). Issuer-Hiding Attribute-Based Credentials. Cryptology and Network Security. https://doi.org/10.1007/978-3-030-92548-2_9","ama":"Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based Credentials. In: Cryptology and Network Security. Springer International Publishing; 2021. doi:10.1007/978-3-030-92548-2_9","mla":"Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” Cryptology and Network Security, Springer International Publishing, 2021, doi:10.1007/978-3-030-92548-2_9.","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham}, title={Issuer-Hiding Attribute-Based Credentials}, DOI={10.1007/978-3-030-92548-2_9}, booktitle={Cryptology and Network Security}, publisher={Springer International Publishing}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Ramacher, Sebastian and Samelin, Kai}, year={2021} }"},"type":"conference","year":"2021","place":"Cham","user_id":"27207","title":"Issuer-Hiding Attribute-Based Credentials","publication":"Cryptology and Network Security","department":[{"_id":"7"},{"_id":"64"}],"publisher":"Springer International Publishing","author":[{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"},{"last_name":"Eidens","id":"25078","first_name":"Fabian","full_name":"Eidens, Fabian"},{"last_name":"Krenn","first_name":"Stephan","full_name":"Krenn, Stephan"},{"last_name":"Ramacher","first_name":"Sebastian","full_name":"Ramacher, Sebastian"},{"first_name":"Kai","full_name":"Samelin, Kai","last_name":"Samelin"}],"date_created":"2022-01-27T13:00:21Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"status":"public","publication_status":"published","publication_identifier":{"isbn":["9783030925475","9783030925482"],"issn":["0302-9743","1611-3349"]}},{"user_id":"477","ddc":["000"],"date_created":"2020-04-09T10:00:29Z","has_accepted_license":"1","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-04-09T09:59:03Z","file_id":"16488","creator":"feidens","file_size":553623,"access_level":"closed","file_name":"main.pdf","date_created":"2020-04-09T09:59:03Z"}],"publication":"Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),","file_date_updated":"2020-04-09T09:59:03Z","author":[{"first_name":"Jan","full_name":"Bobolz, Jan","last_name":"Bobolz","id":"27207"},{"id":"25078","last_name":"Eidens","full_name":"Eidens, Fabian","first_name":"Fabian"},{"last_name":"Krenn","first_name":"Stephan","full_name":"Krenn, Stephan"},{"first_name":"Daniel","full_name":"Slamanig, Daniel","last_name":"Slamanig"},{"first_name":"Christoph","full_name":"Striecks, Christoph","last_name":"Striecks"}],"publisher":"ACM","conference":{"name":"ASIA CCS'20","location":"Taiwan"},"_id":"16487","type":"conference","citation":{"bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Slamanig_Striecks_2020, place={New York, NY, USA}, title={Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection}, DOI={10.1145/3320269.3384769}, booktitle={Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),}, publisher={ACM}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Slamanig, Daniel and Striecks, Christoph}, year={2020} }","mla":"Bobolz, Jan, et al. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, 2020, doi:10.1145/3320269.3384769.","apa":"Bobolz, J., Eidens, F., Krenn, S., Slamanig, D., & Striecks, C. (2020). Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),. New York, NY, USA: ACM. https://doi.org/10.1145/3320269.3384769","ama":"Bobolz J, Eidens F, Krenn S, Slamanig D, Striecks C. Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),. New York, NY, USA: ACM; 2020. doi:10.1145/3320269.3384769","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph Striecks. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” In Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),. New York, NY, USA: ACM, 2020. https://doi.org/10.1145/3320269.3384769.","ieee":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, and C. Striecks, “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection,” in Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), Taiwan, 2020.","short":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, C. Striecks, in: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, New York, NY, USA, 2020."},"year":"2020","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2020/382"}],"title":"Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection","place":"New York, NY, USA","project":[{"name":"SFB 901","_id":"1"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"_id":"82","name":"SFB 901 - Project Area T"}],"department":[{"_id":"64"}],"oa":"1","doi":"10.1145/3320269.3384769","date_updated":"2022-01-06T06:52:51Z","language":[{"iso":"eng"}]},{"conference":{"start_date":"2019-11-11","name":"26th ACM Conference on Computer and Communications Security","location":"London","end_date":"2019-11-15"},"_id":"13904","type":"conference","year":"2019","citation":{"short":"J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.","ieee":"J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,” presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi: 10.1145/3319535.3354223.","ama":"Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:10.1145/3319535.3354223","apa":"Blömer, J., Bobolz, J., Diemert, D. P., & Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. 26th ACM Conference on Computer and Communications Security, London. https://doi.org/10.1145/3319535.3354223","chicago":"Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens. “Updatable Anonymous Credentials and Applications to Incentive Systems.” In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019. https://doi.org/10.1145/3319535.3354223.","mla":"Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.” Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019, doi:10.1145/3319535.3354223.","bibtex":"@inproceedings{Blömer_Bobolz_Diemert_Eidens_2019, series={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, title={Updatable Anonymous Credentials and Applications to Incentive Systems}, DOI={10.1145/3319535.3354223}, booktitle={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, author={Blömer, Johannes and Bobolz, Jan and Diemert, Denis Pascal and Eidens, Fabian}, year={2019}, collection={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19} }"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/169.pdf"}],"ddc":["006"],"user_id":"25078","abstract":[{"lang":"eng","text":"In this paper, we introduce updatable anonymous credential systems (UACS) and use them to construct a new privacy-preserving incentive system. In a UACS, a user holding a credential certifying some attributes can interact with the corresponding issuer to update his attributes. During this, the issuer knows which update function is run, but does not learn the user's previous attributes. Hence the update process preserves anonymity of the user. One example for a class of update functions are additive updates of integer attributes, where the issuer increments an unknown integer attribute value v by some known value k. This kind of update is motivated by an application of UACS to incentive systems. Users in an incentive system can anonymously accumulate points, e.g. in a shop at checkout, and spend them later, e.g. for a discount."}],"date_created":"2019-10-18T08:09:44Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","file_date_updated":"2019-10-18T08:07:49Z","author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"},{"first_name":"Denis Pascal","full_name":"Diemert, Denis Pascal","last_name":"Diemert","id":"44071"},{"last_name":"Eidens","id":"25078","first_name":"Fabian","full_name":"Eidens, Fabian"}],"file":[{"file_id":"13907","creator":"jbobolz","file_size":838949,"relation":"main_file","content_type":"application/pdf","date_updated":"2019-10-18T08:07:49Z","date_created":"2019-10-18T08:07:49Z","file_name":"full_eprinted_v2.pdf","access_level":"closed"}],"doi":"10.1145/3319535.3354223","oa":"1","date_updated":"2023-01-10T10:25:27Z","language":[{"iso":"eng"}],"series_title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","title":"Updatable Anonymous Credentials and Applications to Incentive Systems","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"7"},{"_id":"64"}]},{"_id":"3265","conference":{"location":"Hamburg, Germany","name":"ARES 2018 - SECPID","start_date":"2018-08-27","end_date":"2018-08-30"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/835"}],"year":"2018","citation":{"chicago":"Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials with Reputation System.” In Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM, n.d. https://doi.org/10.1145/3230833.3234517.","apa":"Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation System. In Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3234517","ama":"Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM. doi:10.1145/3230833.3234517","mla":"Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.” Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, doi:10.1145/3230833.3234517.","bibtex":"@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with Reputation System}, DOI={10.1145/3230833.3234517}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan and et al.} }","short":"K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L. Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling, M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA, n.d.","ieee":"K. Bemmann et al., “Fully-Featured Anonymous Credentials with Reputation System,” in Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, Hamburg, Germany."},"type":"conference","abstract":[{"text":"We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials), an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing CLARC, users can receive attribute-based credentials from issuers. They can efficiently prove that their credentials satisfy complex (access) policies in a privacy-preserving way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore, CLARC is the first ACS that is combined with an anonymous reputation system where users can anonymously rate services. A user who gets access to a service via a credential, also anonymously receives a review token to rate the service. If a user creates more than a single rating, this can be detected by anyone, preventing users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility of our construction, we present an open-source prototype implementation.","lang":"eng"}],"user_id":"25078","ddc":["000"],"file":[{"access_level":"closed","file_name":"react_acs.pdf","date_created":"2018-11-08T10:17:39Z","relation":"main_file","date_updated":"2018-11-08T10:17:39Z","content_type":"application/pdf","file_id":"5428","creator":"feidens","file_size":920843}],"author":[{"first_name":"Kai","full_name":"Bemmann, Kai","last_name":"Bemmann"},{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"id":"27207","last_name":"Bobolz","full_name":"Bobolz, Jan","first_name":"Jan"},{"last_name":"Bröcher","id":"41047","first_name":"Henrik","full_name":"Bröcher, Henrik"},{"last_name":"Diemert","id":"44071","first_name":"Denis Pascal","full_name":"Diemert, Denis Pascal"},{"full_name":"Eidens, Fabian","first_name":"Fabian","id":"25078","last_name":"Eidens"},{"last_name":"Eilers","full_name":"Eilers, Lukas","first_name":"Lukas"},{"full_name":"Haltermann, Jan Frederik","first_name":"Jan Frederik","id":"44413","last_name":"Haltermann"},{"last_name":"Juhnke","id":"48090","first_name":"Jakob","full_name":"Juhnke, Jakob"},{"last_name":"Otour","full_name":"Otour, Burhan","first_name":"Burhan"},{"last_name":"Porzenheim","id":"47434","first_name":"Laurens Alexander","full_name":"Porzenheim, Laurens Alexander"},{"last_name":"Pukrop","first_name":"Simon","full_name":"Pukrop, Simon"},{"full_name":"Schilling, Erik","first_name":"Erik","last_name":"Schilling"},{"last_name":"Schlichtig","id":"32312","first_name":"Michael","full_name":"Schlichtig, Michael"},{"full_name":"Stienemeier, Marcel","first_name":"Marcel","last_name":"Stienemeier"}],"publisher":"ACM","quality_controlled":"1","file_date_updated":"2018-11-08T10:17:39Z","publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18","has_accepted_license":"1","status":"public","date_created":"2018-06-14T11:19:29Z","date_updated":"2022-01-06T06:59:07Z","oa":"1","doi":"10.1145/3230833.3234517","language":[{"iso":"eng"}],"place":"New York, NY, USA","related_material":{"link":[{"relation":"software","url":"https://github.com/upbcuk"}]},"title":"Fully-Featured Anonymous Credentials with Reputation System","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"KogniHome - die mitdenkende Wohnung","_id":"44"}],"publication_status":"accepted","publication_identifier":{"isbn":["978-1-4503-6448-5"]}},{"publication_status":"draft","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_created":"2018-11-25T08:08:40Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-12-31T09:55:30Z","department":[{"_id":"7"},{"_id":"64"},{"_id":"79"}],"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Setzer","id":"11108","first_name":"Alexander","full_name":"Setzer, Alexander"}],"file":[{"access_level":"closed","file_name":"draft-2018.pdf","date_created":"2018-12-31T09:55:30Z","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-12-31T09:55:30Z","file_id":"6435","creator":"jbobolz","file_size":470968}],"ddc":["000"],"title":"Provably Anonymous Communication Based on Trusted Execution Environments","user_id":"27207","abstract":[{"text":"In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks.\r\nFor this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes.\r\nIn our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks. \r\nOur techniques are very general and can be used as a basis for future constructions with similar goals.","lang":"eng"}],"type":"working_paper","year":"2018","citation":{"ieee":"J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments. .","short":"J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","bibtex":"@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander} }","mla":"Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.","chicago":"Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","ama":"Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication Based on Trusted Execution Environments.","apa":"Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments."},"language":[{"iso":"eng"}],"_id":"5820","date_updated":"2022-01-06T07:02:43Z"},{"abstract":[{"text":"In this paper, we introduce the notion of delegatable attribute-based anonymous credentials (DAAC). Such systems offer fine-grained anonymous access control and they give the credential holder the ability to issue more restricted credentials to other users. In our model, credentials are parameterized with attributes that (1) express what the credential holder himself has been certified and (2) define which attributes he may issue to others. Furthermore, we present a practical construction of DAAC. For this construction, we deviate from the usual approach of embedding a certificate chain in the credential. Instead, we introduce a novel approach for which we identify a new primitive we call dynamically malleable signatures (DMS) as the main ingredient. This primitive may be of independent interest. We also give a first instantiation of DMS with efficient protocols. ","lang":"eng"}],"user_id":"25078","ddc":["004"],"file":[{"date_created":"2018-11-02T13:41:16Z","file_name":"2018-340.pdf","access_level":"closed","file_size":542171,"creator":"ups","file_id":"5252","date_updated":"2018-11-02T13:41:16Z","content_type":"application/pdf","relation":"main_file","success":1}],"author":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"}],"file_date_updated":"2018-11-02T13:41:16Z","publication":"ACNS 2018 Applied Cryptography & Network security","status":"public","has_accepted_license":"1","date_created":"2018-04-17T12:28:25Z","_id":"2379","conference":{"location":"Leuven, Belgium","name":"The 16th International Conference on Applied Cryptography and Network Security"},"main_file_link":[{"url":"https://eprint.iacr.org/2018/340","open_access":"1"}],"citation":{"ieee":"J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures,” presented at the The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi: 10.1007/978-3-319-93387-0_12.","short":"J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography & Network Security, n.d.","bibtex":"@inproceedings{Blömer_Bobolz, series={LNCS}, title={Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures}, DOI={10.1007/978-3-319-93387-0_12}, booktitle={ACNS 2018 Applied Cryptography & Network security}, author={Blömer, Johannes and Bobolz, Jan}, collection={LNCS} }","mla":"Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.” ACNS 2018 Applied Cryptography & Network Security, doi:10.1007/978-3-319-93387-0_12.","ama":"Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. In: ACNS 2018 Applied Cryptography & Network Security. LNCS. doi:10.1007/978-3-319-93387-0_12","apa":"Blömer, J., & Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. ACNS 2018 Applied Cryptography & Network Security. The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium. https://doi.org/10.1007/978-3-319-93387-0_12","chicago":"Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.” In ACNS 2018 Applied Cryptography & Network Security. LNCS, n.d. https://doi.org/10.1007/978-3-319-93387-0_12."},"type":"conference","year":"2018","title":"Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures","department":[{"_id":"7"},{"_id":"64"}],"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"publication_status":"accepted","date_updated":"2023-01-10T10:28:43Z","oa":"1","doi":"10.1007/978-3-319-93387-0_12","series_title":"LNCS","language":[{"iso":"eng"}]},{"file_date_updated":"2018-07-20T09:54:22Z","department":[{"_id":"64"}],"publisher":"Universität Paderborn","author":[{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"}],"file":[{"date_created":"2018-03-20T07:47:11Z","file_name":"301-thesis_jbobolz_final_02.pdf","access_level":"open_access","file_size":1214027,"creator":"florida","file_id":"1443","content_type":"application/pdf","date_updated":"2018-07-20T09:54:22Z","relation":"main_file"}],"date_created":"2017-10-17T12:41:50Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"has_accepted_license":"1","status":"public","ddc":["040"],"title":"Efficient Verifier-Local Revocation for Anonymous Credentials","user_id":"27207","year":"2015","citation":{"bibtex":"@book{Bobolz_2015, title={Efficient Verifier-Local Revocation for Anonymous Credentials}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2015} }","mla":"Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn, 2015.","chicago":"Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn, 2015.","apa":"Bobolz, J. (2015). Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn.","ama":"Bobolz J. Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn; 2015.","ieee":"J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn, 2015.","short":"J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials, Universität Paderborn, 2015."},"type":"mastersthesis","supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"urn":"3016","date_updated":"2022-01-06T06:58:51Z","_id":"301","oa":"1"},{"year":"2015","type":"report","citation":{"ieee":"W. Schäfer et al., Seminar Theses of the Project Group Cybertron. 2015.","short":"W. Schäfer, S. Dziwok, U. Pohlmann, J. Bobolz, M. Czech, A.P. Dann, J. Geismann, M. Hüwe, A. Krieger, G. Piskachev, D. Schubert, R. Wohlrab, Seminar Theses of the Project Group Cybertron, 2015.","bibtex":"@book{Schäfer_Dziwok_Pohlmann_Bobolz_Czech_Dann_Geismann_Hüwe_Krieger_Piskachev_et al._2015, title={Seminar Theses of the Project Group Cybertron}, author={Schäfer, Wilhelm and Dziwok, Stefan and Pohlmann, Uwe and Bobolz, Jan and Czech, Mike and Dann, Andreas Peter and Geismann, Johannes and Hüwe, Marcus and Krieger, Arthur and Piskachev, Goran and et al.}, year={2015} }","mla":"Schäfer, Wilhelm, et al. Seminar Theses of the Project Group Cybertron. 2015.","chicago":"Schäfer, Wilhelm, Stefan Dziwok, Uwe Pohlmann, Jan Bobolz, Mike Czech, Andreas Peter Dann, Johannes Geismann, et al. Seminar Theses of the Project Group Cybertron, 2015.","ama":"Schäfer W, Dziwok S, Pohlmann U, et al. Seminar Theses of the Project Group Cybertron.; 2015.","apa":"Schäfer, W., Dziwok, S., Pohlmann, U., Bobolz, J., Czech, M., Dann, A. P., Geismann, J., Hüwe, M., Krieger, A., Piskachev, G., Schubert, D., & Wohlrab, R. (2015). Seminar Theses of the Project Group Cybertron."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:40Z","_id":"20832","status":"public","date_created":"2020-12-22T10:03:05Z","author":[{"last_name":"Schäfer","full_name":"Schäfer, Wilhelm","first_name":"Wilhelm"},{"id":"3901","last_name":"Dziwok","orcid":"http://orcid.org/0000-0002-8679-6673","full_name":"Dziwok, Stefan","first_name":"Stefan"},{"last_name":"Pohlmann","full_name":"Pohlmann, Uwe","first_name":"Uwe"},{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"last_name":"Czech","first_name":"Mike","full_name":"Czech, Mike"},{"last_name":"Dann","id":"26886","first_name":"Andreas Peter","full_name":"Dann, Andreas Peter"},{"id":"20063","last_name":"Geismann","full_name":"Geismann, Johannes","orcid":"https://orcid.org/0000-0003-2015-2047","first_name":"Johannes"},{"full_name":"Hüwe, Marcus","first_name":"Marcus","id":"13606","last_name":"Hüwe"},{"first_name":"Arthur","full_name":"Krieger, Arthur","last_name":"Krieger"},{"id":"41936","last_name":"Piskachev","full_name":"Piskachev, Goran","orcid":"0000-0003-4424-5838","first_name":"Goran"},{"first_name":"David","full_name":"Schubert, David","last_name":"Schubert","id":"9106"},{"full_name":"Wohlrab, Rebekka","first_name":"Rebekka","last_name":"Wohlrab"}],"department":[{"_id":"76"}],"title":"Seminar Theses of the Project Group Cybertron","user_id":"5786"},{"file":[{"access_level":"open_access","file_name":"thesis_jbobolz_final.pdf","date_created":"2018-04-13T11:42:08Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-06-29T09:56:54Z","creator":"jbobolz","file_id":"2346","file_size":874286}],"department":[{"_id":"64"}],"file_date_updated":"2018-06-29T09:56:54Z","author":[{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"}],"publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:27Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"status":"public","has_accepted_license":"1","user_id":"27207","title":"Security Proofs for Pairing-Based Cryptography in the Generic Group Model","ddc":["000"],"citation":{"ieee":"J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic Group Model. Universität Paderborn, 2013.","short":"J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic Group Model, Universität Paderborn, 2013.","bibtex":"@book{Bobolz_2013, title={Security Proofs for Pairing-Based Cryptography in the Generic Group Model}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2013} }","mla":"Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic Group Model. Universität Paderborn, 2013.","chicago":"Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic Group Model. Universität Paderborn, 2013.","ama":"Bobolz J. Security Proofs for Pairing-Based Cryptography in the Generic Group Model. Universität Paderborn; 2013.","apa":"Bobolz, J. (2013). Security Proofs for Pairing-Based Cryptography in the Generic Group Model. Universität Paderborn."},"type":"bachelorsthesis","year":"2013","urn":"4875","_id":"487","date_updated":"2022-01-06T07:01:28Z","oa":"1"}]