A Note on Perfect Correctness by Derandomization
Authors:
- Nir BitanskyNBNir Bitansky
- Vinod VaikuntanathanVVVinod Vaikuntanathan
- 1 April 2017
- book chapter
- Published by Springer Nature
- p. 592-606
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- On the (im)possibility of obfuscating programsJournal of the ACM, 2012
- Derandomization in CryptographySIAM Journal on Computing, 2007
- Zaps and Their ApplicationsSIAM Journal on Computing, 2007
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Eliminating decryption errors in the Ajtai-Dwork Cryptosystem1997
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- BPP and the polynomial hierarchyInformation Processing Letters, 1983