{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:31:02Z","timestamp":1742970662640,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030578077"},{"type":"electronic","value":"9783030578084"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-57808-4_2","type":"book-chapter","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T21:03:47Z","timestamp":1598475827000},"page":"24-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Random Walks and Concurrent Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Anand","family":"Aiyer","sequence":"first","affiliation":[]},{"given":"Xiao","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Nilu","family":"Nalini","sequence":"additional","affiliation":[]},{"given":"Omkant","family":"Pandey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"2_CR1","unstructured":"Aiyer, A., Liang, X., Nalini, N., Pandey, O.: Random walks and concurrent zero-knowledge. Cryptology ePrint Archive, Report 2020\/082 (2020). https:\/\/eprint.iacr.org\/2020\/082"},{"key":"2_CR2","volume-title":"The Probabilistic Method","author":"N Alon","year":"2004","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, Hoboken (2004)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: Proceedings of the 42Nd IEEE Symposium on Foundations of Computer Science, FOCS 2001, p. 106. IEEE Computer Society, Washington, DC (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"key":"2_CR5","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge. In: STOC, pp. 235\u2013244 (2000)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-44381-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"R Canetti","year":"2014","unstructured":"Canetti, R., Jain, A., Paneth, O.: Client-server concurrent zero knowledge with constant rounds and guaranteed complexity. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 337\u2013350. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_19"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires$$\\backslash $$tilde $$\\{\\varOmega \\}$$(log n) rounds. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 570\u2013579. ACM (2001)","DOI":"10.1145\/380752.380852"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-36594-2_5","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2013","unstructured":"Canetti, R., Lin, H., Paneth, O.: Public-coin concurrent zero-knowledge in the global hash model. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 80\u201399. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_5"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-662-47989-6_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"K-M Chung","year":"2015","unstructured":"Chung, K.-M., Lin, H., Pass, R.: Constant-round concurrent zero-knowledge from indistinguishability obfuscation. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 287\u2013307. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_14"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Lin, H., Pass, R.: Constant-round concurrent zero knowledge from p-certificates. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 50\u201359. IEEE (2013)","DOI":"10.1109\/FOCS.2013.14"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-28628-8_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"G Di Crescenzo","year":"2004","unstructured":"Di Crescenzo, G., Persiano, G., Visconti, I.: Constant-round resettable zero knowledge with concurrent soundness in the bare public-key model. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 237\u2013253. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_15"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology \u2014 CRYPTO 91","author":"I Damg\u00e5rd","year":"1992","unstructured":"Damg\u00e5rd, I.: Towards practical public key systems secure against chosen ciphertext attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 445\u2013456. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_36"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 409\u2013418. ACM, New York (1998)","DOI":"10.1145\/276698.276853"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/BFb0055746","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"C Dwork","year":"1998","unstructured":"Dwork, C., Sahai, A.: Concurrent zero-knowledge: reducing the need for timing constraints. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 442\u2013457. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055746"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10959-013-0490-3","volume":"28","author":"R Essifi","year":"2015","unstructured":"Essifi, R., Peign\u00e9, M.: Return probabilities for the reflected random walk on N0. J. Theor. Probab. 28(1), 231\u2013258 (2015)","journal-title":"J. Theor. Probab."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, USA, 13\u201317 May 1990, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"key":"2_CR17","unstructured":"Feller, W.: An Introduction to Probability Theory and its Applications, vol. 1 (1968)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Concurrent zero-knowledge with timing, revisited. In: STOC, pp. 332\u2013340 (2002)","DOI":"10.1145\/509907.509959"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0032038","volume-title":"Automata, Languages and Programming","author":"O Goldreich","year":"1990","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 268\u2013282. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032038"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 291\u2013304. ACM, New York (1985)","DOI":"10.1145\/22145.22178"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-36594-2_4","volume-title":"Theory of Cryptography","author":"V Goyal","year":"2013","unstructured":"Goyal, V., Jain, A., Ostrovsky, R., Richelson, S., Visconti, I.: Concurrent zero knowledge in the bounded player model. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 60\u201379. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_4"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-13039-2_5","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2014","author":"D Gupta","year":"2014","unstructured":"Gupta, D., Sahai, A.: On constant-round concurrent zero-knowledge from a knowledge assumption. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 71\u201388. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13039-2_5"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/BFb0055744","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"S Hada","year":"1998","unstructured":"Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 408\u2013423. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055744"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-662-46497-7_26","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2015","unstructured":"Ishai, Y., Pandey, O., Sahai, A.: Public-coin differing-inputs obfuscation and its applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 668\u2013697. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_26"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-logarithmic rounds. In: Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, STOC 2001, pp. 560\u2013569. ACM (2001)","DOI":"10.1145\/380752.380851"},{"key":"2_CR27","unstructured":"Kilian, J., Petrank, E., Rackoff, C.: Lower bounds for zero knowledge on the Internet. In: FOCS, pp. 484\u2013492 (1998)"},{"issue":"3","key":"2_CR28","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/BF02218045","volume":"8","author":"SP Lalley","year":"1995","unstructured":"Lalley, S.P.: Return probabilities for random walk on a half-line. J. Theor. Probab. 8(3), 571\u2013599 (1995)","journal-title":"J. Theor. Probab."},{"issue":"2","key":"2_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00446-006-0005-x","volume":"19","author":"L Lamport","year":"2006","unstructured":"Lamport, L.: Fast paxos. Distrib. Comput. 19(2), 79\u2013103 (2006)","journal-title":"Distrib. Comput."},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-662-46497-7_25","volume-title":"Theory of Cryptography","author":"O Pandey","year":"2015","unstructured":"Pandey, O., Prabhakaran, M., Sahai, A.: Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 638\u2013667. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_25"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-642-11799-2_31","volume-title":"Theory of Cryptography","author":"R Pass","year":"2010","unstructured":"Pass, R., Tseng, W.-L.D., Venkitasubramaniam, M.: Eye for an eye: efficient concurrent zero-knowledge in the timing model. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 518\u2013534. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_31"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/11523468_19","volume-title":"Automata, Languages and Programming","author":"G Persiano","year":"2005","unstructured":"Persiano, G., Visconti, I.: Single-prover concurrent zero knowledge in almost constant rounds. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 228\u2013240. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_19"},{"key":"2_CR33","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 366\u2013375. IEEE (2002)"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 99","author":"R Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 415\u2013431. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_29"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-44598-6_28","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"A Rosen","year":"2000","unstructured":"Rosen, A.: A note on the round-complexity of concurrent zero-knowledge. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 451\u2013468. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_28"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-17373-8_21","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Rosen","year":"2010","unstructured":"Rosen, A., Shelat, A.: Optimistic concurrent zero knowledge. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 359\u2013376. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_21"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-29011-4_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Scafuro","year":"2012","unstructured":"Scafuro, A., Visconti, I.: On round-optimal zero knowledge in the bare public-key model. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 153\u2013171. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_11"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57808-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T16:20:14Z","timestamp":1723479614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57808-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030578077","9783030578084"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57808-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/ACNS2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"214","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to COVID-19 pandemy the confernce was helt virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}