{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:33:23Z","timestamp":1775774003136,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645184","type":"print"},{"value":"9783540697954","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054115","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:13:04Z","timestamp":1153991584000},"page":"32-46","source":"Crossref","is-referenced-by-count":85,"title":["A practical and provably secure scheme for publicly verifiable secret sharing and its applications"],"prefix":"10.1007","author":[{"given":"Eiichiro","family":"Fujisaki","sequence":"first","affiliation":[]},{"given":"Tatsuaki","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Brickell, E. F., Chaum, D., Damg\u00e5rd, I., and Gr\u00e5f, J. van de, \u201cGradual and verifiable release of a secret\u201d, Proceedings of CRYPTO'87, pp.156\u2013166. (1988).","DOI":"10.1007\/3-540-48184-2_11"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., and Goldwasser, S., \u201cVerifiable Partial Key Escrow\u201d, To appear in Proceedings of the Fourth Annual Conference and Communications Security, ACM, 1997.","DOI":"10.1145\/266420.266439"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G., \u201cSafeguarding cryptographic keys\u201d, AFIPS Conference Proceeding, June 1979.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., and Wigderson, A., \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation\u201d, Proceeding of STOC88, pp 11\u201317.","DOI":"10.1145\/62212.62213"},{"key":"3_CR5","unstructured":"Chaum, D., Crepeau, C, and Damg\u00e5rd, I., \u201cMultiparty Unconditionally Secure Protocol\u201d, Proceeding of STOC88, pp 1\u201310."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S. and Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, Proc. of FOCS, pp.383\u2013395 (1985).","DOI":"10.1109\/SFCS.1985.64"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Feldman, P., \u201cA Practical Scheme for Non-interactive Verifiable Secret Sharing,\u201d In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, pp.427\u2013437 (1987).","DOI":"10.1109\/SFCS.1987.4"},{"key":"3_CR8","unstructured":"Fujisaki, E., \u201cEfficient PZK Proofs for Boolean Formulae whose atoms are Polynomials\u201d, Manuscript."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Fujisaki, E., and Okamoto, T., \u201cStatistical Zero Knowledge Protocols to Prove Modular Polynomial Relations,\u201d Proceedings of Crypto'97, LNCS 1294, Springer, pp.16\u201330 (1997).","DOI":"10.1007\/BFb0052225"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat and A. Shamir, \u201cZero Knowledge Proofs of Identity,\u201d Journal of Cryptology, Vol. 1, pp.77\u201394 (1988).","journal-title":"Journal of Cryptology"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"U.Feige, and A.Shamir, \u201cWitness Indistinguishable and Witness Hiding Protocols,\u201d Proc. of STOC90.","DOI":"10.1145\/100216.100272"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S. and Wiederson, A., \u201cHow to play any mental game\u201d, Proceedings of STOC87, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Mao, W., \u201cPublicly Verifiable Partial Key Escrow\u201d, Proceedings of ICICS'97, Beijing, pp.409\u2013413 (1997).","DOI":"10.1007\/BFb0028496"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Micali, S., \u201cFair Public-Key Cryptosystems\u201d, Proceedings of CRYPTO'92, pp.113\u2013138 (1993).","DOI":"10.1007\/3-540-48071-4_9"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Pedersen, T. P., \u201cNon-Interactive and Information-Theoretic Secure Verifiable Secret Sharing\u201d, Proceedings of Crypto 91, pp. 129\u2013140 (1992).","DOI":"10.1007\/3-540-46766-1_9"},{"issue":"No.11","key":"3_CR16","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A., \u201cHow to share a secret\u201d, CACM, Vol 22, No.11, pp.612\u2013613 (1979).","journal-title":"CACM"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Stadler, M.: Publicly Verifiable Secret Sharing, Proc. of Eurocrypt'96, LNCS 1070, Springer, pp.190\u2013199 (1996)","DOI":"10.1007\/3-540-68339-9_17"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT'98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T14:05:07Z","timestamp":1587132307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645184","9783540697954"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0054115","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}