{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:24:50Z","timestamp":1748384690563,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662464465"},{"type":"electronic","value":"9783662464472"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46447-2_29","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T05:21:25Z","timestamp":1426483285000},"page":"650-670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Making Sigma-Protocols Non-interactive Without Random Oracles"],"prefix":"10.1007","author":[{"given":"Pyrros","family":"Chaidos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Groth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"29_CR1","unstructured":"Adida, B.: Helios: web-based open-audit voting. In: Security Symposium, SS 2008, pp. 335\u2013348. USENIX Association (2008)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: Foundations of Computer Science, FOCS 2004, pp. 186\u2013195. IEEE (2004)","DOI":"10.1109\/FOCS.2004.71"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Computer and Communications Security, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-23822-2_19","volume-title":"Computer Security \u2013 ESORICS 2011","author":"D Bernhard","year":"2011","unstructured":"Bernhard, D., Cortier, V., Pereira, O., Smyth, B., Warinschi, B.: Adapting helios for provable ballot privacy. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol. 6879, pp. 335\u2013354. Springer, Heidelberg (2011)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Theory of Computing, STOC 1988, pp. 103\u2013112. ACM (1988)","DOI":"10.1145\/62212.62222"},{"issue":"4","key":"29_CR6","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. Journal of the ACM (JACM) 51(4), 557\u2013594 (2004)","journal-title":"Journal of the ACM (JACM)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Cortier, V., Galindo, D., Glondu, S., Izabach\u00e8ne, M.: Distributed ElGamal \u00e1 la Pedersen: application to Helios. In: Privacy in the Electronic Society, WPES 2013, pp. 131\u2013142. ACM (2013)","DOI":"10.1145\/2517840.2517852"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"R Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public-key encryption schemes secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO \u201998. LNCS, vol. 1462. Springer, Heidelberg (1998)"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, p. 45. Springer, Heidelberg (2002)"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-47555-9_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"IB Damg\u00e5rd","year":"1993","unstructured":"Damg\u00e5rd, I.B.: Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 341\u2013355. Springer, Heidelberg (1993)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11681878_3","volume-title":"Theory of Cryptography","author":"IB Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., Fazio, N., Nicolosi, A.: Non-interactive zero-knowledge from homomorphic encryption. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 41\u201359. Springer, Heidelberg (2006)"},{"issue":"6","key":"29_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10207-010-0119-9","volume":"9","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Jurik, M., Nielsen, J.B.: A generalization of Paillier\u2019s public-key system with applications to electronic voting. International Journal of Information Security 9(6), 371\u2013385 (2010)","journal-title":"International Journal of Information Security"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"29_CR14","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. 7881, pp. 626\u2013645. Springer, Heidelberg (2013)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Gentry, C., Groth, J., Ishai, Y., Peikert, C., Sahai, A., Smith, A.: Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs. Journal of Cryptology, 1\u201324 (2014)","DOI":"10.1007\/s00145-014-9184-y"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the Fiat-Shamir paradigm. In: Foundations of Computer Science, FOCS 2003, pp. 102\u2013113. IEEE (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on computing 18(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on computing"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11935230_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J Groth","year":"2006","unstructured":"Groth, J.: Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 444\u2013459. Springer, Heidelberg (2006)"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-17373-8_20","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J Groth","year":"2010","unstructured":"Groth, J.: Short non-interactive zero-knowledge proofs. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 341\u2013358. Springer, Heidelberg (2010)"},{"key":"29_CR20","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. 6477, pp. 321\u2013340. Springer, Heidelberg (2010)"},{"issue":"3","key":"29_CR21","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/2220357.2220358","volume":"59","author":"J Groth","year":"2012","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: New techniques for noninteractive zero-knowledge. Journal of the ACM 59(3), 11:1\u201311:35 (2012)","journal-title":"Journal of the ACM"},{"issue":"5","key":"29_CR22","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/080725386","volume":"41","author":"J Groth","year":"2012","unstructured":"Groth, J., Sahai, A.: Efficient noninteractive proof systems for bilinear groups. SIAM Journal on Computing 41(5), 1193\u20131232 (2012)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M Jakobsson","year":"1996","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 143\u2013154. Springer, Heidelberg (1996)"},{"issue":"1","key":"29_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s001459900032","volume":"11","author":"J Kilian","year":"1998","unstructured":"Kilian, J., Petrank, E.: An efficient noninteractive zero-knowledge proof system for NP with general assumptions. Journal of Cryptology 11(1), 1\u201327 (1998)","journal-title":"Journal of Cryptology"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Theory of Computing, STOC 2013, pp. 427\u2013437. ACM (1990)","DOI":"10.1145\/100216.100273"},{"key":"29_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","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)"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: Security and Privacy, pp. 238\u2013252. IEEE (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"29_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-02384-2_18","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"C Ventre","year":"2009","unstructured":"Ventre, C., Visconti, I.: Co-sound zero-knowledge with public keys. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 287\u2013304. Springer, Heidelberg (2009)"},{"key":"29_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-85855-3_20","volume-title":"Security and Cryptography for Networks","author":"D Wikstr\u00f6m","year":"2008","unstructured":"Wikstr\u00f6m, D.: Simplified submission of inputs to protocols. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 293\u2013308. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography -- PKC 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46447-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:16:09Z","timestamp":1747786569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46447-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464465","9783662464472"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46447-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}