[{"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"date_updated":"2023-07-07T11:13:37Z","date_created":"2023-07-07T08:41:35Z","creator":"florida","file_size":5944790,"file_id":"45902","file_name":"T2-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"language":[{"iso":"eng"}],"ddc":["004"],"year":"2023","date_created":"2023-07-07T08:41:44Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","title":"Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems","type":"book_chapter","status":"public","editor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"department":[{"_id":"7"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","_id":"45901","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"}],"file_date_updated":"2023-07-07T11:13:37Z","has_accepted_license":"1","intvolume":"       412","page":"237-246","citation":{"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. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:237-246. doi:<a href=\"https://doi.org/10.5281/zenodo.8068755\">10.5281/zenodo.8068755</a>","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 <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, 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. <a href=\"https://doi.org/10.5281/zenodo.8068755\">https://doi.org/10.5281/zenodo.8068755</a>.","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 <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, 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.","mla":"Blömer, Johannes, et al. “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–46, doi:<a href=\"https://doi.org/10.5281/zenodo.8068755\">10.5281/zenodo.8068755</a>.","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={<a href=\"https://doi.org/10.5281/zenodo.8068755\">10.5281/zenodo.8068755</a>}, 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} }","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.","apa":"Blömer, J., Bobolz, J., Eidens, F., Jager, T., &#38; 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, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 237–246). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068755\">https://doi.org/10.5281/zenodo.8068755</a>"},"place":"Paderborn","volume":412,"author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Jan","last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan"},{"first_name":"Fabian","full_name":"Eidens, Fabian","id":"25078","last_name":"Eidens"},{"first_name":"Tibor","id":"64669","full_name":"Jager, Tibor","last_name":"Jager"},{"id":"64594","full_name":"Kramer, Paul","last_name":"Kramer","first_name":"Paul"}],"date_updated":"2023-07-07T11:13:37Z","oa":"1","doi":"10.5281/zenodo.8068755"},{"language":[{"iso":"eng"}],"ddc":["004"],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"access_level":"open_access","file_name":"C1-Chapter-SFB-Buch-Final.pdf","file_id":"45892","file_size":320980,"date_created":"2023-07-07T08:08:37Z","creator":"florida","date_updated":"2023-07-07T11:18:21Z","relation":"main_file","content_type":"application/pdf"}],"date_created":"2023-07-07T08:08:47Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","title":"Robustness and Security","year":"2023","department":[{"_id":"7"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","_id":"45891","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 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"file_date_updated":"2023-07-07T11:18:21Z","type":"book_chapter","status":"public","editor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"volume":412,"author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078","first_name":"Fabian"},{"last_name":"Jager","full_name":"Jager, Tibor","id":"64669","first_name":"Tibor"},{"last_name":"Niehues","id":"36113","full_name":"Niehues, David","first_name":"David"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_updated":"2023-07-07T11:18:21Z","oa":"1","doi":"10.5281/zenodo.8068629","has_accepted_license":"1","intvolume":"       412","page":"145-164","citation":{"ama":"Blömer J, Eidens F, Jager T, Niehues D, Scheideler C. Robustness and Security. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:145-164. doi:<a href=\"https://doi.org/10.5281/zenodo.8068629\">10.5281/zenodo.8068629</a>","ieee":"J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness and Security,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, 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. 145–164.","chicago":"Blömer, Johannes, Fabian Eidens, Tibor Jager, David Niehues, and Christian Scheideler. “Robustness and Security.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:145–64. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068629\">https://doi.org/10.5281/zenodo.8068629</a>.","short":"J. Blömer, F. Eidens, T. Jager, D. Niehues, C. Scheideler, 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. 145–164.","bibtex":"@inbook{Blömer_Eidens_Jager_Niehues_Scheideler_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Robustness and Security}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068629\">10.5281/zenodo.8068629</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Blömer, Johannes and Eidens, Fabian and Jager, Tibor and Niehues, David and Scheideler, Christian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={145–164}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Blömer, Johannes, et al. “Robustness and Security.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:<a href=\"https://doi.org/10.5281/zenodo.8068629\">10.5281/zenodo.8068629</a>.","apa":"Blömer, J., Eidens, F., Jager, T., Niehues, D., &#38; Scheideler, C. (2023). Robustness and Security. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 145–164). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068629\">https://doi.org/10.5281/zenodo.8068629</a>"},"place":"Paderborn"},{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"user_id":"25078","department":[{"_id":"64"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"}],"_id":"35188","citation":{"short":"F. Eidens, Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials, 2022.","mla":"Eidens, Fabian. <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1653\">10.17619/UNIPB/1-1653</a>.","bibtex":"@book{Eidens_2022, title={Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1653\">10.17619/UNIPB/1-1653</a>}, author={Eidens, Fabian}, year={2022} }","apa":"Eidens, F. (2022). <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1653\">https://doi.org/10.17619/UNIPB/1-1653</a>","chicago":"Eidens, Fabian. <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1653\">https://doi.org/10.17619/UNIPB/1-1653</a>.","ieee":"F. Eidens, <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>. 2022.","ama":"Eidens F. <i>Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1653\">10.17619/UNIPB/1-1653</a>"},"year":"2022","doi":"10.17619/UNIPB/1-1653","title":"Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials","author":[{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"}],"date_created":"2023-01-04T09:01:48Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"date_updated":"2023-02-08T21:07:41Z"},{"status":"public","type":"preprint","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"82","name":"SFB 901 - Project Area T"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"26645","citation":{"chicago":"Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 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.","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. <i>Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes</i>. IACR eprint, 2021.","short":"J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).","bibtex":"@article{Bobolz_Eidens_Heitjohann_Fell_2021, title={Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes}, publisher={IACR eprint}, author={Bobolz, Jan and Eidens, Fabian and Heitjohann, Raphael and Fell, Jeremy}, year={2021} }","apa":"Bobolz, J., Eidens, F., Heitjohann, R., &#38; Fell, J. (2021). <i>Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes</i>. IACR eprint."},"year":"2021","main_file_link":[{"url":"https://eprint.iacr.org/2021/961","open_access":"1"}],"title":"Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes","author":[{"last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan","first_name":"Jan"},{"first_name":"Fabian","id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens"},{"full_name":"Heitjohann, Raphael","last_name":"Heitjohann","first_name":"Raphael"},{"last_name":"Fell","full_name":"Fell, Jeremy","first_name":"Jeremy"}],"date_created":"2021-10-21T07:51:32Z","oa":"1","publisher":"IACR eprint","date_updated":"2022-11-18T09:38:42Z"},{"place":"Cham","year":"2021","citation":{"ama":"Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based Credentials. In: <i>Cryptology and Network Security</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai Samelin. “Issuer-Hiding Attribute-Based Credentials.” In <i>Cryptology and Network Security</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">https://doi.org/10.1007/978-3-030-92548-2_9</a>.","ieee":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding Attribute-Based Credentials,” 2021, doi: <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>.","short":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021.","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham}, title={Issuer-Hiding Attribute-Based Credentials}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>}, booktitle={Cryptology and Network Security}, publisher={Springer International Publishing}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Ramacher, Sebastian and Samelin, Kai}, year={2021} }","mla":"Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” <i>Cryptology and Network Security</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>.","apa":"Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., &#38; Samelin, K. (2021). Issuer-Hiding Attribute-Based Credentials. <i>Cryptology and Network Security</i>. <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">https://doi.org/10.1007/978-3-030-92548-2_9</a>"},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030925475","9783030925482"]},"title":"Issuer-Hiding Attribute-Based Credentials","doi":"10.1007/978-3-030-92548-2_9","publisher":"Springer International Publishing","date_updated":"2022-01-27T13:02:23Z","author":[{"last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207","first_name":"Jan"},{"full_name":"Eidens, Fabian","id":"25078","last_name":"Eidens","first_name":"Fabian"},{"first_name":"Stephan","full_name":"Krenn, Stephan","last_name":"Krenn"},{"first_name":"Sebastian","last_name":"Ramacher","full_name":"Ramacher, Sebastian"},{"first_name":"Kai","full_name":"Samelin, Kai","last_name":"Samelin"}],"date_created":"2022-01-27T13:00:21Z","status":"public","type":"conference","publication":"Cryptology and Network Security","language":[{"iso":"eng"}],"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"}],"_id":"29566","user_id":"27207","department":[{"_id":"7"},{"_id":"64"}]},{"department":[{"_id":"64"}],"user_id":"477","_id":"16487","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"_id":"82","name":"SFB 901 - Project Area T"}],"file_date_updated":"2020-04-09T09:59:03Z","type":"conference","status":"public","author":[{"first_name":"Jan","last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207"},{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"},{"first_name":"Stephan","full_name":"Krenn, Stephan","last_name":"Krenn"},{"first_name":"Daniel","full_name":"Slamanig, Daniel","last_name":"Slamanig"},{"first_name":"Christoph","last_name":"Striecks","full_name":"Striecks, Christoph"}],"oa":"1","date_updated":"2022-01-06T06:52:51Z","doi":"10.1145/3320269.3384769","conference":{"location":"Taiwan","name":"ASIA CCS'20"},"main_file_link":[{"url":"https://eprint.iacr.org/2020/382","open_access":"1"}],"has_accepted_license":"1","citation":{"apa":"Bobolz, J., Eidens, F., Krenn, S., Slamanig, D., &#38; Striecks, C. (2020). Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3320269.3384769\">https://doi.org/10.1145/3320269.3384769</a>","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.","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Slamanig_Striecks_2020, place={New York, NY, USA}, title={Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection}, DOI={<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>}, booktitle={Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),}, publisher={ACM}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Slamanig, Daniel and Striecks, Christoph}, year={2020} }","mla":"Bobolz, Jan, et al. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i> ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>.","ama":"Bobolz J, Eidens F, Krenn S, Slamanig D, Striecks C. Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In: <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>","ieee":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, and C. Striecks, “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection,” in <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i> Taiwan, 2020.","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph Striecks. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” In <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM, 2020. <a href=\"https://doi.org/10.1145/3320269.3384769\">https://doi.org/10.1145/3320269.3384769</a>."},"place":"New York, NY, USA","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),","file":[{"file_size":553623,"file_id":"16488","access_level":"closed","file_name":"main.pdf","date_updated":"2020-04-09T09:59:03Z","date_created":"2020-04-09T09:59:03Z","creator":"feidens","success":1,"relation":"main_file","content_type":"application/pdf"}],"date_created":"2020-04-09T10:00:29Z","publisher":"ACM","title":"Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection","year":"2020"},{"ddc":["006"],"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":838949,"file_name":"full_eprinted_v2.pdf","file_id":"13907","access_level":"closed","date_updated":"2019-10-18T08:07:49Z","date_created":"2019-10-18T08:07:49Z","creator":"jbobolz"}],"publication":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","title":"Updatable Anonymous Credentials and Applications to Incentive Systems","date_created":"2019-10-18T08:09:44Z","year":"2019","file_date_updated":"2019-10-18T08:07:49Z","_id":"13904","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"7"},{"_id":"64"}],"series_title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","user_id":"25078","status":"public","type":"conference","conference":{"end_date":"2019-11-15","location":"London","name":"26th ACM Conference on Computer and Communications Security","start_date":"2019-11-11"},"doi":"10.1145/3319535.3354223","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/169.pdf"}],"oa":"1","date_updated":"2023-01-10T10:25:27Z","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Jan","last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan"},{"first_name":"Denis Pascal","full_name":"Diemert, Denis Pascal","id":"44071","last_name":"Diemert"},{"first_name":"Fabian","full_name":"Eidens, Fabian","id":"25078","last_name":"Eidens"}],"citation":{"ama":"Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>","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: <a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>.","chicago":"Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens. “Updatable Anonymous Credentials and Applications to Incentive Systems.” In <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>.","mla":"Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.” <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>, 2019, doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>.","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.","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={<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>}, 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} }","apa":"Blömer, J., Bobolz, J., Diemert, D. P., &#38; Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. 26th ACM Conference on Computer and Communications Security, London. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>"},"has_accepted_license":"1"},{"year":"2018","date_created":"2018-05-24T11:14:02Z","publisher":"Springer International Publishing","title":"Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems","publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings","file":[{"access_level":"closed","file_name":"PracticalAnonymousAndPubliclyL.pdf","file_id":"5253","file_size":3371773,"creator":"ups","date_created":"2018-11-02T13:45:40Z","date_updated":"2018-11-02T13:45:40Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"language":[{"iso":"eng"}],"ddc":["004"],"publication_status":"published","publication_identifier":{"isbn":["9783319769523","9783319769530"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","citation":{"chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, 470–90. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, San Francisco, CA, USA, 2018, pp. 470–490.","ama":"Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>. Cham: Springer International Publishing; 2018:470-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>","short":"J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>}, booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490} }","mla":"Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, Springer International Publishing, 2018, pp. 470–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>.","apa":"Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i> (pp. 470–490). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>"},"page":"470-490","place":"Cham","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"},{"id":"48090","full_name":"Juhnke, Jakob","last_name":"Juhnke","first_name":"Jakob"}],"date_updated":"2022-01-06T06:58:12Z","oa":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/029"}],"doi":"10.1007/978-3-319-76953-0_25","conference":{"name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018","start_date":"2018-04-16","end_date":"2018-04-20","location":"San Francisco, CA, USA"},"type":"conference","status":"public","user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"2862","file_date_updated":"2018-11-02T13:45:40Z"},{"quality_controlled":"1","year":"2018","date_created":"2018-06-14T11:19:29Z","publisher":"ACM","title":"Fully-Featured Anonymous Credentials with Reputation System","publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"react_acs.pdf","file_id":"5428","access_level":"closed","file_size":920843,"creator":"feidens","date_created":"2018-11-08T10:17:39Z","date_updated":"2018-11-08T10:17:39Z"}],"abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"ddc":["000"],"related_material":{"link":[{"url":"https://github.com/upbcuk","relation":"software"}]},"has_accepted_license":"1","publication_identifier":{"isbn":["978-1-4503-6448-5"]},"publication_status":"accepted","citation":{"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 <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>","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.","mla":"Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, ACM, doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>.","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={<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>}, 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.} }","ama":"Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>","ieee":"K. Bemmann <i>et al.</i>, “Fully-Featured Anonymous Credentials with Reputation System,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, Hamburg, Germany.","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 <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>."},"place":"New York, NY, USA","author":[{"first_name":"Kai","last_name":"Bemmann","full_name":"Bemmann, Kai"},{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207","first_name":"Jan"},{"first_name":"Henrik","last_name":"Bröcher","id":"41047","full_name":"Bröcher, Henrik"},{"full_name":"Diemert, Denis Pascal","id":"44071","last_name":"Diemert","first_name":"Denis Pascal"},{"first_name":"Fabian","last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian"},{"first_name":"Lukas","full_name":"Eilers, Lukas","last_name":"Eilers"},{"id":"44413","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann","first_name":"Jan Frederik"},{"first_name":"Jakob","last_name":"Juhnke","full_name":"Juhnke, Jakob","id":"48090"},{"full_name":"Otour, Burhan","last_name":"Otour","first_name":"Burhan"},{"first_name":"Laurens Alexander","full_name":"Porzenheim, Laurens Alexander","id":"47434","last_name":"Porzenheim"},{"last_name":"Pukrop","full_name":"Pukrop, Simon","first_name":"Simon"},{"first_name":"Erik","full_name":"Schilling, Erik","last_name":"Schilling"},{"last_name":"Schlichtig","full_name":"Schlichtig, Michael","id":"32312","first_name":"Michael"},{"last_name":"Stienemeier","full_name":"Stienemeier, Marcel","first_name":"Marcel"}],"oa":"1","date_updated":"2022-01-06T06:59:07Z","doi":"10.1145/3230833.3234517","conference":{"location":"Hamburg, Germany","end_date":"2018-08-30","start_date":"2018-08-27","name":"ARES 2018 - SECPID"},"main_file_link":[{"url":"https://eprint.iacr.org/2018/835","open_access":"1"}],"type":"conference","status":"public","department":[{"_id":"64"}],"user_id":"25078","_id":"3265","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"44","name":"KogniHome - die mitdenkende Wohnung"}],"file_date_updated":"2018-11-08T10:17:39Z"},{"status":"public","type":"conference","file_date_updated":"2018-11-08T10:15:00Z","user_id":"25078","series_title":"Lecture Notes in Computer Science","department":[{"_id":"64"}],"project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"1","name":"SFB 901"}],"_id":"3873","citation":{"short":"J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology And Network Security (CANS), Springer, 2018, pp. 235–255.","mla":"Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.” <i>The International Conference on Cryptology And Network Security (CANS)</i>, vol. 11124, Springer, 2018, pp. 235–55, doi:<a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">10.1007/978-3-030-00434-7_12</a>.","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, series={Lecture Notes in Computer Science}, title={Enhanced Security of Attribute-Based Signatures}, volume={11124}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">10.1007/978-3-030-00434-7_12</a>}, booktitle={The International Conference on Cryptology And Network Security (CANS)}, publisher={Springer}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={235–255}, collection={Lecture Notes in Computer Science} }","apa":"Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Enhanced Security of Attribute-Based Signatures. <i>The International Conference on Cryptology And Network Security (CANS)</i>, <i>11124</i>, 235–255. <a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">https://doi.org/10.1007/978-3-030-00434-7_12</a>","ama":"Blömer J, Eidens F, Juhnke J. Enhanced Security of Attribute-Based Signatures. In: <i>The International Conference on Cryptology And Network Security (CANS)</i>. Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:<a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">10.1007/978-3-030-00434-7_12</a>","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based Signatures,” in <i>The International Conference on Cryptology And Network Security (CANS)</i>, Naples, Italy, 2018, vol. 11124, pp. 235–255, doi: <a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">10.1007/978-3-030-00434-7_12</a>.","chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Enhanced Security of Attribute-Based Signatures.” In <i>The International Conference on Cryptology And Network Security (CANS)</i>, 11124:235–55. Lecture Notes in Computer Science. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00434-7_12\">https://doi.org/10.1007/978-3-030-00434-7_12</a>."},"intvolume":"     11124","page":"235-255","publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["978-3-030-00434-7"]},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/874"}],"conference":{"location":"Naples, Italy","name":"The International Conference on Cryptology And Network Security (CANS)"},"doi":"10.1007/978-3-030-00434-7_12","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Fabian","id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens"},{"last_name":"Juhnke","full_name":"Juhnke, Jakob","id":"48090","first_name":"Jakob"}],"volume":11124,"oa":"1","date_updated":"2023-01-10T10:26:13Z","file":[{"relation":"main_file","content_type":"application/pdf","file_size":574228,"file_name":"uc_abs.pdf","file_id":"5427","access_level":"closed","date_updated":"2018-11-08T10:15:00Z","date_created":"2018-11-08T10:15:00Z","creator":"feidens"}],"publication":"The International Conference on Cryptology And Network Security (CANS)","language":[{"iso":"eng"}],"ddc":["000"],"year":"2018","title":"Enhanced Security of Attribute-Based Signatures","date_created":"2018-08-10T09:44:09Z","publisher":"Springer"},{"has_accepted_license":"1","year":"2015","citation":{"apa":"Eidens, F. (2015). <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn.","bibtex":"@book{Eidens_2015, title={Anonymous credential system based on q-Strong Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2015} }","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.","ama":"Eidens F. <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.","ieee":"F. Eidens, <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:05Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078","first_name":"Fabian"}],"date_created":"2017-10-17T12:41:54Z","title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption","type":"mastersthesis","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,"creator":"florida","date_created":"2018-03-20T07:40:22Z","date_updated":"2018-03-20T07:40:22Z"}],"_id":"321","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-20T07:40:22Z"},{"title":"Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:03Z","author":[{"first_name":"Fabian","id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens"}],"date_created":"2017-10-17T12:42:56Z","year":"2012","citation":{"apa":"Eidens, F. (2012). <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn.","mla":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","bibtex":"@book{Eidens_2012, title={Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2012} }","short":"F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken, Universität Paderborn, 2012.","ama":"Eidens F. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn; 2012.","ieee":"F. Eidens, <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","chicago":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012."},"language":[{"iso":"ger"}],"_id":"638","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"user_id":"477","status":"public","type":"bachelorsthesis"}]