Lossy trapdoor functions from homomorphic reproducible encryption

DOI10.1016/J.IPL.2012.07.012zbMath1250.94032OpenAlexW2080688935WikidataQ122395092 ScholiaQ122395092MaRDI QIDQ456129

Seung Geol Choi, Hoeteck Wee

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.07.012

zbMATH Keywords

cryptographypublic-key encryptionlossy trapdoor functions

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Reproducible circularly secure bit encryption: applications and realizations

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Synthesizers and their application to the parallel construction of pseudo-random functions
• On Homomorphic Encryption and Chosen-Ciphertext Security
• Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
• Lossy trapdoor functions and their applications
• More Constructions of Lossy and Correlation-Secure Trapdoor Functions
• Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Lossy trapdoor functions from homomorphic reproducible encryption