{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:59Z","timestamp":1750306439787,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T00:00:00Z","timestamp":1441670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["15-07-00597-a"],"award-info":[{"award-number":["15-07-00597-a"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,9,8]]},"DOI":"10.1145\/2799979.2800038","type":"proceedings-article","created":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T19:31:27Z","timestamp":1442950287000},"page":"80-83","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Cryptanalysis of factoring-based fully homomorphic encryption"],"prefix":"10.1145","author":[{"given":"Ludmila","family":"Babenko","sequence":"first","affiliation":[{"name":"Southern Federal University, Taganrog, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alina","family":"Trepacheva","sequence":"additional","affiliation":[{"name":"Southern Federal University, Taganrog, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,9,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/0025570X.2007.11953481"},{"key":"e_1_3_2_1_3_1","first-page":"637","volume":"2012","author":"Kipnis A.","year":"2012","unstructured":"A. Kipnis and E. Hibshoosh . Efficient methods for practical fully homomorphic symmetric-key encrypton, randomization and verification. IACR Cryptology ePrint Archive , 2012 : 637 , 2012 . A. Kipnis and E. Hibshoosh. Efficient methods for practical fully homomorphic symmetric-key encrypton, randomization and verification. IACR Cryptology ePrint Archive, 2012:637, 2012.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_4_1","volume-title":"Secure evaluation of polynomial using privacy ring homomorphisms. IACR Cryptology ePrint Archive","author":"Rostovtsev A.","year":"2011","unstructured":"A. Rostovtsev , A. Bogdanov , and M. Mikhaylov . Secure evaluation of polynomial using privacy ring homomorphisms. IACR Cryptology ePrint Archive , 2011 : 24, 2011. A. Rostovtsev, A. Bogdanov, and M. Mikhaylov. Secure evaluation of polynomial using privacy ring homomorphisms. IACR Cryptology ePrint Archive, 2011:24, 2011."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.15439\/2014F43"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of 4th Workshop on Current Trends in Cryptology CTCrypt15","author":"Trepacheva A.","year":"2015","unstructured":"A. Trepacheva . Known plaintext attack on a fully homomorphic cryptosystem based on factorization . In Proceedings of 4th Workshop on Current Trends in Cryptology CTCrypt15 , 2015 . A. Trepacheva. Known plaintext attack on a fully homomorphic cryptosystem based on factorization. In Proceedings of 4th Workshop on Current Trends in Cryptology CTCrypt15, 2015."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2659651.2659692"},{"key":"e_1_3_2_1_8_1","unstructured":"B. Van der Varden. Algebra (algebra) 1979.  B. Van der Varden. Algebra (algebra) 1979."},{"key":"e_1_3_2_1_9_1","volume-title":"Central European Crypto Conference, number EPFL-CONF-198992","author":"Viz\u00e1r D.","year":"2014","unstructured":"D. Viz\u00e1r and S. Vaudenay . Analysis of chosen symmetric homomorphic schemes . In Central European Crypto Conference, number EPFL-CONF-198992 , 2014 . D. Viz\u00e1r and S. Vaudenay. Analysis of chosen symmetric homomorphic schemes. In Central European Crypto Conference, number EPFL-CONF-198992, 2014."},{"key":"e_1_3_2_1_10_1","first-page":"193","volume":"2012","author":"Xiao L.","year":"2012","unstructured":"L. Xiao , O. Bastani , and I.-L. Yen . An efficient homomorphic encryption protocol for multi-user systems. IACR Cryptology e Print Archive , 2012 : 193 , 2012 . L. Xiao, O. Bastani, and I.-L. Yen. An efficient homomorphic encryption protocol for multi-user systems. IACR Cryptology ePrint Archive, 2012:193, 2012.","journal-title":"Print Archive"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/WorldCIS.2013.6751020"}],"event":{"name":"SIN '15: The 8th International Conference on Security of Information and Networks","acronym":"SIN '15","location":"Sochi Russia"},"container-title":["Proceedings of the 8th International Conference on Security of Information and Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2799979.2800038","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2799979.2800038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:42:43Z","timestamp":1750225363000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2799979.2800038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,8]]},"references-count":10,"alternative-id":["10.1145\/2799979.2800038","10.1145\/2799979"],"URL":"https:\/\/doi.org\/10.1145\/2799979.2800038","relation":{},"subject":[],"published":{"date-parts":[[2015,9,8]]},"assertion":[{"value":"2015-09-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}