Towards non-black-box lower bounds in cryptography

Authors:
Rafael Pass;Wei-Lung Dustin Tseng;Muthuramakrishnan Venkitasubramaniam
Affiliations:
Cornell University;Cornell University;Cornell University
Venue:
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Year:
2011

Citing 26
Cited 3

How to generate cryptographically strong sequences of pseudo-random bits

SIAM Journal on Computing
How to construct random functions

Journal of the ACM (JACM)
Witness indistinguishable and witness hiding protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Cryptographic primitives based on hard learning problems

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Hardness vs randomness

Journal of Computer and System Sciences
On the Composition of Zero-Knowledge Proof Systems

SIAM Journal on Computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
On the limits of nonapproximability of lattice problems

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Some optimal inapproximability results

Journal of the ACM (JACM)
The Design of Rijndael

The Design of Rijndael
Nonmalleable Cryptography

SIAM Journal on Computing
Limits on the Provable Consequences of One-way Permutations

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
How to Go Beyond the Black-Box Simulation Barrier

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On Worst-Case to Average-Case Reductions for NP Problems

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Lattice problems in NP ∩ coNP

Journal of the ACM (JACM)
On basing one-way functions on NP-hardness

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin games using hitting sets

Computational Complexity
Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness

CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Witnesses for non-satisfiability of dense random 3CNF formulas

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Statistically-hiding commitment from any one-way function

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP

CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Private coins versus public coins in zero-knowledge proof systems

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Statistical secrecy and multibit commitments

IEEE Transactions on Information Theory

Limits of provable security from standard assumptions

Proceedings of the forty-third annual ACM symposium on Theory of computing
On the power of nonuniformity in proofs of security

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Unprovable security of perfect NIZK and non-interactive non-malleable commitments

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider average-case strengthenings of the traditional assumption that coNP is not contained in AM. Under these assumptions, we rule out generic and potentially non-black-box constructions of various cryptographic primitives (e.g., one-way permutations, collision-resistant hash-functions, constant-round statistically hiding commitments, and constant-round black-box zero-knowledge proofs for NP) from one-way functions, assuming the security reductions are black-box.