Supported in part by NSERC grant A4107.
Supported in part by an NSERC postgraduate scholarship;
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
R. Berger, R. Peralta and T. Tedrick, “A Provably Secure Oblivious Transfer Protocol”, Proceedings of EUROCRYPT 84, 1984, pp. 379–386.
G. Brassard and C. Crépeau, “Zero-Knowledge Simulation of Boolean Circuits”, these Advances in Cryptology: Proceedings of CRYPTO 86, A. Odlyzko, ed., Springer-Verlag, 1987.
G. Brassard and C. Crépeau, “Non Transitive Transfert of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and beyond”, Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science, 1986, pp. 188–195.
G. Brassard, C. Crépeau and J.-M. Robert, “Information Theoretic Reduction among Disclosure Problems”, Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science, 1986, pp. 168–173.
D. Chaum, Private communication, may 1986.
C. Crépeau, “A Secure Poker Protocol That Minimizes the Effect of Player Coalitions”, Advances in Cryptology: Proceedings of CRYPTO 85, H. C. Williams, ed., Lecture Notes in Computer Science 218, Springer-Verlag, 1986, pp. 73–86.
C. Crépeau, “A Zero-Knowledge Poker Protocol that Achieves Confidentiality of the Players’ Strategy, or How to Achieve an Electronic Poker Face”, these Advances in Cryptology: Proceedings of CRYPTO 86, A. Odlyzko, ed., Springer-Verlag, 1987.
D. E. R. Denning, Cryptography and Data Security, Addison-Wesley, Reading, Massachusetts, 1982.
Z. Galil, S. Haber and M. Yung, “A private interactive test of a Boolean predicate and minimum-knowledge public-key cryptosystems”, Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science, 1985, pp. 360–371.
S. Goldwasser and S. Micali, “Probabilistic Encryption”, Journal of Computer and System Sciences, 28, 1984, pp. 270–299.
S. Goldwasser, S. Micali and C. Rackoff, “The knowledge complexity of interactive proof-systems”, Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, 1985, pp. 291–304.
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
Brassard, G., Crepeau, C., Robert, JM. (1987). All-or-Nothing Disclosure of Secrets. 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_17
Download citation
DOI: https://doi.org/10.1007/3-540-47721-7_17
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