{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:18:53Z","timestamp":1766269133851,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642146220"},{"type":"electronic","value":"9783642146237"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_8","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T08:15:26Z","timestamp":1281428126000},"page":"138-154","source":"Crossref","is-referenced-by-count":37,"title":["Additively Homomorphic Encryption with d-Operand Multiplications"],"prefix":"10.1007","author":[{"given":"Carlos Aguilar","family":"Melchor","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Herranz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.1109\/ISIT.2008.4595310","volume-title":"The 2008 IEEE International Symposium on Information Theory (ISIT 2008), Toronto, Ontario, Canada","author":"C. Aguilar Melchor","year":"2008","unstructured":"Aguilar Melchor, C., Castagnos, G., Gaborit, P.: Lattice-based homomorphic encryption of vector spaces. In: The 2008 IEEE International Symposium on Information Theory (ISIT 2008), Toronto, Ontario, Canada, pp. 1858\u20131862. IEEE Computer Society Press, Los Alamitos (2008)"},{"unstructured":"Aguilar Melchor, C., Gaborit, P., Herranz, J.: Additively homomorphic encryption with d-operand multiplications. Cryptology ePrint Archive, Report 2008\/378 (2008), http:\/\/eprint.iacr.org\/","key":"8_CR2"},{"key":"8_CR3","first-page":"94","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA","author":"M. Ajtai","year":"2005","unstructured":"Ajtai, M.: Representing hard lattices with O(n log n) bits. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, pp. 94\u2013103. ACM, New York (2005)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D.A.M. Barrington","year":"1989","unstructured":"Barrington, D.A.M.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci.\u00a038(1), 150\u2013164 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"issue":"3","key":"8_CR6","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ipl.2005.09.016","volume":"97","author":"J.H. Cheon","year":"2006","unstructured":"Cheon, J.H., Kim, W.H., Nam, H.S.: Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme. Inf. Process. Lett.\u00a097(3), 118\u2013123 (2006)","journal-title":"Inf. Process. Lett."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1515\/jmc.2007.017","volume":"1","author":"S.J. Choi","year":"2007","unstructured":"Choi, S.J., Blackburn, S.R., Wild, P.R.: Cryptanalysis of a homomorphic public-key cryptosystem over a finite group. J. Math. Cryptography\u00a01, 351\u2013358 (2007)","journal-title":"J. Math. Cryptography"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"EUROCRYPT 2010","author":"M. Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010, French Riviera. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(96)00170-6","volume":"60","author":"J. Domingo-Ferrer","year":"1996","unstructured":"Domingo-Ferrer, J.: A new privacy homomorphism and applications. Information Processing Letters\u00a060(5), 277\u2013282 (1996)","journal-title":"Information Processing Letters"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-45811-5_37","volume-title":"Information Security","author":"J. Domingo-Ferrer","year":"2002","unstructured":"Domingo-Ferrer, J.: A provably secure additive and multiplicative privacy homomorphism. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol.\u00a02433, pp. 471\u2013483. Springer, Heidelberg (2002)"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Fellows, M., Koblitz, N.: Combinatorial cryptosystems galore! In: Finite Fields: Theory, Applications, and Algorithms, Las Vegas, NV (1993). Contemp. Math., Amer. Math. Soc, vol.\u00a0168, pp. 51\u201361 (1994)","key":"8_CR12","DOI":"10.1090\/conm\/168\/01688"},{"key":"8_CR13","first-page":"169","volume-title":"Proceedings of STOC 2009","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of STOC 2009, pp. 169\u2013178. ACM Press, New York (2009)"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009), http:\/\/crypto.stanford.edu\/craig","key":"8_CR14","DOI":"10.1145\/1536414.1536440"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-642-13190-5_26","volume-title":"EUROCRYPT 2010","author":"C. Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: A simple BGN-type cryptosystem from LWE. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 506\u2013522. Springer, Heidelberg (2010)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BFb0052230","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Eliminating decryption errors in the Ajtai-Dwork cryptosystem. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 105\u2013111. Springer, Heidelberg (1997)"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00200-006-0005-x","volume":"17","author":"D. Grigoriev","year":"2006","unstructured":"Grigoriev, D., Ponomarenko, I.: Homomorphic public-key cryptosystems and encrypting boolean circuits. Applicable Algebra in Engineering, Communication and Computing\u00a017(3), 239\u2013255 (2006)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70936-7_31","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2007","unstructured":"Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 575\u2013594. Springer, Heidelberg (2007)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-71677-8_21","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"A. Kawachi","year":"2007","unstructured":"Kawachi, A., Tanaka, K., Xagawa, K.: Multi-bit cryptosystems based on lattice problems. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 315\u2013329. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval (extended abstract). In: FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 364\u2013373 (1997)","key":"8_CR21","DOI":"10.1109\/SFCS.1997.646125"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-03356-8_34","volume-title":"CRYPTO 2009","author":"V. Lyubashevsky","year":"2009","unstructured":"Lyubashevsky, V., Micciancio, D.: On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 577\u2013594. Springer, Heidelberg (2009)"},{"unstructured":"Mahajan, M.: Polynomial size log depth circuits: between NC 1 and AC 1. BEATCS: Bulletin of the European Association for Theoretical Computer Science\u00a091 (2007)","key":"8_CR23"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post Quantum Cryptography","author":"D. Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-Based Cryptography. In: Post Quantum Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009)"},{"issue":"4","key":"8_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00145-007-0565-3","volume":"20","author":"R. Ostrovsky","year":"2007","unstructured":"Ostrovsky, R., Skeith III, W.E.: Private searching on streaming data. J. Cryptology\u00a020(4), 397\u2013430 (2007)","journal-title":"J. Cryptology"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"8_CR27","first-page":"333","volume-title":"Proceedings of STOC 2009","author":"C. Peikert","year":"2009","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of STOC 2009, pp. 333\u2013342. ACM Press, New York (2009)"},{"issue":"6","key":"8_CR28","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O. Regev","year":"2004","unstructured":"Regev, O.: New lattice based cryptographic constructions. Journal of the ACM\u00a051(6), 899\u2013942 (2004)","journal-title":"Journal of the ACM"},{"issue":"6","key":"8_CR29","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O. Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM\u00a056(6), 34 (2009)","journal-title":"Journal of the ACM"},{"key":"8_CR30","first-page":"169","volume-title":"Foundations of Secure Computation","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169\u2013180. Academic Press, London (1978)"},{"issue":"2","key":"8_CR31","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"8_CR32","first-page":"554","volume-title":"Proceedings of the 40th Symposium on Foundations of Computer Science (FOCS)","author":"T. Sander","year":"1999","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive CryptoComputing for NC 1. In: Proceedings of the 40th Symposium on Foundations of Computer Science (FOCS), pp. 554\u2013567. IEEE Computer Society Press, New York (1999)"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"PKC 2010","author":"N. Smart","year":"2010","unstructured":"Smart, N., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 420\u2013443. Springer, Heidelberg (2010)"},{"issue":"11","key":"8_CR34","doi-asserted-by":"publisher","first-page":"2990","DOI":"10.1109\/TIT.2002.804112","volume":"48","author":"R. Steinwandt","year":"2002","unstructured":"Steinwandt, R., Geiselmann, W.: Cryptanalysis of Polly Cracker. IEEE Transactions on Information Theory\u00a048(11), 2990\u20132991 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/10958513_18","volume-title":"Information Security","author":"D. Wagner","year":"2003","unstructured":"Wagner, D.: Cryptanalysis of an algebraic privacy homomorphism. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol.\u00a02851, pp. 234\u2013239. Springer, Heidelberg (2003)"},{"key":"8_CR36","first-page":"162","volume-title":"27th Annual Symposium on Foundations of Computer Science, Toronto, Ontario, Canada","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Ontario, Canada, pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T01:24:17Z","timestamp":1740360257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}