{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:25:42Z","timestamp":1781519142336,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540675174","type":"print"},{"value":"9783540455394","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45539-6_14","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:26:08Z","timestamp":1184588768000},"page":"190-206","source":"Crossref","is-referenced-by-count":25,"title":["Computing Inverses over a Shared Secret Modulus"],"prefix":"10.1007","author":[{"given":"Dario","family":"Catalano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,5,12]]},"reference":[{"key":"14_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology-Eurocrypt\u2019 97","author":"N. Bari\u0107","year":"1997","unstructured":"N. Bari\u0107, and B. Pfitzmann. Collision-free accumulators and Fail-stop signature schemes without trees. In Advances in Cryptology-Eurocrypt\u2019 97, LNCS vol. 1233, Springer, 1997, pages 480\u2013494."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan, and D. Beaver. Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds. In Proceedings of the ACM Symposium on Principles of Distributed Computation, pp.201\u2013209, 1989.","DOI":"10.1145\/72981.72995"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations. 20th ACM Symposium on the Theory of Computing, pp.1\u201310, ACM Press, 1988.","DOI":"10.1145\/62212.62213"},{"key":"14_CR4","unstructured":"E. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470."},{"key":"14_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology-Crypto\u2019 97","author":"D. Boneh","year":"1997","unstructured":"D. Boneh and M. Franklin. Efficient Generation of Shared RSA Keys. In Advances in Cryptology-Crypto\u2019 97, LNCS vol. 1294, Springer, 1997, pages 425\u2013439. Extended version available from http:\/\/crypto.stanford.edu\/~dabo\/pubs.html"},{"key":"14_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Advances in Cryptology-Crypto\u2019 99","author":"R. Canetti","year":"1999","unstructured":"R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Adaptive Security for Threshold Cryptosystems. In Advances in Cryptology-Crypto\u2019 99, LNCS vol. 1666, Springer, 1999, pages 98\u2013115."},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BFb0055723","volume-title":"Advances in Cryptology-Crypto\u2019 98","author":"D. Catalano","year":"1998","unstructured":"D. Catalano and R. Gennaro. New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications. In Advances in Cryptology-Crypto\u2019 98, LNCS vol. 1462, Springer, 1998, pages 105\u2013120."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. 20th ACM Symposium on the Theory of Computing, pp.11\u201319, ACM Press, 1988.","DOI":"10.1145\/62212.62214"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup. Signature Schemes Based on the Strong RSA Assumption. To appear in the Proceedings of the 6th ACM Conference in Computer and Communication Security, 1999.","DOI":"10.1145\/319709.319716"},{"key":"14_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology-CRYPTO\u201987","author":"Y. Desmedt","year":"1988","unstructured":"Y. Desmedt. Society and group oriented cryptography: A new concept. In Carl Pomerance, editor, Advances in Cryptology-CRYPTO\u201987, Lecture Notes in Computer Science Vol. 293, pp. 120\u2013127, Springer-Verlag, 1988."},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y.G. Desmedt","year":"1994","unstructured":"Y.G. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(4):449\u2013457, July 1994.","journal-title":"European Transactions on Telecommunications"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung. Optimal Resilience Proactive Public-Key Cryptosystems. 38th IEEE Symposium on the Foundations of Computer Science, pp.384\u2013393, IEEE Computer Society Press, 1997.","DOI":"10.1109\/SFCS.1997.646127"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell, and M. Yung. Witness-based Cryptographic Program Checking and Robust Function Sharing. 28th ACM Symposium on the Theory of Computing, pp.499\u2013508, ACM Press, 1996.","DOI":"10.1145\/237814.237998"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Mackenzie, and M. Yung. Robust Efficient Distributed RSA-Key Generation. In STOC 1998, pp.663\u2013672.","DOI":"10.1145\/276698.276882"},{"key":"14_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology-Crypto\u2019 97","author":"E. Fujisaki","year":"1997","unstructured":"E. Fujisaki and T. Okamoto. Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations. In Advances in Cryptology-Crypto\u2019 97, LNCS vol. 1294, Springer, 1997, pages 16\u201330."},{"key":"14_CR16","unstructured":"P. Gemmell. An Introduction to Threshold Cryptography. RSA Laboratories CryptoBytes, Vol.2, No.3, Winter 1997."},{"key":"14_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology-Eurocrypt\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Halevi and T. Rabin. Secure Hash-and-Sign Signatures without the Random Oracle. In Advances in Cryptology-Eurocrypt\u2019 99, LNCS vol. 1592, Springer, 1999, pages 123\u2013139."},{"key":"14_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Crypto\u201996","author":"R. Gennaro","year":"1996","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. Crypto\u201996, pp.157\u2013172, Lecture Notes in Computer Science vol.1109, Springer-Verlag, 1996."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. 19th ACM Symposium on Theory of Computing, pp.218\u2013229, ACM Press, 1987.","DOI":"10.1145\/28395.28420"},{"key":"14_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Crypto\u201991","author":"T. Pedersen","year":"1992","unstructured":"T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. Crypto\u201991, pp.129\u2013140, Lecture Notes in Computer Science vol.576, Springer-Verlag, 1992."},{"key":"14_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Crypto\u201998","author":"T. Rabin","year":"1998","unstructured":"T. Rabin. A SimpliFIed Approach to Threshold and Proactive RSA. Crypto\u201998, pp.89\u2013104, Lecture Notes in Computer Science vol.1462, Springer-Verlag, 1998."},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir and L. Adelman. A Method for Obtaining Digital Signature and Public Key Cryptosystems. Comm. of ACM, 21 (1978), pp. 120\u2013126","journal-title":"Comm. of ACM"},{"key":"14_CR23","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons. 1986."},{"key":"14_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60615-7","volume-title":"Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems","author":"M. Sudan","year":"1995","unstructured":"M. Sudan. Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. Lecture Notes in Computer Science, vol.1001, Springer-Verlag, 1995."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45539-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:37:01Z","timestamp":1556667421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45539-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675174","9783540455394"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45539-6_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}