{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T04:47:59Z","timestamp":1749271679871},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47721-7_16","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T10:32:57Z","timestamp":1175769177000},"page":"223-233","source":"Crossref","is-referenced-by-count":15,"title":["Zero-Knowledge Simulation of Boolean Circuits"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Brassard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Crepeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L., \u201cReducibility, randomness and intractability\u201d, Proceedings of the 9th Annual ACM Symposium on the Theory of Computing, 1977, pp. 151\u2013163.","DOI":"10.1145\/800105.803405"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., \u201cTrading group theory for randomness\u201d, Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, 1985, pp. 421\u2013429.","DOI":"10.1145\/22145.22192"},{"key":"16_CR3","unstructured":"Benaloh (Cohen), J. D., \u201cCryptographic capsules: a disjunctive primitive for interactive protocols\u201d, these CRYPTO 86 Proceedings, Springer-Verlag, 1987."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Brassard, G. and C. Cr\u00e9peau, \u201cNon-transitive transfer 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":"16_CR5","unstructured":"Chaum, D., \u201cDemonstrating that a public predicate can be satisfied without revealing any information about how\u201d, these CRYPTO 86 Proceedings, Springer-Verlag, 1987."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cohen (Benaloh), J. D. and M. J. Fisher, \u201cA robust and verifiable cryptographically secure election scheme\u201d, Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science, 1985, pp. 372\u2013382.","DOI":"10.1109\/SFCS.1985.2"},{"key":"16_CR7","unstructured":"Cr\u00e9peau, C., \u201cA zero-knowledge Poker protocol that achieves confidentiality of the players\u2019 strategy, or How to achieve an electronic Poker face\u201d, these CRYPTO 86 Proceedings, Springer-Verlag, 1987."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Galil, Z., 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"},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"Gill, J. \u201cComputational complexity of probabilistic Turing machines\u201d, SIAM Journal on Computing, vol. 6, no. 4, 1977, pp. 675\u2013695.","journal-title":"SIAM Journal on Computing"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., S. Micali and A. Wigderson, \u201cProofs that yield nothing but their validity and a methodology of cryptographic protocol design\u201d, Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science, 1986, pp. 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Goldwasser, S. and J. Kilian, \u201cAlmost all primes can be quickly certified\u201d, Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, 1986, pp. 316\u2013329.","DOI":"10.1145\/12130.12162"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S. and S. Micali, \u201cProbabilistic encryption\u201d, Journal of Computer and System Sciences, vol. 28, no. 2, 1984, pp. 270\u2013299.","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., 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"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Peralta, R., \u201cA simple and fast probabilistic algorithm for computing square roots modulo a prime number\u201d, IEEE Transactions on Information Theory, to appear.","DOI":"10.1109\/TIT.1986.1057236"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0204018","volume":"4","author":"V. Pratt","year":"1975","unstructured":"Pratt, V., \u201cEvery prime has a succinct certificate\u201d, SIAM Journal on Computing, vol. 4, 1975, pp. 214\u2013220.","journal-title":"SIAM Journal on Computing"},{"key":"16_CR16","first-page":"21","volume-title":"Algorithms and Their Complexity: Recent Results and New Directions","author":"M. O. Rabin","year":"1976","unstructured":"Rabin, M. O., \u201cProbabilistic algorithms\u201d, in Algorithms and Their Complexity: Recent Results and New Directions, J.F. Traub (editor), Academic Press, New York, New York, 1976, pp. 21\u201339."},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., A. Shamir and L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystem\u201d, Communications of the ACM, vol. 21, no. 2, 1978, pp. 120\u2013126.","journal-title":"Communications of the ACM"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"Solovay, R. and V. Strassen, \u201cA fast Monte Carlo test for primality\u201d, SIAM Journal on Computing, vol. 6, 1977, pp. 84\u201385.","journal-title":"SIAM Journal on Computing"}],"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_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:12Z","timestamp":1605647652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47721-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540180470"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-47721-7_16","relation":{},"subject":[]}}