{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:12:19Z","timestamp":1753888339144},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180470"},{"type":"electronic","value":"9783540477211"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-47721-7_14","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T06:32:57Z","timestamp":1175754777000},"page":"200-212","source":"Crossref","is-referenced-by-count":55,"title":["Demonstrating Possession of a Discrete Logarithm Without Revealing it"],"prefix":"10.1007","author":[{"given":"David","family":"Chaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan-Hendrik","family":"Evertse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeroen","family":"van de Graaf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Peralta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,1]]},"reference":[{"key":"14_CR1","unstructured":"R. Berger, S. Kannan, and R. Peralta, \u201cA Framework for the Study of Cryptographic Protocols,\u201d Proceedings of Crypto 85, (1985)."},{"key":"14_CR2","unstructured":"M. Blum, \u201cCoin Flipping by Telephone,\u201d Proc. IEEE COMPCON, pp. 133\u2013137 (1982)."},{"key":"14_CR3","unstructured":"G. Brassard, and C. Cr\u00e9peau, \u201cZero-Knowledge Simulation of Boolean Circuits,\u201d Presented at Crypto 86, (August 1986)."},{"key":"14_CR4","unstructured":"D. Chaum, \u201cDemonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How,\u201d Presented at Crypto 86, (August 1986)."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT 22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, and M. Hellman, \u201cNew Directions in Cryptography,\u201d IEEE Transactions on Information Theory\u201d IT 22, pp. 644\u2013654 (1976).","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, \u201cThe Knowledge Complexity of Interactive Proof Systems,\u201d 17th STOC (1985).","DOI":"10.1145\/22145.22178"},{"key":"14_CR7","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, \u201cHow to Prove all NP-statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design,\u201d Presented at Crypto 86, (August 1986)."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 86"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47721-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T23:33:26Z","timestamp":1556321606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47721-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540180470","9783540477211"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-47721-7_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1987]]}}}