Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, and Amit Sahai. Robust non-interactive zero knowledge. In proceedings of CRYPTO '01, LNCS series, volume 2139, pages 566--598, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2002) (24 citations) (Correct)
....One way to guarantee that protocols withstand some speci c security threats in multi execution environments is to explicitly incorporate these threats into the security model and analysis. Such an approach was taken, for instance, in the cases of non malleable commitments and zero knowledge [23, 20, 46, 21, 19], and concurrent composition of zeroknowledge and oblivious transfer protocols [24, 45, 29] However, this approach is inherently limited since it needs to explicitly address each new concern, whereas in a realistic network setting, the threats may be unpredictable. Furthermore, it inevitably ....
....(such as commitment, zero knowledge, and common coin tossing) cannot be securely realized in this framework by two party protocols. Nonetheless, protocols that securely realize the commitment and zero knowledge functionalities in the common reference string (CRS) model were shown in [12, 19]. In the CRS model all parties are given a common, public reference string that was ideally chosen from a given distribution. This notion was originally proposed in the context of non interactive zero knowledge proofs [6] and since then proved useful in other cases as well. Our results. We show ....
[Article contains additional citation context not shown here]
A. DeSantis, G. DiCrescenzo, R. Ostrovsky, G. Persiano, A. Sahai. Robust Non-interactive Zero-Knowledge. CRYPTO 2001.
Strengthening Zero-Knowledge Protocols using Signatures - Garay, MacKenzie, Yang (2003) (7 citations) (Correct)
....construction of constant round, one time non malleable ZK protocols in the plain model. His construction uses a non blackbox proof of security and is not very efficient. Sahai [51] provides a definition for one time non malleability in the case of non interactive ZK (NIZK) proofs. De Santis et al. [19] generalize this to unbounded non malleability of NIZK proofs, where even any polynomial number of simulator constructed proofs does not help an adversary to construct any new proof. As they do, for the remainder of this paper we will simply refer to this property as non malleability, leaving off ....
....adversary. Further, they introduce the notion of a robust NIZK argument, which in addition to being non malleable, requires the so called simulator of the zero knowledge property to use a common reference string with the same distribution (uniform) as the one used by the real prover. Following [19], we call this the same string ZK property. Finally, they give two constructions of non malleable (and robust) ZK proofs for any NP language. In fact, these proofs are non interactive, and thus achieve concurrent (constant round) ZK. The notion of simulation soundness for NIZK proofs was ....
[Article contains additional citation context not shown here]
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust non-interactive zero knowledge. In Advances in Cryptology -- CRYPTO 2001.
Zero-Knowledge twenty years after its invention - Goldreich (2002) (4 citations) (Correct)
....(even in the adaptive and non malleable sense) for any NP set. Suggestions for further reading: For a definitional treatment of the basic, unbounded and adaptive definitions see [49, Sec. 4.10] Increasingly stronger variants of the non malleable definition are presented in [50, Sec. 5.4.4. 4] and [31]. A relatively simple construction for the basic model is presented in [38] see also [49, Sec. 4.10.2] A more efficient construction can be found in [71] A transformation of systems for the basic model into systems for the unbounded model is also presented in [38] and [49, Sec. 4.10.3] ....
....can be found in [71] A transformation of systems for the basic model into systems for the unbounded model is also presented in [38] and [49, Sec. 4.10.3] Constructions for increasingly stronger variants of the (adaptive) non malleable definition are presented in [50, Sec. 5.4.4. 4] and [31]. 9 Statistical Zero Knowledge Recall that statistical zero knowledge protocols are such in which the distribution ensembles referred to in Definition 4 are required to be statistically indistinguishable (rather than computationally indistinguishable) Under standard intractability assumptions, ....
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Non-interactive ZeroKnowledge. In Crypto01, Springer Lecture Notes in Computer Science (Vol. 2139), pages 566--598.
Computational Soundness of Formal Adversaries - Herzog (2002) (7 citations) (Correct)
....transformation preserves the zero knowledge aspect of a noninteractive proof system: since the additional bits are random and untouched by the prover, adding them to the proof reveals nothing about the underlying witness. The last condition we need is that the proof be NIZK proofs of knowledge [16]. That is, a proof system where if an adversary can in fact create a proof for a new theorem x 2 L (for L 2 NP ) then it is possible to derive from that adversary a witness for x. The derivation is done by a pair of algorithms, collectively known as the extractor, which use the adversary as a ....
Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, and Amit Sahai. Robust non-interactive zero knowledge. In Advances in Cryptology{CRYPTO 2001.
Perfect Non-Interactive Zero Knowledge for NP - Jens Groth Rafail Self-citation (Ostrovsky Sahai) (Correct)
No context found.
Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, and Amit Sahai. Robust non-interactive zero knowledge. In proceedings of CRYPTO '01, LNCS series, volume 2139, pages 566--598, 2002.
Concurrently Non-Malleable Zero Knowledge in the.. - Deng, Di Crescenzo, Lin (2006) Self-citation (Di crescenzo) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Non-Interactive Zero Knowledge. In Advance in Cryptology-CRYPTO'01, Springer LNCS 2139, pp.566-598, 2001. 19
Identity-Based Zero-Knowledge - Jonathan Katz Rafail Self-citation (Ostrovsky) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust Non-Interactive Zero Knowledge. Crypto 2001.
Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2003) (24 citations) Self-citation (Ostrovsky Sahai) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Noninteractive Zero-Knowledge. In CRYPTO'01, Springer-Verlag (LNCS 2139), pages 566-- 598, 2001. 82
Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2002) (24 citations) Self-citation (Ostrovsky Sahai) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, A. Sahai. Robust Noninteractive Zero-Knowledge. In CRYPTO'01, Springer-Verlag (LNCS 2139), pages 566{ 598, 2001.
Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2002) (24 citations) Self-citation (Ostrovsky Sahai) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, A. Sahai. Robust Noninteractive Zero-Knowledge. In CRYPTO'01, Springer-Verlag (LNCS 2139), pages 566-- 598, 2001.
A Stronger Definition for - Anonymous Electronic Cash (2006) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust non-interactive zero knowledge. In Advances in Cryptology -- CRYPTO 2001, 2001.
Universally Composable Password-Based Key Exchange - Canetti, Halevi, Katz.. (2005) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust NonInteractive Zero-Knowledge. Advances in Cryptology -- Crypto 2001.
Automatic Generation of Two-Party Computations (Extended.. - MacKenzie, Oprea, Reiter (2003) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust non-interactive zero knowledge. In Proc. CRYPTO 2001.
Adaptively-Secure, Non-Interactive Public-Key Encryption - Canetti, Halevi, Katz (2004) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust NonInteractive Zero Knowledge. Adv. in Cryptology --- Crypto
Hierarchical Group Signatures - Trolin, Wikström (2004) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust non-interactive zero knowledge. In Advances in Cryptology -- CRYPTO 2001.
Foundations of Cryptography - Goldreich (2004) (50 citations) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, A. Sahai. Robust Non-interactive Zero-Knowledge. In Crypto01, Springer Lecture Notes in Computer Science (Vol. 2139), pages 566-598.
Two-Party Generation of DSA Signatures - MacKenzie, Reiter (2004) (10 citations) (Correct)
No context found.
De Santis A, Di Crescenzo G, Ostrovsky R, Persiano G, Sahai A (2001) Robust non-interactive zero knowledge. In: Proc. CRYPTO 2001. LNCS, vol 2139. Springer, Berlin Heidelberg New York, pp 566--598
Concurrent/Resettable Zero-Knowledge with Concurrent Soundness in.. - Zhao (2003) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Non-Interactive Zero-Knowledge. In J. Kilian (Ed.): Advances in Cryptology-Proceedings of CRYPTO 2001.
On Simulation-Sound Trapdoor Commitments - MacKenzie, Yang (2003) (5 citations) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust non-interactive zero knowledge. In Advances in Cryptology -- CRYPTO 2001.
Alternatives to Non-Malleability: Definitions.. - MacKenzie, Reiter, Yang (2004) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust non-interactive zero knowledge. In Advances in Cryptology -- CRYPTO 2001.
Alternatives to Non-malleability: Definitions.. - MacKenzie, Reiter, Yang (2004) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust non-interactive zero knowledge. In Advances in Cryptology -- CRYPTO 2001 (LNCS 2139), 566--598, 2001.
Efficient and Non-Malleable Proofs of Plaintext Knowledge and.. - Katz (2002) (2 citations) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust Non-Interactive Zero Knowledge. Advances in Cryptology --- Crypto 2001, LNCS vol. 2139, J. Kilian, ed., Springer-Verlag, 2001, pp. 566--598.
Multi-trapdoor Commitments and their Applications to Proofs of.. - Gennaro (2004) (3 citations) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Non-Interactive Zero Knowledge. Proc. of CRYPTO'01), (LNCS 2139), pp.566-598, Springer 2001.
Constant-Round Coin-Tossing With a Man in the Middle or Realizing.. - Barak (2002) (17 citations) (Correct)
No context found.
Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, and Amit Sahai. Robust non-interactive zero knowledge. In CRYPTO ' 2001, pages 566{ 598, 2001.
On Chosen Ciphertext Security of Multiple Encryptions - Goldreich, Lustig, Naor (2002) (4 citations) (Correct)
No context found.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Non-interactive Zero-Knowledge. In Crypto01, Springer Lecture Notes in Computer Science (Vol. 2139), pages 566--598.
First 50 documents
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