Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/B97182MaRDI QIDQ5307263zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Recommendations

• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Advances in Cryptology - CRYPTO 2003
• scientific article; zbMATH DE number 1088229
• CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
• Enhanced NTRU cryptosystem eliminating decryption failures

Cited in

(32)

• A proof of security of Yao's protocol for two-party computation
• Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
• A framework for unconditionally secure public-key encryption (with possible decryption errors)
• A black-box construction of non-malleable encryption from semantically secure encryption
• Generic authenticated key exchange in the quantum random oracle model
• Cryptographic pseudorandom generators can make cryptosystems problematic
• Amplifying the security of functional encryption, unconditionally
• Chosen ciphertext security from injective trapdoor functions
• A note on perfect correctness by derandomization
• Statistical difference beyond the polarizing regime
• CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
• Non-committing encryption with constant ciphertext expansion from standard assumptions
• Indistinguishability obfuscation: from approximate to exact
• Simultaneous secrecy and reliability amplification for a general channel model
• The journey from NP to TFNP hardness
• Computational two-party correlation: a dichotomy for key-agreement protocols
• A note on perfect correctness by derandomization
• Functional encryption: deterministic to randomized functions from simple assumptions
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• CCA security and trapdoor functions via key-dependent-message security
• Collision-resistance from multi-collision-resistance
• Public-key encryption from homogeneous CLWE
• Collision Resistance from Multi-collision Resistance
• Public-key encryption, local pseudorandom generators, and the low-degree method
• Combinatorially homomorphic encryption
• Injective rank metric trapdoor functions with homogeneous errors
• Amplification of non-interactive zero knowledge, revisited
• NIZK amplification via leakage-resilient secure computation
• Quantum CCA-secure PKE, revisited
• Hamming weight proofs of proximity with one-sided error

Describes a project that uses

Uses Software

• NTRU

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)