A note on perfect correctness by derandomization
From MaRDI portal
Publication:5267419
Recommendations
Cites work
- scientific article; zbMATH DE number 1088229 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - EUROCRYPT 2004
- Advances in cryptology -- EUROCRYPT 2004. International conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2--6, 2004. Proceedings.
- Amplification of Chosen-Ciphertext Security
- BPP and the polynomial hierarchy
- Bit commitment using pseudorandomness
- Derandomization in Cryptography
- Foundations of Cryptography
- Hardness vs randomness
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Indistinguishability obfuscation: from approximate to exact
- On lattices, learning with errors, random linear codes, and cryptography
- On the (im)possibility of obfuscating programs
- On the existence of extractable one-way functions
- On the importance of eliminating errors in cryptographic computations
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Probabilistic encryption
- Simple extractors for all min-entropies and a new pseudorandom generator
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
- Zaps and Their Applications
Cited in
(17)- Generic constructions of master-key KDM secure attribute-based encryption
- On perfect correctness in (lockable) obfuscation
- A new framework for quantum oblivious transfer
- A note on perfect correctness by derandomization
- How to build a trapdoor function from an encryption scheme
- On the complexity of compressing obfuscation
- The journey from NP to TFNP hardness
- 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?
- Combiners for functional encryption, unconditionally
- Collision-resistance from multi-collision-resistance
- From FE combiners to secure MPC and back
- Non-malleable codes with optimal rate for poly-size circuits
- 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?
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)
