J. Kilian. A Note on E#cient Zero-Knowledge Proofs and Arguments. Proc. of 24th STOC, pp. 723--732, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Deniable Ring Authentication - Naor (2002) (8 citations) (Correct)
....by sending o( S ) bits, assuming the identity of the members of S is known, or a the very least without sending encryptions (or signatures) Note that [38] manage to achieve that using random oracles. Also Boaz Barak (personal communication) has pointed out that using Kilian s arguments [33] it is possible in principle to obtain ine#cient but succinct protocols, so the remaining question is whether it is possible to do so while maintaining the e#ciency of the protocol. What is the weakest form of security required from an encryption scheme that is su#cient to be used in our ring ....
J. Kilian, A Note on E#cient Zero-Knowledge Proofs and Arguments, Proc. 24th ACM Symposium on the Theory of Computing, 1992, pp. 723--732.
Universal Arguments and their Applications - Barak, Goldreich (2001) (7 citations) (Correct)
....of the common input) The latter holds also for CS proofs, but we will be able to construct a universal argument based on weaker assumption than the ones seem necessary for constructing CS proofs (cf. Footnote 5) 1. 3 The construction of universal arguments By adapting the construction of Kilian [21], one can easily show that the existence of strong collisionfree hashing functions implies the existence of universal arguments (and even CS proofs for L U ; cf. Micali [23] By strong collision free hashing we mean families of functions for which collisions are hard to find even by using ....
....existence of (standard) collision free hashing functions implies the existence of universal arguments. Furthermore, these proof systems are of the public coin (Arthur Merlin [3] type and use a constant number of rounds. Our construction of universal arguments (also) adapts Kilian s construction [21] in a straightforward manner. Our contribution is in the analysis of this construction. Unlike in previous analysis (as in [21] and [23] in establishing computational soundness via contradiction, we cannot a#ord to derive a collision forming circuit of size that is (at least) polynomial in the ....
[Article contains additional citation context not shown here]
J. Kilian. A Note on E#cient Zero-Knowledge Proofs and Arguments. In 24th STOC, pages 723--732, 1992.
Sufficient Conditions for Collision-Resistant Hashing - Ishai, Kushilevitz, Ostrovsky (1 citation) (Correct)
No context found.
J. Kilian. A Note on E#cient Zero-Knowledge Proofs and Arguments. Proc. of 24th STOC, pp. 723--732, 1992.
Lower Bounds for Non-Black-Box Zero Knowledge - Barak, Lindell, Vadhan (2004) (1 citation) (Correct)
No context found.
J. Kilian. A note on e#cient zero-knowledge proofs and arguments (extended abstract). In Proc. 24th STOC, pages 723--732. ACM, 1992.
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