A Note on Perfect Correctness by Derandomization
From MaRDI portal
Publication:5267419
DOI10.1007/978-3-319-56614-6_20zbMATH Open1415.94411OpenAlexW2613015340MaRDI QIDQ5267419FDOQ5267419
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
Cites Work
- Probabilistic encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Hardness vs randomness
- A Pseudorandom Generator from any One-way Function
- Title not available (Why is that?)
- On the importance of eliminating errors in cryptographic computations
- Bit commitment using pseudorandomness
- Advances in cryptology -- EUROCRYPT 2004. International conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2--6, 2004. Proceedings.
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Foundations of Cryptography
- BPP and the polynomial hierarchy
- Simple extractors for all min-entropies and a new pseudorandom generator
- Title not available (Why is that?)
- Derandomization in Cryptography
- Zaps and Their Applications
- On the (im)possibility of obfuscating programs
- Title not available (Why is that?)
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Indistinguishability Obfuscation: From Approximate to Exact
- Advances in Cryptology - EUROCRYPT 2004
- Amplification of Chosen-Ciphertext Security
- On the existence of extractable one-way functions
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
Cited In (15)
- Generic constructions of master-key KDM secure attribute-based encryption
- A new framework for quantum oblivious transfer
- How to build a trapdoor function from an encryption scheme
- On the complexity of compressing obfuscation
- Statistically sender-private OT from LPN and derandomization
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Collision-resistance from multi-collision-resistance
- Non-malleable codes with optimal rate for poly-size circuits
- Combiners for functional encryption, unconditionally
- From FE combiners to secure MPC and back
- Cryptographic pseudorandom generators can make cryptosystems problematic
- Collision Resistance from Multi-collision Resistance
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- The Journey from NP to TFNP Hardness
This page was built for publication: A Note on Perfect Correctness by Derandomization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267419)
