{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:04:17Z","timestamp":1772823857596,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319686363","type":"print"},{"value":"9783319686370","type":"electronic"}],"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-68637-0_23","type":"book-chapter","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T10:07:56Z","timestamp":1508148476000},"page":"381-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Homomorphic Secret Sharing from Paillier Encryption"],"prefix":"10.1007","author":[{"given":"Nelly","family":"Fazio","sequence":"first","affiliation":[]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[]},{"given":"Tahereh","family":"Jafarikhah","sequence":"additional","affiliation":[]},{"suffix":"III","given":"William E.","family":"Skeith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,17]]},"reference":[{"key":"23_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: 10.1007\/978-3-642-13190-5_21"},{"key":"23_CR2","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: 10.1007\/978-3-662-53008-5_23"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-006-0211-8","volume":"15","author":"B Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Comput. Complex. 15(2), 115\u2013162 (2006)","journal-title":"Comput. Complex."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"23_CR5","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: 10.1007\/978-3-662-48800-3_32"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46803-6_12"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-662-53018-4_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Boyle","year":"2016","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 509\u2013539. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53018-4_19"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1292\u20131303. ACM (2016)","DOI":"10.1145\/2976749.2978429"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-56614-6_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"E Boyle","year":"2017","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Group-based secure computation: optimizing rounds, communication, and computation. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 163\u2013193. Springer, Cham (2017). doi: 10.1007\/978-3-319-56614-6_6"},{"key":"23_CR10","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: 10.1007\/978-3-642-30057-8_32"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM symposium on Theory of Computing, pp. 11\u201319. ACM (1988)","DOI":"10.1145\/62212.62214"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval. In: Proceedings of the Twenty-Ninth Annual ACM symposium on Theory of Computing, pp. 304\u2013313. ACM (1997)","DOI":"10.1145\/258533.258609"},{"issue":"6","key":"23_CR13","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure election scheme (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, pp. 372\u2013382, 21\u201323 October 1985","DOI":"10.1109\/SFCS.1985.2"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45067-X_30","volume-title":"Information Security and Privacy","author":"I Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 350\u2013364. Springer, Heidelberg (2003). doi: 10.1007\/3-540-45067-X_30"},{"key":"23_CR16","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 Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44586-2_9"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 169\u2013178. ACM, New York (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S.: Implementing gentry\u2019s fully-homomorphic encryption scheme. Cryptology ePrint Archive, Report 2010\/520 (2010)","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 465\u2013482. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29011-4_28"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"23_CR21","first-page":"270","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS 28(2), 270\u2013299 (1984)","journal-title":"JCSS"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-662-54365-8_10","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"R Goyal","year":"2017","unstructured":"Goyal, R., Koppula, V., Waters, B.: Separating IND-CPA and circular security for unbounded length key cycles. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 232\u2013246. Springer, Heidelberg (2017). doi: 10.1007\/978-3-662-54365-8_10"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 294\u2013304. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"23_CR24","unstructured":"Jurik, M.J.: Extensions to the Paillier cryptosystem with applications to cryptological protocols. In: BRICS (2003)"},{"key":"23_CR25","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: 10.1007\/978-3-662-53008-5_24"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"23_CR27","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 $$\\Rightarrow $$ (IND-CPA security $$\\nRightarrow $$ circular security). In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 77\u201390. Springer, Cham (2014). doi: 10.1007\/978-3-319-10879-7_5"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: Proceedings of the 5th ACM Conference on Computer and Communications Security, pp. 59\u201366. ACM (1998)","DOI":"10.1145\/288090.288106"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp. 113\u2013124. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1998","author":"T Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308\u2013318. Springer, Heidelberg (1998). doi: 10.1007\/BFb0054135"},{"key":"23_CR31","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 \u2014 EUROCRYPT 1999","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. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48910-X_16"},{"key":"23_CR32","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: 10.1007\/978-3-642-36594-2_32"},{"issue":"11","key":"23_CR33","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"23_CR34","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. Technical report, Cryptology ePrint Archive, Report 2017\/276 (2017). http:\/\/eprint.iacr.org\/2017\/276"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68637-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T14:13:56Z","timestamp":1750947236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68637-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319686363","9783319686370"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68637-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"23 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/it.snnu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}