{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T09:59:20Z","timestamp":1790762360907,"version":"4.1.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1007\/bf00204448","type":"journal-article","created":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T12:20:01Z","timestamp":1094041201000},"page":"63-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["A discrete logarithm implementation of perfect zero-knowledge blobs"],"prefix":"10.1007","volume":"2","author":[{"given":"Joan F.","family":"Boyar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stuart A.","family":"Kurtz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark W.","family":"Krentel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF00204448_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman and M. Huang. Recognizing primes in random polynomial time. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, pages 462\u2013469, 1987.","DOI":"10.1145\/28395.28445"},{"key":"BF00204448_CR2","doi-asserted-by":"crossref","unstructured":"L. Babai. Trading group theory for randomness. In Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, pages 421\u2013429, 1985.","DOI":"10.1145\/22145.22192"},{"key":"BF00204448_CR3","unstructured":"E. Bach. Discrete logarithms and factoring. Technical Report 84\/186, Computer Science Division, University of California, June 1984."},{"issue":"2","key":"BF00204448_CR4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1137\/0217012","volume":"17","author":"E. Bach","year":"April 1988","unstructured":"E.Bach. How to generate factored random numbers. SIAM Journal on Computing, 17(2): 179\u2013193, April 1988.","journal-title":"SIAM Journal on Computing"},{"key":"BF00204448_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"BF00204448_CR6","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M.Blum and S.Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing, 13:850\u2013864, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"BF00204448_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"R.Boppana, J.H\u00e5stad, and S.Zachos. Does CoNP have short interactive proofs? Information Processing Letters, 25:127\u2013132, 1987.","journal-title":"Information Processing Letters"},{"key":"BF00204448_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/58562.59305","volume":"36","author":"J. Boyar","year":"1989","unstructured":"J.Boyar. Inferring sequences produced by pseudo-random number generators. Journal of the ACM, 36:129\u2013141, 1989.","journal-title":"Journal of the ACM"},{"key":"BF00204448_CR9","unstructured":"G. Brassard and D. Chaum. Personal communication, 1987."},{"key":"BF00204448_CR10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G.Brassard, D.Chaum, and C.Cr\u00e9peau. Minimum disclosure proofs of knowledge. Journal of Computer System Science, 37:156\u2013189, 1988.","journal-title":"Journal of Computer System Science"},{"key":"BF00204448_CR11","doi-asserted-by":"crossref","unstructured":"G. Brassard and C. Cr\u00e9peau. Nontransitive transfer of confidence: a perfect zero-knowledge interactive protocol for Sat and beyond. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, pages 188\u2013195, 1986.","DOI":"10.1109\/SFCS.1986.33"},{"key":"BF00204448_CR12","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1109\/5.4443","volume":"76","author":"E. Brickell","year":"1988","unstructured":"E.Brickell and A.Odlyzko. Cryptanalysis: A survey of recent results. Proceedings of the IEEE, 76:578\u2013593, 1988.","journal-title":"Proceedings of the IEEE"},{"key":"BF00204448_CR13","doi-asserted-by":"crossref","unstructured":"D. Chaum. Demonstrating that a public predicate can be satisfied without revealing any information about how. In Crypto 86, pages 195\u2013199, 1986.","DOI":"10.1007\/3-540-47721-7_13"},{"key":"BF00204448_CR14","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. Multiparty unconditionally secure protocols. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"BF00204448_CR15","doi-asserted-by":"crossref","unstructured":"D. Chaum, I. Damg\u00e5rd, and J. van de Graaf. Multiparty computations ensuring privacy of each party's input and correctness of the result. In Crypto 87, pages 87\u2013119, 1987.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"BF00204448_CR16","doi-asserted-by":"crossref","unstructured":"D. Chaum, J.-H. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of a discrete logarithm and some generalizations. In Euro Crypt 87, pages 127\u2013141, 1987.","DOI":"10.1007\/3-540-39118-5_13"},{"key":"BF00204448_CR17","doi-asserted-by":"crossref","unstructured":"L. Fortnow. The complexity of perfect zero-knowledge. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, pages 204\u2013209, 1987.","DOI":"10.1145\/28395.28418"},{"key":"BF00204448_CR18","volume-title":"Computers and Intractability, A Guide to the Theory ofNP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R.Garey and D. S.Johnson. Computers and Intractability, A Guide to the Theory ofNP-Completeness. Freeman, San Francisco, 1979."},{"key":"BF00204448_CR19","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, pages 174\u2013187, 1986.","DOI":"10.1109\/SFCS.1986.47"},{"key":"BF00204448_CR20","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. In Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, pages 291\u2013304, 1985.","DOI":"10.1145\/22145.22178"},{"key":"BF00204448_CR21","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S.Goldwasser, S.Micali, and C.Rackoff. The knowledge complexity of interactive proof-systems. SIAM Journal on Computing, 18:186\u2013208, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"BF00204448_CR22","volume-title":"An Introduction to the Theory of Numbers","author":"G. E. Hardy","year":"1979","unstructured":"G. E.Hardy and E. M.Wright. An Introduction to the Theory of Numbers, fifth edition. Oxford University Press, Oxford, 1979.","edition":"fifth edition"},{"key":"BF00204448_CR23","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"S.Pohlig and M. E.Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24:106\u2013110, 1978.","journal-title":"IEEE Transactions on Information Theory"},{"key":"BF00204448_CR24","doi-asserted-by":"crossref","unstructured":"A. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on the Foundations of Computer Science, pages 80\u201391, 1982.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00204448.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00204448\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00204448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00204448.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T04:29:37Z","timestamp":1586320177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00204448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["BF00204448"],"URL":"https:\/\/doi.org\/10.1007\/bf00204448","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,1]]},"assertion":[{"value":"23 March 1987","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 1989","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}