Demonstrating that a public predicate can be satisfied without revealing any information about how

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 263 LNCS, Issue , 1987, Pages 195-199

  Chaum, David ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976713185     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47721-7_13     Document Type: Conference Paper

References (8)

1. Blum, M., “Coin flipping by telephone,” Proceedings of IEEE Compcon, 1982, pp. 133–137.
2. Brassard, G. and Crepeau, C., “Zero-knowledge simulation of boolean circuits,” preprint of extended abstract, April 1986.
3. Chaum, D., “Showing credentials without identification: signatures transferred between unconditionally unlinkable pseudonyms,” Presented at Eurocrypt’85, Linz Austria, April 1985a.
4. Chaum, D., “Security without identification: transaction systems to make big brother obsolete,” Comm. ACM 28, 10 (October 1985b), pp. 1030–1044.
5. Damgård, I., private communication 1986.
6. Goldreich, O., Micali, S., and Wigderson, A., “Proofs that yield nothing but the validity of the assertion and the methodology of cryptographic protocol design,” preprint, April 1986.
7. Goldwasser, S., Micali, S. and Rivest, R.L., “A ‘paradoxical’ solution to the signature problem,” FOCS 84.
8. Rabin, M.O., “Digitalized signatures,” in Foundations of Secure Computation, Academic Press, NY, 1978.