{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T19:10:37Z","timestamp":1784747437270,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540615125","type":"print"},{"value":"9783540686972","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68697-5_13","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T17:10:00Z","timestamp":1194541800000},"page":"157-172","source":"Crossref","is-referenced-by-count":93,"title":["Robust and Efficient Sharing of RSA Functions"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Gennaro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stanis\u0142aw","family":"Jarecki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"issue":"2","key":"13_CR1","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, and C. Cr\u00e9peau. Minimum disclosure proofs of knowledge. JCSS, 37(2): 156\u2013189, 1988.","journal-title":"JCSS"},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-38424-3_14","volume-title":"Proc. CRYPTO 90","author":"J. Boyar","year":"1991","unstructured":"J. Boyar, D. Chaum, I. Damg\u00e5rd, and T. Pedersen. Convertible undeniable signatures. In A.J. Menezes and S. A. Vanstone, editors, Proc. CRYPTO 90, pages 189\u2013205. Springer-Verlag, 1991. Lecture Notes in Computer Science No. 537."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"M. Blum and S. Kannan, Program correctness checking and the design of programs that check their work. In Proc. of the 21st ACM Symposium on Theory of Computing, 1989.","DOI":"10.1145\/73007.73015"},{"key":"13_CR4","unstructured":"C. Boyd, Digital Multisignatures. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 241\u2013246, Claredon Press, 1986."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Eurocrypt\u201994, 1994.","DOI":"10.1007\/BFb0053428"},{"key":"13_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Proc. CRYPTO 89","author":"D. Chaum","year":"1990","unstructured":"David Chaum and Hans Van Antwerpen. Undeniable signatures. In G. Brassard, editor, Proc. CRYPTO 89, pages 212\u2013217. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435."},{"key":"13_CR7","series-title":"Lect Notes Comput Sci","first-page":"458","volume-title":"Proc. EUROCRYPT 90","author":"D. Chaum","year":"1990","unstructured":"D. Chaum. Zero-knowledge undeniable signatures. In Proc. EUROCRYPT 90, pages 458\u2013464. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 473."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Alfredo De Santis, Yvo Desmedt, Yair Frankel, and Moti Yung. How to share a function securely. In Proc. 26th ACM Symp. on Theory of Computing, pages 522\u2013533, Santa Fe, 1994. IEEE.","DOI":"10.1145\/195058.195405"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. G. Desmedt","year":"1994","unstructured":"Yvo G. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(4):449\u2013457, July 1994.","journal-title":"European Transactions on Telecommunications"},{"key":"13_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Proc. CRYPTO 89","author":"Y. Desmedt","year":"1990","unstructured":"Yvo Desmedt and Yair Frankel, Threshold cryptosystems. In G. Brassard, editor, Proc. CRYPTO 89, pages 307\u2013315. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435."},{"key":"13_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-46766-1_37","volume-title":"Proc. CRYPTO 91","author":"Y. Desmedt","year":"1992","unstructured":"Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Proc. CRYPTO 91, pages 457\u2013469, Springer, 1992. Lecture Notes in Computer Science No. 576."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In Proceeding 28th Annual Symposium on the Foundations of Computer Science, pages 427\u2013437. IEEE, 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell, and M. Yung. Witness-based Cryptographic Program Checking and Robust Function Sharing. To appear in proceedings of STOC96, 1996.","DOI":"10.1145\/237814.237998"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold dss signatures. To appear in Eurocrypt\u201996, 1996.","DOI":"10.1007\/3-540-68339-9_31"},{"issue":"2","key":"13_CR15","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic encryption. JCSS, 28(2):270\u2013299, April 1984.","journal-title":"JCSS"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","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. J. Computing, 18(1):186\u2013208, February 1989.","journal-title":"SIAM. J. Computing"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing but the Validity of the Assertion, and a Methodology of Cryptographic Protocol Design. In Proceeding 27th Annual Symposium on the Foundations of Computer Science, pages 174\u2013187. ACM, 1986.","DOI":"10.1109\/SFCS.1986.47"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In Proceeding 19th Annual Symposium on the Theory of Computing, pages 218\u2013229. ACM, 1987.","DOI":"10.1145\/28395.28420"},{"key":"13_CR20","unstructured":"Oded Goldreich. Foundation of Cryptography \u2014 Fragments of a Book. Electronic Colloquium on Computational Complexity, February 1995. Available online from http:\/\/www.eccc.uni-trier.de\/eccc\/ ."},{"key":"13_CR21","series-title":"Lect Notes Comput Sci","first-page":"113","volume-title":"Proc. CRYPTO 92","author":"S. Micali","year":"1992","unstructured":"Silvio Micali. Fair public-key cryptosystems. In Emest F. Brickell, editor, Proc. CRYPTO 92, pages 113\u2013138. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 740."},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"T. Pedersen. Distributed provers with applications to undeniable signatures. In Eurocrypt\u201991, 1991.","DOI":"10.1007\/3-540-46416-6_20"},{"issue":"6","key":"13_CR23","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1145\/195613.195621","volume":"41","author":"T. Rabin","year":"1994","unstructured":"T. Rabin. Robust Sharing of Secrets When the Dealer is Honest or Faulty. Journal of the ACM, 41(6):1089\u20131109, 1994.","journal-title":"Journal of the ACM"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proceeding 21st Annual Symposium on the Theory of Computing, pages 73\u201385. ACM, 1989.","DOI":"10.1145\/73007.73014"},{"key":"13_CR25","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. Communications of the ACM, 22:612\u2013613, 1979.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68697-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T04:27:51Z","timestamp":1556944071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68697-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615125","9783540686972"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-68697-5_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}