{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:40:03Z","timestamp":1737067203114,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003243"},{"type":"electronic","value":"9783540362883"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_4","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T20:45:01Z","timestamp":1180903501000},"page":"47-61","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack"],"prefix":"10.1007","author":[{"given":"Philip","family":"Mac Kenzie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"4_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-48405-1_9","volume-title":"CRYPTO\u2019 99","author":"M. Abe","year":"1999","unstructured":"M. Abe. Robust distributed multiplication without interaction. In CRYPTO\u2019 99 (LNCS 1666), pages 130\u2013147, 1999. 48"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In 3rd ACM Conference on Computer and Communications Security, pages 6\u201317, 1996. 47","DOI":"10.1145\/266420.266426"},{"key":"4_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Proceedings of the Third Algorithmic Number Theory Symposium","author":"D. Boneh","year":"1998","unstructured":"D. Boneh. The decision Diffie-Hellman problem. In Proceedings of the Third Algorithmic Number Theory Symposium (LNCS1423), pp. 48\u201363, 1998. 57"},{"key":"4_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"CRYPTO\u2019 97","author":"D. Boneh","year":"1997","unstructured":"D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In CRYPTO\u2019 97 (LNCS 1294), pages 425\u2013439, 1997. 49"},{"key":"4_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"EUROCRYPT\u2019 97","author":"N. Bari\u0107","year":"1997","unstructured":"N. Bari\u0107 and B. Pfitzmann. Collision-free accumulators and fail-stopsign ature schemes without trees. In EUROCRYPT\u2019 97 (LNCS 1233), pages 480\u2013494, 1997. 48"},{"key":"4_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"CRYPTO\u2019 98","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In CRYPTO\u2019 98 (LNCS 1462), pp. 26\u201345, 1998. 57"},{"key":"4_CR7","unstructured":"C. Boyd. Digital multisignatures. In H.J. Beker and F.C. Piper, editors, Cryptography and Coding, pages 241\u2013246. Clarendon Press, 1986. 48"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communications Security, pages 62\u201373, November 1993. 49","DOI":"10.1145\/168588.168596"},{"key":"4_CR9","unstructured":"J. Camenisch and M. Stadler. Proof systems for general statements about discrete logarithms. Technical Report TR 260, Department of Computer Science, ETH Zurich, March 1997. 56"},{"key":"4_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-48910-X_7","volume-title":"EUROCRYPT\u2019 99","author":"R. Canetti","year":"1999","unstructured":"R. Canetti and S. Goldwasser. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In EUROCRYPT\u2019 99 (LNCS 1592), pages 90\u2013106, 1999. 48, 50, 56"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Goldreich, and S. Halevi. Random oracle methodology, revisited. In 30th ACM Symposium on Theory of Computing, pages 209\u2013218, 1998. 49","DOI":"10.1145\/276698.276741"},{"issue":"4","key":"4_CR12","first-page":"532","volume":"E76A","author":"M. Cerecedo","year":"1993","unstructured":"M. Cerecedo, T. Matsumoto, H. Imai. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences, E76A(4):532\u2013545, April 1993. 48, 49","journal-title":"IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences"},{"key":"4_CR13","unstructured":"R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocols. Ph.D. Thesis. CWI and University of Amsterdam, 1997. 51"},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u2222rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO\u2019 94 (LNCS 839), pages 174\u2013187, 1994. 51, 52"},{"key":"4_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"CRYPTO\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer and V. Shoup. A practical public-key cryptosystem provably secure against adaptive chosen ciphertext attack. In CRYPTO\u2019 98 (LNCS 1462), pages 13\u201325, 1998. 47, 50"},{"key":"4_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"EUROCRYPT 2002","author":"R. Cramer","year":"2002","unstructured":"R. Cramer and V. Shoup. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In EUROCRYPT 2002 (LNCS 2332), pages 45\u201364, 2002. 50"},{"key":"4_CR17","unstructured":"R.A. Croft and S.P. Harris. Public-key cryptography and reusable shared secrets. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 189\u2013201, 1989. 48"},{"key":"4_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"EUROCRYPT 2000","author":"I. Damg\u2222rd","year":"2000","unstructured":"I. Damg\u2222rd. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000 (LNCS 1807), pages 418\u2013430, 2000. 56"},{"key":"4_CR19","series-title":"Lect Notes Comput Sci","first-page":"120","volume-title":"CRYPTO\u2019 87","author":"Y. Desmedt","year":"1987","unstructured":"Y. Desmedt. Society and group oriented cryptography: a new concept. In CRYPTO\u2019 87 (LNCS 293), pages 120\u2013127, 1987. 48"},{"key":"4_CR20","series-title":"Lect Notes Comput Sci","first-page":"307","volume-title":"CRYPTO\u2019 89","author":"Y. Desmedt","year":"1989","unstructured":"Y. Desmedt and Y. Frankel. Threshold cryptosystems. In CRYPTO\u2019 89 (LNCS 435), pages 307\u2013315, 1989. 48"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469\u2013472, 1985. 53","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. In 22nd ACM Symposium on Theory of Computing, pp. 416\u2013426, 1990. 52","DOI":"10.1145\/100216.100272"},{"key":"4_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-45682-1_21","volume-title":"ASIACRYPT\u2019 01","author":"P. Fouque","year":"2001","unstructured":"P. Fouque and D. Pointcheval. Threshold Cryptosystems secure against Chosen-Ciphertext Attack. In ASIACRYPT\u2019 01 (LNCS 2248), pages 351\u2013368, 2001. 48"},{"key":"4_CR24","series-title":"Lect Notes Comput Sci","first-page":"56","volume-title":"EUROCRYPT\u2019 89","author":"Y. Frankel","year":"1989","unstructured":"Y. Frankel. A practical protocol for large group oriented networks. In EUROCRYPT\u2019 89(LNCS 434), pages 56\u201361, 1989. 48"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Mac Kenzie, and M. Yung. Robust efficient distributed RSA-key generation. In 30th ACM Symposium on Theory of Computing, pages 663\u2013672, 1998. 49","DOI":"10.1145\/276698.276882"},{"key":"4_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/3-540-48481-7_2","volume-title":"European Symposium on Algorithms","author":"Y. Frankel","year":"1999","unstructured":"Y. Frankel, P. Mac Kenzie, and M. Yung. Adaptively-secure distributed threshold public key systems. In European Symposium on Algorithms (LNCS 1643), pages 4\u201327, 1999. 48"},{"key":"4_CR27","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"CRYPTO\u2019 86","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In CRYPTO\u2019 86 (LNCS 263), pages 186\u2013194, 1987. 56"},{"key":"4_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"CRYPTO\u2019 99","author":"N. Gilboa","year":"1999","unstructured":"N. Gilboa. Two party RSA key generation. In CRYPTO\u2019 99 (LNCS 1666), pages 116\u2013129, 1999. 49"},{"key":"4_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"EUROCRYPT\u2019 96","author":"R. Gennaro","year":"1996","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In EUROCRYPT\u2019 96 (LNCS 1070), pages 354\u2013371, 1996. 48, 49"},{"issue":"5","key":"4_CR30","first-page":"307","volume":"141","author":"L. Harn","year":"1994","unstructured":"L. Harn. Grouporien ted (t, n) threshold digital signature scheme and digital multisignature. IEE Proc.-Comput. Digit. Tech. 141(5):307\u2013313, 1994. 48","journal-title":"Grouporien ted (t, n) threshold digital signature scheme and digital multisignature"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public-key and signature schemes. In 4th ACM Conference on Computer and Communications Security, pages 100\u2013110, 1997. 48","DOI":"10.1145\/266420.266442"},{"key":"4_CR32","series-title":"Lect Notes Comput Sci","first-page":"352","volume-title":"EUROCRYPT\u2019 90","author":"T. Hwang","year":"1990","unstructured":"T. Hwang. Cryptosystem for group oriented cryptography. In EUROCRYPT\u2019 90 (LNCS 473), pages 352\u2013360, 1990. 48"},{"key":"4_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"EUROCRYPT 2000","author":"S. Jarecki","year":"2000","unstructured":"S. Jarecki and A. Lysyanskaya. Adaptively secure threshold cryptography: Introducing concurrency, removing erasures. In EUROCRYPT 2000 (LNCS 1807), pages 221\u2013242, 2000. 48, 56"},{"key":"4_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-44750-4_32","volume-title":"CRYPTO\u2019 95","author":"S. Langford","year":"1995","unstructured":"S. Langford. Threshold DSS signatures without a trusted party. In CRYPTO\u2019 95 (LNCS 963), pages 397\u2013409, 1995. 48, 49"},{"key":"4_CR35","unstructured":"P. Mac Kenzie and M.K. Reiter. Networked cryptographic devices resilient to capture. DIMACS Technical Report 2001-19, May 2001. Extended abstract in 2001 IEEE Symposium on Security and Privacy, May 2001. 47, 48, 51, 52"},{"key":"4_CR36","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-44647-8_8","volume-title":"CRYPTO 2001","author":"P. Mac Kenzie","year":"2001","unstructured":"P. Mac Kenzie and M.K. Reiter. Two-party generation of DSA signatures. In CRYPTO 2001 (LNCS 2139), pages 137\u2013154, 2001. 48, 49, 56"},{"key":"4_CR37","series-title":"Lect Notes Comput Sci","first-page":"113","volume-title":"CRYPTO\u2019 92","author":"S. Micali","year":"1992","unstructured":"S. Micali. Fair public-key cryptosystems. In CRYPTO\u2019 92 (LNCS 740), pages 113\u2013138, 1992. 47"},{"key":"4_CR38","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"EUROCRYPT\u2019 99","author":"P. Paillier","year":"1999","unstructured":"P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT\u2019 99 (LNCS 1592), pages 223\u2013238, 1999. 48"},{"issue":"1","key":"4_CR39","first-page":"86","volume":"E79A","author":"C. Park","year":"1996","unstructured":"C. Park and K. Kurosawa. New ElGamal type threshold digital signature scheme. IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences, E79A(1):86\u201393, January, 1996. 48","journal-title":"IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences"},{"key":"4_CR40","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"EUROCRYPT\u2019 91","author":"T. Pedersen","year":"1991","unstructured":"T. Pedersen. A threshold cryptosystem without a trusted party. In EUROCRYPT\u2019 91(LNCS 547), pages 522\u2013526, 1991. 48"},{"key":"4_CR41","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-49649-1_2","volume-title":"ASIACRYPT\u2019 98","author":"G. Poupard","year":"1998","unstructured":"G. Poupard and J. Stern. Generation of shared RSA keys by two parties. In ASIACRYPT\u2019 98, LNCS 1514, pages 11\u201324, 1998. 49"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In EUROCRYPT\u2019 98, pp. 1\u201316, 1998. 48, 51, 57","DOI":"10.1007\/BFb0054113"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"A. Yao. Protocols for secure computation. In 23rd IEEE Symposium on Foundations of Computer Science, pages 160\u2013164, 1982. 47","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:04:20Z","timestamp":1737065060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}