[{"doi":"10.5281/zenodo.8068629","volume":412,"author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"},{"first_name":"Tibor","id":"64669","full_name":"Jager, Tibor","last_name":"Jager"},{"first_name":"David","id":"36113","full_name":"Niehues, David","last_name":"Niehues"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"oa":"1","date_updated":"2023-07-07T11:18:21Z","intvolume":"       412","page":"145-164","citation":{"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.","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>.","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} }","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>","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>.","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.","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>"},"place":"Paderborn","has_accepted_license":"1","file_date_updated":"2023-07-07T11:18:21Z","department":[{"_id":"7"}],"user_id":"477","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","_id":"45891","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"status":"public","editor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"type":"book_chapter","title":"Robustness and Security","date_created":"2023-07-07T08:08:47Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","year":"2023","language":[{"iso":"eng"}],"ddc":["004"],"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"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets"},{"year":"2022","date_created":"2022-02-07T13:29:07Z","title":"More Efficient Techniques for Adaptively-Secure Cryptography","license":"https://creativecommons.org/licenses/by-nd/4.0/","file":[{"date_created":"2022-02-07T13:26:05Z","creator":"davnie","date_updated":"2022-02-07T13:26:05Z","access_level":"closed","file_id":"29764","file_name":"de2107.pdf","file_size":1542089,"content_type":"application/pdf","relation":"main_file","success":1}],"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"}],"language":[{"iso":"eng"}],"keyword":["public-key cryptography","lattices","pairings","verifiable random functions","identity-based encryption"],"ddc":["000"],"has_accepted_license":"1","publication_status":"published","citation":{"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>","short":"D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography, 2022.","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>.","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} }","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>","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>."},"author":[{"first_name":"David","last_name":"Niehues","id":"36113","full_name":"Niehues, David"}],"supervisor":[{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"first_name":"Anja","last_name":"Lehmann","full_name":"Lehmann, Anja"}],"date_updated":"2022-02-07T13:32:28Z","oa":"1","doi":"10.25926/rdtq-jw45","main_file_link":[{"url":"https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf","open_access":"1"}],"type":"dissertation","status":"public","department":[{"_id":"558"}],"user_id":"36113","_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"}],"file_date_updated":"2022-02-07T13:26:05Z"},{"user_id":"36113","department":[{"_id":"558"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"22057","file_date_updated":"2021-05-10T16:02:02Z","type":"book_chapter","status":"public","author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"last_name":"Kurek","full_name":"Kurek, Rafael","first_name":"Rafael"},{"last_name":"Niehues","id":"36113","full_name":"Niehues, David","first_name":"David"}],"date_updated":"2022-01-06T06:55:23Z","doi":"10.1007/978-3-030-75245-3_22","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752446","9783030752453"]},"has_accepted_license":"1","citation":{"short":"T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","bibtex":"@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek, Rafael and Niehues, David}, year={2021} }","mla":"Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>.","apa":"Jager, T., Kurek, R., &#38; Niehues, D. (2021). Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>","chicago":"Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>.","ieee":"T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021.","ama":"Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>"},"place":"Cham","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Public-Key Cryptography – PKC 2021","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2021-05-10T16:02:02Z","creator":"davnie","date_created":"2021-05-10T16:02:02Z","file_size":701068,"access_level":"closed","file_id":"22058","file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf"}],"abstract":[{"lang":"eng","text":"We construct more efficient cryptosystems with provable\r\nsecurity against adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient, selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal, Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n– Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption, has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves full adaptive security with\r\npublic parameters of size only O(log λ). The other is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext is\r\nonly a single group element and the security reduction is quadrat-\r\nically tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n– A very efficient adaptively-secure verifiable random function where\r\nproofs, public keys, and secret keys have size O(log λ).\r\nAs a technical contribution we introduce blockwise partitioning, which\r\nleverages the assumption that a cryptographic hash function is weak\r\nnear-collision resistant to prove full adaptive security of cryptosystems."}],"date_created":"2021-05-10T15:56:24Z","title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","year":"2021"},{"publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9783030752477","9783030752484"],"issn":["0302-9743","1611-3349"]},"year":"2021","place":"Cham","citation":{"apa":"Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>","bibtex":"@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions with Optimal Tightness}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021} }","short":"D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","mla":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>.","chicago":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>.","ieee":"D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021.","ama":"Niehues D. Verifiable Random Functions with Optimal Tightness. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>"},"date_updated":"2022-01-06T06:55:24Z","author":[{"first_name":"David","full_name":"Niehues, David","id":"36113","last_name":"Niehues"}],"date_created":"2021-05-10T16:07:50Z","title":"Verifiable Random Functions with Optimal Tightness","doi":"10.1007/978-3-030-75248-4_3","type":"book_chapter","publication":"Public-Key Cryptography – PKC 2021","abstract":[{"text":"Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan (FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public verification key and proofs accompanying the\r\noutput enable all parties to verify the correctness of the output. How-\r\never, all known standard model VRFs have a reduction loss that is much\r\nworse than what one would expect from known optimal constructions of\r\nclosely related primitives like unique signatures. We show that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries. To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16) to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We answer this ques-\r\ntion in the affirmative by presenting the first VRF with a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability of tight verifiable\r\nrandom functions: We show that a security loss of Q is unavoidable and\r\npresent the first construction that achieves this bound.","lang":"eng"}],"file":[{"creator":"davnie","date_created":"2021-05-10T16:09:17Z","date_updated":"2021-05-10T16:09:17Z","file_id":"22060","access_level":"closed","file_name":"Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf","file_size":697361,"content_type":"application/pdf","relation":"main_file"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"22059","user_id":"36113","department":[{"_id":"558"}],"ddc":["000"],"file_date_updated":"2021-05-10T16:09:17Z","language":[{"iso":"eng"}]},{"keyword":["Admissible hash functions","Verifiable random functions","Error-correcting codes","Provable security"],"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"Verifiable random functions (VRFs) are essentially digital signatures with additional properties, namely verifiable uniqueness and pseudorandomness, which make VRFs a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated Denial of Existence and the CONIKS key management system, or in the random committee selection of the Algorand blockchain.\r\n\r\nMost standard-model VRFs rely on admissible hash functions (AHFs) to achieve security against adaptive attacks in the standard model. Known AHF constructions are based on error-correcting codes, which yield asymptotically efficient constructions. However, previous works do not clarify how the code should be instantiated concretely in the real world. The rate and the minimal distance of the selected code have significant impact on the efficiency of the resulting cryptosystem, therefore it is unclear if and how the aforementioned constructions can be used in practice.\r\n\r\nFirst, we explain inherent limitations of code-based AHFs. Concretely, we assume that even if we were given codes that achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch bounds, existing AHF-based constructions of verifiable random functions (VRFs) can only be instantiated quite inefficiently. Then we introduce and construct computational AHFs (cAHFs). While classical AHFs are information-theoretic, and therefore work even in presence of computationally unbounded adversaries, cAHFs provide only security against computationally bounded adversaries. However, we show that cAHFs can be instantiated significantly more efficiently. Finally, we use our cAHF to construct the currently most efficient verifiable random function with full adaptive security in the standard model."}],"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2021-03-08T17:02:37Z","creator":"davnie","date_created":"2021-03-08T17:02:37Z","file_size":706743,"file_name":"Jager und Niehues - 2020 - On the Real-World Instantiability of Admissible Ha.pdf","file_id":"21399","access_level":"closed"}],"date_created":"2021-03-08T16:50:31Z","title":"On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions","quality_controlled":"1","year":"2020","_id":"21396","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"558"}],"user_id":"36113","file_date_updated":"2021-03-08T17:02:37Z","type":"book_chapter","status":"public","date_updated":"2022-01-06T06:54:58Z","author":[{"full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"first_name":"David","last_name":"Niehues","full_name":"Niehues, David","id":"36113"}],"conference":{"name":"Selected Areas in Cryptography","start_date":"2019-08-12","end_date":"2019-08-16","location":"Waterloo, Canada"},"doi":"10.1007/978-3-030-38471-5_13","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007%252F978-3-030-38471-5_13.pdf"}],"has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030384708","9783030384715"]},"publication_status":"published","related_material":{"link":[{"relation":"later_version","url":"https://eprint.iacr.org/2019/1335.pdf"}]},"place":"Cham","citation":{"chicago":"Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">https://doi.org/10.1007/978-3-030-38471-5_13</a>.","ieee":"T. Jager and D. Niehues, “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions,” in <i>Lecture Notes in Computer Science</i>, Cham, 2020.","ama":"Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In: <i>Lecture Notes in Computer Science</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">10.1007/978-3-030-38471-5_13</a>","apa":"Jager, T., &#38; Niehues, D. (2020). On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In <i>Lecture Notes in Computer Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">https://doi.org/10.1007/978-3-030-38471-5_13</a>","mla":"Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">10.1007/978-3-030-38471-5_13</a>.","bibtex":"@inbook{Jager_Niehues_2020, place={Cham}, title={On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">10.1007/978-3-030-38471-5_13</a>}, booktitle={Lecture Notes in Computer Science}, author={Jager, Tibor and Niehues, David}, year={2020} }","short":"T. Jager, D. Niehues, in: Lecture Notes in Computer Science, Cham, 2020."}}]