{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T01:13:32Z","timestamp":1779326012522,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662443804","type":"print"},{"value":"9783662443811","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-44381-1_16","type":"book-chapter","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T04:27:09Z","timestamp":1405312029000},"page":"276-294","source":"Crossref","is-referenced-by-count":131,"title":["Scalable Zero Knowledge via Cycles of Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Eli","family":"Ben-Sasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Chiesa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madars","family":"Virza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: STOC 1996 (1996)","DOI":"10.1145\/237814.237838"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Math. Comp (1993)","DOI":"10.2307\/2152935"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKs and proof-carrying data. In: STOC 2013 (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"E. Ben-Sasson","year":"2013","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: Verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 90\u2013108. Springer, Heidelberg (2013)"},{"key":"16_CR5","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: TinyRAM architecture specification v2.00 (2013), URL: \n                    \n                      http:\/\/scipr-lab.org\/tinyram"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., Virza, M.: Zerocash: Decentralized anonymous payments from Bitcoin. In: SP 2014 (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E.: Fast reductions from RAMs to delegatable succinct constraint satisfaction problems. In: ITCS 2013 (2013)","DOI":"10.1145\/2422436.2422481"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E.: On the concrete efficiency of probabilistically-checkable proofs. In: STOC 2013 (2013)","DOI":"10.1145\/2488608.2488681"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-36594-2_18","volume-title":"Theory of Cryptography","author":"N. Bitansky","year":"2013","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Paneth, O., Ostrovsky, R.: Succinct non-interactive arguments via linear interactive proofs. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 315\u2013333. Springer, Heidelberg (2013)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. Cryptology ePrint Archive (2014)","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"16_CR11","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von Neumann architecture. In: Security 2014 (2014), \n                    \n                      http:\/\/eprint.iacr.org\/2013\/879"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge. SIAM J. Comp. (1991)","DOI":"10.1137\/0220068"},{"key":"16_CR13","unstructured":"Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. In: FOCS 1991 (1991)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: STOC 1991 (1991)","DOI":"10.1145\/103418.103428"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali Non-interactive, S.: zero-knowledge and its applications. In: STOC 1988 (1988)","DOI":"10.1145\/62212.62222"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Braun, B., Feldman, A.J., Ren, Z., Setty, S., Blumberg, A.J., Walfish, M.: Verifying computations with state. In: SOSP 2013 (2013)","DOI":"10.1145\/2517349.2522733"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-13797-6_13","volume-title":"Arithmetic of Finite Fields","author":"N. Benger","year":"2010","unstructured":"Benger, N., Scott, M.: Constructing tower extensions of finite fields for implementation of pairing-based cryptography. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol.\u00a06087, pp. 180\u2013195. Springer, Heidelberg (2010)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Boneh, D., Segev, G., Waters, B.: Targeted malleability: Homomorphic encryption for restricted computations. In: ITCS 2012 (2012)","DOI":"10.1145\/2090236.2090264"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Practical verified computation with streaming interactive proofs. In: ITCS 2012 (2012)","DOI":"10.1145\/2090236.2090245"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R., Riva, B., Rothblum, G.N.: Practical delegation of computation using multiple servers. In: CCS 2011 (2011)","DOI":"10.1145\/2046707.2046759"},{"key":"16_CR21","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. In: ICS 2010 (2010)"},{"key":"16_CR22","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data: Secure computation on untrusted platforms (high-level description). In: The Next Wave: The National Security Agency\u2019s Review of Emerging Technologies (2012)"},{"key":"16_CR23","unstructured":"Chong, S., Tromer, E., Vaughan, J.A.: Enforcing language semantics using proof-carrying data. ePrint 2013\/513 (2013)"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-14518-6_14","volume-title":"Algorithmic Number Theory","author":"A. Enge","year":"2010","unstructured":"Enge, A., Sutherland, A.V.: Class invariants by the CRT method. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS-IX. LNCS, vol.\u00a06197, pp. 142\u2013156. Springer, Heidelberg (2010)"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Journal of Cryptology (2010)","DOI":"10.1007\/s00145-009-9048-z"},{"key":"16_CR26","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Collision-free hashing from lattice problems. Technical report, ECCC TR95-042 (1996)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R. Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 626\u2013645. Springer, Heidelberg (2013)"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J. Groth","year":"2010","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 321\u2013340. Springer, Heidelberg (2010)"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-79456-1_6","volume-title":"Algorithmic Number Theory","author":"K. Karabina","year":"2008","unstructured":"Karabina, K., Teske, E.: On prime-order elliptic curves with embedding degrees k = 3, 4, and 6. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol.\u00a05011, pp. 102\u2013117. Springer, Heidelberg (2008)"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-28914-9_10","volume-title":"Theory of Cryptography","author":"H. Lipmaa","year":"2012","unstructured":"Lipmaa, H.: Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 169\u2013189. Springer, Heidelberg (2012)"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-42033-7_3","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"H. Lipmaa","year":"2013","unstructured":"Lipmaa, H.: Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol.\u00a08269, pp. 41\u201360. Springer, Heidelberg (2013)"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-17455-1_1","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"K. Lauter","year":"2010","unstructured":"Lauter, K., Montgomery, P.L., Naehrig, M.: An analysis of affine coordinates for pairing computation. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 1\u201320. Springer, Heidelberg (2010)"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comp. (2000)","DOI":"10.1137\/S0097539795284959"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2001)","DOI":"10.1007\/3-540-45247-8_8"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC 1990 (1990)","DOI":"10.1145\/100216.100273"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Parno, B., Gentry, C., Howell, J., Raykova, M.: Pinocchio: Nearly practical verifiable computation. In: Oakland 2013 (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Setty, S., Braun, B., Vu, V., Blumberg, A.J., Parno, B., Walfish, M.: Resolving the conflict between generality and plausibility in verified computation. In: EuroSys 2013 (2013)","DOI":"10.1145\/2465351.2465359"},{"key":"16_CR38","unstructured":"Setty, S., Blumberg, A.J., Walfish, M.: Toward practical and unconditional verification of remote computations. In: HotOS 2011 (2011)"},{"key":"16_CR39","unstructured":"Setty, S., McPherson, M., Blumberg, A.J., Walfish, M.: Making argument systems for outsourced computation practical (sometimes). In: NDSS 2012 (2012)"},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"Sutherland, A.V.: Computing Hilbert class polynomials with the Chinese remainder theorem. Math. Comp. (2011)","DOI":"10.1090\/S0025-5718-2010-02373-7"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Sutherland, A.V.: Accelerating the CM method. LMS Journal of Computation and Mathematics (2012)","DOI":"10.1112\/S1461157012001015"},{"key":"16_CR42","unstructured":"Setty, S., Vu, V., Panpalia, N., Braun, B., Blumberg, A.J., Walfish, M.: Taking proof-based verified computation a few steps closer to practicality. In: Security 2012 (2012)"},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-40084-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J. Thaler","year":"2013","unstructured":"Thaler, J.: Time-optimal interactive proofs for circuit evaluation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 71\u201389. Springer, Heidelberg (2013)"},{"key":"16_CR44","unstructured":"Thaler, J., Roberts, M., Mitzenmacher, M., Pfister, H.: Verifiable computation with massively parallel interactive proofs. CoRR (2012)"},{"key":"16_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78524-8_1","volume-title":"Theory of Cryptography","author":"P. Valiant","year":"2008","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 1\u201318. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44381-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T08:38:45Z","timestamp":1558946325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44381-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443804","9783662443811"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}