A Note on Perfect Correctness by Derandomization
From MaRDI portal
Publication:5267419
DOI10.1007/978-3-319-56614-6_20zbMath1415.94411OpenAlexW2613015340MaRDI QIDQ5267419
Vinod Vaikuntanathan, Nir Bitansky
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_20
Related Items (13)
The Journey from NP to TFNP Hardness ⋮ From FE combiners to secure MPC and back ⋮ Collision-resistance from multi-collision-resistance ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ How to build a trapdoor function from an encryption scheme ⋮ Statistically sender-private OT from LPN and derandomization ⋮ A new framework for quantum oblivious transfer ⋮ CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors ⋮ On the complexity of compressing obfuscation ⋮ 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? ⋮ Combiners for functional encryption, unconditionally ⋮ Cryptographic pseudorandom generators can make cryptosystems problematic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- BPP and the polynomial hierarchy
- Probabilistic encryption
- Hardness vs randomness
- Advances in cryptology -- EUROCRYPT 2004. International conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2--6, 2004. Proceedings.
- Indistinguishability Obfuscation: From Approximate to Exact
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Simple extractors for all min-entropies and a new pseudorandom generator
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- Amplification of Chosen-Ciphertext Security
- On the existence of extractable one-way functions
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- Advances in Cryptology - EUROCRYPT 2004
- Derandomization in Cryptography
- On the (im)possibility of obfuscating programs
- Zaps and Their Applications
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- On the importance of eliminating errors in cryptographic computations
This page was built for publication: A Note on Perfect Correctness by Derandomization
