{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T01:37:59Z","timestamp":1776217079698,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602217","type":"print"},{"value":"9783540447504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-44750-4_27","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:39:53Z","timestamp":1187253593000},"page":"339-352","source":"Crossref","is-referenced-by-count":331,"title":["Proactive Secret Sharing Or: How to Cope With Perpetual Leakage"],"prefix":"10.1007","author":[{"given":"Amir","family":"Herzberg","sequence":"first","affiliation":[]},{"given":"Stanis\u0142aw","family":"Jarecki","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"27_CR1","unstructured":"M. Bellare and P. Rogaway, Optimal Asymmetric Encryption, Eurocrypt\u2019 94."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"G.R. Blakley, Safeguarding Cryptographic Keys, AFIPS Con. Proc (v. 48), 1979, pp 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"27_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/3-540-48658-5_38","volume-title":"Proc. Crypto\u201994","author":"R. Canetti","year":"1994","unstructured":"R. Canetti and A. Herzberg, Maintaining Security in the Presence of Transient Faults, Proc. Crypto\u201994 (LNCS 839), pp. 425\u2013438."},{"key":"27_CR4","unstructured":"R. Canetti and A. Herzberg, Proactive Maintenance of Authenticated Communication, manuscript, 1995."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaneous Broadcast, Proc. of IEEE Focs 1985, pp. 335\u2013344.","DOI":"10.1109\/SFCS.1985.64"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"M. Blum and S. Micali, How to Construct Cryptographically Strong Sequences of Pseudorandom Bits. SIAM J. Comp. 13, 1984.","DOI":"10.1137\/0213053"},{"key":"27_CR7","unstructured":"A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung, How to Share a Function Securely, ACM STOC 94."},{"key":"27_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology, Proc. of Crypto\u2019 89","author":"Y. Desmedt","year":"1990","unstructured":"Y. Desmedt and Y. Frankel, Threshold cryptosystems, In G. Brassard, editor, Advances in Cryptology, Proc. of Crypto\u2019 89 (Lecture Notes in Computer Science 435), pages 307\u2013315. Springer-Verlag, 1990."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, O. Waarts, and M. Yung, Perfectly Secure Message Transmission, Proc. 31st Annual Symposium on the Foundations of Computer Science, 1990, (also JACM).","DOI":"10.1109\/FSCS.1990.89522"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1109\/TIT.1985.1057073","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"T. El Gamal, A Public key cryptosystem and a signature scheme based on discrete logarithm, IEEE Trans. on Information Theory 31, 465\u2013472, 1985.","journal-title":"IEEE Trans. on Information Theory"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret Sharing, Proc. of the 28th IEEE Symposium on the Foundations of Computer Science, 1987, 427\u2013437","DOI":"10.1109\/SFCS.1987.4"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, Probabilistic Encryption, J. Com. Sys. Sci. 28 (1984), pp 270\u2013299.","journal-title":"J. Com. Sys. Sci."},{"issue":"2","key":"27_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali and R. Rivest, A Secure Digital Signature Scheme, Siam Journal of Computing, Vol. 17,2 (1988), pp. 281\u2013308.","journal-title":"Siam Journal of Computing"},{"key":"27_CR14","unstructured":"A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk and M. Yung, Proactive Public Key and Signatures Systems, draft."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0217021","volume":"17","author":"D.L. Long","year":"1988","unstructured":"D.L. Long and A. Wigderson, The Discrete Log. Problem Hides O(Log N) Bits. SIAM J. Comp. 17, 1988, pp. 363\u2013372.","journal-title":"SIAM J. Comp."},{"key":"27_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-46416-6_20","volume-title":"Proc. Eurocrypt\u2019 91","author":"T. P. Pedersen","year":"1991","unstructured":"T. P. Pedersen, Distributed Provers with Applications to Undeniable Signature, Proc. Eurocrypt\u2019 91 (LNCS 547), pp. 221\u2013242."},{"key":"27_CR17","series-title":"Lect Notes Comput Sci","first-page":"129","volume-title":"Proc. Crypto\u201991","author":"T. P. Pedersen","year":"1991","unstructured":"T. P. Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Proc. Crypto\u201991 (LNCS 576), pp. 129\u2013140."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, Proc. of the 10th ACM Symp. on the Princ. of Distr. Comp., 1991, pp. 51\u201361.","DOI":"10.1145\/112600.112605"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret, Commun. ACM, 22 (1979), pp 612\u2013613.","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPT0\u2019 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44750-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T22:38:03Z","timestamp":1587854283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44750-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602217","9783540447504"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44750-4_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]}}}