{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:13:12Z","timestamp":1778087592652,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253293","type":"print"},{"value":"9783032253309","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-25330-9_5","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:32:08Z","timestamp":1778085128000},"page":"125-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Bounds on\u00a0Uniform-Challenge Reductions from\u00a0Sigma Protocols"],"prefix":"10.1007","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Makriyannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Bellare, M., Dai, W.: The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures. In: Bhargavan, K., et al. (ed.) INDOCRYPT 2020, Vol. 12578. LNCS. Springer, Cham, pp. 529\u2013552 (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_24","DOI":"10.1007\/978-3-030-65277-7_24"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Bellare, M., Palacio, A.: GQ and Schnorr identification schemes: proofs of security against impersonation under active and concurrent attacks. In: Yung, M. (ed.) CRYPTO 2002. Vol. 2442. LNCS. Springer, Berlin, Heidelberg, pp. 162\u2013177 (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_11","DOI":"10.1007\/3-540-45708-9_11"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., et al. (ed.) ACM CCS 93, ACM Press, pp. 62\u201373 (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Beth, T.: Efficient zero-knowledge identification scheme for smart cards. In: G\u00fcnther, C.G. (ed.)EUROCRYPT\u201988. Vol. 330. LNCS. Springer, Berlin, Heidelberg, pp. 77\u201384 (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_7","DOI":"10.1007\/3-540-45961-8_7"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Brickell, E.F., McCurley, K.S.: An interactive identification scheme based on discrete logarithms and factoring. In: Damg\u00e5rd, I. (ed.) EUROCRYPT\u201990. Vol. 473. LNCS. Springer, Berlin, Heidelberg, pp. 63\u201371 (1991). https:\/\/doi.org\/10.1007\/3-540-46877-3_6","DOI":"10.1007\/3-540-46877-3_6"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Cho, G., et al.: Schnorr signatures are tightly secure in the ROM under a non-interactive assumption. In: Annual International Cryptology Conference (CRYPTO) (2025)","DOI":"10.1007\/978-3-032-01887-8_8"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO\u201986. Vol. 263. LNCS. Springer, Berlin, Heidelberg, pp. 186\u2013194 (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Fischlin, M., Fleischhacker, N.: Limitations of the meta-reduction technique: the case of Schnorr signatures. In: Johansson, T., Nguyen, P.Q., (ed.) EUROCRYPT 2013. Vol. 7881. LNCS. Springer, Berlin, Heidelberg, pp. 444\u2013460 (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_27","DOI":"10.1007\/978-3-642-38348-9_27"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Fleischhacker, N., et al.: On tight security proofs for Schnorr signatures. J. Cryptology 32(2), 566\u2013599 (2019). https:\/\/doi.org\/10.1007\/s00145-019-09311-5","DOI":"10.1007\/s00145-019-09311-5"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., et al.: Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model. In: Canteaut, A., Ishai, Y. (ed.) EUROCRYPT 2020, Part II. Vol. 12106. LNCS. Springer, Cham, pp. 63\u201395 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_3","DOI":"10.1007\/978-3-030-45724-2_3"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Garg, S., et al.: Improved bounds on security reductions for discrete log based signatures. In: Wagner, D. (ed.) CRYPTO 2008. Vol. 5157. LNCS. Springer, Berlin, Heidelberg, pp. 93\u2013107 (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_6","DOI":"10.1007\/978-3-540-85174-5_6"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Girault, M.: An identity-based identification scheme based on discrete logarithms modulo a composite number (Rump Session). In: Damg\u00e5rd, I. (ed.) EUROCRYPT \u201990. Vol. 473. LNCS. Springer, Berlin, Heidelberg, pp. 481\u2013486 (1991). https:\/\/doi.org\/10.1007\/3-540-46877-3_44","DOI":"10.1007\/3-540-46877-3_44"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Guillou, L.C., Quisquater, J.-J.: A practical zero-knowledge protocol fitted to security microprocessor minimizing both trasmission and memory. In: G\u00fcnther, C.G. (ed.). EUROCRYPT \u201988. Vol. 330. LNCS. Springer, Berlin, Heidelberg, pp. 123\u2013128 (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_11","DOI":"10.1007\/3-540-45961-8_11"},{"key":"5_CR14","unstructured":"Haitner, I., Makriyannis, N.: Tight Bounds on Uniform-Challenge Reductions from Sigma Protocols. Cryptology ePrint Archive, Paper 2025\/1535 (2025). https:\/\/eprint.iacr.org\/2025\/1535"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Micali, S., Shamir, A.: An improvement of the Fiat-Shamir identification and signature scheme. In: Goldwasser, S. (ed.) CRYPTO \u201988. Vol. 403. LNCS. Springer, New York, pp. 244\u2013247 (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_18","DOI":"10.1007\/0-387-34799-2_18"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Okamoto, T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Brickell, E.F. (ed.) CRYPTO \u201992. Vol. 740. LNCS. Springer, Berlin, Heidelberg, pp. 31\u201353 (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_3","DOI":"10.1007\/3-540-48071-4_3"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Paillier, P., Vergnaud, D.: Discrete-log-based signatures may not be equivalent to discrete log. In: Roy, B.K. (ed.) ASIACRYPT 2005. Vol. 3788. LNCS. Springer, Berlin, Heidelberg, pp. 1\u201320 (2005). https:\/\/doi.org\/10.1007\/11593447_1","DOI":"10.1007\/11593447_1"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptology 13(3), 361\u2013396 (2000). https:\/\/doi.org\/10.1007\/s001450010003","DOI":"10.1007\/s001450010003"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Reingold, O., et al.: Notions of reducibility between cryptographic primitives. In: Theory of Cryptography (TCC), pp. 1\u201320 (2004)","DOI":"10.1007\/978-3-540-24638-1_1"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Rotem, L., Segev, G.: Tighter security for Schnorr identification and signatures: a high-moment forking lemma for $$\\Sigma $$-protocols. J. Cryptology 37(3), 26 (2024). https:\/\/doi.org\/10.1007\/s00145-024-09506-5","DOI":"10.1007\/s00145-024-09506-5"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Schnorr, C.-P.: Efficient signature generation by smart cards. J. Cryptology 4(3), 161\u2013174 (1991). https:\/\/doi.org\/10.1007\/BF00196725","DOI":"10.1007\/BF00196725"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Segev, G., et al.: Rogue-instance security for batch knowledge proofs. In: Rothblum, G.N., Wee, H. (ed.) TCC 2023, Part I. Vol. 14369. LNCS. Springer, Cham, pp. 121\u2013157 (2023). https:\/\/doi.org\/10.1007\/978-3-031-48615-9_5","DOI":"10.1007\/978-3-031-48615-9_5"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Seurin, Y.: On the exact security of Schnorr-type signatures in the random oracle model. In: Pointcheval, D., Johansson, T. (ed.) EUROCRYPT 2012. Vol. 7237. LNCS. Springer, Berlin, Heidelberg, pp. 554\u2013571 (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_33","DOI":"10.1007\/978-3-642-29011-4_33"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25330-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:32:12Z","timestamp":1778085132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25330-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253293","9783032253309"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25330-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}