Advances in Cryptology - EUROCRYPT 2004
From MaRDI portal
Publication:5307263
DOI10.1007/B97182zbMATH Open1122.94369OpenAlexW2477185671MaRDI QIDQ5307263FDOQ5307263
Authors: Cynthia Dwork, Moni Naor, Omer Reingold 
Publication date: 25 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97182
Recommendations
Cited In (29)
- Indistinguishability Obfuscation: From Approximate to Exact
- Public-key encryption, local pseudorandom generators, and the low-degree method
- Combinatorially homomorphic encryption
- A Note on Perfect Correctness by Derandomization
- A proof of security of Yao's protocol for two-party computation
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Public-key encryption from homogeneous CLWE
- A note on perfect correctness by derandomization
- Injective rank metric trapdoor functions with homogeneous errors
- A framework for unconditionally secure public-key encryption (with possible decryption errors)
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- CCA security and trapdoor functions via key-dependent-message security
- Generic authenticated key exchange in the quantum random oracle model
- Collision-resistance from multi-collision-resistance
- Simultaneous Secrecy and Reliability Amplification for a General Channel Model
- Statistical difference beyond the polarizing regime
- Cryptographic pseudorandom generators can make cryptosystems problematic
- Collision Resistance from Multi-collision Resistance
- Amplifying the security of functional encryption, unconditionally
- Amplification of non-interactive zero knowledge, revisited
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Non-committing encryption with constant ciphertext expansion from standard assumptions
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Chosen ciphertext security from injective trapdoor functions
- The Journey from NP to TFNP Hardness
- A black-box construction of non-malleable encryption from semantically secure encryption
Uses Software
This page was built for publication: Advances in Cryptology - EUROCRYPT 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307263)
