{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T05:25:30Z","timestamp":1738819530591,"version":"3.37.0"},"reference-count":14,"publisher":"Academy Publisher","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JNW"],"DOI":"10.4304\/jnw.9.6.1464-1470","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T02:59:48Z","timestamp":1402369188000},"source":"Crossref","is-referenced-by-count":0,"title":["A Weakly Homomorphic Encryption with LDN"],"prefix":"10.4304","volume":"9","author":[{"given":"Chao","family":"Feng","sequence":"first","affiliation":[]},{"given":"Yang","family":"Xin","sequence":"additional","affiliation":[]},{"given":"Hongliang","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Yixian","family":"Yang","sequence":"additional","affiliation":[]}],"member":"2838","published-online":{"date-parts":[[2014,6,9]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref3","first-page":"169","article-title":"On data banks and privacy homomorphisms","volume-title":"Foundations of Secure Computation","author":"Rivest","year":"1978","unstructured":"[3] R. L. Rivest, L. Adleman, and M. L. Dertouzos, \"On data banks and privacy homomorphisms\", In Foundations of Secure Computation, Academic Press, pp. 169-180, 1978."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"ref5","first-page":"169","article-title":"Fully homomorphic encryption using ideal lattices","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"Gentry","year":"2009","unstructured":"[5] C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA, pp. 169-178, 2009."},{"key":"ref6","first-page":"420","article-title":"Fully homomorphic encryption with relatively small key and ciphertext sizes.","volume-title":"Proceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography","author":"Smart","year":"2010","unstructured":"[7] N. P. Smart, F. Vercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. Proceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, pp. 420\u2013443, 2010."},{"key":"ref7","first-page":"377","article-title":"Faster fully homomorphic encryption.","volume-title":"Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security","author":"Stehle","year":"2010","unstructured":"[8] D. Stehle and R. Steinfeld, Faster fully homomorphic encryption. Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security, December 5-9, 2010, Singapore, pp. 377-394, 2010."},{"key":"ref8","first-page":"24","article-title":"Fully homomorphic encryption over the integers.","volume-title":"Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques French Riviera","author":"van Dijk","year":"2010","unstructured":"[9] M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, Fully homomorphic encryption over the integers. Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, pp. 24\u201343, 2010."},{"key":"ref9","first-page":"487","article-title":"Fully homomorphic encryption over the integers with shorter public keys.","volume-title":"Proceedings of the 31st Annual Cryptology Conference","author":"Coron","year":"2011","unstructured":"[10] J. S. Coron, A. Mandal, D. Naccache, and M. Tibouchi, Fully homomorphic encryption over the integers with shorter public keys. Proceedings of the 31st Annual Cryptology Conference, Santa Barbara, CA, USA, pp. 487-504, 2011."},{"key":"ref10","first-page":"446","article-title":"Public key compression and modulus switching for fully homomorphic encryption over the integers.","volume-title":"Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Coron","year":"2012","unstructured":"[11] J. S. Coron, D. Naccache, and M. Tibouchi, Public key compression and modulus switching for fully homomorphic encryption over the integers. Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, pp. 446-464. Springer, 2012."},{"key":"ref11","first-page":"315","article-title":"Batch Fully Homomorphic Encryption over the Integers.","volume-title":"Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Coron","year":"2013","unstructured":"[12] J. S. Coron, D. Naccache, and M. Tibouchi, Batch Fully Homomorphic Encryption over the Integers. Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, pp. 315-335, 2013."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"ref13","first-page":"868","article-title":"Fully homomorphic encryption without modulus switching from classical gapsvp.","volume-title":"Proceedings of the 32nd Annual Cryptology Conference","author":"Brakerski","year":"2012","unstructured":"[14] Z. Brakerski, Fully homomorphic encryption without modulus switching from classical gapsvp. Proceedings of the 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, pp. 868-886, 2012."},{"key":"ref14","first-page":"1","article-title":"On ideal lattices and learning with errors over rings.","volume-title":"Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques French Riviera","author":"Lyubashevsky","year":"2010","unstructured":"[15] Vadim Lyubashevsky, Chris Peikert, and Oded Regev, On ideal lattices and learning with errors over rings. Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, pp. 1-23, 2010."}],"container-title":["Journal of Networks"],"original-title":[],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:06:28Z","timestamp":1738775188000},"score":1,"resource":{"primary":{"URL":"https:\/\/dblp.org\/db\/journals\/jnw\/index.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,9]]},"references-count":14,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2014,6,9]]}},"URL":"https:\/\/doi.org\/10.4304\/jnw.9.6.1464-1470","relation":{},"ISSN":["1796-2056"],"issn-type":[{"type":"print","value":"1796-2056"}],"subject":[],"published":{"date-parts":[[2014,6,9]]}}}