{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:50:26Z","timestamp":1725475826418},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673804"},{"type":"electronic","value":"9783540455684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719994_14","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T20:38:40Z","timestamp":1167511120000},"page":"169-183","source":"Crossref","is-referenced-by-count":2,"title":["Verifiable Secret Sharing and Time Capsules"],"prefix":"10.1007","author":[{"given":"Josef","family":"Pieprzyk","sequence":"first","affiliation":[]},{"given":"Eiji","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for design efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communication Security, 1993, Fairfax, Virginia, November 3-5, 1994, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-49649-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 1998","author":"M. Burmester","year":"1998","unstructured":"Burmester, M., Desmedt, Y., Seberry, J.: Equitable key escrow with limited time span. In: Ohta, K., Pei, D. (eds.) SAFECOMP 1998. LNCS, vol.\u00a01516, pp. 380\u2013391. Springer, Heidelberg (1998)"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01388382","volume":"5","author":"M. Carpentieri","year":"1995","unstructured":"Carpentieri, M.: A perfect threshold secret sharing scheme to identify cheaters. Designs, Codes and Cryptography\u00a05(3), 183\u2013187 (1995)","journal-title":"Designs, Codes and Cryptography"},{"key":"14_CR4","first-page":"427","volume-title":"Proceedings of the 28th IEEE Symposium on Foundations of Computer Science","author":"P. Feldman","year":"1987","unstructured":"Feldman, P.: A practical scheme for non-interactive veriable secret sharing. In: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pp. 427\u2013437. IEEE, Los Alamitos (1987)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-47942-0_20","volume-title":"Information and Communication Security","author":"W. Mao","year":"1999","unstructured":"Mao, W.: Send message into a definite future. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol.\u00a01726, pp. 244\u2013251. Springer, Heidelberg (1999)"},{"key":"14_CR6","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure veriable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Veriable secret sharing and multiparty protocols with honest majority. In: Proceedings of 21st ACM Symposium on Theory of Computing, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"14_CR9","unstructured":"Rivest, R., Shamir, A., Wagner, D.: Time-lock puzzles and time-release crypto (1996), http:\/\/theory.lcs.mit.edu\/rivest\/RivestShamirWagner-timelock.ps"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"B. Schoenmakers","year":"1999","unstructured":"Schoenmakers, B.: A simple publicly veriable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 148\u2013164. Springer, Heidelberg (1999)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology - EUROCRYPT 1996","author":"M. Stadler","year":"1996","unstructured":"Stadler, M.: Publicly veriable secret sharing. In: Maurer, U. (ed.) Advances in Cryptology - EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 190\u2013199. Springer, Heidelberg (1996)"},{"key":"14_CR13","unstructured":"Tamura, Y., Okamoto, E.: Concept and implementation of flexible secret sharing scheme. In: Proceedings of 1998 Computer Security Symposium(CSS 1998) (1998)"},{"issue":"2","key":"14_CR14","first-page":"133","volume":"1","author":"M. Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. Journal of Cryptology\u00a01(2), 133\u2013138 (1988)","journal-title":"Journal of Cryptology"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-48970-3_4","volume-title":"Information Security and Privacy","author":"K. Viswanathan","year":"1999","unstructured":"Viswanathan, K., Boyd, C., Dawson, E.: Publicly veriable key escrow with limited time span. In: Pieprzyk, J.P., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol.\u00a01587, pp. 36\u201350. Springer, Heidelberg (1999)"},{"key":"14_CR16","unstructured":"Zheng, Y., Hardjono, T., Pieprzyk, J.: The sibling intractable function family (SIFF): notion, construction and applications. IEICE Trans. Fundamentals\u00a0E76- A, 4\u201313 (1993)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719994_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:58:49Z","timestamp":1556020729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719994_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673804","9783540455684"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/10719994_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}