[{"year":"2022","publication_status":"published","type":"dissertation","oa":"1","date_created":"2022-02-07T13:29:07Z","file":[{"relation":"main_file","date_updated":"2022-02-07T13:26:05Z","file_size":1542089,"content_type":"application/pdf","creator":"davnie","file_name":"de2107.pdf","file_id":"29764","access_level":"closed","success":1,"date_created":"2022-02-07T13:26:05Z"}],"status":"public","license":"https://creativecommons.org/licenses/by-nd/4.0/","main_file_link":[{"open_access":"1","url":"https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf"}],"keyword":["public-key cryptography","lattices","pairings","verifiable random functions","identity-based encryption"],"doi":"10.25926/rdtq-jw45","date_updated":"2022-02-07T13:32:28Z","supervisor":[{"first_name":"Tibor","last_name":"Jager","id":"64669","full_name":"Jager, Tibor"},{"full_name":"Lehmann, Anja","last_name":"Lehmann","first_name":"Anja"}],"file_date_updated":"2022-02-07T13:26:05Z","abstract":[{"lang":"eng","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."}],"department":[{"_id":"558"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"mla":"Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography. 2022, doi:10.25926/rdtq-jw45.","ieee":"D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography. 2022.","chicago":"Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography, 2022. https://doi.org/10.25926/rdtq-jw45.","ama":"Niehues D. More Efficient Techniques for Adaptively-Secure Cryptography.; 2022. doi:10.25926/rdtq-jw45","short":"D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography, 2022.","apa":"Niehues, D. (2022). More Efficient Techniques for Adaptively-Secure Cryptography. https://doi.org/10.25926/rdtq-jw45","bibtex":"@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure Cryptography}, DOI={10.25926/rdtq-jw45}, author={Niehues, David}, year={2022} }"},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"user_id":"36113","title":"More Efficient Techniques for Adaptively-Secure Cryptography","ddc":["000"],"_id":"29763","author":[{"id":"36113","full_name":"Niehues, David","first_name":"David","last_name":"Niehues"}]},{"_id":"22057","ddc":["000"],"author":[{"full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"},{"full_name":"Kurek, Rafael","first_name":"Rafael","last_name":"Kurek"},{"id":"36113","full_name":"Niehues, David","first_name":"David","last_name":"Niehues"}],"publication_identifier":{"isbn":["9783030752446","9783030752453"],"issn":["0302-9743","1611-3349"]},"title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","file_date_updated":"2021-05-10T16:02:02Z","publication":"Public-Key Cryptography – PKC 2021","language":[{"iso":"eng"}],"department":[{"_id":"558"}],"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."}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"citation":{"apa":"Jager, T., Kurek, R., & Niehues, D. (2021). Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75245-3_22","short":"T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","ieee":"T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance,” in Public-Key Cryptography – PKC 2021, Cham, 2021.","chicago":"Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” In Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75245-3_22.","ama":"Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In: Public-Key Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75245-3_22","mla":"Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75245-3_22.","bibtex":"@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance}, DOI={10.1007/978-3-030-75245-3_22}, booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek, Rafael and Niehues, David}, year={2021} }"},"has_accepted_license":"1","user_id":"36113","doi":"10.1007/978-3-030-75245-3_22","date_updated":"2022-01-06T06:55:23Z","file":[{"date_created":"2021-05-10T16:02:02Z","access_level":"closed","file_id":"22058","creator":"davnie","file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf","relation":"main_file","file_size":701068,"date_updated":"2021-05-10T16:02:02Z","content_type":"application/pdf"}],"status":"public","publication_status":"published","type":"book_chapter","date_created":"2021-05-10T15:56:24Z","year":"2021","place":"Cham"},{"department":[{"_id":"558"}],"language":[{"iso":"eng"}],"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"}],"has_accepted_license":"1","citation":{"bibtex":"@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions with Optimal Tightness}, DOI={10.1007/978-3-030-75248-4_3}, booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021} }","apa":"Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75248-4_3","short":"D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","ieee":"D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in Public-Key Cryptography – PKC 2021, Cham, 2021.","chicago":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75248-4_3.","ama":"Niehues D. Verifiable Random Functions with Optimal Tightness. In: Public-Key Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75248-4_3","mla":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75248-4_3."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"user_id":"36113","file_date_updated":"2021-05-10T16:09:17Z","publication":"Public-Key Cryptography – PKC 2021","date_updated":"2022-01-06T06:55:24Z","doi":"10.1007/978-3-030-75248-4_3","author":[{"full_name":"Niehues, David","id":"36113","last_name":"Niehues","first_name":"David"}],"ddc":["000"],"_id":"22059","title":"Verifiable Random Functions with Optimal Tightness","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752477","9783030752484"]},"date_created":"2021-05-10T16:07:50Z","publication_status":"published","type":"book_chapter","year":"2021","place":"Cham","file":[{"access_level":"closed","date_created":"2021-05-10T16:09:17Z","date_updated":"2021-05-10T16:09:17Z","file_size":697361,"relation":"main_file","content_type":"application/pdf","creator":"davnie","file_name":"Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf","file_id":"22060"}],"status":"public"},{"keyword":["Admissible hash functions","Verifiable random functions","Error-correcting codes","Provable security"],"related_material":{"link":[{"url":"https://eprint.iacr.org/2019/1335.pdf","relation":"later_version"}]},"main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007%252F978-3-030-38471-5_13.pdf"}],"status":"public","file":[{"creator":"davnie","file_name":"Jager und Niehues - 2020 - On the Real-World Instantiability of Admissible Ha.pdf","file_id":"21399","content_type":"application/pdf","relation":"main_file","file_size":706743,"date_updated":"2021-03-08T17:02:37Z","access_level":"closed","date_created":"2021-03-08T17:02:37Z"}],"publication_status":"published","type":"book_chapter","date_created":"2021-03-08T16:50:31Z","conference":{"location":"Waterloo, Canada","name":"Selected Areas in Cryptography","end_date":"2019-08-16","start_date":"2019-08-12"},"year":"2020","place":"Cham","ddc":["000"],"_id":"21396","author":[{"full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"first_name":"David","last_name":"Niehues","full_name":"Niehues, David","id":"36113"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030384708","9783030384715"]},"title":"On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions","file_date_updated":"2021-03-08T17:02:37Z","publication":"Lecture Notes in Computer Science","department":[{"_id":"558"}],"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."}],"language":[{"iso":"eng"}],"user_id":"36113","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"citation":{"bibtex":"@inbook{Jager_Niehues_2020, place={Cham}, title={On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions}, DOI={10.1007/978-3-030-38471-5_13}, 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.","ama":"Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In: Lecture Notes in Computer Science. Cham; 2020. doi:10.1007/978-3-030-38471-5_13","ieee":"T. Jager and D. Niehues, “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions,” in Lecture Notes in Computer Science, Cham, 2020.","chicago":"Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” In Lecture Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-38471-5_13.","mla":"Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-38471-5_13.","apa":"Jager, T., & Niehues, D. (2020). On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-38471-5_13"},"has_accepted_license":"1","doi":"10.1007/978-3-030-38471-5_13","date_updated":"2022-01-06T06:54:58Z","quality_controlled":"1"},{"status":"public","file":[{"success":1,"access_level":"closed","date_created":"2018-11-08T13:25:52Z","relation":"main_file","date_updated":"2018-11-08T13:25:52Z","file_size":533731,"content_type":"application/pdf","file_name":"2018-199.pdf","creator":"abirke","file_id":"5453"}],"title":"Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange","ddc":["006"],"_id":"3105","author":[{"full_name":"Derler, David","last_name":"Derler","first_name":"David"},{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"first_name":"Daniel","last_name":"Slamanig","full_name":"Slamanig, Daniel"},{"full_name":"Striecks, Christoph","last_name":"Striecks","first_name":"Christoph"}],"main_file_link":[{"url":"https://eprint.iacr.org/2018/199.pdf"}],"doi":"10.1007/978-3-319-78372-7_14","date_updated":"2022-01-06T06:58:56Z","page":"425--455","year":"2018","publication":"Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III","type":"conference","file_date_updated":"2018-11-08T13:25:52Z","user_id":"38235","date_created":"2018-06-07T08:47:17Z","has_accepted_license":"1","citation":{"apa":"Derler, D., Jager, T., Slamanig, D., & Striecks, C. (2018). Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. In Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III (pp. 425--455). https://doi.org/10.1007/978-3-319-78372-7_14","bibtex":"@inproceedings{Derler_Jager_Slamanig_Striecks_2018, title={Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange}, DOI={10.1007/978-3-319-78372-7_14}, booktitle={Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III}, author={Derler, David and Jager, Tibor and Slamanig, Daniel and Striecks, Christoph}, year={2018}, pages={425--455} }","mla":"Derler, David, et al. “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange.” Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 2018, pp. 425--455, doi:10.1007/978-3-319-78372-7_14.","ieee":"D. Derler, T. Jager, D. Slamanig, and C. Striecks, “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange,” in Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 2018, pp. 425--455.","chicago":"Derler, David, Tibor Jager, Daniel Slamanig, and Christoph Striecks. “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange.” In Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 425--455, 2018. https://doi.org/10.1007/978-3-319-78372-7_14.","ama":"Derler D, Jager T, Slamanig D, Striecks C. Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. In: Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III. ; 2018:425--455. doi:10.1007/978-3-319-78372-7_14","short":"D. Derler, T. Jager, D. Slamanig, C. Striecks, in: Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 2018, pp. 425--455."},"department":[{"_id":"558"}],"language":[{"iso":"eng"}]},{"year":"2018","page":"221-250","date_updated":"2022-01-06T07:02:44Z","doi":"10.1007/978-3-030-03329-3_8","language":[{"iso":"eng"}],"department":[{"_id":"558"}],"citation":{"apa":"Jager, T., & Kurek, R. (2018). Short Digital Signatures and ID-KEMs via Truncation Collision Resistance. In Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II (pp. 221–250). https://doi.org/10.1007/978-3-030-03329-3_8","bibtex":"@inproceedings{Jager_Kurek_2018, title={Short Digital Signatures and ID-KEMs via Truncation Collision Resistance}, DOI={10.1007/978-3-030-03329-3_8}, booktitle={Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II}, author={Jager, Tibor and Kurek, Rafael}, year={2018}, pages={221–250} }","short":"T. Jager, R. Kurek, in: Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II, 2018, pp. 221–250.","mla":"Jager, Tibor, and Rafael Kurek. “Short Digital Signatures and ID-KEMs via Truncation Collision Resistance.” Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II, 2018, pp. 221–50, doi:10.1007/978-3-030-03329-3_8.","chicago":"Jager, Tibor, and Rafael Kurek. “Short Digital Signatures and ID-KEMs via Truncation Collision Resistance.” In Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II, 221–50, 2018. https://doi.org/10.1007/978-3-030-03329-3_8.","ama":"Jager T, Kurek R. Short Digital Signatures and ID-KEMs via Truncation Collision Resistance. In: Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II. ; 2018:221-250. doi:10.1007/978-3-030-03329-3_8","ieee":"T. Jager and R. Kurek, “Short Digital Signatures and ID-KEMs via Truncation Collision Resistance,” in Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II, 2018, pp. 221–250."},"user_id":"38235","date_created":"2018-11-27T09:39:57Z","type":"conference","publication":"Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II","title":"Short Digital Signatures and ID-KEMs via Truncation Collision Resistance","status":"public","author":[{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor","id":"64669"},{"first_name":"Rafael","last_name":"Kurek","full_name":"Kurek, Rafael","id":"64752"}],"_id":"5861"},{"year":"2018","date_updated":"2022-01-06T07:02:44Z","doi":"10.1007/978-3-030-03332-3_18","page":"490-518","user_id":"38235","date_created":"2018-11-27T09:42:49Z","citation":{"short":"T. Jager, R. Kurek, J. Pan, in: Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III, 2018, pp. 490–518.","ama":"Jager T, Kurek R, Pan J. Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH. In: Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III. ; 2018:490-518. doi:10.1007/978-3-030-03332-3_18","ieee":"T. Jager, R. Kurek, and J. Pan, “Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH,” in Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III, 2018, pp. 490–518.","chicago":"Jager, Tibor, Rafael Kurek, and Jiaxin Pan. “Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH.” In Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III, 490–518, 2018. https://doi.org/10.1007/978-3-030-03332-3_18.","mla":"Jager, Tibor, et al. “Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH.” Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III, 2018, pp. 490–518, doi:10.1007/978-3-030-03332-3_18.","bibtex":"@inproceedings{Jager_Kurek_Pan_2018, title={Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH}, DOI={10.1007/978-3-030-03332-3_18}, booktitle={Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III}, author={Jager, Tibor and Kurek, Rafael and Pan, Jiaxin}, year={2018}, pages={490–518} }","apa":"Jager, T., Kurek, R., & Pan, J. (2018). Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH. In Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III (pp. 490–518). https://doi.org/10.1007/978-3-030-03332-3_18"},"language":[{"iso":"eng"}],"department":[{"_id":"558"}],"publication":"Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III","type":"conference","title":"Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH","status":"public","author":[{"full_name":"Jager, Tibor","id":"64669","first_name":"Tibor","last_name":"Jager"},{"last_name":"Kurek","first_name":"Rafael","full_name":"Kurek, Rafael","id":"64752"},{"last_name":"Pan","first_name":"Jiaxin","full_name":"Pan, Jiaxin"}],"_id":"5862"},{"date_updated":"2022-01-06T07:04:16Z","doi":"10.1007/s10623-018-0461-x","page":"2549-2586","year":"2018","publication":"Designs, Codes and Cryptography","type":"journal_article","publication_status":"published","user_id":"66268","date_created":"2019-05-03T12:42:01Z","citation":{"chicago":"Liu, Jia, Tibor Jager, Saqib Kakvi, and Bogdan Warinschi. “How to Build Time-Lock Encryption.” Designs, Codes and Cryptography, 2018, 2549–86. https://doi.org/10.1007/s10623-018-0461-x.","ieee":"J. Liu, T. Jager, S. Kakvi, and B. Warinschi, “How to build time-lock encryption,” Designs, Codes and Cryptography, pp. 2549–2586, 2018.","ama":"Liu J, Jager T, Kakvi S, Warinschi B. How to build time-lock encryption. Designs, Codes and Cryptography. 2018:2549-2586. doi:10.1007/s10623-018-0461-x","mla":"Liu, Jia, et al. “How to Build Time-Lock Encryption.” Designs, Codes and Cryptography, 2018, pp. 2549–86, doi:10.1007/s10623-018-0461-x.","short":"J. Liu, T. Jager, S. Kakvi, B. Warinschi, Designs, Codes and Cryptography (2018) 2549–2586.","bibtex":"@article{Liu_Jager_Kakvi_Warinschi_2018, title={How to build time-lock encryption}, DOI={10.1007/s10623-018-0461-x}, journal={Designs, Codes and Cryptography}, author={Liu, Jia and Jager, Tibor and Kakvi, Saqib and Warinschi, Bogdan}, year={2018}, pages={2549–2586} }","apa":"Liu, J., Jager, T., Kakvi, S., & Warinschi, B. (2018). How to build time-lock encryption. Designs, Codes and Cryptography, 2549–2586. https://doi.org/10.1007/s10623-018-0461-x"},"language":[{"iso":"eng"}],"department":[{"_id":"558"}],"publication_identifier":{"issn":["0925-1022","1573-7586"]},"status":"public","title":"How to build time-lock encryption","_id":"9606","author":[{"full_name":"Liu, Jia","first_name":"Jia","last_name":"Liu"},{"full_name":"Jager, Tibor","id":"64669","last_name":"Jager","first_name":"Tibor"},{"full_name":"Kakvi, Saqib","id":"66268","first_name":"Saqib","last_name":"Kakvi"},{"full_name":"Warinschi, Bogdan","last_name":"Warinschi","first_name":"Bogdan"}]},{"file_date_updated":"2018-11-08T12:53:03Z","publication_status":"published","publication":"Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"558"}],"user_id":"38235","date_created":"2018-11-08T12:47:45Z","citation":{"apa":"Gjøsteen, K., & Jager, T. (2018). Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange. In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II. https://doi.org/10.1007/978-3-319-96881-0_4","bibtex":"@inproceedings{Gjøsteen_Jager_2018, title={Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange}, DOI={10.1007/978-3-319-96881-0_4}, booktitle={Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II}, author={Gjøsteen, Kristian and Jager, Tibor}, year={2018} }","short":"K. Gjøsteen, T. Jager, in: Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, 2018.","chicago":"Gjøsteen, Kristian, and Tibor Jager. “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange.” In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, 2018. https://doi.org/10.1007/978-3-319-96881-0_4.","ama":"Gjøsteen K, Jager T. Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange. In: Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II. ; 2018. doi:10.1007/978-3-319-96881-0_4","ieee":"K. Gjøsteen and T. Jager, “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange,” in Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, 2018.","mla":"Gjøsteen, Kristian, and Tibor Jager. “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange.” Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, 2018, doi:10.1007/978-3-319-96881-0_4."},"has_accepted_license":"1","doi":"10.1007/978-3-319-96881-0_4","date_updated":"2022-01-06T07:01:53Z","year":"2018","_id":"5438","ddc":["006"],"author":[{"last_name":"Gjøsteen","first_name":"Kristian","full_name":"Gjøsteen, Kristian"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"}],"main_file_link":[{"url":"https://eprint.iacr.org/2018/543.pdf"}],"status":"public","file":[{"access_level":"closed","date_created":"2018-11-08T12:53:03Z","creator":"abirke","file_name":"2018-543","file_id":"5440","relation":"main_file","file_size":486642,"date_updated":"2018-11-08T12:53:03Z","content_type":"application/octet-stream"}],"title":"Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange"},{"type":"conference","publication_status":"published","date_created":"2018-11-08T12:56:04Z","publisher":"ACM Press","year":"2018","main_file_link":[{"url":"https://eprint.iacr.org/2018/855.pdf"}],"status":"public","file":[{"date_created":"2018-11-08T12:57:34Z","success":1,"access_level":"closed","file_id":"5443","file_name":"2018-855.pdf","creator":"abirke","content_type":"application/pdf","date_updated":"2018-11-08T12:57:34Z","file_size":481982,"relation":"main_file"}],"publication":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS '18","file_date_updated":"2018-11-08T12:57:34Z","user_id":"38235","has_accepted_license":"1","citation":{"apa":"Jager, T., Kakvi, S., & May, A. (2018). On the Security of the PKCS#1 v1.5 Signature Scheme. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18. ACM Press. https://doi.org/10.1145/3243734.3243798","bibtex":"@inproceedings{Jager_Kakvi_May_2018, title={On the Security of the PKCS#1 v1.5 Signature Scheme}, DOI={10.1145/3243734.3243798}, booktitle={Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18}, publisher={ACM Press}, author={Jager, Tibor and Kakvi, Saqib and May, Alexander}, year={2018} }","ieee":"T. Jager, S. Kakvi, and A. May, “On the Security of the PKCS#1 v1.5 Signature Scheme,” in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18, 2018.","ama":"Jager T, Kakvi S, May A. On the Security of the PKCS#1 v1.5 Signature Scheme. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18. ACM Press; 2018. doi:10.1145/3243734.3243798","chicago":"Jager, Tibor, Saqib Kakvi, and Alexander May. “On the Security of the PKCS#1 v1.5 Signature Scheme.” In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18. ACM Press, 2018. https://doi.org/10.1145/3243734.3243798.","mla":"Jager, Tibor, et al. “On the Security of the PKCS#1 v1.5 Signature Scheme.” Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18, ACM Press, 2018, doi:10.1145/3243734.3243798.","short":"T. Jager, S. Kakvi, A. May, in: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18, ACM Press, 2018."},"department":[{"_id":"558"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:54Z","doi":"10.1145/3243734.3243798","_id":"5442","ddc":["006"],"author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"full_name":"Kakvi, Saqib","id":"66268","last_name":"Kakvi","first_name":"Saqib"},{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"}],"publication_identifier":{"isbn":["9781450356930"]},"title":"On the Security of the PKCS#1 v1.5 Signature Scheme"},{"page":"1276--1324","doi":"10.1007/s00145-016-9248-2","date_updated":"2022-01-06T06:58:56Z","year":"2017","type":"journal_article","publication":"J. Cryptology","department":[{"_id":"558"}],"citation":{"apa":"Jager, T., Kohlar, F., Schäge, S., & Schwenk, J. (2017). Authenticated Confidential Channel Establishment and the Security of TLS-DHE. J. Cryptology, (4), 1276--1324. https://doi.org/10.1007/s00145-016-9248-2","bibtex":"@article{Jager_Kohlar_Schäge_Schwenk_2017, title={Authenticated Confidential Channel Establishment and the Security of TLS-DHE}, DOI={10.1007/s00145-016-9248-2}, number={4}, journal={J. Cryptology}, author={Jager, Tibor and Kohlar, Florian and Schäge, Sven and Schwenk, Jörg}, year={2017}, pages={1276--1324} }","mla":"Jager, Tibor, et al. “Authenticated Confidential Channel Establishment and the Security of TLS-DHE.” J. Cryptology, no. 4, 2017, pp. 1276--1324, doi:10.1007/s00145-016-9248-2.","ieee":"T. Jager, F. Kohlar, S. Schäge, and J. Schwenk, “Authenticated Confidential Channel Establishment and the Security of TLS-DHE,” J. Cryptology, no. 4, pp. 1276--1324, 2017.","ama":"Jager T, Kohlar F, Schäge S, Schwenk J. Authenticated Confidential Channel Establishment and the Security of TLS-DHE. J Cryptology. 2017;(4):1276--1324. doi:10.1007/s00145-016-9248-2","chicago":"Jager, Tibor, Florian Kohlar, Sven Schäge, and Jörg Schwenk. “Authenticated Confidential Channel Establishment and the Security of TLS-DHE.” J. Cryptology, no. 4 (2017): 1276--1324. https://doi.org/10.1007/s00145-016-9248-2.","short":"T. Jager, F. Kohlar, S. Schäge, J. Schwenk, J. Cryptology (2017) 1276--1324."},"user_id":"38235","date_created":"2018-06-07T08:58:36Z","status":"public","title":"Authenticated Confidential Channel Establishment and the Security of TLS-DHE","issue":"4","_id":"3108","author":[{"id":"64669","full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"},{"last_name":"Kohlar","first_name":"Florian","full_name":"Kohlar, Florian"},{"last_name":"Schäge","first_name":"Sven","full_name":"Schäge, Sven"},{"first_name":"Jörg","last_name":"Schwenk","full_name":"Schwenk, Jörg"}]},{"year":"2017","page":"20--38","doi":"10.1007/978-3-319-61204-1_2","date_updated":"2022-01-06T06:58:56Z","department":[{"_id":"558"}],"citation":{"mla":"Hale, Britta, et al. “Simple Security Definitions for and Constructions of 0-RTT Key Exchange.” Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings, 2017, pp. 20--38, doi:10.1007/978-3-319-61204-1_2.","chicago":"Hale, Britta, Tibor Jager, Sebastian Lauer, and Jörg Schwenk. “Simple Security Definitions for and Constructions of 0-RTT Key Exchange.” In Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings, 20--38, 2017. https://doi.org/10.1007/978-3-319-61204-1_2.","ieee":"B. Hale, T. Jager, S. Lauer, and J. Schwenk, “Simple Security Definitions for and Constructions of 0-RTT Key Exchange,” in Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings, 2017, pp. 20--38.","ama":"Hale B, Jager T, Lauer S, Schwenk J. Simple Security Definitions for and Constructions of 0-RTT Key Exchange. In: Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. ; 2017:20--38. doi:10.1007/978-3-319-61204-1_2","short":"B. Hale, T. Jager, S. Lauer, J. Schwenk, in: Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings, 2017, pp. 20--38.","apa":"Hale, B., Jager, T., Lauer, S., & Schwenk, J. (2017). Simple Security Definitions for and Constructions of 0-RTT Key Exchange. In Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings (pp. 20--38). https://doi.org/10.1007/978-3-319-61204-1_2","bibtex":"@inproceedings{Hale_Jager_Lauer_Schwenk_2017, title={Simple Security Definitions for and Constructions of 0-RTT Key Exchange}, DOI={10.1007/978-3-319-61204-1_2}, booktitle={Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings}, author={Hale, Britta and Jager, Tibor and Lauer, Sebastian and Schwenk, Jörg}, year={2017}, pages={20--38} }"},"user_id":"38235","date_created":"2018-06-07T09:07:59Z","type":"conference","publication":"Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings","title":"Simple Security Definitions for and Constructions of 0-RTT Key Exchange","status":"public","author":[{"first_name":"Britta","last_name":"Hale","full_name":"Hale, Britta"},{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor","id":"64669"},{"last_name":"Lauer","first_name":"Sebastian","full_name":"Lauer, Sebastian"},{"full_name":"Schwenk, Jörg","last_name":"Schwenk","first_name":"Jörg"}],"_id":"3109"},{"citation":{"bibtex":"@inproceedings{Günther_Hale_Jager_Lauer_2017, title={0-RTT Key Exchange with Full Forward Secrecy}, DOI={10.1007/978-3-319-56617-7_18}, booktitle={Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III}, author={Günther, Felix and Hale, Britta and Jager, Tibor and Lauer, Sebastian}, year={2017}, pages={519--548} }","mla":"Günther, Felix, et al. “0-RTT Key Exchange with Full Forward Secrecy.” Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III, 2017, pp. 519--548, doi:10.1007/978-3-319-56617-7_18.","ieee":"F. Günther, B. Hale, T. Jager, and S. Lauer, “0-RTT Key Exchange with Full Forward Secrecy,” in Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III, 2017, pp. 519--548.","ama":"Günther F, Hale B, Jager T, Lauer S. 0-RTT Key Exchange with Full Forward Secrecy. In: Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III. ; 2017:519--548. doi:10.1007/978-3-319-56617-7_18","chicago":"Günther, Felix, Britta Hale, Tibor Jager, and Sebastian Lauer. “0-RTT Key Exchange with Full Forward Secrecy.” In Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III, 519--548, 2017. https://doi.org/10.1007/978-3-319-56617-7_18.","short":"F. Günther, B. Hale, T. Jager, S. Lauer, in: Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III, 2017, pp. 519--548.","apa":"Günther, F., Hale, B., Jager, T., & Lauer, S. (2017). 0-RTT Key Exchange with Full Forward Secrecy. In Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III (pp. 519--548). https://doi.org/10.1007/978-3-319-56617-7_18"},"date_created":"2018-06-07T09:10:17Z","user_id":"38235","department":[{"_id":"558"}],"type":"conference","publication":"Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III","year":"2017","page":"519--548","doi":"10.1007/978-3-319-56617-7_18","date_updated":"2022-01-06T06:58:56Z","author":[{"full_name":"Günther, Felix","first_name":"Felix","last_name":"Günther"},{"full_name":"Hale, Britta","first_name":"Britta","last_name":"Hale"},{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"last_name":"Lauer","first_name":"Sebastian","full_name":"Lauer, Sebastian"}],"_id":"3110","title":"0-RTT Key Exchange with Full Forward Secrecy","status":"public"},{"title":"Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy","status":"public","author":[{"id":"64669","full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"},{"last_name":"Stam","first_name":"Martijn","full_name":"Stam, Martijn"},{"full_name":"Stanley-Oakes, Ryan","last_name":"Stanley-Oakes","first_name":"Ryan"},{"full_name":"Warinschi, Bogdan","first_name":"Bogdan","last_name":"Warinschi"}],"_id":"3111","year":"2017","page":"409--441","date_updated":"2022-01-06T06:58:56Z","doi":"10.1007/978-3-319-70500-2_14","department":[{"_id":"558"}],"citation":{"apa":"Jager, T., Stam, M., Stanley-Oakes, R., & Warinschi, B. (2017). Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. In Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I (pp. 409--441). https://doi.org/10.1007/978-3-319-70500-2_14","bibtex":"@inproceedings{Jager_Stam_Stanley-Oakes_Warinschi_2017, title={Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy}, DOI={10.1007/978-3-319-70500-2_14}, booktitle={Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I}, author={Jager, Tibor and Stam, Martijn and Stanley-Oakes, Ryan and Warinschi, Bogdan}, year={2017}, pages={409--441} }","ama":"Jager T, Stam M, Stanley-Oakes R, Warinschi B. Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. In: Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I. ; 2017:409--441. doi:10.1007/978-3-319-70500-2_14","chicago":"Jager, Tibor, Martijn Stam, Ryan Stanley-Oakes, and Bogdan Warinschi. “Multi-Key Authenticated Encryption with Corruptions: Reductions Are Lossy.” In Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I, 409--441, 2017. https://doi.org/10.1007/978-3-319-70500-2_14.","ieee":"T. Jager, M. Stam, R. Stanley-Oakes, and B. Warinschi, “Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy,” in Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I, 2017, pp. 409--441.","mla":"Jager, Tibor, et al. “Multi-Key Authenticated Encryption with Corruptions: Reductions Are Lossy.” Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I, 2017, pp. 409--441, doi:10.1007/978-3-319-70500-2_14.","short":"T. Jager, M. Stam, R. Stanley-Oakes, B. Warinschi, in: Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I, 2017, pp. 409--441."},"date_created":"2018-06-07T09:11:07Z","user_id":"38235","type":"conference","publication":"Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I"},{"type":"journal_article","publication":"Journal of Cryptology","publication_status":"published","citation":{"apa":"Kakvi, S., & Kiltz, E. (2017). Optimal Security Proofs for Full Domain Hash, Revisited. Journal of Cryptology, 276–306. https://doi.org/10.1007/s00145-017-9257-9","bibtex":"@article{Kakvi_Kiltz_2017, title={Optimal Security Proofs for Full Domain Hash, Revisited}, DOI={10.1007/s00145-017-9257-9}, journal={Journal of Cryptology}, author={Kakvi, Saqib and Kiltz, Eike}, year={2017}, pages={276–306} }","mla":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” Journal of Cryptology, 2017, pp. 276–306, doi:10.1007/s00145-017-9257-9.","ama":"Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited. Journal of Cryptology. 2017:276-306. doi:10.1007/s00145-017-9257-9","chicago":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” Journal of Cryptology, 2017, 276–306. https://doi.org/10.1007/s00145-017-9257-9.","ieee":"S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” Journal of Cryptology, pp. 276–306, 2017.","short":"S. Kakvi, E. Kiltz, Journal of Cryptology (2017) 276–306."},"user_id":"66268","date_created":"2019-05-03T12:44:03Z","language":[{"iso":"eng"}],"department":[{"_id":"558"}],"page":"276-306","doi":"10.1007/s00145-017-9257-9","date_updated":"2022-01-06T07:04:16Z","year":"2017","_id":"9607","main_file_link":[{"url":"https://link.springer.com/article/10.1007%2Fs00145-017-9257-9"}],"author":[{"id":"66268","full_name":"Kakvi, Saqib","last_name":"Kakvi","first_name":"Saqib"},{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"}],"status":"public","publication_identifier":{"issn":["0933-2790","1432-1378"]},"title":"Optimal Security Proofs for Full Domain Hash, Revisited"},{"user_id":"38235","date_created":"2018-06-07T09:12:15Z","citation":{"apa":"Hofheinz, D., & Jager, T. (2016). Tightly secure signatures and public-key encryption. Des. Codes Cryptography, (1), 29--61. https://doi.org/10.1007/s10623-015-0062-x","bibtex":"@article{Hofheinz_Jager_2016, title={Tightly secure signatures and public-key encryption}, DOI={10.1007/s10623-015-0062-x}, number={1}, journal={Des. Codes Cryptography}, author={Hofheinz, Dennis and Jager, Tibor}, year={2016}, pages={29--61} }","mla":"Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key Encryption.” Des. Codes Cryptography, no. 1, 2016, pp. 29--61, doi:10.1007/s10623-015-0062-x.","ieee":"D. Hofheinz and T. Jager, “Tightly secure signatures and public-key encryption,” Des. Codes Cryptography, no. 1, pp. 29--61, 2016.","chicago":"Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key Encryption.” Des. Codes Cryptography, no. 1 (2016): 29--61. https://doi.org/10.1007/s10623-015-0062-x.","ama":"Hofheinz D, Jager T. Tightly secure signatures and public-key encryption. Des Codes Cryptography. 2016;(1):29--61. doi:10.1007/s10623-015-0062-x","short":"D. Hofheinz, T. Jager, Des. Codes Cryptography (2016) 29--61."},"department":[{"_id":"558"}],"publication":"Des. Codes Cryptography","type":"journal_article","year":"2016","doi":"10.1007/s10623-015-0062-x","extern":"1","date_updated":"2022-01-06T06:58:56Z","page":"29--61","author":[{"full_name":"Hofheinz, Dennis","first_name":"Dennis","last_name":"Hofheinz"},{"last_name":"Jager","first_name":"Tibor","id":"64669","full_name":"Jager, Tibor"}],"issue":"1","_id":"3112","title":"Tightly secure signatures and public-key encryption","status":"public"},{"year":"2016","date_updated":"2022-01-06T06:58:56Z","extern":"1","doi":"10.1049/iet-ifs.2015.0507","page":"304--318","department":[{"_id":"558"}],"user_id":"38235","date_created":"2018-06-07T09:12:50Z","citation":{"apa":"Heuer, F., Jager, T., Schäge, S., & Kiltz, E. (2016). Selective opening security of practical public-key encryption schemes. IET Information Security, (6), 304--318. https://doi.org/10.1049/iet-ifs.2015.0507","bibtex":"@article{Heuer_Jager_Schäge_Kiltz_2016, title={Selective opening security of practical public-key encryption schemes}, DOI={10.1049/iet-ifs.2015.0507}, number={6}, journal={IET Information Security}, author={Heuer, Felix and Jager, Tibor and Schäge, Sven and Kiltz, Eike}, year={2016}, pages={304--318} }","mla":"Heuer, Felix, et al. “Selective Opening Security of Practical Public-Key Encryption Schemes.” IET Information Security, no. 6, 2016, pp. 304--318, doi:10.1049/iet-ifs.2015.0507.","ieee":"F. Heuer, T. Jager, S. Schäge, and E. Kiltz, “Selective opening security of practical public-key encryption schemes,” IET Information Security, no. 6, pp. 304--318, 2016.","ama":"Heuer F, Jager T, Schäge S, Kiltz E. Selective opening security of practical public-key encryption schemes. IET Information Security. 2016;(6):304--318. doi:10.1049/iet-ifs.2015.0507","chicago":"Heuer, Felix, Tibor Jager, Sven Schäge, and Eike Kiltz. “Selective Opening Security of Practical Public-Key Encryption Schemes.” IET Information Security, no. 6 (2016): 304--318. https://doi.org/10.1049/iet-ifs.2015.0507.","short":"F. Heuer, T. Jager, S. Schäge, E. Kiltz, IET Information Security (2016) 304--318."},"publication":"IET Information Security","type":"journal_article","title":"Selective opening security of practical public-key encryption schemes","status":"public","author":[{"full_name":"Heuer, Felix","first_name":"Felix","last_name":"Heuer"},{"id":"64669","full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"},{"last_name":"Schäge","first_name":"Sven","full_name":"Schäge, Sven"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"}],"_id":"3113","issue":"6"},{"publication":"PoPETs","type":"journal_article","department":[{"_id":"558"}],"date_created":"2018-06-07T09:13:15Z","user_id":"38235","citation":{"apa":"Jager, T., & Rupp, A. (2016). Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. PoPETs, (3), 62--82.","short":"T. Jager, A. Rupp, PoPETs (2016) 62--82.","mla":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” PoPETs, no. 3, 2016, pp. 62--82.","ieee":"T. Jager and A. Rupp, “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way,” PoPETs, no. 3, pp. 62--82, 2016.","ama":"Jager T, Rupp A. Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. PoPETs. 2016;(3):62--82.","chicago":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” PoPETs, no. 3 (2016): 62--82.","bibtex":"@article{Jager_Rupp_2016, title={Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way}, number={3}, journal={PoPETs}, author={Jager, Tibor and Rupp, Andy}, year={2016}, pages={62--82} }"},"extern":"1","date_updated":"2022-01-06T06:58:56Z","page":"62--82","year":"2016","issue":"3","_id":"3114","author":[{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"last_name":"Rupp","first_name":"Andy","full_name":"Rupp, Andy"}],"status":"public","title":"Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way"},{"title":"How to Generate and Use Universal Samplers","status":"public","author":[{"full_name":"Hofheinz, Dennis","last_name":"Hofheinz","first_name":"Dennis"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"full_name":"Khurana, Dakshita","first_name":"Dakshita","last_name":"Khurana"},{"first_name":"Amit","last_name":"Sahai","full_name":"Sahai, Amit"},{"last_name":"Waters","first_name":"Brent","full_name":"Waters, Brent"},{"full_name":"Zhandry, Mark","last_name":"Zhandry","first_name":"Mark"}],"_id":"3115","year":"2016","date_updated":"2022-01-06T06:58:57Z","doi":"10.1007/978-3-662-53890-6_24","extern":"1","page":"715--744","department":[{"_id":"558"}],"user_id":"38235","date_created":"2018-06-07T09:13:48Z","citation":{"apa":"Hofheinz, D., Jager, T., Khurana, D., Sahai, A., Waters, B., & Zhandry, M. (2016). How to Generate and Use Universal Samplers. In Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II (pp. 715--744). https://doi.org/10.1007/978-3-662-53890-6_24","mla":"Hofheinz, Dennis, et al. “How to Generate and Use Universal Samplers.” Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, 2016, pp. 715--744, doi:10.1007/978-3-662-53890-6_24.","ama":"Hofheinz D, Jager T, Khurana D, Sahai A, Waters B, Zhandry M. How to Generate and Use Universal Samplers. In: Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II. ; 2016:715--744. doi:10.1007/978-3-662-53890-6_24","chicago":"Hofheinz, Dennis, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, and Mark Zhandry. “How to Generate and Use Universal Samplers.” In Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, 715--744, 2016. https://doi.org/10.1007/978-3-662-53890-6_24.","ieee":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, and M. Zhandry, “How to Generate and Use Universal Samplers,” in Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, 2016, pp. 715--744.","short":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, M. Zhandry, in: Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, 2016, pp. 715--744.","bibtex":"@inproceedings{Hofheinz_Jager_Khurana_Sahai_Waters_Zhandry_2016, title={How to Generate and Use Universal Samplers}, DOI={10.1007/978-3-662-53890-6_24}, booktitle={Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II}, author={Hofheinz, Dennis and Jager, Tibor and Khurana, Dakshita and Sahai, Amit and Waters, Brent and Zhandry, Mark}, year={2016}, pages={715--744} }"},"publication":"Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II","type":"conference"},{"status":"public","title":"Breaking PPTP VPNs via RADIUS Encryption","_id":"3116","author":[{"full_name":"Horst, Matthias","first_name":"Matthias","last_name":"Horst"},{"full_name":"Grothe, Martin","first_name":"Martin","last_name":"Grothe"},{"full_name":"Jager, Tibor","id":"64669","first_name":"Tibor","last_name":"Jager"},{"full_name":"Schwenk, Jörg","last_name":"Schwenk","first_name":"Jörg"}],"extern":"1","doi":"10.1007/978-3-319-48965-0_10","date_updated":"2022-01-06T06:58:57Z","page":"159--175","year":"2016","publication":"Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings","type":"conference","department":[{"_id":"558"}],"user_id":"38235","date_created":"2018-06-07T09:14:34Z","citation":{"apa":"Horst, M., Grothe, M., Jager, T., & Schwenk, J. (2016). Breaking PPTP VPNs via RADIUS Encryption. In Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings (pp. 159--175). https://doi.org/10.1007/978-3-319-48965-0_10","bibtex":"@inproceedings{Horst_Grothe_Jager_Schwenk_2016, title={Breaking PPTP VPNs via RADIUS Encryption}, DOI={10.1007/978-3-319-48965-0_10}, booktitle={Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings}, author={Horst, Matthias and Grothe, Martin and Jager, Tibor and Schwenk, Jörg}, year={2016}, pages={159--175} }","chicago":"Horst, Matthias, Martin Grothe, Tibor Jager, and Jörg Schwenk. “Breaking PPTP VPNs via RADIUS Encryption.” In Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings, 159--175, 2016. https://doi.org/10.1007/978-3-319-48965-0_10.","ieee":"M. Horst, M. Grothe, T. Jager, and J. Schwenk, “Breaking PPTP VPNs via RADIUS Encryption,” in Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings, 2016, pp. 159--175.","ama":"Horst M, Grothe M, Jager T, Schwenk J. Breaking PPTP VPNs via RADIUS Encryption. In: Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings. ; 2016:159--175. doi:10.1007/978-3-319-48965-0_10","mla":"Horst, Matthias, et al. “Breaking PPTP VPNs via RADIUS Encryption.” Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings, 2016, pp. 159--175, doi:10.1007/978-3-319-48965-0_10.","short":"M. Horst, M. Grothe, T. Jager, J. Schwenk, in: Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings, 2016, pp. 159--175."}}]