{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:20:11Z","timestamp":1769314811525,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T00:00:00Z","timestamp":1397779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s00145-014-9184-y","type":"journal-article","created":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T02:07:15Z","timestamp":1397786835000},"page":"820-843","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":62,"title":["Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs"],"prefix":"10.1007","volume":"28","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[]},{"given":"Jens","family":"Groth","sequence":"additional","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,18]]},"reference":[{"key":"9184_CR1","doi-asserted-by":"crossref","unstructured":"B. Barak, R. Canetti, J.-B. Nielsen, R. Pass, Universally composable protocols with relaxed set-up assumptions, in FOCS, (ACM, New York, 2004), pp. 186\u2013195","DOI":"10.1109\/FOCS.2004.71"},{"key":"9184_CR2","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, S. Micali, Non-interactive zero-knowledge and its applications, in STOC, (ACM, New York, 1988) pp. 103\u2013112","DOI":"10.1145\/62212.62222"},{"key":"9184_CR3","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, Fully homomorphic encryption without modulus switching from classical gapsvp, in CRYPTO. Lecture Notes in Computer Science, vol. 7417 (Springer, Berlin, 2012), pp. 868\u2013886","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"9184_CR4","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, V. Vaikuntanathan, Efficient fully homomorphic encryption from (standard) LWE, in FOCS (ACM, New York, 2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"9184_CR5","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, C. Gentry, S. Halevi, Packed ciphertexts in lwe-based homomorphic encryption, in Public Key Cryptography. Lecture Notes in Computer Science, vol. 7778 (Springer, Berlin, 2013), pp. 1\u201313","DOI":"10.1007\/978-3-642-36362-7_1"},{"key":"9184_CR6","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, C. Gentry, V. Vaikuntanathan, (Leveled) fully homomorphic encryption without bootstrapping, in ITCS (ACM, New York, 2012), pp. 309\u2013325","DOI":"10.1145\/2090236.2090262"},{"key":"9184_CR7","doi-asserted-by":"crossref","unstructured":"X. Boyen, B. Waters, Compact group signatures without random oracles, in EUROCRYPT. Lecture Notes in Computer Science, vol. 4004 (Springer, Berlin, 2006), pp. 427\u2013444","DOI":"10.1007\/11761679_26"},{"key":"9184_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in FOCS (ACM, New York, 2001), pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9184_CR9","doi-asserted-by":"crossref","unstructured":"N. Chandran, J. Groth, A. Sahai, Ring signatures of sub-linear size without random oracles, in ICALP. Lecture Notes in Computer Science, vol. 4596 (Springer, Berlin, 2007), pp. 423\u2013434","DOI":"10.1007\/978-3-540-73420-8_38"},{"key":"9184_CR10","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing, in EUROCRYPT. Lecture Notes in Computer Science, vol. 658 (Springer, Berline, 1992), pp. 341\u2013355","DOI":"10.1007\/3-540-47555-9_28"},{"key":"9184_CR11","doi-asserted-by":"crossref","unstructured":"A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, A. Sahai, Robust non-interactive zero knowledge, in CRYPTO. Lecture Notes in Computer Science, vol 2139 (Springer, Berline, 2002), pp. 566\u2013598","DOI":"10.1007\/3-540-44647-8_33"},{"key":"9184_CR12","doi-asserted-by":"crossref","unstructured":"A. De Santis, G. Di Crescenzo, G. Persiano. Randomness-optimal characterization of two NP proof systems, in RANDOM. Lecture Notes in Computer Science, vol. 2483 (Springer, Berline, 2002), pp. 179\u2013193","DOI":"10.1007\/3-540-45726-7_15"},{"issue":"2","key":"9184_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork, M. Naor, Non-malleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9184_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"U. Feige, D. Lapidot, A. Shamir, Multiple non-interactive zero knowledge proofs under general assumptions. SIAM J. Comput. 29(1), 1\u201328 (1999)","journal-title":"SIAM J. Comput."},{"key":"9184_CR15","doi-asserted-by":"crossref","unstructured":"C. Gentry, A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"9184_CR16","doi-asserted-by":"crossref","unstructured":"C. Gentry. Fully homomorphic encryption using ideal lattices, in STOC (ACN, New York, 2009), pp. 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"9184_CR17","doi-asserted-by":"crossref","unstructured":"C. Gentry, S. Halevi, V. Vaikuntanathan, i-hop homomorphic encryption and rerandomizable Yao circuits, in CRYPTO. Lecture Notes in Computer Science, vol. 6223 (Springer, Berline, 2010), pp. 155\u2013172","DOI":"10.1007\/978-3-642-14623-7_9"},{"issue":"4","key":"9184_CR18","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0020-0190(98)00116-1","volume":"67","author":"O. Goldreich","year":"1998","unstructured":"O. Goldreich, J. H\u00e5stad, On the complexity of interactive proofs with bounded communication. Inf. Process. Lett. 67(4), 205\u2013214 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9184_CR19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, H. Krawczyk, On the composition of zero-knowledge proof systems. SIAM J. Comput. 25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9184_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"O. Goldreich, Y. Oren, Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1), 1\u201332 (1994)","journal-title":"J. Cryptol."},{"issue":"1\u20132","key":"9184_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00037-002-0169-0","volume":"11","author":"O. Goldreich","year":"2002","unstructured":"O. Goldreich, S.P. Vadhan, A. Wigderson, On interactive proofs with a laconic prover. Comput. Complex. 11(1\u20132), 1\u201353 (2002)","journal-title":"Comput. Complex."},{"key":"9184_CR22","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Y.T. Kalai, G.N. Rothblum, Delegating computation: interactive proofs for muggles, in STOC (ACN, New York, 2008), pp. 113\u2013122","DOI":"10.1145\/1374376.1374396"},{"key":"9184_CR23","doi-asserted-by":"crossref","unstructured":"J. Groth, Simulation-sound NIZK proofs for a practical language and constant size group signatures, in ASIACRYPT. Lecture Notes in Computer Science, vol. 4248 (Springer, Berline, 2006), pp. 444\u2013459","DOI":"10.1007\/11935230_29"},{"key":"9184_CR24","doi-asserted-by":"crossref","unstructured":"J. Groth, Short non-interactive zero-knowledge proofs, in ASIACRYPT. Lecture Notes in Computer Science, vol. 6477 (Springer, Berline, 2010), pp. 341\u2013358","DOI":"10.1007\/978-3-642-17373-8_20"},{"key":"9184_CR25","doi-asserted-by":"crossref","unstructured":"J. Groth, R. Ostrovsky, Cryptography in the multi-string model, in CRYPTO. Lecture Notes in Computer Science, vol. 4622 (Springer, Berline, 2007), pp. 323\u2013341","DOI":"10.1007\/978-3-540-74143-5_18"},{"key":"9184_CR26","doi-asserted-by":"crossref","unstructured":"J. Groth, A. Sahai, Efficient non-interactive proof systems for bilinear groups, in EUROCRYPT. Lecture Notes in Computer Science, vol. 4965 (Springer, Berline, 2008), pp. 415\u2013432","DOI":"10.1007\/978-3-540-78967-3_24"},{"issue":"3","key":"9184_CR27","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/2220357.2220358","volume":"59","author":"J. Groth","year":"2012","unstructured":"J. Groth, R. Ostrovsky, A. Sahai, New techniques for noninteractive zero-knowledge. J. ACM 59(3), 11 (2012)","journal-title":"J. ACM"},{"issue":"4","key":"9184_CR28","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9184_CR29","unstructured":"Y. Ishai, Efficiency vs. assumptions in secure computation, in Presentation at Impagliazzo\u2019s Worlds Workshop (2009)"},{"issue":"3","key":"9184_CR30","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y. Ishai","year":"2009","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput. 39(3), 1121\u20131152 (2009)","journal-title":"SIAM J. Comput."},{"key":"9184_CR31","doi-asserted-by":"crossref","unstructured":"Y.T. Kalai, R. Raz, Interactive PCP, in ICALP. Lecture Notes in Computer Science, vol. 5126 (Springer, Berline, 2008), pp. 536\u2013547","DOI":"10.1007\/978-3-540-70583-3_44"},{"issue":"1","key":"9184_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s001459900032","volume":"11","author":"J. Kilian","year":"1998","unstructured":"J. Kilian, Erez Petrank, An efficient noninteractive zero-knowledge proof system for NP with general assumptions. J. Cryptol. 11(1), 1\u201327 (1998)","journal-title":"J. Cryptol."},{"key":"9184_CR33","unstructured":"H. Lipmaa, Efficient multi-query CPIR from ring-LWE, in Cryptology ePrint Archive, Report 2011\/595 (2011)"},{"key":"9184_CR34","doi-asserted-by":"crossref","unstructured":"M. Naor, K. Nissim, Communication preserving protocols for secure function evaluation, in STOC (ACN, New York, 2001), pp. 590\u2013599","DOI":"10.1145\/380752.380855"},{"key":"9184_CR35","doi-asserted-by":"crossref","unstructured":"M. Naor, M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, in STOC (ACN, New York, 1990), pp. 427\u2013437","DOI":"10.1145\/100216.100273"},{"key":"9184_CR36","doi-asserted-by":"crossref","unstructured":"Y. Oren, On the cunning power of cheating verifiers: some observations about zero knowledge proofs, in FOCS (ACN, New York, 1987), pp. 462\u2013471","DOI":"10.1109\/SFCS.1987.43"},{"key":"9184_CR37","unstructured":"C. Peikert, A. Smith, Concise, uninformative proofs, in Rump Session Presentation at Asiacrypt (2009)"},{"key":"9184_CR38","doi-asserted-by":"crossref","unstructured":"J. Rompel, One-way functions are necessary and sufficient for secure signatures, in STOC (ACN, New York, 1990), pp. 387\u2013394","DOI":"10.1145\/100216.100269"},{"key":"9184_CR39","doi-asserted-by":"crossref","unstructured":"A. Sahai, Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security, in FOCS (ACN, New York, 2001), pp. 543\u2013553","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"9184_CR40","doi-asserted-by":"crossref","unstructured":"D. Stehl\u00e9, R. Steinfeld, Faster fully homomorphic encryption, in ASIACRYPT. Lecture Notes in Computer Science, vol. 6477 (Springer, Berline, 2010), pp. 377\u2013394","DOI":"10.1007\/978-3-642-17373-8_22"},{"key":"9184_CR41","doi-asserted-by":"crossref","unstructured":"N.P. Smart, F. Vercauteren, Fully homomorphic encryption with relatively small key and ciphertext sizes, in Public Key Cryptography. Lecture Notes in Computer Science, vol. 6056 (Springer, Berline, 2010), pp. 420\u2013443","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"9184_CR42","doi-asserted-by":"crossref","unstructured":"M. van Dijk, C. Gentry, S. Halevi, V. Vaikuntanathan, Fully homomorphic encryption over the integers, in EUROCRYPT. Lecture Notes in Computer Science, vol. 6110 (Springer, Berline, 2010), pp. 24\u201343","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"9184_CR43","unstructured":"A.C.-C. Yao, Protocols for secure computations (extended abstract), in FOCS (ACN, New York, 1982), pp. 160\u2013164"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9184-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-014-9184-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9184-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9184-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T12:19:04Z","timestamp":1746188344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-014-9184-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,18]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9184"],"URL":"https:\/\/doi.org\/10.1007\/s00145-014-9184-y","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,18]]},"assertion":[{"value":"28 May 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2014","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}