Pseudorandom generators for low degree polynomials
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
ICML '06 Proceedings of the 23rd international conference on Machine learning
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the Security of Goldreich's One-Way Function
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
One-way permutations, interactive hashing and statistically hiding commitments
TCC'07 Proceedings of the 4th conference on Theory of cryptography
How many oblivious transfers are needed for secure multiparty computation?
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On the round complexity of covert computation
Proceedings of the forty-second ACM symposium on Theory of computing
Input locality and hardness amplification
TCC'11 Proceedings of the 8th conference on Theory of cryptography
From randomizing polynomials to parallel algorithms
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On the power of the randomized iterate
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Scalable secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
On the complexity of parallel hardness amplification for one-way functions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
How to delegate and verify in public: verifiable computation from attribute-based encryption
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Sparse extractor families for all the entropy
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hi-index | 0.00 |
We study the parallel time-complexity of basic cryptographic primitives such as one-way functions (OWFs) and pseudorandom generators (PRGs). Specifically, we study the possibility of computing instances of these primitives by NC驴 circuits, in which each output bit depends on a constant number of input bits. Despite previous efforts in this direction, there has been no significant theoretical evidence supporting this possibility, which was posed as an open question in several previous works. We essentially settle this question by providing overwhelming positive evidence for the possibility of cryptography in NC驴 Our main result is that every "moderatelyeasy" OWF (resp., PRG), say computable in NC鹿, can be compiled into a corresponding OWF (resp., low-stretch PRG) in NC_4^0 i.e. whose output bits each depend on at most 4 input bits. The existence of OWF and PRG in NC鹿 is a relatively mild assumption, implied by most number-theoretic or algebraic intractability assumptions commonly used in cryptography. Hence, the existence of OWF and PRG in NC驴 follows from a variety of standard assumptions. A similar compiler can also be obtained for other cryptographic primitives such as one-way permutations, encryption, commitment, and collision-resistant hashing. The above results leave a small gap between the possibility of cryptography in NC_4^0and the known impossibility of implementing even OWF in NC_2^0 We partially close this gap by providing evidence for the existence of OWF in NC_3^0. resolving an open question posed by Mossel et al. [25], as well as a PRG for logspace in NC驴. Our results make use of the machinery of randomizing polynomials [19], which was originally motivated by questions in the domain of information-theoretic secure multiparty computation.