O. Goldreich. Concurrent Zero-Knowledge With Timing Revisited. In 34th STOC, pages 332--340, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Concurrent Zero Knowledge with Logarithmic Round-Complexity - Manoj Prabhakaran Alon (2002) (9 citations) (Correct)
.... allows the concurrent execution of zeroknowledge protocols [8, 6] In the concurrent setting, many protocols (sessions) are executed at the same time, involving many verifiers which may be talking with the same (or many) provers simultaneously (the so called parallel composition considered in [12, 9, 10] is a special case) This setting presents the new risk of a coordinated attack in which an adversary controls many verifiers, interleaving the executions of the protocols and choosing verifiers messages # Email: mp cs.princeton.edu. Email: alon wisdom.weizmann.ac.il. # Email: ....
O. Goldreich. Concurrent Zero-Knowledge with Timing -- Revisited. To appear, in 34th STOC, 2002.
Signature Schemes and Applications to Cryptographic Protocol.. - Lysyanskaya (2002) (6 citations) (Correct)
.... protocols [GK96, DNS98, RK99, CKPR01] For example, Goldreich and Krawczyk [GK96] show that there exist protocols that are zero knowledge when executed stand alone, and yet do not compose in parallel (even twice) However, protocols that compose do exist (see, for example, Goldreich [Gol02] and references therein) In contrast, we show that it is impossible to obtain any protocol that will compose twice in parallel. 106 7.2.1 Computational Model We consider a setting involving n parties, P 1 ; P n , that interact in a synchronous point to point network. In such a ....
Oded Goldreich. Concurrent zero-knowledge with timing revisited. In Proc. 34th Annual ACM Symposium on Theory of Computing (STOC), pages 332-340, 2002.
On the Composition of Authenticated Byzantine Agreement - Lindell, Lysyanskaya (2002) (11 citations) (Correct)
.... and concurrent zero knowledge protocols [10, 6, 17, 4] For example, Goldreich and Krawczyk [10] show that there exist protocols that are zero knowledge when executed stand alone, and yet do not compose in parallel (even twice) However, protocols that compose do exist (see, for example, Goldreich [9] and references therein) In contrast, we show that it is impossible to obtain any protocol that will compose twice in parallel. 2. DEFINITIONS 2.1 Computational Model We consider a setting involving n parties, P1 ; Pn , that interact in a synchronous point to point network. In such a ....
O. Goldreich. Concurrent Zero-Knowledge With Timing Revisited. In 34th STOC. 2002.
The Round-Complexity of Black-Box Concurrent Zero-Knowledge - Rosen (2003) Self-citation (Goldreich) (Correct)
No context found.
O. Goldreich. Concurrent Zero-Knowledge with Timing -- Revisited. In 34th STOC, pages 332-340, 2002.
On the Composition of Authenticated Byzantine Agreement - Lindell, Lysyanskaya, Rabin (2004) (11 citations) (Correct)
No context found.
O. Goldreich. Concurrent Zero-Knowledge With Timing Revisited. In 34th STOC, pages 332--340, 2002.
Concurrent Zero Knowledge with Logarithmic Round-Complexity - Prabhakaran, Rosen, Sahai (2002) (9 citations) (Correct)
No context found.
O. Goldreich. Concurrent Zero-Knowledge with Timing -- Revisited. To appear, in 34th STOC, 2002.
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