STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The (true) complexity of statistical zero knowledge
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Resettable zero-knowledge (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
SIAM Journal on Computing
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
SIAM Journal on Computing
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Concurrent Zero Knowledge with Logarithmic Round-Complexity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Soundness in the Public-Key Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Bounded-concurrent secure two-party computation without setup assumptions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Resettably-Sound Zero-Knowledge and its Applications
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A study of statistical zero-knowledge proofs
A study of statistical zero-knowledge proofs
Lower Bounds for Non-Black-Box Zero Knowledge
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Concurrent statistical zero-knowledge arguments for NP from one way functions
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
An equivalence between zero knowledge and commitments
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
The round-complexity of black-box zero-knowledge: a combinatorial characterization
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Constant-Round non-malleable commitments from sub-exponential one-way functions
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Non-interactive zaps and new techniques for NIZK
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Non-interactive zero-knowledge from homomorphic encryption
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Simultaneously resettable arguments of knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On round-optimal zero knowledge in the bare public-key model
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Simultaneously resettable arguments of knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Nearly simultaneously resettable black-box zero knowledge
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Languages with efficient zero-knowledge PCPs are in SZK
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Witness encryption and its applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
Two central notions of Zero Knowledge that provide strong, yet seemingly incomparable security guarantees against malicious verifiers are those of Statistical Zero Knowledge and Resettable Zero Knowledge. The current state of the art includes several feasibility and impossibility results regarding these two notions separately. However, the question of achieving Resettable Statistical Zero Knowledge (i.e., Resettable Zero Knowledge and Statistical Zero Knowledge simultaneously) for non-trivial languages remained open. In this paper, we show: — Resettable Statistical Zero Knowledge with unbounded prover: under the assumption that sub-exponentially hard one-way functions exist, rSƵK = SƵK. In other words, every language that admits a Statistical Zero-Knowledge (SƵK) proof system also admits a Resettable Statistical Zero-Knowledge (rSƵK) proof system. (Further, the result can be re-stated unconditionally provided there exists a sub-exponentially hard language in SƵK). Moreover, under the assumption that (standard) one-way functions exist, all languages L such that the complement of L is random self reducible, admit a rSƵK; in other words: co-RSR ⊆ rSƵK. — Resettable Statistical Zero Knowledge with efficient prover: efficient-prover Resettable Statistical Zero-Knowledge proof systems exist for all languages that admit hash proof systems (e.g., QNR, QR, ƊƊH, DCR). Furthermore, for these languages we construct a two-round resettable statistical witness-indistinguishable argument system. The round complexity of our proof systems is Õ(log κ), where κ is the security parameter, and all our simulators are black-box.