{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T04:10:12Z","timestamp":1749787812920,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319498058"},{"type":"electronic","value":"9783319498065"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49806-5_29","type":"book-chapter","created":{"date-parts":[[2016,11,23]],"date-time":"2016-11-23T12:34:29Z","timestamp":1479904469000},"page":"499-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reed-Muller Code Based Symmetric Key Fully Homomorphic Encryption Scheme"],"prefix":"10.1007","author":[{"given":"RatnaKumari","family":"Challa","sequence":"first","affiliation":[]},{"given":"VijayaKumari","family":"Gunta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,24]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22792-9_29"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-22792-9_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J-S Coron","year":"2011","unstructured":"Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 487\u2013504. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22792-9_28"},{"key":"29_CR3","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","year":"2010","unstructured":"Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13190-5_2"},{"key":"29_CR4","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, Kenneth, G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129\u2013148. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-20465-4_9"},{"key":"29_CR5","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":"NP 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. 6056, pp. 420\u2013443. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13013-7_25"},{"issue":"4","key":"29_CR6","first-page":"10","volume":"3","author":"YG Ramaiah","year":"2012","unstructured":"Ramaiah, Y.G., Kumari, G.V.: Towards practical homomorphic encryption with efficient public key generation. ACEEE Int. J. Netw. Secur. 3(4), 10 (2012)","journal-title":"ACEEE Int. J. Netw. Secur."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"29_CR8","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ITCS (2012). http:\/\/eprint.iacr.org\/2011\/277"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40041-4_5"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-25516-8_3","volume-title":"Cryptography and Coding","author":"F Armknecht","year":"2011","unstructured":"Armknecht, F., Augot, D., Perret, L., Sadeghi, A.-R.: On constructing homomorphic encryption schemes from coding theory. In: Chen, L. (ed.) IMACC 2011. LNCS, vol. 7089, pp. 23\u201340. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25516-8_3"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201988","author":"PJ Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of mceliece\u2019s public-key cryptosystem. In: Barstow, D., Brauer, W., Brinch Hansen, P., Gries, D., Luckham, D., Moler, C., Pnueli, A., Seegm\u00fcller, G., Stoer, J., Wirth, N., G\u00fcnther, C.G. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275\u2013280. Springer, Heidelberg (1988). doi: 10.1007\/3-540-45961-8_25"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-60693-9_24","volume-title":"Cryptography and Coding","author":"A Canteaut","year":"1995","unstructured":"Canteaut, A.: A new algorithm for finding minimum-weight words in large linear codes. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol. 1025, pp. 205\u2013212. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60693-9_24"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989). doi: 10.1007\/BFb0019850"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in 2n\/20: how 1\u2009+\u20091\u2009=\u20090 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29011-4_31"},{"key":"29_CR15","unstructured":"Bogdanov, A., Lee, C.H.: Homomorphic encryption from codes. IACR Cryptology ePrint Archive, Report 2011\/622 (2011). http:\/\/eprint.iacr.org\/"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Barak, B., Wigderson, A.: Public-key cryptography from different assumptions. In: STOC, pp. 171\u2013180 (2010)","DOI":"10.1145\/1806689.1806715"},{"issue":"4","key":"29_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s13389-011-0020-0","volume":"1","author":"F Strenzke","year":"2011","unstructured":"Strenzke, F.: Message-aimed side channel and fault attacks against public key cryptosystems with homomorphic properties. Cryptogr. Eng. 1(4), 283\u2013292 (2011)","journal-title":"Cryptogr. Eng."},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Shpilka, A.A., Wigderson, A.: Reed-Muller codes for random erasures and errors. In: Proceeding STOC 2015, pp. 297\u2013306. ACM (2015)","DOI":"10.1145\/2746539.2746575"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Zhao, C.-C., Yang, Y.L.-C.: The homomorphic properties of McEliecepublickey cryptosystem. In: Proceedings of IEEE ICMINS, pp. 39\u201342 (2012)","DOI":"10.1109\/MINES.2012.228"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme, Ph.D. Thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-38348-9_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"JH Cheon","year":"2013","unstructured":"Cheon, J.H., Coron, J.-S., Kim, J., Lee, M.S., Lepoint, T., Tibouchi, M., Yun, A.: Batch fully homomorphic encryption over the integers. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 315\u2013335. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38348-9_20"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Yung, M.: Cryptographic hardness based on the decoding of Reed-Solomon codes with applications. In: Electronic Colloquium on Computational Complexity (ECCC) (2002)","DOI":"10.1007\/3-540-45465-9_21"},{"issue":"3","key":"29_CR23","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"R Berlekamp","year":"1978","unstructured":"Berlekamp, R., McEliece, R.J., Tilborg, H.C.V.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theor. 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"29_CR24","first-page":"6","volume":"3","author":"DE Muller","year":"1954","unstructured":"Muller, D.E.: Application of boolean algebra to switching circuit design and to error detection. IRE Trans. Electron. Comput. 3, 6\u201312 (1954)","journal-title":"IRE Trans. Electron. Comput."},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/TIT.1954.1057465","volume":"4","author":"IS Reed","year":"1954","unstructured":"Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. Trans. IRE Prof. Gr. Inf. Theor. 4, 38\u201349 (1954)","journal-title":"Trans. IRE Prof. Gr. Inf. Theor."}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49806-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T20:41:52Z","timestamp":1749760912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49806-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319498058","9783319498065"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49806-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Systems Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jaipur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iciss2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iciss16.mnit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}