See this document in CiteSeerX!

Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols (1994)  (Make Corrections)  (119 citations)
Ronald Cramer
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
win.tue.nl/math/dw/pp/...crypto94.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  win.tue.nl/math/dw/pp/be...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants. Then under certain assumptions on P and S, we show how to transform P into a witness indistinguishable protocol, in which the prover demonstrates knowledge of the solution to some subset of n problem instances out of a collection of subsets de ned by S. For example, using a threshold... (Update)

Cited by:   More
Cryptographic Randomized Response Techniques - Andris Ambainis Markus   (Correct)
Traceable Ring Signature - Fujisaki, Suzuki (2006)   (Correct)
Universally Composable Security with Global Setup - Ran Canetti Yevgeniy   (Correct)

Similar documents (at the sentence level):
39.0%:   Proofs of Partial Knowledge and Simplified Design of.. - Cramer, Damgård.. (1995)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Secure Signature Schemes Based on Interactive Protocols - Cramer, Damgård (1994)   (Correct)
0.4:   Fast and Secure Immunization against Adaptive.. - Cramer, Damgård   (Correct)
0.2:   Linear Zero-Knowledge - A Note on Efficient Zero-Knowledge .. - Damgård, Cramer (1996)   (Correct)

Similar documents based on text:   More   All
0.4:   Efficient and Concurrent Zero-Knowledge from any public.. - Micciancio, Petrank (2002)   (Correct)
0.1:   Delegateable Signature Using Witness Indistinguishable and.. - Tang, Pei, Liu (2004)   (Correct)
0.1:   High-Speed RSA Implementation - Koc (1994)   (Correct)

Related documents from co-citation:   More   All
34:   How to prove yourself: Practical solutions to identification and signature probl.. - Fiat, Shamir - 1987
24:   How to Share a Secret (context) - Shamir - 1979
24:   Wallet databases with observers (context) - Chaum, Pedersen - 1993

BibTeX entry:   (Update)

Cramer, R., Damgard, I., Schoenmakers, B., "Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols," Advances in Cryptology -- CRYPTO '94, Lecture Notes in Computer Science No. 893, Springer-Verlag, 1995, pp. 174--187. http://citeseer.ist.psu.edu/cramer94proofs.html   More

@article{ cramer94proof,
    author = "Ronald Cramer and Ivan Bjerre Damg{\aa}rd and Berry Schoenmakers",
    title = "Proof of Partial Knowledge and Simplified Design of Witness Hiding Protocols",
    journal = "Lecture Notes in Computer Science",
    volume = "839",
    pages = "174--187",
    year = "1994",
    url = "citeseer.ist.psu.edu/cramer94proofs.html" }
Citations (may not include all citations):
531   The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
21   Communications of the ACM (context) - Shamir, Share et al. - 1979
17   Shamir: Zero-Knowledge Proofs of Identity (context) - Feige, Fiat - 1988
15   Quisquater: A Practical Zero-Knowledge Protocol tted to Secu.. (context) - Guillou
14   Journal of Cryptology (context) - Schnorr, Generation et al. - 1991
11   Leichter: Generalized Secret Sharing and Monotone Functions (context) - Benaloh
8   Shamir: Witness Indistinguishable and Witness Hiding Protoco.. (context) - Feige
5   van Heyst: Group Signatures (context) - Chaum
5   Hemachandra: On Generating Solved Instances of Computational.. (context) - Abadi, Allender et al.
3   Martin: The Geometry of Shared Secret Schemes (context) - Simmons, Jackson - 1991
3   Nishizeki: Secret Sharing Scheme Realizing any Access Struct.. (context) - Ito, Saito - 1987
1   ard: Interactive Hashing can Simplify Zero-Knowledge Protoco.. (context) - Damg
1   Yung: Formulae over Random Self-Reducible Languages: The Ext.. (context) - De Santis, Persiano
1   Persiano: Secret Sharing and Perfect ZeroKnowledge (context) - De Santis, Di Crescenzo



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.win.tue.nl/math/dw/pp/berry/papers.html):   More
Basic Security of the ecash Payment System - Schoenmakers (1997)   (Correct)
The ESPRIT Project CAFE - High Security Digital.. - Boly, Bosselaers.. (1994)   (Correct)
A Tight Lower Bound for Top-Down Skew Heaps - Schoenmakers (1997)   (Correct)

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