A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security

DOI10.1007/978-3-540-72540-4_29zbMath1141.94364OpenAlexW2160000391MaRDI QIDQ5429409

Johan Sjödin, Ueli M. Maurer

Publication date: 29 November 2007

Published in: Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72540-4_29

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography ⋮ Two-Round Man-in-the-Middle Security from LPN ⋮ Tweakable Enciphering Schemes from Hash-Sum-Expansion ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions ⋮ From non-adaptive to adaptive pseudorandom functions

This page was built for publication: A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security