[{"project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"citation":{"ieee":"J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models,” <i>Advances in Data Analysis and Classification</i>, vol. 14, pp. 147–173, 2020.","apa":"Blömer, J., Brauer, S., Bujna, K., &#38; Kuntze, D. (2020). How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. <i>Advances in Data Analysis and Classification</i>, <i>14</i>, 147–173. <a href=\"https://doi.org/10.1007/s11634-019-00366-7\">https://doi.org/10.1007/s11634-019-00366-7</a>","short":"J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and Classification 14 (2020) 147–173.","chicago":"Blömer, Johannes, Sascha Brauer, Kathrin Bujna, and Daniel Kuntze. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” <i>Advances in Data Analysis and Classification</i> 14 (2020): 147–173. <a href=\"https://doi.org/10.1007/s11634-019-00366-7\">https://doi.org/10.1007/s11634-019-00366-7</a>.","mla":"Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” <i>Advances in Data Analysis and Classification</i>, vol. 14, 2020, pp. 147–173, doi:<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>.","bibtex":"@article{Blömer_Brauer_Bujna_Kuntze_2020, title={How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models}, volume={14}, DOI={<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>}, journal={Advances in Data Analysis and Classification}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin and Kuntze, Daniel}, year={2020}, pages={147–173} }","ama":"Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. <i>Advances in Data Analysis and Classification</i>. 2020;14:147–173. doi:<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>"},"publication":"Advances in Data Analysis and Classification","department":[{"_id":"64"}],"type":"journal_article","date_created":"2019-07-11T08:08:25Z","intvolume":"        14","date_updated":"2022-01-06T06:50:50Z","publication_status":"published","publication_identifier":{"issn":["1862-5347","1862-5355"]},"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"},{"full_name":"Brauer, Sascha","last_name":"Brauer","first_name":"Sascha","id":"13291"},{"full_name":"Bujna, Kathrin","last_name":"Bujna","first_name":"Kathrin"},{"last_name":"Kuntze","first_name":"Daniel","full_name":"Kuntze, Daniel"}],"year":"2020","status":"public","title":"How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models","volume":14,"doi":"10.1007/s11634-019-00366-7","user_id":"13291","language":[{"iso":"eng"}],"_id":"10790","page":"147–173"},{"_id":"15482","language":[{"iso":"eng"}],"user_id":"13703","doi":"10.17619/UNIPB/1-854","title":"Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work","status":"public","year":"2020","author":[{"id":"13703","full_name":"Löken, Nils","last_name":"Löken","first_name":"Nils"}],"date_updated":"2022-01-06T06:52:27Z","date_created":"2020-01-10T08:23:30Z","type":"dissertation","department":[{"_id":"64"},{"_id":"568"}],"citation":{"mla":"Löken, Nils. <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>. 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-854\">10.17619/UNIPB/1-854</a>.","bibtex":"@book{Löken_2020, title={Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-854\">10.17619/UNIPB/1-854</a>}, author={Löken, Nils}, year={2020} }","ama":"Löken N. <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>.; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-854\">10.17619/UNIPB/1-854</a>","ieee":"N. Löken, <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>. 2020.","apa":"Löken, N. (2020). <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-854\">https://doi.org/10.17619/UNIPB/1-854</a>","chicago":"Löken, Nils. <i>Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work</i>, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-854\">https://doi.org/10.17619/UNIPB/1-854</a>.","short":"N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work, 2020."},"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}]},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"citation":{"chicago":"Kramer, Paul. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","short":"P. Kramer, Comparison of Zero-Knowledge Range Proofs, Universität Paderborn, 2020.","ieee":"P. Kramer, <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","apa":"Kramer, P. (2020). <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn.","bibtex":"@book{Kramer_2020, title={Comparison of Zero-Knowledge Range Proofs}, publisher={Universität Paderborn}, author={Kramer, Paul}, year={2020} }","ama":"Kramer P. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn; 2020.","mla":"Kramer, Paul. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020."},"type":"bachelorsthesis","department":[{"_id":"7"},{"_id":"64"}],"date_created":"2020-08-29T13:27:11Z","date_updated":"2022-10-17T10:56:59Z","year":"2020","title":"Comparison of Zero-Knowledge Range Proofs","status":"public","author":[{"last_name":"Kramer","first_name":"Paul","full_name":"Kramer, Paul","id":"64594"}],"user_id":"25078","_id":"18638","publisher":"Universität Paderborn","language":[{"iso":"eng"}]},{"citation":{"chicago":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” <i>Theoretical Computer Science</i> 754 (2019): 88–106. <a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">https://doi.org/10.1016/j.tcs.2018.04.048</a>.","short":"S. Brauer, Theoretical Computer Science 754 (2019) 88–106.","ieee":"S. Brauer, “Complexity of single-swap heuristics for metric facility location and related problems,” <i>Theoretical Computer Science</i>, vol. 754, pp. 88–106, 2019.","apa":"Brauer, S. (2019). Complexity of single-swap heuristics for metric facility location and related problems. <i>Theoretical Computer Science</i>, <i>754</i>, 88–106. <a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">https://doi.org/10.1016/j.tcs.2018.04.048</a>","bibtex":"@article{Brauer_2019, title={Complexity of single-swap heuristics for metric facility location and related problems}, volume={754}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">10.1016/j.tcs.2018.04.048</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Brauer, Sascha}, year={2019}, pages={88–106} }","ama":"Brauer S. Complexity of single-swap heuristics for metric facility location and related problems. <i>Theoretical Computer Science</i>. 2019;754:88-106. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">10.1016/j.tcs.2018.04.048</a>","mla":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” <i>Theoretical Computer Science</i>, vol. 754, Elsevier, 2019, pp. 88–106, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">10.1016/j.tcs.2018.04.048</a>."},"project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"status":"public","_id":"2916","publisher":"Elsevier","page":"88-106","volume":754,"user_id":"13291","publication":"Theoretical Computer Science","date_created":"2018-05-25T11:10:36Z","department":[{"_id":"64"}],"type":"journal_article","author":[{"last_name":"Brauer","first_name":"Sascha","full_name":"Brauer, Sascha","id":"13291"}],"publication_identifier":{"issn":["0304-3975"]},"year":"2019","title":"Complexity of single-swap heuristics for metric facility location and related problems","intvolume":"       754","publication_status":"published","date_updated":"2022-01-06T06:58:46Z","language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2018.04.048"},{"language":[{"iso":"eng"}],"_id":"15746","user_id":"13703","author":[{"full_name":"Otte, Oliver","first_name":"Oliver","last_name":"Otte"}],"year":"2019","title":"Outsourced Decryption of Attribute-based Ciphertexts","status":"public","date_updated":"2022-01-06T06:52:32Z","date_created":"2020-02-03T09:43:19Z","department":[{"_id":"64"}],"type":"mastersthesis","citation":{"apa":"Otte, O. (2019). <i>Outsourced Decryption of Attribute-based Ciphertexts</i>.","ieee":"O. Otte, <i>Outsourced Decryption of Attribute-based Ciphertexts</i>. 2019.","chicago":"Otte, Oliver. <i>Outsourced Decryption of Attribute-Based Ciphertexts</i>, 2019.","short":"O. Otte, Outsourced Decryption of Attribute-Based Ciphertexts, 2019.","mla":"Otte, Oliver. <i>Outsourced Decryption of Attribute-Based Ciphertexts</i>. 2019.","ama":"Otte O. <i>Outsourced Decryption of Attribute-Based Ciphertexts</i>.; 2019.","bibtex":"@book{Otte_2019, title={Outsourced Decryption of Attribute-based Ciphertexts}, author={Otte, Oliver}, year={2019} }"}},{"date_created":"2020-02-03T09:45:01Z","department":[{"_id":"64"}],"type":"bachelorsthesis","citation":{"ieee":"N. C. Wördenweber, <i>On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model</i>. 2019.","mla":"Wördenweber, Nico Christof. <i>On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model</i>. 2019.","apa":"Wördenweber, N. C. (2019). <i>On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model</i>.","bibtex":"@book{Wördenweber_2019, title={On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model}, author={Wördenweber, Nico Christof}, year={2019} }","short":"N.C. Wördenweber, On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model, 2019.","ama":"Wördenweber NC. <i>On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model</i>.; 2019.","chicago":"Wördenweber, Nico Christof. <i>On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model</i>, 2019."},"language":[{"iso":"eng"}],"_id":"15747","user_id":"13703","author":[{"first_name":"Nico Christof","last_name":"Wördenweber","full_name":"Wördenweber, Nico Christof"}],"status":"public","title":"On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model","year":"2019","date_updated":"2022-01-06T06:52:32Z"},{"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"citation":{"bibtex":"@book{Leutnant_2019, title={Experimentelle Untersuchung des SEM-Algorithmus}, author={Leutnant, Matthias}, year={2019} }","ama":"Leutnant M. <i>Experimentelle Untersuchung Des SEM-Algorithmus</i>.; 2019.","mla":"Leutnant, Matthias. <i>Experimentelle Untersuchung Des SEM-Algorithmus</i>. 2019.","short":"M. Leutnant, Experimentelle Untersuchung Des SEM-Algorithmus, 2019.","chicago":"Leutnant, Matthias. <i>Experimentelle Untersuchung Des SEM-Algorithmus</i>, 2019.","ieee":"M. Leutnant, <i>Experimentelle Untersuchung des SEM-Algorithmus</i>. 2019.","apa":"Leutnant, M. (2019). <i>Experimentelle Untersuchung des SEM-Algorithmus</i>."},"date_created":"2020-02-06T08:51:51Z","type":"bachelorsthesis","department":[{"_id":"64"}],"title":"Experimentelle Untersuchung des SEM-Algorithmus","year":"2019","status":"public","author":[{"last_name":"Leutnant","first_name":"Matthias","full_name":"Leutnant, Matthias"}],"date_updated":"2022-01-06T06:52:37Z","_id":"15819","language":[{"iso":"eng"}],"user_id":"13291"},{"has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"25078","_id":"13128","publisher":"Universität Paderborn","project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2020-10-30T15:59:34Z","supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"ama":"Bröcher H. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn; 2019.","bibtex":"@book{Bröcher_2019, title={Rational Secure Multiparty Computation}, publisher={Universität Paderborn}, author={Bröcher, Henrik}, year={2019} }","mla":"Bröcher, Henrik. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019.","chicago":"Bröcher, Henrik. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019.","short":"H. Bröcher, Rational Secure Multiparty Computation, Universität Paderborn, 2019.","apa":"Bröcher, H. (2019). <i>Rational Secure Multiparty Computation</i>. Universität Paderborn.","ieee":"H. Bröcher, <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019."},"oa":"1","date_updated":"2022-01-06T06:51:28Z","title":"Rational Secure Multiparty Computation","year":"2019","author":[{"id":"41047","last_name":"Bröcher","first_name":"Henrik","full_name":"Bröcher, Henrik"}],"language":[{"iso":"eng"}],"extern":"1","type":"mastersthesis","department":[{"_id":"64"}],"file":[{"creator":"bhenrik","date_created":"2019-09-04T07:59:31Z","date_updated":"2020-10-30T15:59:34Z","relation":"main_file","file_size":746819,"access_level":"open_access","file_name":"thesis_broecher.pdf","content_type":"application/pdf","file_id":"13129"}],"date_created":"2019-09-04T08:04:12Z"},{"file":[{"file_id":"10307","content_type":"application/pdf","file_name":"thesis_final.pdf","access_level":"open_access","file_size":899233,"relation":"main_file","date_updated":"2019-06-26T09:19:15Z","date_created":"2019-06-26T09:08:23Z","creator":"laurensp"}],"date_created":"2019-06-26T09:12:47Z","type":"mastersthesis","oa":"1","department":[{"_id":"64"}],"file_date_updated":"2019-06-26T09:19:15Z","supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"citation":{"mla":"Porzenheim, Laurens Alexander. <i>Post-Quantum Secure Group Signatures</i>. 2019.","ama":"Porzenheim LA. <i>Post-Quantum Secure Group Signatures</i>.; 2019.","bibtex":"@book{Porzenheim_2019, title={Post-Quantum Secure Group Signatures}, author={Porzenheim, Laurens Alexander}, year={2019} }","apa":"Porzenheim, L. A. (2019). <i>Post-Quantum Secure Group Signatures</i>.","ieee":"L. A. Porzenheim, <i>Post-Quantum Secure Group Signatures</i>. 2019.","chicago":"Porzenheim, Laurens Alexander. <i>Post-Quantum Secure Group Signatures</i>, 2019.","short":"L.A. Porzenheim, Post-Quantum Secure Group Signatures, 2019."},"language":[{"iso":"eng"}],"_id":"10306","ddc":["000"],"user_id":"47434","status":"public","year":"2019","title":"Post-Quantum Secure Group Signatures","author":[{"first_name":"Laurens Alexander","last_name":"Porzenheim","full_name":"Porzenheim, Laurens Alexander","id":"47434"}],"date_updated":"2022-01-06T06:50:36Z","has_accepted_license":"1"},{"oa":"1","file_date_updated":"2019-10-01T07:45:17Z","citation":{"mla":"Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” <i>Security and Trust Management, STM 2019</i>, vol. 11738, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">10.1007/978-3-030-31511-5_9</a>.","ama":"Blömer J, Löken N. Personal Cross-Platform Reputation. In: <i>Security and Trust Management, STM 2019</i>. Vol 11738. LNCS. ; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">10.1007/978-3-030-31511-5_9</a>","bibtex":"@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Personal Cross-Platform Reputation}, volume={11738}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">10.1007/978-3-030-31511-5_9</a>}, booktitle={Security and Trust Management, STM 2019}, author={Blömer, Johannes and Löken, Nils}, year={2019}, collection={LNCS} }","apa":"Blömer, J., &#38; Löken, N. (2019). Personal Cross-Platform Reputation. In <i>Security and Trust Management, STM 2019</i> (Vol. 11738). <a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">https://doi.org/10.1007/978-3-030-31511-5_9</a>","ieee":"J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in <i>Security and Trust Management, STM 2019</i>, 2019, vol. 11738.","chicago":"Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” In <i>Security and Trust Management, STM 2019</i>, Vol. 11738. LNCS, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31511-5_9\">https://doi.org/10.1007/978-3-030-31511-5_9</a>.","short":"J. Blömer, N. Löken, in: Security and Trust Management, STM 2019, 2019."},"_id":"13554","ddc":["000"],"user_id":"13703","volume":11738,"status":"public","conference":{"name":"Security and Trust Management, STM 2019"},"has_accepted_license":"1","file":[{"access_level":"open_access","file_name":"informal.pdf","date_created":"2019-10-01T07:45:17Z","date_updated":"2019-10-01T07:45:17Z","relation":"main_file","file_size":507736,"title":"Personal cross-platform reputation, author's version","content_type":"application/pdf","file_id":"13555","creator":"nilo","description":"This is an author's version of the paper presented at STM 2019."}],"date_created":"2019-10-01T07:50:03Z","type":"conference","department":[{"_id":"568"},{"_id":"64"}],"publication":"Security and Trust Management, STM 2019","abstract":[{"text":"We propose a novel personal reputation system for cross-platform reputation. We observe that, in certain usage scenarios, e.g. crowd work, the rater anonymity property typically imposed on reputation systems is not necessary. Instead, we propose a relaxed notion of rater anonymity that is more applicable in the crowd work scenario. This allows us to construct a secure personal reputation system from simple cryptographic primitives.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-030-31511-5_9","year":"2019","title":"Personal Cross-Platform Reputation","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"},{"last_name":"Löken","first_name":"Nils","full_name":"Löken, Nils","id":"13703"}],"date_updated":"2022-01-06T06:51:38Z","intvolume":"     11738"},{"main_file_link":[{"url":"http://eprint.iacr.org/2019/1038","open_access":"1"}],"language":[{"iso":"eng"}],"_id":"13557","publisher":"Springer","series_title":"LNCS","user_id":"13703","volume":12056,"title":"Dynamic Searchable Encryption with Access Control","status":"public","year":"2019","author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"last_name":"Löken","first_name":"Nils","full_name":"Löken, Nils","id":"13703"}],"date_updated":"2022-01-06T06:51:38Z","intvolume":"     12056","date_created":"2019-10-01T08:05:31Z","type":"conference","department":[{"_id":"64"},{"_id":"568"}],"oa":"1","publication":"12th International Symposium on Foundations and Practice of Security, FPS 2019","citation":{"mla":"Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>, vol. 12056, Springer, 2019.","bibtex":"@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Dynamic Searchable Encryption with Access Control}, volume={12056}, booktitle={12th International Symposium on Foundations and Practice of Security, FPS 2019}, publisher={Springer}, author={Blömer, Johannes and Löken, Nils}, year={2019}, collection={LNCS} }","ama":"Blömer J, Löken N. Dynamic Searchable Encryption with Access Control. In: <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>. Vol 12056. LNCS. Springer; 2019.","ieee":"J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,” in <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>, 2019, vol. 12056.","apa":"Blömer, J., &#38; Löken, N. (2019). Dynamic Searchable Encryption with Access Control. In <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i> (Vol. 12056). Springer.","chicago":"Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” In <i>12th International Symposium on Foundations and Practice of Security, FPS 2019</i>, Vol. 12056. LNCS. Springer, 2019.","short":"J. Blömer, N. Löken, in: 12th International Symposium on Foundations and Practice of Security, FPS 2019, Springer, 2019."},"abstract":[{"text":"We present a searchable encryption scheme for dynamic document collections in a multi-user scenario. Our scheme features fine-grained access control to search results, as well as access control to operations such as adding documents to the document collection, or changing individual documents. The scheme features verifiability of search results. Our scheme also satisfies the forward privacy notion crucial for the security of dynamic searchable encryption schemes.","lang":"eng"}]},{"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"citation":{"chicago":"Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn, 2019.","short":"M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java, Universität Paderborn, 2019.","apa":"Pilot, M. (2019). <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn.","ieee":"M. Pilot, <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn, 2019.","ama":"Pilot M. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn; 2019.","bibtex":"@book{Pilot_2019, title={Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java}, publisher={Universität Paderborn}, author={Pilot, Matthias}, year={2019} }","mla":"Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java</i>. Universität Paderborn, 2019."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"extern":"1","date_created":"2019-10-03T12:30:24Z","department":[{"_id":"7"},{"_id":"64"}],"type":"bachelorsthesis","author":[{"last_name":"Pilot","first_name":"Matthias","full_name":"Pilot, Matthias"}],"status":"public","title":"Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java","year":"2019","date_updated":"2022-01-06T06:51:40Z","_id":"13592","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477"},{"department":[{"_id":"7"},{"_id":"64"}],"type":"mastersthesis","date_created":"2019-10-07T09:56:58Z","file":[{"creator":"jbobolz","date_created":"2020-04-27T10:32:00Z","date_updated":"2020-04-27T10:33:59Z","relation":"main_file","file_size":1714805,"access_level":"open_access","file_name":"sscholz-MA-thesis-final.pdf","content_type":"application/pdf","file_id":"16871"}],"extern":"1","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:41Z","author":[{"full_name":"Scholz, Swante","first_name":"Swante","last_name":"Scholz"}],"year":"2019","title":"Implementation and Comparison of Elliptic Curve Algorithms in Java","oa":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"chicago":"Scholz, Swante. <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn, 2019.","short":"S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in Java, Universität Paderborn, 2019.","apa":"Scholz, S. (2019). <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn.","ieee":"S. Scholz, <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn, 2019.","ama":"Scholz S. <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn; 2019.","bibtex":"@book{Scholz_2019, title={Implementation and Comparison of Elliptic Curve Algorithms in Java}, publisher={Universität Paderborn}, author={Scholz, Swante}, year={2019} }","mla":"Scholz, Swante. <i>Implementation and Comparison of Elliptic Curve Algorithms in Java</i>. Universität Paderborn, 2019."},"file_date_updated":"2020-04-27T10:33:59Z","ddc":["000"],"user_id":"477","_id":"13648","publisher":"Universität Paderborn","has_accepted_license":"1","status":"public"},{"doi":"10.17619/UNIPB/1-816","user_id":"13291","language":[{"iso":"eng"}],"_id":"13679","date_updated":"2022-01-06T06:51:41Z","author":[{"id":"13291","first_name":"Sascha","last_name":"Brauer","full_name":"Brauer, Sascha"}],"title":"Classification and Approximation of Geometric Location Problems","status":"public","year":"2019","department":[{"_id":"64"}],"type":"dissertation","place":"Paderborn","date_created":"2019-10-09T10:00:53Z","project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"ieee":"S. Brauer, <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn, 2019.","mla":"Brauer, Sascha. <i>Classification and Approximation of Geometric Location Problems</i>. 2019, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-816\">10.17619/UNIPB/1-816</a>.","apa":"Brauer, S. (2019). <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-816\">https://doi.org/10.17619/UNIPB/1-816</a>","bibtex":"@book{Brauer_2019, place={Paderborn}, title={Classification and Approximation of Geometric Location Problems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-816\">10.17619/UNIPB/1-816</a>}, author={Brauer, Sascha}, year={2019} }","chicago":"Brauer, Sascha. <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn, 2019. <a href=\"https://doi.org/10.17619/UNIPB/1-816\">https://doi.org/10.17619/UNIPB/1-816</a>.","ama":"Brauer S. <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn; 2019. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-816\">10.17619/UNIPB/1-816</a>","short":"S. Brauer, Classification and Approximation of Geometric Location Problems, Paderborn, 2019."}},{"main_file_link":[{"url":"https://eprint.iacr.org/2019/169.pdf","open_access":"1"}],"series_title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","language":[{"iso":"eng"}],"doi":"10.1145/3319535.3354223","title":"Updatable Anonymous Credentials and Applications to Incentive Systems","year":"2019","author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"last_name":"Bobolz","first_name":"Jan","full_name":"Bobolz, Jan","id":"27207"},{"full_name":"Diemert, Denis Pascal","first_name":"Denis Pascal","last_name":"Diemert","id":"44071"},{"full_name":"Eidens, Fabian","first_name":"Fabian","last_name":"Eidens","id":"25078"}],"date_updated":"2023-01-10T10:25:27Z","file":[{"file_id":"13907","content_type":"application/pdf","file_name":"full_eprinted_v2.pdf","access_level":"closed","file_size":838949,"relation":"main_file","date_updated":"2019-10-18T08:07:49Z","date_created":"2019-10-18T08:07:49Z","creator":"jbobolz"}],"date_created":"2019-10-18T08:09:44Z","type":"conference","department":[{"_id":"7"},{"_id":"64"}],"publication":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","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"}],"_id":"13904","user_id":"25078","ddc":["006"],"status":"public","conference":{"end_date":"2019-11-15","location":"London","name":"26th ACM Conference on Computer and Communications Security","start_date":"2019-11-11"},"has_accepted_license":"1","oa":"1","file_date_updated":"2019-10-18T08:07:49Z","citation":{"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>.","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>","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>.","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.","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>.","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} }","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>"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}]},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"file_date_updated":"2018-11-02T13:45:40Z","citation":{"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} }","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>","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>.","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>.","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.","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.","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>"},"oa":"1","place":"Cham","has_accepted_license":"1","status":"public","conference":{"end_date":"2018-04-20","name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018","start_date":"2018-04-16","location":"San Francisco, CA, USA"},"user_id":"477","ddc":["004"],"page":"470-490","_id":"2862","publisher":"Springer International Publishing","publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings","type":"conference","department":[{"_id":"7"},{"_id":"64"}],"file":[{"date_created":"2018-11-02T13:45:40Z","creator":"ups","success":1,"content_type":"application/pdf","file_id":"5253","date_updated":"2018-11-02T13:45:40Z","relation":"main_file","access_level":"closed","file_size":3371773,"file_name":"PracticalAnonymousAndPubliclyL.pdf"}],"date_created":"2018-05-24T11:14:02Z","publication_status":"published","date_updated":"2022-01-06T06:58:12Z","year":"2018","title":"Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems","author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"full_name":"Eidens, Fabian","last_name":"Eidens","first_name":"Fabian","id":"25078"},{"first_name":"Jakob","last_name":"Juhnke","full_name":"Juhnke, Jakob","id":"48090"}],"publication_identifier":{"isbn":["9783319769523","9783319769530"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-319-76953-0_25","main_file_link":[{"url":"https://eprint.iacr.org/2018/029","open_access":"1"}],"language":[{"iso":"eng"}]},{"volume":2,"user_id":"477","ddc":["000"],"_id":"2685","page":"314-338","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"ieee":"J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, pp. 314–338, 2018.","apa":"Blömer, J., &#38; Kohn, K. (2018). Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry.</i>, <i>2</i>(2), 314–338. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>","chicago":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i> 2, no. 2 (2018): 314–38. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>.","short":"J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018) 314–338.","mla":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, 2018, pp. 314–38, doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>.","bibtex":"@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect to Arbitrary Norms}, volume={2}, DOI={<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>}, number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer, Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }","ama":"Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry</i>. 2018;2(2):314-338. doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>"},"file_date_updated":"2018-11-02T15:22:55Z","doi":"10.1137/17M1132045","language":[{"iso":"eng"}],"intvolume":"         2","publication_status":"epub_ahead","date_updated":"2022-01-06T06:57:29Z","publication_identifier":{"eissn":["2470-6566"]},"author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"last_name":"Kohn","first_name":"Kathlén","full_name":"Kohn, Kathlén"}],"year":"2018","title":"Voronoi Cells of Lattices with Respect to Arbitrary Norms","department":[{"_id":"7"},{"_id":"64"}],"type":"journal_article","date_created":"2018-05-08T09:18:54Z","file":[{"file_name":"17m1132045.pdf","access_level":"closed","file_size":1131048,"relation":"main_file","date_updated":"2018-11-02T15:22:55Z","file_id":"5300","content_type":"application/pdf","success":1,"creator":"ups","date_created":"2018-11-02T15:22:55Z"}],"issue":"2","publication":"SIAM Journal on Applied Algebra and Geometry."},{"oa":"1","place":"New York, NY, USA","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"KogniHome - die mitdenkende Wohnung","_id":"44"}],"quality_controlled":"1","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 <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>.","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.","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>","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.","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>","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.} }","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>."},"file_date_updated":"2018-11-08T10:17:39Z","user_id":"25078","ddc":["000"],"publisher":"ACM","_id":"3265","has_accepted_license":"1","conference":{"end_date":"2018-08-30","location":"Hamburg, Germany","name":"ARES 2018 - SECPID","start_date":"2018-08-27"},"status":"public","department":[{"_id":"64"}],"type":"conference","date_created":"2018-06-14T11:19:29Z","file":[{"creator":"feidens","date_created":"2018-11-08T10:17:39Z","date_updated":"2018-11-08T10:17:39Z","relation":"main_file","file_size":920843,"access_level":"closed","file_name":"react_acs.pdf","content_type":"application/pdf","file_id":"5428"}],"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."}],"related_material":{"link":[{"url":"https://github.com/upbcuk","relation":"software"}]},"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18","doi":"10.1145/3230833.3234517","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/835"}],"publication_status":"accepted","date_updated":"2022-01-06T06:59:07Z","author":[{"full_name":"Bemmann, Kai","last_name":"Bemmann","first_name":"Kai"},{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"last_name":"Bobolz","first_name":"Jan","full_name":"Bobolz, Jan","id":"27207"},{"full_name":"Bröcher, Henrik","last_name":"Bröcher","first_name":"Henrik","id":"41047"},{"id":"44071","first_name":"Denis Pascal","last_name":"Diemert","full_name":"Diemert, Denis Pascal"},{"id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian","last_name":"Eidens"},{"last_name":"Eilers","first_name":"Lukas","full_name":"Eilers, Lukas"},{"id":"44413","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann","first_name":"Jan Frederik"},{"id":"48090","full_name":"Juhnke, Jakob","first_name":"Jakob","last_name":"Juhnke"},{"full_name":"Otour, Burhan","first_name":"Burhan","last_name":"Otour"},{"id":"47434","first_name":"Laurens Alexander","last_name":"Porzenheim","full_name":"Porzenheim, Laurens Alexander"},{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon"},{"full_name":"Schilling, Erik","last_name":"Schilling","first_name":"Erik"},{"first_name":"Michael","last_name":"Schlichtig","full_name":"Schlichtig, Michael","id":"32312"},{"full_name":"Stienemeier, Marcel","last_name":"Stienemeier","first_name":"Marcel"}],"publication_identifier":{"isbn":["978-1-4503-6448-5"]},"year":"2018","title":"Fully-Featured Anonymous Credentials with Reputation System"},{"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018","department":[{"_id":"64"},{"_id":"568"}],"type":"conference","date_created":"2018-06-04T11:33:15Z","file":[{"file_id":"5278","content_type":"application/pdf","success":1,"file_name":"a25-Blomer.pdf","file_size":769807,"access_level":"closed","relation":"main_file","date_updated":"2018-11-02T14:39:46Z","date_created":"2018-11-02T14:39:46Z","creator":"ups"}],"publication_status":"accepted","date_updated":"2022-01-06T06:58:49Z","author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"full_name":"Löken, Nils","last_name":"Löken","first_name":"Nils","id":"13703"}],"publication_identifier":{"isbn":["978-1-4503-6448-5"]},"year":"2018","title":"Cloud Architectures for Searchable Encryption","doi":"10.1145/3230833.3230853","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"quality_controlled":"1","citation":{"apa":"Blömer, J., &#38; Löken, N. (n.d.). Cloud Architectures for Searchable Encryption. In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i> (pp. 25:1--25:10). New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>","ieee":"J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, Hamburg, Germany, pp. 25:1--25:10.","short":"J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.","chicago":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, 25:1--25:10. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>.","mla":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, ACM, pp. 25:1--25:10, doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>.","ama":"Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>. New York, NY, USA: ACM; :25:1--25:10. doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>","bibtex":"@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures for Searchable Encryption}, DOI={<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken, Nils}, pages={25:1--25:10} }"},"file_date_updated":"2018-11-02T14:39:46Z","place":"New York, NY, USA","has_accepted_license":"1","conference":{"location":"Hamburg, Germany","name":"ARES 2018"},"status":"public","user_id":"13703","ddc":["000"],"_id":"2965","publisher":"ACM","page":"25:1--25:10"},{"language":[{"iso":"eng"}],"_id":"5820","user_id":"27207","ddc":["000"],"author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz","first_name":"Jan"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander","id":"11108"}],"status":"public","year":"2018","title":"Provably Anonymous Communication Based on Trusted Execution Environments","has_accepted_license":"1","publication_status":"draft","date_updated":"2022-01-06T07:02:43Z","date_created":"2018-11-25T08:08:40Z","file":[{"content_type":"application/pdf","success":1,"file_id":"6435","date_updated":"2018-12-31T09:55:30Z","relation":"main_file","access_level":"closed","file_size":470968,"file_name":"draft-2018.pdf","date_created":"2018-12-31T09:55:30Z","creator":"jbobolz"}],"department":[{"_id":"7"},{"_id":"64"},{"_id":"79"}],"type":"working_paper","citation":{"ieee":"J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>. .","apa":"Blömer, J., Bobolz, J., Scheideler, C., &#38; Setzer, A. (n.d.). <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","mla":"Blömer, Johannes, et al. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","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} }","chicago":"Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>, n.d.","ama":"Blömer J, Bobolz J, Scheideler C, Setzer A. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","short":"J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d."},"file_date_updated":"2018-12-31T09:55:30Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"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"}]}]