Filters








19,044 Hits in 10.3 sec

General Properties of Quantum Zero-Knowledge Proofs [article]

Hirotada Kobayashi
2007 arXiv   pre-print
For the classes QPZK, HVQPZK, and QSZK of problems having a quantum perfect zero-knowledge proof system, an honest-verifier quantum perfect zero-knowledge proof system, and a quantum statistical zero-knowledge  ...  a quantum statistical zero-knowledge proof system of perfect completeness, and (h) any problem in QSZK has a three-message public-coin quantum statistical zero-knowledge proof system of perfect completeness  ...  Acknowledgement The author would like to thank John Watrous for his helpful comments on the choice of the universal gate set.  ... 
arXiv:0705.1129v1 fatcat:vec3mvnzhzb3nbnsifafxohvzu

Quantum statistical zero-knowledge [article]

John Watrous
2002 arXiv   pre-print
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK.  ...  regarding the effect of this zero-knowledge restriction on quantum interactive proof systems.  ...  honest verifier) quantum zero-knowledge.  ... 
arXiv:quant-ph/0202111v1 fatcat:x6mjmulmirenlld4iqdgm2cmnq

Non-Interactive Quantum Statistical and Perfect Zero-Knowledge [article]

Hirotada Kobayashi
2002 arXiv   pre-print
This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems.  ...  Our results may be the first non-trivial quantum zero-knowledge proofs secure even against dishonest quantum verifiers, since our protocols are non-interactive, and thus the zero-knowledge property does  ...  This paper focuses on quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems.  ... 
arXiv:quant-ph/0207158v1 fatcat:u7n64g4pbvgkrgzn3hp4qpvzia

Resettable Statistical Zero Knowledge [chapter]

Sanjam Garg, Rafail Ostrovsky, Ivan Visconti, Akshay Wadia
2012 Lecture Notes in Computer Science  
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  ...  In other words, every language that admits a Statistical Zero-Knowledge (SZK) proof system also admits a Resettable Statistical Zero-Knowledge (rSZK) proof system.  ...  Resettable Partially Honest-Verifier Statistical Zero Knowledge We aim at constructing a resettable statistical zero-knowledge proof system.  ... 
doi:10.1007/978-3-642-28914-9_28 fatcat:6ev3fb7lcjdsvkkcixtwqkjjla

Complete Problem for Perfect Zero-Knowledge Quantum Proof [chapter]

Jun Yan
2012 Lecture Notes in Computer Science  
Using complete problems, many interesting facts about statistical zero-knowledge (interactive and non-interactive) proof are proved unconditionally (in contrast to those proved based on complexity assumption  ...  Thus far, almost all complete problems for statistical zero-knowledge (classical) proof find their quantum counterparts. Motivation and related work  ...  On input Fig. 1 . 1 A 4-message perfect zero-knowledge quantum interactive proof system.  ... 
doi:10.1007/978-3-642-27660-6_34 fatcat:y67fxbrhivaaxcohx327kq3l4i

Page 4420 of Mathematical Reviews Vol. , Issue 95g [page]

1995 Mathematical Reviews  
In this model it suffices for the verifier to have space Syin in or- der to verify proof, and the proof should remain statistically zero knowledge with respect to verifiers that use space at most Sjax.  ...  Aumann, Yonatan (IL-WEIZ-CS; Rehovot); Feige, Uriel (IL-WEIZ-CS; Rehovot) One message proof systems with known space verifiers.  ... 

On the Composition of Public-Coin Zero-Knowledge Protocols

Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström
2011 SIAM journal on computing (Print)  
We complement this result by constructing a public-coin black-box zero-knowledge proof based on one-way functions that remains secure under any a-priori bounded number of concurrent executions.  ...  On the positive side we show that every language in NP has a public-coin black-box ZK proof that remains secure under an a-priori bounded number of concurrent (and thus parallel) executions.  ...  We would like to thank Johan Håstad and the reviewers for invaluable comments, and for highlighting our work's connection with resettable soundness.  ... 
doi:10.1137/100811465 fatcat:3jaa7tv7izaphghte75n7m5dnu

Precise bounded-concurrent zero-knowledge proofs for NP

Ning Ding, DaWu Gu
2010 Science China Information Sciences  
In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny).  ...  Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed.  ...  Thus, precise zero-knowledge bounds the knowledge of the verifier in terms of its actual computation. Ref.  ... 
doi:10.1007/s11432-010-4056-z fatcat:xzv5zpblc5bldhdwvf6dgxvz2y

Zero-Knowledge against Quantum Attacks

John Watrous
2009 SIAM journal on computing (Print)  
that honest verifier and general quantum statistical zero-knowledge are equal: QSZK = QSZK HV .  ...  Also included is a quantum interactive proof system for a complete problem for the complexity class of problems having honest verifier quantum statistical zero-knowledge proofs, which therefore establishes  ...  Acknowledgements I thank Claude Crépeau for sharing his thoughts and insight on zero-knowledge, and for getting me interested in the problem discussed in this paper.  ... 
doi:10.1137/060670997 fatcat:xptugugxbrg6tms3bym2zt2jsm

Zero-knowledge against quantum attacks

John Watrous
2006 Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06  
that honest verifier and general quantum statistical zero-knowledge are equal: QSZK = QSZK HV .  ...  Also included is a quantum interactive proof system for a complete problem for the complexity class of problems having honest verifier quantum statistical zero-knowledge proofs, which therefore establishes  ...  Acknowledgements I thank Claude Crépeau for sharing his thoughts and insight on zero-knowledge, and for getting me interested in the problem discussed in this paper.  ... 
doi:10.1145/1132516.1132560 dblp:conf/stoc/Watrous06 fatcat:t7zoaapdjbhqfjodg4dsyj56va

Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs [chapter]

Ivan Damgård, Oded Goldreich, Tatsuaki Okamoto, Avi Wigderson
1995 Lecture Notes in Computer Science  
verifier, has a proof system which is statistical zero-knowledge (with respect to any verifier).  ...  It assumes the existence of secure commitment schemes and transforms any public-coin proof which is statistical zero-knowledge with respect to the honest into one which is statistical zero-knowledge (in  ...  Corollary 1 If language L has a statistical zero-knowledge public-coin proof and L i s not an AVBPP, then L has a statistical zero-knowledge public-coin proof against "any verifier".  ... 
doi:10.1007/3-540-44750-4_26 fatcat:im4kbasevffihmd27w7geb42jm

On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations [chapter]

S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich
2010 Lecture Notes in Computer Science  
We consider the following problem: can we construct constantround zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations?  ...  We also give strong evidence that we are unlikely to find fully black-box constructions of constant-round zero knowledge proofs for NP, even without this restriction on adaptivity.  ...  In more detail, the AM verifier will pick the permutation π at random from a space of poly(T m ) permutations, where T is an upper bound on the running time of the reduction in the zero-knowledge protocol  ... 
doi:10.1007/978-3-642-14712-8_12 fatcat:pxbk5jgmjff6rdeqrmfsdr7yii

On the Composition of Public-Coin Zero-Knowledge Protocols [chapter]

Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström
2009 Lecture Notes in Computer Science  
We complement this result by showing the existence of a public-coin black-box zero-knowledge proof that remains secure under any a-priori bounded number of concurrent executions.  ...  This result holds both in the plain model (without any set-up) and in the Bare Public-Key Model (where the prover and the verifier have registered public keys).  ...  We would like to thank Johan Håstad and the reviewers for invaluable comments, and for pointing out our work's connection with resettable soundness.  ... 
doi:10.1007/978-3-642-03356-8_10 fatcat:73ckcu35yrdwxiazteslejin6a

Lightweight Zero-Knowledge Proofs for Crypto-Computing Protocols [chapter]

Sven Laur, Bingsheng Zhang
2014 Lecture Notes in Computer Science  
In this work, we propose a new class of zero-knowledge proofs, which are tailored for cryptocomputing protocols.  ...  Second, we show how to achieve universal composability in the trusted set-up model where all zero-knowledge proofs share the same system-wide parameters.  ...  On the flip side, CDS transformation ensures only input-privacy. In this work, we extend this approach to full-fledged zero-knowledge proofs by adding a few short messages.  ... 
doi:10.1007/978-3-319-13257-0_9 fatcat:eu3a4xlaibggvjbeltzsuk6gaa

Succinct Interactive Oracle Proofs: Applications and Limitations [article]

Shafik Nassar, Ron D. Rothblum
2022 IACR Cryptology ePrint Archive  
In this work we show both new applications, and limitations, for succinct IOPs: • First, using one-way functions, we show how to compile IOPs into zero-knowledge proofs, while nearly preserving the proof  ...  Applying the compiler to the state-of-the-art succinct IOPs yields zero-knowledge proofs for bounded-space NP relations, with communication that is nearly equal to the original witness length.  ...  Acknowledgements We thank Yuval Filmus and Yuval Ishai for helpful discussions.  ... 
dblp:journals/iacr/NassarR22 fatcat:j4gn5u63grgzvmui5jpldnpzse
« Previous Showing results 1 — 15 out of 19,044 results