Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Blum, M., “Coin flipping by telephone,” Proceedings of IEEE Compcon, 1982, pp. 133–137.
Brassard, G. and Crepeau, C., “Zero-knowledge simulation of boolean circuits,” preprint of extended abstract, April 1986.
Chaum, D., “Showing credentials without identification: signatures transferred between unconditionally unlinkable pseudonyms,” Presented at Eurocrypt’85, Linz Austria, April 1985a.
Chaum, D., “Security without identification: transaction systems to make big brother obsolete,” Comm. ACM 28, 10 (October 1985b), pp. 1030–1044.
Damgård, I., private communication 1986.
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.
Goldwasser, S., Micali, S. and Rivest, R.L., “A ‘paradoxical’ solution to the signature problem,” FOCS 84.
Rabin, M.O., “Digitalized signatures,” in Foundations of Secure Computation, Academic Press, NY, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaum, D. (1987). Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How. In: Odlyzko, A.M. (eds) Advances in Cryptology — CRYPTO’ 86. CRYPTO 1986. Lecture Notes in Computer Science, vol 263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47721-7_13
Download citation
DOI: https://doi.org/10.1007/3-540-47721-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18047-0
Online ISBN: 978-3-540-47721-1
eBook Packages: Springer Book Archive