[{"citation":{"mla":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022, doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>.","short":"D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography, 2022.","bibtex":"@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure Cryptography}, DOI={<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>}, author={Niehues, David}, year={2022} }","apa":"Niehues, D. (2022). <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>","ieee":"D. Niehues, <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022.","chicago":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>, 2022. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>.","ama":"Niehues D. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>.; 2022. doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>"},"has_accepted_license":"1","publication_status":"published","doi":"10.25926/rdtq-jw45","main_file_link":[{"open_access":"1","url":"https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf"}],"date_updated":"2022-02-07T13:32:28Z","oa":"1","author":[{"first_name":"David","last_name":"Niehues","id":"36113","full_name":"Niehues, David"}],"supervisor":[{"first_name":"Tibor","id":"64669","full_name":"Jager, Tibor","last_name":"Jager"},{"last_name":"Lehmann","full_name":"Lehmann, Anja","first_name":"Anja"}],"status":"public","type":"dissertation","file_date_updated":"2022-02-07T13:26:05Z","_id":"29763","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"department":[{"_id":"558"}],"user_id":"36113","year":"2022","title":"More Efficient Techniques for Adaptively-Secure Cryptography","date_created":"2022-02-07T13:29:07Z","abstract":[{"text":"Modern-day communication has become more and more digital. While this comes with many advantages such as a more efficient economy, it has also created more and more opportunities for various adversaries to manipulate communication or eavesdrop on it. The Snowden revelations in 2013 further highlighted the seriousness of these threats. To protect the communication of people, companies, and states from such threats, we require cryptography with strong security guarantees.\r\nDifferent applications may require different security properties from cryptographic schemes. For most applications, however, so-called adaptive security is considered a reasonable minimal requirement of security. Cryptographic schemes with adaptive security remain secure in the presence of an adversary that can corrupt communication partners to respond to messages of the adversaries choice, while the adversary may choose the messages based on previously observed interactions.\r\nWhile cryptography is associated the most with encryption, this is only one of many primitives that are essential for the security of digital interactions. This thesis presents novel identity-based encryption (IBE) schemes and verifiable random functions (VRFs) that achieve adaptive security as outlined above. Moreover, the cryptographic schemes presented in this thesis are proven secure in the standard model. That is without making use of idealized models like the random oracle model.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","file":[{"file_size":1542089,"file_id":"29764","file_name":"de2107.pdf","access_level":"closed","date_updated":"2022-02-07T13:26:05Z","date_created":"2022-02-07T13:26:05Z","creator":"davnie","success":1,"relation":"main_file","content_type":"application/pdf"}],"keyword":["public-key cryptography","lattices","pairings","verifiable random functions","identity-based encryption"],"ddc":["000"],"language":[{"iso":"eng"}]},{"year":"2009","citation":{"ama":"Blömer J,  Naewe S. Sampling methods for shortest vectors, closest vectors and successive minima. <i>Theoretical Computer Science</i>. 2009;410(18):1648-1665. doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>","ieee":"J. Blömer and S.  Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” <i>Theoretical Computer Science</i>, vol. 410, no. 18, pp. 1648–1665, 2009, doi: <a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>.","chicago":"Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i> 410, no. 18 (2009): 1648–65. <a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">https://doi.org/10.1016/j.tcs.2008.12.045</a>.","short":"J. Blömer, S.  Naewe, Theoretical Computer Science 410 (2009) 1648–1665.","bibtex":"@article{Blömer_ Naewe_2009, title={Sampling methods for shortest vectors, closest vectors and successive minima}, volume={410}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>}, number={18}, journal={Theoretical Computer Science}, author={Blömer, Johannes and  Naewe, Stefanie}, year={2009}, pages={1648–1665} }","mla":"Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i>, vol. 410, no. 18, 2009, pp. 1648–65, doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>.","apa":"Blömer, J., &#38;  Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. <i>Theoretical Computer Science</i>, <i>410</i>(18), 1648–1665. <a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">https://doi.org/10.1016/j.tcs.2008.12.045</a>"},"intvolume":"       410","page":"1648 - 1665","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"issue":"18","title":"Sampling methods for shortest vectors, closest vectors and successive minima","doi":"10.1016/j.tcs.2008.12.045","date_updated":"2024-08-08T12:18:04Z","date_created":"2018-06-05T08:07:24Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Stefanie","last_name":" Naewe","id":"1971","full_name":" Naewe, Stefanie"}],"volume":410,"status":"public","type":"journal_article","publication":"Theoretical Computer Science","keyword":["Geometry of numbers","Lattices","Shortest vectors"],"language":[{"iso":"eng"}],"_id":"2999","user_id":"49063","department":[{"_id":"64"}]}]