{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:33:11Z","timestamp":1753601591514,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319566139"},{"type":"electronic","value":"9783319566146"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-56614-6_18","type":"book-chapter","created":{"date-parts":[[2017,3,30]],"date-time":"2017-03-30T22:31:20Z","timestamp":1490913080000},"page":"528-557","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption"],"prefix":"10.1007","author":[{"given":"Rishab","family":"Goyal","sequence":"first","affiliation":[]},{"given":"Venkata","family":"Koppula","sequence":"additional","affiliation":[]},{"given":"Brent","family":"Waters","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,1]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-13190-5_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"T Acar","year":"2010","unstructured":"Acar, T., Belenkiy, M., Bellare, M., Cash, D.: Cryptographic agility and its relation to circular encryption. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 403\u2013422. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-13190-5_21"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"737","DOI":"10.3233\/JCS-2009-0358","volume":"17","author":"P Ad\u00e3o","year":"2009","unstructured":"Ad\u00e3o, P., Bana, G., Herzog, J., Scedrov, A.: Soundness and completeness of formal encryption: the cases of key cycles and partial information leakage. J. Comput. Secur. 17, 737\u2013797 (2009)","journal-title":"J. Comput. Secur."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-662-53008-5_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"N Alamati","year":"2016","unstructured":"Alamati, N., Peikert, C.: Three\u2019s compromised too: circular insecurity for any cycle length from (ring-)LWE. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 659\u2013680. Springer, Heidelberg (2016). doi:\n                      10.1007\/978-3-662-53008-5_23"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-30057-8_20","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"J Alperin-Sheriff","year":"2012","unstructured":"Alperin-Sheriff, J., Peikert, C.: Circular and KDM security for identity-based encryption. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 334\u2013352. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-30057-8_20"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-20465-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"B Applebaum","year":"2011","unstructured":"Applebaum, B.: Key-dependent message security: generic amplification and completeness. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 527\u2013546. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-20465-4_29"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595\u2013618. Springer, Heidelberg (2009). doi:\n                      10.1007\/978-3-642-03356-8_35"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-29011-4_42"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-13190-5_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"B Barak","year":"2010","unstructured":"Barak, B., Haitner, I., Hofheinz, D., Ishai, Y.: Bounded key-dependent message security. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 423\u2013444. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-13190-5_22"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in \n                      \n                        \n                      \n                      $$NC^{1}$$\n                    . In: STOC 1986 (1986)","DOI":"10.1145\/12130.12131"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/978-3-662-48800-3_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Bishop","year":"2015","unstructured":"Bishop, A., Hohenberger, S., Waters, B.: New circular security counterexamples from decision linear and learning with errors. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 776\u2013800. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-48800-3_32"},{"key":"18_CR11","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. 5157, pp. 108\u2013125. Springer, Heidelberg (2008). doi:\n                      10.1007\/978-3-540-85174-5_7"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1137\/0215040","volume":"15","author":"A Borodin","year":"1986","unstructured":"Borodin, A., Dolev, D., Fich, F.E., Paul, W.J.: Bounds for width two branching programs. SIAM J. Comput. 15(2), 549\u2013560 (1986)","journal-title":"SIAM J. Comput."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14623-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"Z Brakerski","year":"2010","unstructured":"Brakerski, Z., Goldwasser, S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 1\u201320. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-14623-7_1"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-19571-6_13","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Goldwasser, S., Kalai, Y.T.: Black-box circular-secure encryption beyond affine functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 201\u2013218. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-19571-6_13"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: STOC 2013 (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"J Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93\u2013118. Springer, Heidelberg (2001). doi:\n                      10.1007\/3-540-44987-6_7"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/978-3-642-30057-8_32","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"D Cash","year":"2012","unstructured":"Cash, D., Green, M., Hohenberger, S.: New definitions and separations for circular security. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 540\u2013557. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-30057-8_32"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46800-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"JH Cheon","year":"2015","unstructured":"Cheon, J.H., Han, K., Lee, C., Ryu, H., Stehl\u00e9, D.: Cryptanalysis of the multilinear map over the integers. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 3\u201312. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-46800-5_1"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-662-47989-6_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"J-S Coron","year":"2015","unstructured":"Coron, J.-S., Gentry, C., Halevi, S., Lepoint, T., Maji, H.K., Miles, E., Raykova, M., Sahai, A., Tibouchi, M.: Zeroizing without low-level zeroes: new MMAP attacks and their limitations. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 247\u2013266. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-47989-6_12"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.D.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38, 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-24676-3_31","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523\u2013540. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-24676-3_31"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-662-46497-7_20","volume-title":"Theory of Cryptography","author":"C Gentry","year":"2015","unstructured":"Gentry, C., Gorbunov, S., Halevi, S.: Graph-induced multilinear maps from lattices. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 498\u2013527. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-46497-7_20"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-662-46497-7_15","volume-title":"Theory of Cryptography","author":"V Koppula","year":"2015","unstructured":"Koppula, V., Ramchen, K., Waters, B.: Separations in circular security for arbitrary length key cycles. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 378\u2013400. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-46497-7_15"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-662-53008-5_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"V Koppula","year":"2016","unstructured":"Koppula, V., Waters, B.: Circular security separations for arbitrary length cycles from LWE. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 681\u2013700. Springer, Heidelberg (2016). doi:\n                      10.1007\/978-3-662-53008-5_24"},{"key":"18_CR27","unstructured":"Laud, P.: Encryption cycles and two views of cryptography. In: NORDSEC 2002 (2002)"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-10879-7_5","volume-title":"Security and Cryptography for Networks","author":"A Marcedone","year":"2014","unstructured":"Marcedone, A., Orlandi, C.: Obfuscation \n                      \n                        \n                      \n                      $$\\Rightarrow $$\n                     (IND-CPA security \n                      \n                        \n                      \n                      $$\\nRightarrow $$\n                     circular security). In: Abdalla, M., Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 77\u201390. Springer, Cham (2014). doi:\n                      10.1007\/978-3-319-10879-7_5"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-319-44618-9_30","volume-title":"Security and Cryptography for Networks","author":"A Marcedone","year":"2016","unstructured":"Marcedone, A., Pass, R., Shelat, A.: Bounded KDM security from iO and OWF. In: Zikas, V., Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 571\u2013586. Springer, Cham (2016). doi:\n                      10.1007\/978-3-319-44618-9_30"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-29011-4_41"},{"issue":"1","key":"18_CR31","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: STOC 2009 (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"18_CR33","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert, C.: A decade of lattice cryptography. Found. Trends Theor. Comput. Sci. 10, 283\u2013424 (2016)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, 2005 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-642-36594-2_32","volume-title":"Theory of Cryptography","author":"RD Rothblum","year":"2013","unstructured":"Rothblum, R.D.: On the circular security of bit-encryption. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 579\u2013598. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-36594-2_32"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56614-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:51:39Z","timestamp":1558317099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56614-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566139","9783319566146"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56614-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt2017.di.ens.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}