{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:21:57Z","timestamp":1746138117028},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,1,31]],"date-time":"2013-01-31T00:00:00Z","timestamp":1359590400000},"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":[[2014,4]]},"DOI":"10.1007\/s00145-013-9145-x","type":"journal-article","created":{"date-parts":[[2013,1,30]],"date-time":"2013-01-30T12:56:46Z","timestamp":1359550606000},"page":"284-316","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the Amortized Complexity of Zero-Knowledge Protocols"],"prefix":"10.1007","volume":"27","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Keller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,31]]},"reference":[{"key":"9145_CR1","unstructured":"M. Bellare, O. Goldreich, On probabilistic versus deterministic provers in the definition of proofs of knowledge. Electron. Colloq. Comput. Complex.\n                  13(136) (2006)"},{"key":"9145_CR2","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1145\/100216.100283","volume-title":"STOC","author":"M. Bellare","year":"1990","unstructured":"M. Bellare, S. Micali, R. Ostrovsky, Perfect zero-knowledge in constant rounds, in STOC (ACM, New York, 1990), pp. 482\u2013493"},{"key":"9145_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"EUROCRYPT","author":"R. Bendlin","year":"2011","unstructured":"R. Bendlin, I. Damg\u00e5rd, C. Orlandi, S. Zakarias, Semi-homomorphic encryption and multiparty computation, in EUROCRYPT, ed. by K.G. Paterson. Lecture Notes in Computer Science, vol. 6632 (Springer, Berlin, 2011), pp. 169\u2013188"},{"key":"9145_CR4","first-page":"11","volume-title":"CRYPTO","author":"M. Blum","year":"1981","unstructured":"M. Blum, Coin flipping by telephone, in CRYPTO (1981), pp. 11\u201315"},{"key":"9145_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/978-3-540-73458-1_30","volume-title":"ACISP","author":"I. Damg\u00e5rd","year":"2007","unstructured":"I. Damg\u00e5rd, M. Geisler, M. Kr\u00f8igaard, Efficient and secure comparison for on-line auctions, in ACISP, ed. by J. Pieprzyk, H. Ghodosi, E. Dawson. Lecture Notes in Computer Science, vol. 4586 (Springer, Berlin, 2007), pp. 416\u2013430"},{"key":"9145_CR6","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"CRYPTO","author":"A. Fiat","year":"1986","unstructured":"A. Fiat, A. Shamir, How to prove yourself: practical solutions to identification and signature problems, in CRYPTO, ed. by A.M. Odlyzko. Lecture Notes in Computer Science, vol. 263 (Springer, Berlin, 1986), pp. 186\u2013194"},{"key":"9145_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"CRYPTO","author":"E. Fujisaki","year":"1997","unstructured":"E. Fujisaki, T. Okamoto, Statistical zero knowledge protocols to prove modular polynomial relations, in CRYPTO, ed. by B.S. Kaliski Jr. Lecture Notes in Computer Science, vol. 1294 (Springer, Berlin, 1997), pp. 16\u201330"},{"key":"9145_CR8","first-page":"291","volume-title":"STOC","author":"S. Goldwasser","year":"1985","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof-systems (extended abstract), in STOC (ACM, New York, 1985), pp. 291\u2013304"},{"key":"9145_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-540-30576-7_4","volume-title":"TCC","author":"J. Groth","year":"2005","unstructured":"J. Groth, Cryptography in subgroups of zn, in TCC, ed. by J. Kilian. Lecture Notes in Computer Science, vol. 3378 (Springer, Berlin, 2005), pp. 50\u201365"},{"issue":"3","key":"9145_CR10","doi-asserted-by":"publisher","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.\n                  39(3), 1121\u20131152 (2009)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9145_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.-P. Schnorr","year":"1991","unstructured":"C.-P. Schnorr, Efficient signature generation by smart cards. J. Cryptol.\n                  4(3), 161\u2013174 (1991)","journal-title":"J. Cryptol."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9145-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9145-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9145-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9145-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:10:37Z","timestamp":1586333437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9145-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,31]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9145"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9145-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,31]]},"assertion":[{"value":"31 October 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2013","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"}]}}