{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:12:27Z","timestamp":1725484347287},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438618"},{"type":"electronic","value":"9783540454502"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45450-0_33","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T20:53:10Z","timestamp":1179607990000},"page":"436-448","source":"Crossref","is-referenced-by-count":3,"title":["On the Security of a Modified Paillier Public-Key Primitive"],"prefix":"10.1007","author":[{"given":"Kouichi","family":"Sakurai","sequence":"first","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"33_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"CRYPTO\u201998","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, \u201cRelations among notions of security for public-key encryption schemes,\u201d CRYPTO\u201998, LNCS 1462, pp. 26\u201345, 1998."},{"issue":"3","key":"33_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00196727","volume":"4","author":"J. Boyar","year":"1991","unstructured":"J. Boyar, K. Friedl, and C. Lund, \u201cPractical zero-knowledge proofs: Giving hits and using deficiencies,\u201d Journal of Cryptology, 4(3), pp. 185\u2013206, 1991.","journal-title":"Journal of Cryptology"},{"key":"33_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Eurocrypt\u2019 99","author":"J. Camenish","year":"1999","unstructured":"J. Camenish and M. Michels, \u201cProving that a number is the product of two safe primes,\u201d Eurocrypt\u2019 99, LNCS 1592, pp. 107\u2013122, 1999."},{"key":"33_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44987-6_15","volume-title":"Eurocrypt 2001","author":"D. Catalano","year":"2001","unstructured":"D. Catalano, R. Gennaro, and N. Howgraw-Graham, \u201cThe bit security of Paillier\u2019s encryption scheme and its applications,\u201d Eurocrypt 2001, LNCS 2045, pp. 229\u2013243, 2001."},{"doi-asserted-by":"crossref","unstructured":"D. Catalano, R. Gennaro, N. Howgrave-Graham, and P. Nguyen, \u201cPaillier\u2019s cryptosystem revisited,\u201d to appear in the ACM conference on Computer and Communication Security, 2001. (available from http:\/\/www.di.ens.fr\/~pnguyen\/ )","key":"33_CR5","DOI":"10.1145\/501983.502012"},{"key":"33_CR6","series-title":"Lect Notes Comput Sci","first-page":"72","volume-title":"The 4th International Conference on Information Security and Cryptology","author":"D.-H. Choi","year":"2002","unstructured":"D.-H. Choi, S. Choi, and D. Won, \u201cImprovement of probabilistic public key cryptosystem using discrete logarithm,\u201d The 4th International Conference on Information Security and Cryptology, ICISC 2001, LNCS 2288, pp. 72\u201380, 2002."},{"key":"33_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"PKC 2001","author":"I. Damg\u00e5rd","year":"2001","unstructured":"I. Damg\u00e5rd and M. Jurik, \u201cA generalization, a simplification and some applications of Paillier\u2019s probabilistic public-key system, \u201d PKC 2001, LNCS 1992, pp. 119\u2013136, 2001."},{"key":"33_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-49162-7_5","volume-title":"1999 International Workshop on Practice and Theory in Public Key Cryptography","author":"E. Fujisaki","year":"1999","unstructured":"E. Fujisaki and T. Okamoto, \u201cHow to enhance the security of public-key encryption at minimum cost,\u201d 1999 International Workshop on Practice and Theory in Public Key Cryptography, LNCS 1560, pp. 53\u201368, 1999."},{"key":"33_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology-CRYPTO\u201999","author":"E. Fujisaki","year":"1999","unstructured":"E. Fujisaki and T. Okamoto, \u201cSecure integration of asymmetric and symmetric encryption schemes,\u2019 Advances in Cryptology-CRYPTO\u201999, LNCS 1666, pp. 537\u2013554, 1999."},{"unstructured":"S. Galbraith, \u201cElliptic curve Paillier schemes,\u201d to appear in Journal of Cryptology, 2001. (available from http:\/\/www.isg.rhul.ac.uk\/~sdg\/ )","key":"33_CR10"},{"unstructured":"D. Galindo, S. Mart\u00edn, P. Morillo, and J. Villar, \u201cAn efficient semantically secure elliptic curve cryptosystem based on KMOV scheme,\u201d Cryptology ePrint Archive, Report 2002\/037, 2002. (available from http:\/\/eprint.iacr.org\/ )","key":"33_CR11"},{"doi-asserted-by":"crossref","unstructured":"R. Gennaro, D. Micciancio, and T. Rabin, \u201cAn efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products,\u201d ACM Conference on Computer and Communications Security, pp. 67\u201372, 1998.","key":"33_CR12","DOI":"10.1145\/288090.288108"},{"key":"33_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-44586-2_8","volume-title":"2001 International Workshop on Practice and Theory in Public Key Cryptography","author":"T. Okamoto","year":"2001","unstructured":"T. Okamoto and D. Pointcheval, \u201cThe Gap-Problems: a new class of problems fro the security of cryptographic schemes,\u201d 2001 International Workshop on Practice and Theory in Public Key Cryptography, LNCS 1992, pp. 104\u2013118, 2001."},{"key":"33_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45353-9_13","volume-title":"roceedings of the Cryptographers\u2019 Track at RSA Conference\u2019 2001","author":"T. Okamoto","year":"2001","unstructured":"T. Okamoto and D. Pointcheval, \u201cREACT: Rapid Enhanced-security Asymmetric Cryptosystem Transform,\u201d In Proceedings of the Cryptographers\u2019 Track at RSA Conference\u2019 2001, LNCS 2020, pp. 159\u2013175, 2001."},{"key":"33_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"A new public-key cryptosystem as secure as factoring,\u201d Eurocrypt\u201998","author":"T. Okamoto","year":"1998","unstructured":"T. Okamoto and S. Uchiyama, \u201cA new public-key cryptosystem as secure as factoring,\u201d Eurocrypt\u201998, LNCS 1403, pp. 308\u2013318, 1998."},{"key":"33_CR16","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Eurocrypt\u201999","author":"P. Paillier","year":"1999","unstructured":"P. Paillier, \u201cPublic-key cryptosystems based on composite degree residuosity classes,\u201d Eurocrypt\u201999, LNCS 1592, pp. 223\u2013238, 1999."},{"key":"33_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-540-48000-6_14","volume-title":"Asiacrypt\u201999","author":"P. Paillier","year":"1999","unstructured":"P. Paillier and D. Pointcheval, \u201cEfficient public key cryptosystems provably secure against active adversaries,\u201d Asiacrypt\u201999, LNCS 1716, pp. 165\u2013179, 1999."},{"key":"33_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-46588-1_10","volume-title":"2000 International Workshop on Practice and Theory in Public Key Cryptography","author":"D. Pointcheval","year":"2000","unstructured":"D. Pointcheval, \u201cChosen-ciphertext security for any one-way cryptosystem,\u201d 2000 International Workshop on Practice and Theory in Public Key Cryptography, LNCS 1751, pp. 129\u2013146, 2000."},{"key":"33_CR19","first-page":"1","volume-title":"Technical Report No.212, MIT","author":"M. Rabin","year":"1979","unstructured":"M. Rabin, \u201cDigitalized signatures and public-key functions as intractable as factorization\u201d, Technical Report No.212, MIT, Laboratory of Computer Science, Cambridge, pp. 1\u201316, 1979."},{"key":"33_CR20","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"PKC 2002","author":"K. Sakurai","year":"2002","unstructured":"K. Sakurai and T. Takagi, \u201cNew semantically secure public-key cryptosystems from the RSA-primitive,\u201d PKC 2002, LNCS 2274, pp. 1\u201316, 2002."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45450-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T05:39:17Z","timestamp":1556429957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45450-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438618","9783540454502"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45450-0_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}