More constructions of lossy and correlation-secure trapdoor functions
From MaRDI portal
Publication:1946593
DOI10.1007/s00145-011-9112-3zbMath1291.94083OpenAlexW2035103883WikidataQ59163679 ScholiaQ59163679MaRDI QIDQ1946593
David M. Freeman, Gil Segev, Oded Goldreich, Eike Kiltz, Alon Rosen
Publication date: 15 April 2013
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-011-9112-3
Related Items (13)
Targeted lossy functions and applications ⋮ Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Instantiability of RSA-OAEP under chosen-plaintext attack ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Extended Galbraith's test on the anonymity of IBE schemes from higher residuosity ⋮ Incremental deterministic public-key encryption ⋮ Deterministic public-key encryption for adaptively-chosen plaintext distributions ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ Incompressible encodings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
- List Decoding for Binary Goppa Codes
- Lossy trapdoor functions and their applications
- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- Circular-Secure Encryption from Decision Diffie-Hellman
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Chosen-Ciphertext Security via Correlated Products
- Secure Hybrid Encryption from Weakened Key Encapsulation
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Hedged Public-Key Encryption: How to Protect against Bad Randomness
- Efficient Non-interactive Universally Composable String-Commitment Schemes
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Public-Key Cryptosystems Resilient to Key Leakage
This page was built for publication: More constructions of lossy and correlation-secure trapdoor functions