{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:18:16Z","timestamp":1777371496044,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,29]],"date-time":"2018-09-29T00:00:00Z","timestamp":1538179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecur"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s42400-018-0014-7","type":"journal-article","created":{"date-parts":[[2018,9,29]],"date-time":"2018-09-29T06:48:12Z","timestamp":1538203692000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Concurrent non-malleable zero-knowledge and simultaneous resettable non-malleable zero-knowledge in constant rounds"],"prefix":"10.1186","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1784-0001","authenticated-orcid":false,"given":"Zhenbin","family":"Yan","sequence":"first","affiliation":[]},{"given":"Yi","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Yiru","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,29]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/SFCS.2001.959885","volume-title":"42nd Annual Symposium on Foundations of Computer Science, FOCS","author":"B Barak","year":"2001","unstructured":"Barak, B (2001) How to go beyond the black-box simulation barrier In: 42nd Annual Symposium on Foundations of Computer Science, FOCS, 106\u2013115.. IEEE Computer Society, Las Vegas. https:\/\/doi.org\/10.1109\/SFCS.2001.959885 ."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/SFCS.2001.959886","volume-title":"42nd Annual Symposium on Foundations of Computer Science, FOCS","author":"B Barak","year":"2001","unstructured":"Barak, B, Goldreich O, Goldwasser S, Lindell Y (2001) Resettably-sound zero-knowledge and its applications In: 42nd Annual Symposium on Foundations of Computer Science, FOCS, 116\u2013125.. IEEE Computer Society, Las Vegas. https:\/\/doi.org\/10.1109\/SFCS.2001.959886 ."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Proceedings","author":"B Barak","year":"2001","unstructured":"Barak, B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan SP, Yang K (2001) On the (im)possibility of obfuscating programs In: Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Proceedings, 1\u201318.. Springer, Santa Barbara. https:\/\/doi.org\/10.1007\/3-540-44647-8_1 ."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1109\/FOCS.2006.21","volume-title":"47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), Proceedings","author":"B Barak","year":"2006","unstructured":"Barak, B, Prabhakaran M, Sahai A (2006) Concurrent non-malleable zero knowledge In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), Proceedings, 345\u2013354.. IEEE Computer Society, Berkeley. https:\/\/doi.org\/10.1109\/FOCS.2006.21 ."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36563-X_1","volume-title":"Topics in Cryptology - CT-RSA 2003, The Cryptographers\u2019 Track at the RSA Conference, Proceedings","author":"M Bellare","year":"2003","unstructured":"Bellare, M, Yee BS (2003) Forward-security in private-key cryptography In: Topics in Cryptology - CT-RSA 2003, The Cryptographers\u2019 Track at the RSA Conference, Proceedings, 1\u201318.. Springer, San Francisco. https:\/\/doi.org\/10.1007\/3-540-36563-X_1 ."},{"issue":"5","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1137\/130928236","volume":"44","author":"N Bitansky","year":"2015","unstructured":"Bitansky, N, Paneth O (2015) On non-black-box simulation and the impossibility of approximate obfuscation. SIAM J Comput 44(5):1325\u20131383.","journal-title":"SIAM J Comput"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-54242-8_3","volume-title":"Theory of Cryptography - 11th Theory of Cryptography Conference, TCC. Proceedings","author":"E Boyle","year":"2014","unstructured":"Boyle, E, Chung K, Pass R (2014) On extractability obfuscation In: Theory of Cryptography - 11th Theory of Cryptography Conference, TCC. Proceedings, 52\u201373.. Springer, San Diego. https:\/\/doi.org\/10.1007\/978-3-642-54242-8_3 ."},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/335305.335334","volume-title":"Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing","author":"R Canetti","year":"2000","unstructured":"Canetti, R, Goldreich O, Goldwasser S, Micali S (2000) Resettable zero-knowledge (extended abstract) In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 235\u2013244.. ACM, Portland. https:\/\/doi.acm.org\/10.1145\/335305.335334 ."},{"key":"14_CR9","first-page":"570","volume-title":"Proceedings on 33rd Annual ACM Symposium on Theory of Computing, STOC","author":"R Canetti","year":"2001","unstructured":"Canetti, R, Kilian J, Petrank E, Rosen A (2001) Black-box concurrent zero-knowledge requires omega~(log n) rounds In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, STOC, 570\u2013579.. ACM, Heraklion. http:\/\/doi.acm.org\/10.1145\/380752.380852 ."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-36594-2_5","volume-title":"Theory of Cryptography - 10th Theory of Cryptography Conference, TCC. Proceedings","author":"R Canetti","year":"2013","unstructured":"Canetti, R, Lin H, Paneth O (2013) Public-coin concurrent zero-knowledge in the global hash model In: Theory of Cryptography - 10th Theory of Cryptography Conference, TCC. Proceedings, 80\u201399.. Springer, Tokyo. https:\/\/doi.org\/10.1007\/978-3-642-36594-2_5 ."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/FOCS.2010.86","volume-title":"51th Annual IEEE Symposium on Foundations of Computer Science, FOCS","author":"R Canetti","year":"2010","unstructured":"Canetti, R, Lin H, Pass R (2010) Adaptive hardness and composable security in the plain model from standard assumptions In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 541\u2013550.. IEEE Computer Society, Las Vegas. https:\/\/doi.org\/10.1109\/FOCS.2010.86 ."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-28914-9_30","volume-title":"Theory of Cryptography - 9th Theory of Cryptography Conference, TCC. Proceedings","author":"C Cho","year":"2012","unstructured":"Cho, C, Ostrovsky R, Scafuro A, Visconti I (2012) Simultaneously resettable arguments of knowledge In: Theory of Cryptography - 9th Theory of Cryptography Conference, TCC. Proceedings, 530\u2013547.. Springer, Taormina. https:\/\/doi.org\/10.1007\/978-3-642-28914-9_30 ."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-70503-3_4","volume-title":"Theory of Cryptography - 15th International Conference, TCC, Proceedings, Part II","author":"W Chongchitmate","year":"2017","unstructured":"Chongchitmate, W, Ostrovsky R, Visconti I (2017) Resettably-sound resettable zero knowledge in constant rounds In: Theory of Cryptography - 15th International Conference, TCC, Proceedings, Part II, 111\u2013138.. Springer, Baltimore. https:\/\/doi.org\/10.1007\/978-3-319-70503-3_4 ."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/FOCS.2013.14","volume-title":"54th Annual IEEE Symposium on Foundations of Computer Science, FOCS","author":"K-M Chung","year":"2013","unstructured":"Chung, K-M, Lin H, Pass R (2013) Constant-round concurrent zero knowledge from p-certificates In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 50\u201359.. IEEE Computer Society, Berkeley. https:\/\/doi.org\/10.1109\/FOCS.2013.14 ."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-662-47989-6_14","volume-title":"Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings, Part I","author":"K-M Chung","year":"2015","unstructured":"Chung, K-M, Lin H, Pass R (2015) Constant-round concurrent zero-knowledge from indistinguishability obfuscation In: Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings, Part I, 287\u2013307.. Springer, Santa Barbara. https:\/\/doi.org\/10.1007\/978-3-662-47989-6_14 ."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-54242-8_9","volume-title":"Theory of Cryptography - 11th Theory of Cryptography Conference, TCC. Proceedings","author":"K-M Chung","year":"2014","unstructured":"Chung, K-M, Ostrovsky R, Pass R, Venkitasubramaniam M, Visconti I (2014) 4-round resettably-sound zero knowledge In: Theory of Cryptography - 11th Theory of Cryptography Conference, TCC. Proceedings, 192\u2013216.. Springer, San Diego. https:\/\/doi.org\/10.1007\/978-3-642-54242-8_9 ."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/FOCS.2013.15","volume-title":"54th Annual IEEE Symposium on Foundations of Computer Science, FOCS","author":"K-M Chung","year":"2013","unstructured":"Chung, K-M, Ostrovsky R, Pass R, Visconti I (2013a) Simultaneous resettability from one-way functions In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 60\u201369.. IEEE Computer Society, Berkeley. https:\/\/doi.org\/10.1109\/FOCS.2013.15 ."},{"key":"14_CR18","first-page":"231","volume-title":"Symposium on Theory of Computing Conference, STOC\u201913","author":"K-M Chung","year":"2013","unstructured":"Chung, K-M, Pass R, Seth K (2013b) Non-black-box simulation from one-way functions and applications to resettable security In: Symposium on Theory of Computing Conference, STOC\u201913, 231\u2013240.. ACM, Palo Alto. http:\/\/doi.acm.org\/10.1145\/2488608.2488638 ."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-662-53015-3_10","volume-title":"Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Proceedings, Part III","author":"M Ciampi","year":"2016","unstructured":"Ciampi, M, Ostrovsky R, Siniscalchi L, Visconti I (2016) Concurrent non-malleable commitments (and more) in 3 rounds In: Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Proceedings, Part III, 270\u2013299.. Springer, Santa Barbara. https:\/\/doi.org\/10.1007\/978-3-662-53015-3_10 ."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/FOCS.2009.59","volume-title":"50th Annual IEEE Symposium on Foundations of Computer Science, FOCS","author":"Y Deng","year":"2009","unstructured":"Deng, Y, Goyal V, Sahai A (2009) Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 251\u2013260.. IEEE Computer Society, Atlanta. https:\/\/doi.org\/10.1109\/FOCS.2009.59 ."},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev, D, Dwork C, Naor M (2000) Nonmalleable cryptography. SIAM J Comput 30(2):391\u2013437.","journal-title":"SIAM J Comput"},{"key":"14_CR22","first-page":"409","volume-title":"Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, STOC","author":"C Dwork","year":"1998","unstructured":"Dwork, C, Naor M, Sahai A (1998) Concurrent zero-knowledge In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, STOC, 409\u2013418.. ACM, Dallas. http:\/\/doi.acm.org\/10.1145\/276698.276853 ."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/FOCS.2013.13","volume-title":"54th Annual IEEE Symposium on Foundations of Computer Science, FOCS","author":"S Garg","year":"2013","unstructured":"Garg, S, Gentry C, Halevi S, Raykova M, Sahai A, Waters B (2013) Candidate indistinguishability obfuscation and functional encryption for all circuits In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 40\u201349.. IEEE Computer Society, Berkeley. https:\/\/doi.org\/10.1109\/FOCS.2013.13 ."},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-642-28914-9_28","volume-title":"Theory of Cryptography - 9th Theory of Cryptography Conference, TCC. Proceedings","author":"S Garg","year":"2012","unstructured":"Garg, S, Ostrovsky R, Visconti I, Wadia A (2012) Resettable statistical zero knowledge In: Theory of Cryptography - 9th Theory of Cryptography Conference, TCC. Proceedings, 494\u2013511.. Springer, Taormina. https:\/\/doi.org\/10.1007\/978-3-642-28914-9_28 ."},{"issue":"1","key":"14_CR25","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 (1989) The knowledge complexity of interactive proof systems. SIAM J Comput 18(1):186\u2013208. https:\/\/doi.org\/10.1137\/0218012 .","journal-title":"SIAM J Comput"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-46494-6_12","volume-title":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Proceedings, Part I","author":"V Goyal","year":"2015","unstructured":"Goyal, V, Lin H, Pandey O, Pass R, Sahai A (2015) Round-efficient concurrently composable secure computation via a robust extraction lemma In: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Proceedings, Part I, 260\u2013289.. Springer, Warsaw. https:\/\/doi.org\/10.1007\/978-3-662-46494-6_12 ."},{"issue":"4","key":"14_CR27","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J, Impagliazzo R, Levin LA, Luby M (1999) A pseudorandom generator from any one-way function. SIAM J Comput 28(4):1364\u20131396.","journal-title":"SIAM J Comput"},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-662-46497-7_26","volume-title":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Proceedings, Part II","author":"Y Ishai","year":"2015","unstructured":"Ishai, Y, Pandey O, Sahai A (2015) Public-coin differing-inputs obfuscation and its applications In: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Proceedings, Part II, 668\u2013697.. Springer, Warsaw. https:\/\/doi.org\/10.1007\/978-3-662-46497-7_26 ."},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/FOCS.2017.58","volume-title":"58th IEEE Annual Symposium on Foundations of Computer Science, FOCS","author":"D Khurana","year":"2017","unstructured":"Khurana, D, Sahai A (2017) How to achieve non-malleability in one or two rounds In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS, 564\u2013575.. IEEE Computer Society, Berkeley. https:\/\/doi.org\/10.1109\/FOCS.2017.58 ."},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/SFCS.1998.743499","volume-title":"39th Annual Symposium on Foundations of Computer Science, FOCS \u201998","author":"J Kilian","year":"1998","unstructured":"Kilian, J, Petrank E, Rackoff C (1998) Lower bounds for zero knowledge on the internet In: 39th Annual Symposium on Foundations of Computer Science, FOCS \u201998, 484\u2013492.. IEEE Computer Society, Palo Alto. https:\/\/doi.org\/10.1109\/SFCS.1998.743499 ."},{"key":"14_CR31","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-662-44381-1_20","volume-title":"Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings, Part II","author":"S Kiyoshima","year":"2014","unstructured":"Kiyoshima, S (2014) Round-efficient black-box construction of composable multi-party computation In: Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings, Part II, 351\u2013368.. Springer, Santa Barbara. https:\/\/doi.org\/10.1007\/978-3-662-44381-1_20 ."},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-662-46494-6_13","volume-title":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Proceedings, Part I","author":"Kiyoshima, S","year":"2015","unstructured":"Kiyoshima, S (2015) An alternative approach to non-black-box simulation in fully concurrent setting In: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Proceedings, Part I, 290\u2013318.. Springer, Warsaw. https:\/\/doi.org\/10.1007\/978-3-662-46494-6_13 ."},{"key":"14_CR33","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/1536414.1536442","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC","author":"H Lin","year":"2009","unstructured":"Lin, H, Pass R (2009) Non-malleability amplification In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC, 189\u2013198.. ACM, Bethesda. http:\/\/doi.acm.org\/10.1145\/1536414.1536442 ."},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-19571-6_17","volume-title":"Theory of Cryptography - 8th Theory of Cryptography Conference, TCC. Proceedings","author":"R Pass","year":"2011","unstructured":"Lin, H, Pass R (2011) Concurrent non-malleable zero knowledge with adaptive inputs In: Theory of Cryptography - 8th Theory of Cryptography Conference, TCC. Proceedings, 274\u2013292.. Springer, Providence. https:\/\/doi.org\/10.1007\/978-3-642-19571-6_17 ."},{"key":"14_CR35","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-32009-5_27","volume-title":"Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference. Proceedings","author":"H Lin","year":"2012","unstructured":"Lin, H, Pass R (2012) Black-box constructions of composable protocols without set-up In: Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference. Proceedings, 461\u2013478.. Springer, Santa Barbara. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_27 ."},{"key":"14_CR36","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1109\/FOCS.2017.59","volume-title":"58th IEEE Annual Symposium on Foundations of Computer Science, FOCS","author":"H Lin","year":"2017","unstructured":"Lin, H, Pass R, Soni P (2017) Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS, 576\u2013587.. IEEE Computer Society, Berkeley. https:\/\/doi.org\/10.1109\/FOCS.2017.59 ."},{"key":"14_CR37","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-642-14623-7_23","volume-title":"Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference. Proceedings","author":"H Lin","year":"2010","unstructured":"Lin, H, Pass R, Tseng WD, Venkitasubramaniam M (2010) Concurrent non-malleable zero knowledge proofs In: Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference. Proceedings, 429\u2013446.. Springer, Santa Barbara. https:\/\/doi.org\/10.1007\/978-3-642-14623-7_23 ."},{"key":"14_CR38","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-78524-8_31","volume-title":"Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC","author":"H Lin","year":"2008","unstructured":"Lin, H, Pass R, Venkitasubramaniam M (2008) Concurrent non-malleable commitments from any one-way function In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC, 571\u2013588.. Springer, New York. https:\/\/doi.org\/10.1007\/978-3-540-78524-8_31 ."},{"key":"14_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11681878_1","volume-title":"Theory of Cryptography, Third Theory of Cryptography Conference, TCC, Proceedings","author":"D Micciancio","year":"2006","unstructured":"Micciancio, D, Ong SJ, Sahai A, Vadhan S (2006) Concurrent zero knowledge without complexity assumptions In: Theory of Cryptography, Third Theory of Cryptography Conference, TCC, Proceedings, 1\u201320.. Springer, New York. https:\/\/doi.org\/10.1007\/11681878_1 ."},{"key":"14_CR40","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-54242-8_8","volume-title":"Theory of Cryptography - 11th Theory of Cryptography Conference, TCC. Proceedings","author":"C Orlandi","year":"2014","unstructured":"Orlandi, C, Ostrovsky R, Rao V, Sahai A, Visconti I (2014) Statistical concurrent non-malleable zero knowledge In: Theory of Cryptography - 11th Theory of Cryptography Conference, TCC. Proceedings, 167\u2013191.. Springer, San Diego. https:\/\/doi.org\/10.1007\/978-3-642-54242-8_8 ."},{"key":"14_CR41","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-642-11799-2_32","volume-title":"Theory of Cryptography, 7th Theory of Cryptography Conference, TCC. Proceedings","author":"R Ostrovsky","year":"2010","unstructured":"Ostrovsky, R, Pandey O, Visconti I (2010) Efficiency preserving transformations for concurrent non-malleable zero knowledge In: Theory of Cryptography, 7th Theory of Cryptography Conference, TCC. Proceedings, 535\u2013552.. Springer, Zurich. https:\/\/doi.org\/10.1007\/978-3-642-11799-2_32 ."},{"key":"14_CR42","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-540-70583-3_45","volume-title":"Automata, Languages and Programming, 35th International Colloquium, ICALP, Proceedings","author":"R Ostrovsky","year":"2008","unstructured":"Ostrovsky, R, Persiano G, Visconti I (2008) Constant-round concurrent non-malleable zero knowledge in the bare public-key model In: Automata, Languages and Programming, 35th International Colloquium, ICALP, Proceedings, 548\u2013559.. Springer, Reykjavik. https:\/\/doi.org\/10.1007\/978-3-540-70583-3_45 ."},{"key":"14_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6_15","volume-title":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Procee6dings, Part I","author":"R Ostrovsky","year":"2015","unstructured":"Ostrovsky, R, Scafuro A, Venkitasubramaniam M (2015) Resettably sound zero-knowledge arguments from owfs - the (semi) black-box way In: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Procee6dings, Part I.. Springer, Warsaw. https:\/\/doi.org\/10.1007\/978-3-662-46494-6_15 ."},{"key":"14_CR44","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-662-46497-7_25","volume-title":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Proceedings, Part II","author":"O Pandey","year":"2015","unstructured":"Pandey, O, Prabhakaran M, Sahai A (2015) Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP In: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC, Proceedings, Part II, 638\u2013667.. Springer, Warsaw. https:\/\/doi.org\/10.1007\/978-3-662-46497-7_25 ."},{"key":"14_CR45","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/SFCS.2005.27","volume-title":"46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), Proceedings","author":"R Pass","year":"2005","unstructured":"Pass, R, Rosen A (2005) Concurrent non-malleable commitments In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), Proceedings, 563\u2013572.. IEEE Computer Society, Pittsburgh. https:\/\/doi.org\/10.1109\/SFCS.2005.27 ."},{"key":"14_CR46","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-44598-6_28","volume-title":"Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Proceedings","author":"A Rosen","year":"2000","unstructured":"Rosen, A (2000) A note on the round-complexity of concurrent zero-knowledge In: Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Proceedings, 451\u2013468.. Springer, Santa Barbara. https:\/\/doi.org\/10.1007\/3-540-44598-6_28 ."}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-018-0014-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s42400-018-0014-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-018-0014-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T00:00:32Z","timestamp":1662163232000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-018-0014-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,29]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["14"],"URL":"https:\/\/doi.org\/10.1186\/s42400-018-0014-7","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,29]]},"assertion":[{"value":"22 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"12"}}