{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:50:27Z","timestamp":1725475827623},"publisher-location":"Berlin, Heidelberg","reference-count":33,"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_15","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T20:38:40Z","timestamp":1167511120000},"page":"184-196","source":"Crossref","is-referenced-by-count":1,"title":["A New Approach to Robust Threshold RSA Signature Schemes"],"prefix":"10.1007","author":[{"given":"Rei","family":"Safavi-Naini","sequence":"first","affiliation":[]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kwok-Yan","family":"Lam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Naor, M.: Derandomization. witnesses for Boolean matrix multiplication and construction of perfect hash functions (1996)","DOI":"10.1007\/BF01940874"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M. Atici","year":"1996","unstructured":"Atici, M., Magliveras, S.S., Stinson, D.R., Wei, W.D.: Some Recursive Constructions for Perfect Hash Families. Journal of Combinatorial l Designs\u00a04, 353\u2013363 (1996)","journal-title":"Journal of Combinatorial l Designs"},{"key":"15_CR3","first-page":"1","volume-title":"Proc. 20th Annual Symp. on the Theory of Computing","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non cryptographic Fault-Tolerant Distributed Computations. In: Proc. 20th Annual Symp. on the Theory of Computing, pp. 1\u201310. ACM, New York (1988)"},{"key":"15_CR4","unstructured":"Blackburn, S.R.: Combinatorics and Threshold Cryptology, in Combinatorial Designs and their Applications(Pitman Research Notes in Mathematics) (to appear)"},{"key":"15_CR5","unstructured":"Blackburn, S.R., Blake-Wilson, S., Burmester, M., Galbraith, S.: Shared generation of shared RSA keys. Tech. Report CORR98-19, University of Waterloo"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"S.R. Blackburn","year":"1996","unstructured":"Blackburn, S.R., Burmester, M., Desmedt, Y., Wild, P.R.: Efficient multiplicative sharing schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 107\u2013118. Springer, Heidelberg (1996)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Blum, M., Kannan, S.: 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":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 425\u2013439. Springer, Heidelberg (1997)"},{"key":"15_CR9","unstructured":"Boyd, C.: Digital multisignatures. In: Beker, Piper (eds.) Cryptography and coding, pp. 241\u2013246. Clarendon Press (1989)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1007\/0-387-34799-2_40","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"E. Brickell","year":"1990","unstructured":"Brickell, E., Stinson, D.: The Detection of Cheaters in Threshold Schemes. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 564\u2013577. Springer, Heidelberg (1990)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00146-6","volume":"182","author":"Z.J. Czech","year":"1997","unstructured":"Czech, Z.J., Havas, G., Majewski, B.S.: Perfect Hasing. Theoretical Computer Science\u00a0182, 1\u2013143 (1997)","journal-title":"Theoretical Computer Science"},{"key":"15_CR12","unstructured":"Croft, R.A., Harris, S.P.: Public-key cryptography and re-usable shared secrets. In: Beker, Piper (eds.) Cryptography and coding, pp. 241\u2013246. Clarendon Press (1989)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","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":"Desmedt, Y.: Society and group oriented cryptology: a new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 120\u2013127. Springer, Heidelberg (1988)"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. Desmedt","year":"1994","unstructured":"Desmedt, Y.: Threshold cryptography. European Trans. on Telecommunications\u00a05(4), 449\u2013457 (1994)","journal-title":"European Trans. on Telecommunications"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BFb0030418","volume-title":"Information Security","author":"Y. Desmedt","year":"1998","unstructured":"Desmedt, Y.: Some recent research aspects of threshold cryptography. In: Okamoto, E. (ed.) ISW 1997. LNCS, vol.\u00a01396, pp. 99\u2013114. Springer, Heidelberg (1998)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","first-page":"21","volume-title":"Advances in Cryptology-Asiacrypt \u201994","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y., Di Crescenzo, G., Burmester, M.: Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 21\u201332. Springer, Heidelberg (1990)"},{"key":"15_CR17","first-page":"522","volume-title":"Proc. 26th Annual Symp. on the Theory of Computing","author":"A. Santis De","year":"1994","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proc. 26th Annual Symp. on the Theory of Computing, pp. 522\u2013533. ACM, New York (1994)"},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. Desmedt","year":"1994","unstructured":"Desmedt, Y., Frankel, Y.: Homomorphic zero-knowledge threshold schemes over any finite group. SIAM J. Disc. Math.\u00a07(4), 667\u2013679 (1994)","journal-title":"SIAM J. Disc. Math."},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BFb0053750","volume-title":"Information Security and Privacy","author":"Y. Desmedt","year":"1998","unstructured":"Desmedt, Y., King, B., Kishimoto, W., Kurosawa, K.: A comment on the efficiency of secret sharing scheme over any finite abelian group. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol.\u00a01438, pp. 391\u2013402. Springer, Heidelberg (1998)"},{"key":"15_CR20","first-page":"437","volume-title":"Proc. 28th Annual FOCS","author":"P. Feldman","year":"1987","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: Proc. 28th Annual FOCS, pp. 437\u2013437. IEEE Computer Society Press, Los Alamitos (1987)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-46885-4_8","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"Y. Frankel","year":"1990","unstructured":"Frankel, Y.: A practical protocol for large group oriented networks. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 56\u201361. Springer, Heidelberg (1990)"},{"key":"15_CR22","first-page":"384","volume-title":"Proc. 38th FOCS","author":"Y. Frankel","year":"1997","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: Proc. 38th FOCS, pp. 384\u2013393. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"15_CR23","first-page":"499","volume-title":"Proc. 28th STOC","author":"Y. Frankel","year":"1996","unstructured":"Frankel, Y., Gemmell, P., Yung, M.: Witness-based Cryptographic Program Checking and Robust Function Sharing. In: Proc. 28th STOC, pp. 499\u2013508. ACM Press, New York (1996)"},{"key":"15_CR24","first-page":"663","volume-title":"Proc. 30th STOC","author":"Y. Frankel","year":"1998","unstructured":"Frankel, Y., MacKenzie, P., Yung, M.: Robust efficient distributed RSA-key generation. In: Proc. 30th STOC, pp. 663\u2013672. ACM Press, New York (1998)"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"R. Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 157\u2013172. Springer, Heidelberg (1996)"},{"key":"15_CR26","first-page":"174","volume-title":"Proceeding 27th Annual Symposium on the Foundations of Computer Science","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: 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, pp. 174\u2013187. ACM Press, New York (1986)"},{"key":"15_CR27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E. Karnin","year":"1983","unstructured":"Karnin, E., Greene, J., Hellman, M.: On Secret Sharing Systems. IEEE Transactions on Information Theory\u00a0 IT-29, 35\u201341 (1983)","journal-title":"IEEE Transactions on Information Theory IT-"},{"key":"15_CR28","volume-title":"Data Structures and Algorithms","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms. Springer, Heidelberg (1984)"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Miyazaki, S., Sakurai, K., Yung, M.: On threshold RSA-signing with no dealer. In: Song, J.S. (ed.) ICISC 1999. LNCS, vol.\u00a01787, pp. 187\u2013197. Springer, Heidelberg (1999) (see also this proceedings)","DOI":"10.1007\/10719994_16"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Crypto\u201998","author":"T. Rabin","year":"1998","unstructured":"Rabin, T.: A simplified Approach to Threshold and Proactive RSA. In: CRYPTO 1996. LNCS, vol.\u00a01109, pp. 89\u2013104. Springer, Heidelberg (1998)"},{"key":"15_CR31","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":"15_CR32","first-page":"71","volume":"1","author":"G. Simmons","year":"1991","unstructured":"Simmons, G., Jackson, W.-A., Martin, K.: The Geometry of Shared Secret Schemes. Bulletin of the Institute of Combinatorics and its Applications (ICA)\u00a01, 71\u201388 (1991)","journal-title":"Bulletin of the Institute of Combinatorics and its Applications (ICA)"},{"issue":"2","key":"15_CR33","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"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:58:52Z","timestamp":1556020732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719994_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673804","9783540455684"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/10719994_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}