{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:39Z","timestamp":1772283579548,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642255151","type":"print"},{"value":"9783642255168","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25516-8_3","type":"book-chapter","created":{"date-parts":[[2011,12,7]],"date-time":"2011-12-07T01:16:07Z","timestamp":1323220567000},"page":"23-40","source":"Crossref","is-referenced-by-count":10,"title":["On Constructing Homomorphic Encryption Schemes from Coding Theory"],"prefix":"10.1007","author":[{"given":"Frederik","family":"Armknecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Augot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Augot, D., Perret, L., Sadeghi, A.-R.: On constructing homomorphic encryption schemes from coding theory. Eprint Report, 309 (2011)","DOI":"10.1007\/978-3-642-25516-8_3"},{"key":"3_CR2","unstructured":"Armknecht, F., Peter, A., Katzenbeisser, S.: A cleaner view on IND-CCA1 secure homomorphic encryption using SOAP. Cryptology ePrint Archive, Report 2010\/501 (2010), http:\/\/eprint.iacr.org\/"},{"key":"3_CR3","unstructured":"Avanzi, R.: Lightweight asymmetric cryptography and alternatives to RSA, ecrypt european network of excellence in cryptology ist-2002-507932 (2005), http:\/\/www.ecrypt.eu.org\/ecrypt1\/documents\/D.AZTEC.2-1.2.pdf"},{"key":"3_CR4","unstructured":"Benaloh, J.: Verifiable secret-ballot elections. PhD thesis, Yale University, New Haven, CT, USA (1987)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68697-5_22","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Lipton, R.J.: Algorithms for Black-box Fields and their Application to Cryptography (extended abstract). In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 283\u2013297. Springer, Heidelberg (1996)"},{"key":"#cr-split#-3_CR6.1","doi-asserted-by":"crossref","unstructured":"Boneh, D., Freeman, D.M.: Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. Cryptology ePrint Archive, Report 2010\/453 (2010);","DOI":"10.1007\/978-3-642-19379-8_1"},{"key":"#cr-split#-3_CR6.2","unstructured":"Accepted to PKC 2011"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-20465-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D. Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.M.: Homomorphic Signatures for Polynomial Functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 149\u2013168. Springer, Heidelberg (2011)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-85174-5_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D. Boneh","year":"2008","unstructured":"Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-Secure Encryption from Decision Diffie-hellman. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 108\u2013125. Springer, Heidelberg (2008)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H. Chen","year":"2006","unstructured":"Chen, H., Cramer, R.: Algebraic Geometric Secret Sharing Schemes and Secure Multi-party Computations over Small Fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 521\u2013536. Springer, Heidelberg (2006)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-78967-3_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"H. Chen","year":"2008","unstructured":"Chen, H., Cramer, R., de Haan, R., Pueyo, I.C.: Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 451\u2013470. Springer, Heidelberg (2008)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Cluzeau, M., Finiasz, M., Tillich, J.-P.: Methods for the reconstruction of parallel turbo codes. CoRR, abs\/1006.0259 (2010)","DOI":"10.1109\/ISIT.2010.5513365"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, J., Fischer, M.: A robust and verifiable cryptographically secure election scheme (extended abstract). In: FOCS, pp. 372\u2013382. IEEE (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Multiparty Computation from Threshold Homomorphic Encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013299. Springer, Heidelberg (2001)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Cramer, R., Franklin, M., Schoenmakers, L., Yung, M.: Multi-authority secret-ballot elections with linear work. Technical report, CWI (Centre for Mathematics and Computer Science), Amsterdam, The Netherlands (1995)","DOI":"10.1007\/3-540-68339-9_7"},{"issue":"5","key":"3_CR15","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/ett.4460080506","volume":"8","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. European Transactions on Telecommunications\u00a08(5), 481\u2013490 (1997)","journal-title":"European Transactions on Telecommunications"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-20465-4_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"R. Cramer","year":"2011","unstructured":"Cramer, R.: The Arithmetic Codex: Theory and Applications. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, p. 1. Springer, Heidelberg (2011)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damgaard","year":"2001","unstructured":"Damgaard, I., Jurik, M.: A Generalisation, a Simplification and some Applications of Paillier\u2019s Probabilistic Public-key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1090\/conm\/168\/01688","volume":"168","author":"M. Fellows","year":"1993","unstructured":"Fellows, M., Koblitz, N.: Combinatorial cryptosystems galore! Contemporary Mathematics\u00a0168, 51\u201361 (1993)","journal-title":"Contemporary Mathematics"},{"issue":"4","key":"3_CR19","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"El Gamal, 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"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009), crypto.stanford.edu\/craig","DOI":"10.1145\/1536414.1536440"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) STOC, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-20465-4_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"C. Gentry","year":"2011","unstructured":"Gentry, C., Halevi, S.: Implementing Gentry\u2019s Fully-Homomorphic Encryption Scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 129\u2013148. Springer, Heidelberg (2011)"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: i-hop homomorphic encryption and rerandomizable yao circuits. In: Rabin [36], pp. 155\u2013172","DOI":"10.1007\/978-3-642-14623-7_9"},{"key":"3_CR24","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, 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03356-8_2","volume-title":"Advances in Cryptology - CRYPTO 2009","year":"2009","unstructured":"Halevi, S. (ed.): CRYPTO 2009. LNCS, vol.\u00a05677, pp. 18\u201335. Springer, Heidelberg (2009)"},{"key":"3_CR26","unstructured":"H\u00f8oholdt, T., van Lint, J.H., Pellikaan, R.: Algebraic geometry codes. In: Handbook of Coding Theory, vol.\u00a0I, pp. 871\u2013961. Elsevier (1998)"},{"key":"3_CR27","unstructured":"Kiayias, A., Yung, M.: Cryptographic hardness based on the decoding of Reed-Solomon codes. Cryptology ePrint Archive, Report 2007\/153 (2007), http:\/\/eprint.iacr.org\/"},{"key":"3_CR28","first-page":"364","volume-title":"FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997)","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), p. 364. IEEE Computer Society, Washington, DC, USA (1997)"},{"key":"3_CR29","unstructured":"Macwilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Mathematical Library. North Holland (1983)"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Melchor, C.A., Gaborit, P., Herranz, J.: Additively homomorphic encryption with -operand multiplications. In: Rabin [36], pp. 138\u2013154","DOI":"10.1007\/978-3-642-14623-7_8"},{"issue":"5","key":"3_CR31","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M. Naor","year":"2006","unstructured":"Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput.\u00a035(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput."},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","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":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-540-70583-3_54","volume-title":"Automata, Languages and Programming","author":"M. Prabhakaran","year":"2008","unstructured":"Prabhakaran, M., Rosulek, M.: Homomorphic Encryption with CCA Security. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 667\u2013678. Springer, Heidelberg (2008)"},{"key":"3_CR34","unstructured":"Pueyo, I.C., Chen, H., Cramer, R., Xing, C.: Asymptotically good ideal linear secret sharing with strong multiplication over ny fixed finite field. In: Halevi [25], pp. 466\u2013486"},{"key":"3_CR35","unstructured":"Pueyo, I.C., Cramer, R., Xing, C.: The torsion-limit for algebraic function fields and its application to arithmetic secret sharing. In: Halevi [25], pp. 466\u2013486"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-14623-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","year":"2010","unstructured":"Rabin, T. (ed.): CRYPTO 2010. LNCS, vol.\u00a06223, pp. 59\u201379. Springer, Heidelberg (2010)"},{"key":"3_CR37","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":"Public Key Cryptography \u2013 PKC 2010","author":"N.P. Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 420\u2013443. Springer, Heidelberg (2010)"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-17373-8_22","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"D. Stehl\u00e9","year":"2010","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Faster Fully Homomorphic Encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 377\u2013394. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"3_CR39","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(00)00353-X","volume":"111","author":"A. Valembois","year":"2001","unstructured":"Valembois, A.: Detection and recognition of a binary linear code. Discrete Applied Mathematics\u00a0111(1-2), 199\u2013218 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR40","unstructured":"Valembois, A.: D\u00e9codage, D\u00e9tection et Reconnaissance des Codes Lin\u00e9aires Binaires. PhD thesis, Universit\u00e9 Limoges (2004)"},{"key":"3_CR41","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":"Advances in Cryptology \u2013 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. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25516-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T01:11:03Z","timestamp":1742001063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25516-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255151","9783642255168"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25516-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}