{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T00:02:59Z","timestamp":1769299379947,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319388977","type":"print"},{"value":"9783319388984","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-38898-4_22","type":"book-chapter","created":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T11:44:40Z","timestamp":1462535080000},"page":"381-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Slow Motion Zero Knowledge Identifying with Colliding Commitments"],"prefix":"10.1007","author":[{"given":"Houda","family":"Ferradi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"G\u00e9raud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,7]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/1064340.1064341","volume":"5","author":"M Abadi","year":"2005","unstructured":"Abadi, M., Burrows, M., Manasse, M.S., Wobber, T.: Moderately hard, memory-bound functions. ACM Trans. Internet Technol. 5(2), 299\u2013327 (2005)","journal-title":"ACM Trans. Internet Technol."},{"key":"22_CR2","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) CCS 1993, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, 3\u20135 November, 1993, pp. 62\u201373. ACM (1993)"},{"issue":"7","key":"22_CR3","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1002\/spe.4380160704","volume":"16","author":"RL Bernstein","year":"1986","unstructured":"Bernstein, R.L.: Multiplication by integer constants. Softw. Pract. Exper. 16(7), 641\u2013652 (1986)","journal-title":"Softw. Pract. Exper."},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"D Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, p. 236. Springer, Heidelberg (2000)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-33272-2_8","volume-title":"Provable Security","author":"O Ciobotaru","year":"2012","unstructured":"Ciobotaru, O.: On the (Non-)Equivalence of UC security notions. In: Takagi, T., Wang, G., Qin, Z., Jiang, S., Yu, Y. (eds.) ProvSec 2012. LNCS, vol. 7496, pp. 104\u2013124. Springer, Heidelberg (2012)"},{"key":"22_CR6","unstructured":"Damg\u00e5rd, I.: On $$\\Sigma $$ \u03a3 Protocols (2010). http:\/\/www.cs.au.dk\/~ivan\/Sigma.pdf"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-45146-4_25","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"C Dwork","year":"2003","unstructured":"Dwork, C., Goldberg, A.V., Naor, M.: On memory-bound functions for fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 426\u2013444. Springer, Heidelberg (2003)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology - CRYPTO 1992","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11535218_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"C Dwork","year":"2005","unstructured":"Dwork, C., Naor, M., Wee, H.M.: Pebbling and proofs of work. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 37\u201354. Springer, Heidelberg (2005)"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptology 1(2), 77\u201394 (1988)","journal-title":"J. Cryptology"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/3-540-46877-3_44","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"M Girault","year":"1991","unstructured":"Girault, M.: An identity-based identification scheme based on discrete logarithms modulo a composite number. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 481\u2013486. Springer, Heidelberg (1991)"},{"issue":"4","key":"22_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00145-006-0224-0","volume":"19","author":"M Girault","year":"2006","unstructured":"Girault, M., Poupard, G., Stern, J.: On the fly authentication and signature schemes based on groups of unknown order. J. Cryptology 19(4), 463\u2013487 (2006)","journal-title":"J. Cryptology"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/3-540-48658-5_21","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M Girault","year":"1994","unstructured":"Girault, M., Stern, J.: On the length of cryptographic hash-values used in identification schemes. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 202\u2013215. Springer, Heidelberg (1994)"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: Sedgewick, R. (ed.) Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 6\u20138 May, 1985, Providence, Rhode Island, USA, pp. 291\u2013304. ACM (1985)","DOI":"10.1145\/22145.22178"},{"key":"22_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient secure two-party protocols: techniques and constructions","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient secure two-party protocols: techniques and constructions. Springer Science and Business Media, Heidelberg (2010)"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-22792-9_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"M Mahmoody","year":"2011","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Time-lock puzzles in the random oracle model. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 39\u201350. Springer, Heidelberg (2011)"},{"key":"22_CR18","unstructured":"Micali, S., Pass, R.: Local zero knowledge. In: Kleinberg, J.M. (ed.) Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, 21\u201323 May, 2006, pp. 306\u2013315. ACM (2006)"},{"key":"22_CR19","unstructured":"M\u2019Ra\u00efhi, D., Naccache, D.: Couponing scheme reduces computational power requirements for dss signatures. In: Proceedings of CardTech\/SecurTech, pp. 99\u2013104 (1994)"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/BFb0054143","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"G Poupard","year":"1998","unstructured":"Poupard, G., Stern, J.: Security analysis of a practical \u201cOn the Fly\u201d authentication and signature generation. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 422\u2013436. Springer, Heidelberg (1998)"},{"key":"22_CR21","unstructured":"Rivest, R., Shamir, A., Wagner, D.: Time-lock puzzles and timed-release crypto, technical report, MIT\/LCS\/TR-684 (1996)"},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s001459900016","volume":"10","author":"P Rooij de","year":"1997","unstructured":"de Rooij, P.: On schnorr\u2019s preprocessing for digital signature schemes. J. Cryptology 10(1), 1\u201316 (1997)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38898-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T01:12:00Z","timestamp":1748913120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38898-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388977","9783319388984"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38898-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"7 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}