{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T23:36:59Z","timestamp":1781048219368,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540180470","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47721-7_17","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T10:32:57Z","timestamp":1175769177000},"page":"234-238","source":"Crossref","is-referenced-by-count":92,"title":["All-or-Nothing Disclosure of Secrets"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Brassard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claude","family":"Crepeau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Marc","family":"Robert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"R. Berger, R. Peralta and T. Tedrick, \u201cA Provably Secure Oblivious Transfer Protocol\u201d, Proceedings of EUROCRYPT 84, 1984, pp. 379\u2013386.","DOI":"10.1007\/3-540-39757-4_26"},{"key":"17_CR2","unstructured":"G. Brassard and C. Cr\u00e9peau, \u201cZero-Knowledge Simulation of Boolean Circuits\u201d, these Advances in Cryptology: Proceedings of CRYPTO 86, A. Odlyzko, ed., Springer-Verlag, 1987."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"G. Brassard and C. Cr\u00e9peau, \u201cNon Transitive Transfert of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and beyond\u201d, Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science, 1986, pp. 188\u2013195.","DOI":"10.1109\/SFCS.1986.33"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau and J.-M. Robert, \u201cInformation Theoretic Reduction among Disclosure Problems\u201d, Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science, 1986, pp. 168\u2013173.","DOI":"10.1109\/SFCS.1986.26"},{"key":"17_CR5","unstructured":"D. Chaum, Private communication, may 1986."},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-39799-X_8","volume-title":"Advances in Cryptology: Proceedings of CRYPTO 85","author":"C. Cr\u00e9peau","year":"1986","unstructured":"C. Cr\u00e9peau, \u201cA Secure Poker Protocol That Minimizes the Effect of Player Coalitions\u201d, Advances in Cryptology: Proceedings of CRYPTO 85, H. C. Williams, ed., Lecture Notes in Computer Science 218, Springer-Verlag, 1986, pp. 73\u201386."},{"key":"17_CR7","unstructured":"C. Cr\u00e9peau, \u201cA Zero-Knowledge Poker Protocol that Achieves Confidentiality of the Players\u2019 Strategy, or How to Achieve an Electronic Poker Face\u201d, these Advances in Cryptology: Proceedings of CRYPTO 86, A. Odlyzko, ed., Springer-Verlag, 1987."},{"key":"17_CR8","volume-title":"Cryptography and Data Security","author":"D. E. R. Denning","year":"1982","unstructured":"D. E. R. Denning, Cryptography and Data Security, Addison-Wesley, Reading, Massachusetts, 1982."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Z. Galil, S. Haber and M. Yung, \u201cA private interactive test of a Boolean predicate and minimum-knowledge public-key cryptosystems\u201d, Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science, 1985, pp. 360\u2013371.","DOI":"10.1109\/SFCS.1985.1"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic Encryption\u201d, Journal of Computer and System Sciences, 28, 1984, pp. 270\u2013299.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali and C. Rackoff, \u201cThe knowledge complexity of interactive proof-systems\u201d, Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, 1985, pp. 291\u2013304.","DOI":"10.1145\/22145.22178"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 86"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47721-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:13Z","timestamp":1605647653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47721-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540180470"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-47721-7_17","relation":{},"subject":[]}}