{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:08Z","timestamp":1750221308402,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,22]],"date-time":"2017-10-22T00:00:00Z","timestamp":1508630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,22]]},"DOI":"10.1145\/3145777.3145789","type":"proceedings-article","created":{"date-parts":[[2017,12,6]],"date-time":"2017-12-06T21:25:26Z","timestamp":1512595526000},"page":"66-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Homomorphic encryption supporting logical operations"],"prefix":"10.1145","author":[{"given":"Yi-Fan","family":"Tseng","sequence":"first","affiliation":[{"name":"National Sun Yat-sen University, Kaohsiung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-I","family":"Fan","sequence":"additional","affiliation":[{"name":"National Sun Yat-sen University, Kaohsiung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting-Chuan","family":"Kung","sequence":"additional","affiliation":[{"name":"National Sun Yat-sen University, Kaohsiung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jheng-Jia","family":"Huang","sequence":"additional","affiliation":[{"name":"National Sun Yat-sen University, Kaohsiung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsin-Nan","family":"Kuo","sequence":"additional","affiliation":[{"name":"National Sun Yat-sen University, Kaohsiung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Yi X. Paulet R. and Bertino E. 2014. Russell Paulet and Elisa Bertino. Homomorphic encryption and applications. Springer.   Yi X. Paulet R. and Bertino E. 2014. Russell Paulet and Elisa Bertino. Homomorphic encryption and applications. Springer.","DOI":"10.1007\/978-3-319-12229-8"},{"key":"e_1_3_2_1_2_1","unstructured":"Benaloh J. D. C. 1987. Verifiable secret-ballot elections.  Benaloh J. D. C. 1987. Verifiable secret-ballot elections."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Cohen J. D. and Fischer M. J. 1985. A robust and verifiable cryptographically secure election scheme. Yale University. Department of Computer Science.  Cohen J. D. and Fischer M. J. 1985. A robust and verifiable cryptographically secure election scheme. Yale University. Department of Computer Science.","DOI":"10.1109\/SFCS.1985.2"},{"volume-title":"International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 72--83","author":"Cramer R.","key":"e_1_3_2_1_4_1","unstructured":"Cramer , R. , Franklin , M. , Schoenmakers , B. , and Yung , M . 1996. Multiauthority secret-ballot elections with linear work . In International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 72--83 . Cramer, R., Franklin, M., Schoenmakers, B., and Yung, M. 1996. Multiauthority secret-ballot elections with linear work. In International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 72--83."},{"key":"e_1_3_2_1_5_1","first-page":"5","article-title":"A secure and optimally efficient multi-authority election scheme","volume":"8","author":"Cramer R.","year":"1997","unstructured":"Cramer , R. , Gennaro , R. , and Schoenmakers , B. 1997 . A secure and optimally efficient multi-authority election scheme . Transactions on Emerging Telecommunications Technologies. 8 , 5 (Sep. 1997), 481--190. Cramer, R., Gennaro, R., and Schoenmakers, B. 1997. A secure and optimally efficient multi-authority election scheme. Transactions on Emerging Telecommunications Technologies. 8, 5 (Sep. 1997), 481--190.","journal-title":"Transactions on Emerging Telecommunications Technologies."},{"volume-title":"Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on. IEEE, 364--373","author":"Kushilevitz E.","key":"e_1_3_2_1_6_1","unstructured":"Kushilevitz , E. , and Ostrovsky , R . 1997. Replication is not needed: Single database, computationally-private information retrieval . In Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on. IEEE, 364--373 . Kushilevitz, E., and Ostrovsky, R. 1997. Replication is not needed: Single database, computationally-private information retrieval. In Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on. IEEE, 364--373."},{"volume-title":"International conference on the theory and applications of cryptographic techniques. Springer, 1--19","author":"Freedman M. J","key":"e_1_3_2_1_7_1","unstructured":"Freedman , M. J , Nissim , K. , and Pinkas , B . 2004. Efficient private matching and set intersection . In International conference on the theory and applications of cryptographic techniques. Springer, 1--19 . Freedman, M. J, Nissim, K., and Pinkas, B. 2004. Efficient private matching and set intersection. In International conference on the theory and applications of cryptographic techniques. Springer, 1--19."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756146"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802212"},{"volume-title":"Analysis of partially and fully homomorphic encryption","author":"Morris L.","key":"e_1_3_2_1_12_1","unstructured":"Morris , L. 2013. Analysis of partially and fully homomorphic encryption . Rochester Institute of Technology . New York, 1 -- 5. Morris, L. 2013. Analysis of partially and fully homomorphic encryption. Rochester Institute of Technology. New York, 1 -- 5."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"}],"event":{"name":"ICTCE 2017: 2017 International Conference on Telecommunications and Communication Engineering","acronym":"ICTCE 2017","location":"Osaka Japan"},"container-title":["Proceedings of the 2017 International Conference on Telecommunications and Communication Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3145777.3145789","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3145777.3145789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:32Z","timestamp":1750212812000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3145777.3145789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,22]]},"references-count":14,"alternative-id":["10.1145\/3145777.3145789","10.1145\/3145777"],"URL":"https:\/\/doi.org\/10.1145\/3145777.3145789","relation":{},"subject":[],"published":{"date-parts":[[2017,10,22]]},"assertion":[{"value":"2017-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}