Cryptography with Constant Input Locality
Authors:
- 1 January 2007
- book chapter
- Published by Springer Nature
- p. 92-110
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONScomputational complexity, 2006
- On Pseudorandom Generators with Linear Stretch in NC02006
- Cryptography in $NC^0$SIAM Journal on Computing, 2006
- Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials2002
- On Pseudorandom Generators in NC02001
- Synthesizers and Their Application to the Parallel Construction of Pseudo-Random FunctionsJournal of Computer and System Sciences, 1999
- On the Existence of Pseudorandom GeneratorsSIAM Journal on Computing, 1993
- Constant depth circuits, Fourier transform, and learnabilityJournal of the ACM, 1993
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- How to construct random functionsJournal of the ACM, 1986