{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:11Z","timestamp":1772283671497,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T00:00:00Z","timestamp":1414972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["10047212"],"award-info":[{"award-number":["10047212"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE2013-T2-1-041"],"award-info":[{"award-number":["MOE2013-T2-1-041"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003662","name":"Korea Evaluation Institute of Industrial Technology","doi-asserted-by":"publisher","award":["10047212"],"award-info":[{"award-number":["10047212"]}],"id":[{"id":"10.13039\/501100003662","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,11,3]]},"DOI":"10.1145\/2660267.2660335","type":"proceedings-article","created":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T13:40:05Z","timestamp":1415713205000},"page":"287-298","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A New Additive Homomorphic Encryption based on the co-ACD Problem"],"prefix":"10.1145","author":[{"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyung Tae","family":"Lee","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jae Hong","family":"Seo","sequence":"additional","affiliation":[{"name":"Myongji University, Gyeonggi-do, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"N.\n      Baric\n     and \n      B.\n      Pfitzmann\n  . \n  Collision-freeaccumulators and fail-stop signature schemes without trees\n  . In W. Fumy editor EUROCRYPT \n  1997 volume \n  1233\n   of \n  LNCS pages \n  480\n  --\n  494\n  . \n  Springer 1997.   N. Baric and B. Pfitzmann. Collision-freeaccumulators and fail-stop signature schemes without trees. In W. Fumy editor EUROCRYPT 1997 volume 1233 of LNCS pages 480--494. Springer 1997.","DOI":"10.1007\/3-540-69053-0_33"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"F.\n      Boudot\n    .\n  Efficient proofs that a committed number lies in an interval\n  . In B. Preneel editor EUROCRYPT \n  2000 volume \n  1807\n   of \n  LNCS pages \n  431\n  --\n  444\n  . \n  Springer 2000.   F. Boudot. Efficient proofs that a committed number lies in an interval. In B. Preneel editor EUROCRYPT 2000 volume 1807 of LNCS pages 431--444. Springer 2000.","DOI":"10.1007\/3-540-45539-6_31"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"J.\n      Camenisch\n     and \n      M.\n      Michels\n  . \n  A group signature scheme with improved efficiency\n  . In K. Ohta and D. Pei editors ASIACRYPT \n  1998 volume \n  1514\n   of \n  LNCS pages \n  160\n  --\n  174\n  . \n  Springer 1998.   J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In K. Ohta and D. Pei editors ASIACRYPT 1998 volume 1514 of LNCS pages 160--174. Springer 1998.","DOI":"10.1007\/3-540-49649-1_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_30"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"J. H.\n      Cheon J.-S.\n      Coron J.\n      Kim M. S.\n      Lee T.\n      Lepoint M.\n      Tibouchi and \n      A.\n      Yun\n  . \n  Batch fully homomorphic encryption over the integers\n  . In T. Johansson and P. Q. Nguyen editors EUROCRYPT \n  2013 volume \n  7881\n   of \n  LNCS pages \n  315\n  --\n  335\n  . \n  Springer 2013.  J. H. Cheon J.-S. Coron J. Kim M. S. Lee T. Lepoint M. Tibouchi and A. Yun. Batch fully homomorphic encryption over the integers. In T. Johansson and P. Q. Nguyen editors EUROCRYPT 2013 volume 7881 of LNCS pages 315--335. Springer 2013.","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"e_1_3_2_1_10_1","volume-title":"Appeared in ICISC 2013","author":"Cheon J. H.","year":"2012","unstructured":"J. H. Cheon , H. Hong , and H. T. Lee . Invertible polynomial representation for private set operations. 2013 . Appeared in ICISC 2013 , Available at http:\/\/eprint.iacr.org\/ 2012 \/526. J. H. Cheon, H. Hong, and H. T. Lee. Invertible polynomial representation for private set operations. 2013. Appeared in ICISC 2013, Available at http:\/\/eprint.iacr.org\/2012\/526."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"H.\n      Cohn\n     and \n      N.\n      Heninger\n  . \n  Approximate common divisors via lattices\n  . In E. W. Howe and K. S. Kedlaya editors ANTS X volume \n  1\n   of \n  The Open Book Series pages \n  271\n  --\n  293\n  . \n  Mathematical Sciences Publishers 2013\n  .  H. Cohn and N. Heninger. Approximate common divisors via lattices. In E. W. Howe and K. S. Kedlaya editors ANTS X volume 1 of The Open Book Series pages 271--293. Mathematical Sciences Publishers 2013.","DOI":"10.2140\/obs.2013.1.271"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900030"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"J.-S.\n      Coron T.\n      Lepoint and \n      M.\n      Tibouchi\n  . \n  Practical multilinear maps over the integers\n  . In R. Canetti and J. A. Garay editors CRYPTO \n  2013\n   (1) volume \n  8042\n   of \n  LNCS pages \n  476\n  --\n  493\n  . \n  Springer 2013.  J.-S. Coron T. Lepoint and M. Tibouchi. Practical multilinear maps over the integers. In R. Canetti and J. A. Garay editors CRYPTO 2013 (1) volume 8042 of LNCS pages 476--493. Springer 2013.","DOI":"10.1007\/978-3-642-40041-4_26"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"J.-S.\n      Coron A.\n      Mandal D.\n      Naccache and \n      M.\n      Tibouchi\n  . \n  Fully homomorphic encryption over the integers with shorter public keys\n  . In P. Rogaway editor CRYPTO \n  2011 volume \n  6841\n   of \n  LNCS pages \n  487\n  --\n  504\n  . \n  Springer 2011.   J.-S. Coron A. Mandal D. Naccache and M. Tibouchi. Fully homomorphic encryption over the integers with shorter public keys. In P. Rogaway editor CRYPTO 2011 volume 6841 of LNCS pages 487--504. Springer 2011.","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"R.\n      Cramer I.\n      Damgard and \n      J. B.\n      Nielsen\n  . \n  Multiparty computation from threshold homomorphic encryption\n  . In B. Pfitzmann editor EUROCRYPT \n  2001 volume \n  2045\n   of \n  LNCS pages \n  280\n  --\n  299\n  . \n  Springer 2001.   R. Cramer I. Damgard and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In B. Pfitzmann editor EUROCRYPT 2001 volume 2045 of LNCS pages 280--299. Springer 2001.","DOI":"10.1007\/3-540-44987-6_18"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-010-0119-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"I.\n      Damg\u00e5rd\n     and \n      J. B.\n      Nielsen\n  . \n  Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor\n  . In M. Yung editor CRYPTO \n  2002 volume \n  2442\n   of \n  LNCS pages \n  581\n  --\n  596\n  . \n  Springer 2002.   I. Damg\u00e5rd and J. B. Nielsen. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In M. Yung editor CRYPTO 2002 volume 2442 of LNCS pages 581--596. Springer 2002.","DOI":"10.1007\/3-540-45708-9_37"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"I.\n      Damg\u00e5rd\n     and \n      J. B.\n      Nielsen\n  . \n  Universally composable efficient multiparty computation from threshold homomorphic encryption\n  . In D. Boneh editor CRYPTO \n  2003 volume \n  2729\n   of \n  LNCS pages \n  247\n  --\n  264\n  . \n  Springer 2003.  I. Damg\u00e5rd and J. B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In D. Boneh editor CRYPTO 2003 volume 2729 of LNCS pages 247--264. Springer 2003.","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"I.\n      Damg\u00e5rd\n     and \n      M.\n      Jurik\n  . \n  A generalisation a simplification and some applications of Paillier's probabilistic public-key system\n  . In K. Kim editor PKC \n  2001 volume \n  1992\n   of \n  LNCS pages \n  119\n  --\n  136\n  . \n  Springer 2001.   I. Damg\u00e5rd and M. Jurik. A generalisation a simplification and some applications of Paillier's probabilistic public-key system. In K. Kim editor PKC 2001 volume 1992 of LNCS pages 119--136. Springer 2001.","DOI":"10.1007\/3-540-44586-2_9"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","volume-title":"Sharing decryption in the context of voting or lotteries","author":"Fouque P.-A.","year":"2000","unstructured":"P.-A. Fouque , G. Poupard , and J. Stern . Sharing decryption in the context of voting or lotteries . In Y. Frankel, editor, FC 2000 , volume 1962 of LNCS . Springer , 2000. P.-A. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. In Y. Frankel, editor, FC 2000, volume 1962 of LNCS. Springer, 2000."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"M.\n      Freedman K.\n      Nissim and \n      B.\n      Pinkas\n  . \n  Efficient private matching and set-intersection\n  . In C. Cachin and J. Camenisch editors EUROCRYPT \n  2004 volume \n  3027\n   of \n  LNCS pages \n  1\n  --\n  19\n  . \n  Springer-Verlag 2004.  M. Freedman K. Nissim and B. Pinkas. Efficient private matching and set-intersection. In C. Cachin and J. Camenisch editors EUROCRYPT 2004 volume 3027 of LNCS pages 1--19. Springer-Verlag 2004.","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72738-5_16"},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","first-page":"16","volume-title":"B. S. K. Jr.","author":"Fujisaki E.","year":"1997","unstructured":"E. Fujisaki and T. Okamoto . Statistical zeroknowledge protocols to prove modular polynomial relations . In B. S. K. Jr. , editor, CRYPTO 1997 , volume 1294 of LNCS , pages 16 -- 30 . Springer , 1997. E. Fujisaki and T. Okamoto. Statistical zeroknowledge protocols to prove modular polynomial relations. In B. S. K. Jr., editor, CRYPTO 1997, volume 1294 of LNCS, pages 16--30. Springer, 1997."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2230462"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_26"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89255-7_25"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"N.\n      Howgrave-Graham\n    .\n  Approximate integer common divisors\n  . In J. H. Silverman editor CaLC \n  2001 volume \n  2146\n   of \n  LNCS pages \n  51\n  --\n  66\n  . \n  Springer 2001.   N. Howgrave-Graham. Approximate integer common divisors. In J. H. Silverman editor CaLC 2001 volume 2146 of LNCS pages 51--66. Springer 2001.","DOI":"10.1007\/3-540-44670-2_6"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_6"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"M.\n      Joye\n     and \n      B.\n      Libert\n  . \n  Efficient cryptosystems from 2 k -th power residue symbols\n  . In T. Johansson and P. Q. Nguyen editors EUROCRYPT \n  2013 volume \n  7881\n   of \n  LNCS pages \n  76\n  --\n  92\n  . \n  Springer 2013.  M. Joye and B. Libert. Efficient cryptosystems from 2 k -th power residue symbols. In T. Johansson and P. Q. Nguyen editors EUROCRYPT 2013 volume 7881 of LNCS pages 76--92. Springer 2013.","DOI":"10.1007\/978-3-642-38348-9_5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"C. A.\n      Melchor P.\n      Gaborit and \n      J.\n      Herranz\n  . \n  Additively homomorphic encryption with d-operand multiplications\n  . In T. Rabin editor CRYPTO \n  2010 volume \n  6223\n   of \n  LNCS pages \n  138\n  --\n  154\n  . \n  Springer 2010.   C. A. Melchor P. Gaborit and J. Herranz. Additively homomorphic encryption with d-operand multiplications. In T. Rabin editor CRYPTO 2010 volume 6223 of LNCS pages 138--154. Springer 2010.","DOI":"10.1007\/978-3-642-14623-7_8"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288106"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"P. Q.\n      Nguyen\n     and \n      J.\n      Stern\n  . \n  The two faces of lattices in cryptology\n  . In J. H. Silverman editor CaLC \n  2001 volume \n  2146\n   of \n  LNCS pages \n  146\n  --\n  180\n  . \n  Springer 2001.   P. Q. Nguyen and J. Stern. The two faces of lattices in cryptology. In J. H. Silverman editor CaLC 2001 volume 2146 of LNCS pages 146--180. Springer 2001.","DOI":"10.1007\/3-540-44670-2_12"},{"key":"e_1_3_2_1_38_1","volume-title":"Special Publication 800--57 Part 1 Rev","author":"NIST.","year":"2012","unstructured":"NIST. Recommendation for key management. Special Publication 800--57 Part 1 Rev . 3, July 2012 . NIST. Recommendation for key management. Special Publication 800--57 Part 1 Rev. 3, July 2012."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"T.\n      Okamoto\n     and \n      S.\n      Uchiyama\n  . \n  A new public-key cryptosystem as secure as factoring\n  . In K. Nyberg editor EUROCRYPT \n  1998 volume \n  1403\n   of \n  LNCS pages \n  308\n  --\n  318\n  . \n  Springer 1998.  T. Okamoto and S. Uchiyama. A new public-key cryptosystem as secure as factoring. In K. Nyberg editor EUROCRYPT 1998 volume 1403 of LNCS pages 308--318. Springer 1998.","DOI":"10.1007\/BFb0054135"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"R.\n      Ostrovsky\n     and \n      W. E. S.\n     III.\n  A survey of single-database private information retrieval: Techniques and applications\n  . In T. Okamoto and X. Wang editors PKC \n  2007 volume \n  4450\n   of \n  LNCS pages \n  393\n  --\n  411\n  . \n  Springer 2007.   R. Ostrovsky and W. E. S. III. A survey of single-database private information retrieval: Techniques and applications. In T. Okamoto and X. Wang editors PKC 2007 volume 4450 of LNCS pages 393--411. Springer 2007.","DOI":"10.1007\/978-3-540-71677-8_26"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"P.\n      Paillier\n    .\n  Public-key cryptosystems based on composite degree residuosity classes\n  . In J. Stern editor EUROCRYPT \n  1999 volume \n  1592\n   of \n  LNCS pages \n  223\n  --\n  238\n  . \n  Springer 1999.   P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In J. Stern editor EUROCRYPT 1999 volume 1592 of LNCS pages 223--238. Springer 1999.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"R.\n      Rothblum\n    . \n      Homomorphic\n     encryption\n  : \n  From private-key to public-key\n  . In Y. Ishai editor TCC \n  2011 volume \n  6597\n   of \n  LNCS pages \n  219\n  --\n  234\n  . \n  Springer 2011.   R. Rothblum. Homomorphic encryption: From private-key to public-key. In Y. Ishai editor TCC 2011 volume 6597 of LNCS pages 219--234. Springer 2011.","DOI":"10.1007\/978-3-642-19571-6_14"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_24"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167291"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374445"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"J.\n      van de Pol\n     and \n      N. P.\n      Smart\n  . \n  Estimating key sizes for high dimensional lattice-based systems\n  . In M. Stam editor IMACC \n  2013 volume \n  8308\n   of \n  LNCS pages \n  290\n  --\n  303\n  . \n  Springer 2013.  J. van de Pol and N. P. Smart. Estimating key sizes for high dimensional lattice-based systems. In M. Stam editor IMACC 2013 volume 8308 of LNCS pages 290--303. Springer 2013.","DOI":"10.1007\/978-3-642-45239-0_17"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"}],"event":{"name":"CCS'14: 2014 ACM SIGSAC Conference on Computer and Communications Security","location":"Scottsdale Arizona USA","acronym":"CCS'14","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660267.2660335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:10Z","timestamp":1750229770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,3]]},"references-count":45,"alternative-id":["10.1145\/2660267.2660335","10.1145\/2660267"],"URL":"https:\/\/doi.org\/10.1145\/2660267.2660335","relation":{},"subject":[],"published":{"date-parts":[[2014,11,3]]},"assertion":[{"value":"2014-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}