Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions

DOI10.1007/978-3-642-13013-7_18zbMath1281.94043OpenAlexW2147639642MaRDI QIDQ3562904

Petros Mol, Scott Yilek

Publication date: 28 May 2010

Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_18

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Receiver Selective Opening Security from Indistinguishability Obfuscation ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Lossy trapdoor functions from homomorphic reproducible encryption ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ General Construction of Chameleon All-But-One Trapdoor Functions ⋮ Chosen ciphertext security from injective trapdoor functions

This page was built for publication: Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions