Cynthia Dwork and Moni Naor. Zaps and their applications. In proceedings of FOCS '00, pages 283--293, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
New Notions of Soundness and Simultaneous Resettability in the.. - Zhao (2001) (Correct)
....the same x but possibly different sequence of prover s NP witnesses: aux( y( yO)s(n) and aux(2) y(2)b. y(2)s(n) are computational indistinguishable. In [CGGM00] Canetti et al. first gave a 4 round rWI for NP. The round complexity is drastically reduced by Dwork and Naor. In [DN00] they presened a 2 round rWI for NP based on NIZK for NP. Furthermore, more interestingly, their protocol also satisfies resettable soundness. 4 As noted by Goldreich, if the s(n) common inputs are not distinct then all known rZK protocols are not even rWI. CGGM00] Dwork and Naor s 2 round ....
C.Dwork and M. Naor. Zaps and Their Applications. In FOCS 2000.
Resettably-Sound Zero-Knowledge and its Applications - Barak, Goldreich.. (2001) (6 citations) (Correct)
....outside of BPP have resettably sound arguments that are resettable zeroknowledge. Some hope for an affirmative resolution of the above question is provided by the fact that some level of resettablesecurity for both parties does seem to be achievable. 3 That is: Theorem 1. 5 (implicit in [11]) Assuming the existence of trapdoor permutations, any NP language has a resettablysound proof that is resettable witness indistinguishable. Theorem 1.5 follows from the following facts regarding ZAPs (as defined by Dwork and Naor [11] Loosely speaking, ZAPs are two round public coin ....
....seem to be achievable. 3 That is: Theorem 1.5 (implicit in [11] Assuming the existence of trapdoor permutations, any NP language has a resettablysound proof that is resettable witness indistinguishable. Theorem 1. 5 follows from the following facts regarding ZAPs (as defined by Dwork and Naor [11]) Loosely speaking, ZAPs are two round public coin witnessindistinguishable proofs. Thus, by definition, ZAPs are resettably sound (because even in a single session the prover obtains all the verifier s coins before sending its own message) On the other hand, as noted in [11] any ZAP can be ....
[Article contains additional citation context not shown here]
C. Dwork and M. Naor. Zaps and their applications. In 41st FOCS, pages 283--293, 2000.
Responsive Round Complexity and Concurrent Zero-Knowledge - Cohen, Kilian, Petrank (2001) (Correct)
....been sped up may have to nish long before the end of the protocol as a whole. Here, the protocol is the collective set of interactive proofs) Several recent works have overcome the diculty of the asynchronous setting by putting limits on the asynchronisity of the system (timing assumptions) [10,11,6,9] or by making some set up assumptions on the environment (such as a public key infrastructure) 7,4] 1.6 Terminology Some words on the terminology we are using. By zero knowledge we mean computational zero knowledge, i.e. the distribution output by the simulation is polynomial time ....
Dwork, C., Naor, M.: Zaps and their applications. In IEEE, ed.: Proceedings of the 41st Annual Symposium on Foundations of Computer Science: proceedings: 12-14 November,
Resettably-Sound Zero-Knowledge and its Applications - Barak, Goldreich.. (2001) (6 citations) (Correct)
....outside of BPP have resettably sound arguments that are resettable zero knowledge. Some hope for an armative resolution of the above question is provided by the fact that some level of resettable security for both parties does seem to be achievable. 4 That is: Theorem 1. 5 (implicit in [11]) Assuming the existence of trapdoor permutations, any NP language has a resettably sound proof that is resettable witness indistinguishable. Theorem 1.5 follows from the following facts regarding ZAPs (as de ned by Dwork and Naor [11] Loosely speaking, ZAPs are two round public coin ....
....to be achievable. 4 That is: Theorem 1.5 (implicit in [11] Assuming the existence of trapdoor permutations, any NP language has a resettably sound proof that is resettable witness indistinguishable. Theorem 1. 5 follows from the following facts regarding ZAPs (as de ned by Dwork and Naor [11]) Loosely speaking, ZAPs are two round public coin witness indistinguishable proofs. Thus, by definition, ZAPs are resettably sound (because even in a single session the prover obtains all the veri er s coins before sending its own message) On the other hand, as noted in [11] any ZAP can be ....
[Article contains additional citation context not shown here]
C. Dwork and M. Naor. Zaps and their applications. In 41st FOCS, pages 283-293, 2000.
Resettably-Sound Zero-Knowledge and its Applications - Barak, Goldreich.. (2001) (6 citations) (Correct)
....outside of BPP have resettably sound arguments that are resettable zero knowledge. Some hope for an affirmative resolution of the above question is provided by the fact that some level of resettable security for both parties does seem to be achievable. 4 That is: Theorem 1. 5 (implicit in [11]) Assuming the existence of trapdoor permutations, any NP language has a resettably sound proof that is resettable witness indistinguishable. Theorem 1.5 follows from the following facts regarding ZAPs (as defined by Dwork and Naor [11] Loosely speaking, ZAPs are two round public coin ....
....to be achievable. 4 That is: Theorem 1.5 (implicit in [11] Assuming the existence of trapdoor permutations, any NP language has a resettably sound proof that is resettable witness indistinguishable. Theorem 1. 5 follows from the following facts regarding ZAPs (as defined by Dwork and Naor [11]) Loosely speaking, ZAPs are two round public coin witness indistinguishable proofs. Thus, by definition, ZAPs are resettably sound (because even in a single session the prover obtains all the verifier s coins before sending its own message) On the other hand, as noted in [11] any ZAP can be ....
[Article contains additional citation context not shown here]
C. Dwork and M. Naor. Zaps and their applications. In 41st FOCS, pages 283--293, 2000.
Non-interactive Zaps and New Techniques for NIZK - Jens Groth Rafail (Correct)
No context found.
Cynthia Dwork and Moni Naor. Zaps and their applications. In proceedings of FOCS '00, pages 283--293, 2000.
Derandomization in Cryptography - Barak, Ong, Vadhan (2005) (Correct)
No context found.
Cynthia Dwork and Moni Naor. Zaps and their applications. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 283--293. ACM, 2000. 19
Reducing Server Trust In Private Proxy Auctions - Di Crescenzo, Herranz, Sáez (2004) (Correct)
No context found.
C. Dwork and M. Naor. Zaps and Their Applications. Proc. of FOCS'00, pp. 283{ 293 (2000).
Lower Bounds for Non-Black-Box Zero Knowledge - Barak, Lindell, Vadhan (2004) (1 citation) (Correct)
No context found.
C. Dwork and M. Naor. Zaps and Their Applications. In Proc. 41st FOCS, pages 283--293. IEEE, 2000.
Concurrent/Resettable Zero-Knowledge with Concurrent Soundness in.. - Zhao (2003) (Correct)
No context found.
C. Dwork and M. Naor. Zaps and Their Applications. In IEEE Symposium on Foundations of Computer Science, pages 283-293, 2000. Available on-line from:
Efficient and Non-Malleable Proofs of Plaintext Knowledge and.. - Katz (2002) (2 citations) (Correct)
No context found.
C. Dwork and M. Naor. Zaps and Their Applications. Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE, 2000, pp. 283-- 293.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC