{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:29:40Z","timestamp":1740180580883,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T00:00:00Z","timestamp":1731801600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T00:00:00Z","timestamp":1731801600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFB4503203"],"award-info":[{"award-number":["2023YFB4503203"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372447","61932019"],"award-info":[{"award-number":["62372447","61932019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we construct a 6-round simultaneously resettable sound resettable <jats:inline-formula><jats:alternatives><jats:tex-math>$$(T, \\epsilon )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>T<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>\u03f5<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-zero knowledge protocol for <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathsf {NP \\cap coNP}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>NP<\/mml:mi>\n                    <mml:mo>\u2229<\/mml:mo>\n                    <mml:mi>coNP<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in the Public Key model under standard assumptions, comparing with the 27-round simultaneously resettable zero knowledge protocol in the BPK model by Deng et al. in 2011, we have achieved a significant reduction in the round complexity. Our model assumes that <jats:italic>both prover and verifier hold public keys<\/jats:italic>, we call it the Public Key model. It is a variation of the traditional BPK model where only the verifier is assumed to hold public keys. In the original BPK model, under the sub-exponential hardness assumption of factoring, we construct a 2-round simultaneously resettable sound resettable <jats:inline-formula><jats:alternatives><jats:tex-math>$$(T,\\epsilon )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>T<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>\u03f5<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-zero knowledge protocol for <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{NP}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>NP<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1186\/s42400-024-00253-5","type":"journal-article","created":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T01:02:51Z","timestamp":1731805371000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simultaneously resettable zero knowledge protocol in Public Key model"],"prefix":"10.1186","volume":"7","author":[{"given":"Wei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5948-0780","authenticated-orcid":false,"given":"Yi","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,17]]},"reference":[{"key":"253_CR1","doi-asserted-by":"publisher","unstructured":"Barak B, Canetti R, Nielsen JB, Pass R (2004) Universally composable protocols with relaxed set-up assumptions. In: FOCS, pp. 186\u2013195. IEEE Computer Society, USA. https:\/\/doi.org\/10.1109\/FOCS.2004.71","DOI":"10.1109\/FOCS.2004.71"},{"key":"253_CR2","doi-asserted-by":"publisher","unstructured":"Barak B, Goldreich O, Goldwasser S, Lindell Y (2001) Resettably-sound zero-knowledge and its applications. In: FOCS, pp. 116\u2013125. IEEE Computer Society, USA. https:\/\/doi.org\/10.1109\/SFCS.2001.959886","DOI":"10.1109\/SFCS.2001.959886"},{"key":"253_CR3","doi-asserted-by":"publisher","unstructured":"Canetti R, Goldreich O, Goldwasser S, Micali S (2000) Resettable zero-knowledge (extended abstract). In: STOC, pp. 235\u2013244. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/335305.335334","DOI":"10.1145\/335305.335334"},{"key":"253_CR4","doi-asserted-by":"publisher","unstructured":"Crescenzo GD, Lipmaa H (2008) 3-message NP arguments in the BPK model with optimal soundness and zero-knowledge. In: ISAAC. Lecture notes in computer science, vol. 5369, pp. 615\u2013627. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-92182-0_55","DOI":"10.1007\/978-3-540-92182-0_55"},{"key":"253_CR5","doi-asserted-by":"publisher","unstructured":"Crescenzo GD, Persiano G, Visconti I (2004) Constant-round resettable zero knowledge with concurrent soundness in the bare public-key model. In: CRYPTO. Lecture notes in computer science, vol. 3152, pp. 237\u2013253. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-28628-8_15","DOI":"10.1007\/978-3-540-28628-8_15"},{"key":"253_CR6","doi-asserted-by":"publisher","unstructured":"Crescenzo GD (2009) Minimal assumptions and round complexity for concurrent zero-knowledge in the bare public-key model. In: COCOON. Lecture notes in computer science, vol. 5609, pp. 127\u2013137. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-30539-2_37","DOI":"10.1007\/978-3-540-30539-2_37"},{"issue":"3","key":"253_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/J.IPL.2004.06.015","volume":"92","author":"J Cai","year":"2004","unstructured":"Cai J, Threlfall RA (2004) A note on quadratic residuosity and UP. Inf Process Lett 92(3):127\u2013131. https:\/\/doi.org\/10.1016\/J.IPL.2004.06.015","journal-title":"Inf Process Lett"},{"key":"253_CR8","doi-asserted-by":"publisher","unstructured":"Crescenzo GD, Visconti I (2005) Concurrent zero knowledge in the public-key model. In: ICALP. Lecture notes in computer science, vol. 3580, pp. 816\u2013827. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11523468_66","DOI":"10.1007\/11523468_66"},{"key":"253_CR9","doi-asserted-by":"publisher","unstructured":"Deng Y (2020) Individual simulations. In: ASIACRYPT (3). Lecture notes in computer science, vol. 12493, pp. 805\u2013836. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-64840-4_27","DOI":"10.1007\/978-3-030-64840-4_27"},{"key":"253_CR10","doi-asserted-by":"publisher","unstructured":"Deng Y, Feng D, Goyal V, Lin D, Sahai A, Yung M (2011) Resettable cryptography in constant rounds - the case of zero knowledge. In: ASIACRYPT. Lecture notes in computer science, vol. 7073, pp. 390\u2013406. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-25385-0_21","DOI":"10.1007\/978-3-642-25385-0_21"},{"key":"253_CR11","doi-asserted-by":"publisher","unstructured":"Deng Y, Goyal V, Sahai A (2009) Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy. In: FOCS, pp. 251\u2013260. IEEE Computer Society, USA. https:\/\/doi.org\/10.1109\/FOCS.2009.59","DOI":"10.1109\/FOCS.2009.59"},{"key":"253_CR12","doi-asserted-by":"publisher","unstructured":"Deng Y, Lin D (2007) Instance-dependent verifiable random functions and their application to simultaneous resettability. In: EUROCRYPT. Lecture notes in computer science, vol. 4515, pp. 148\u2013168. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-72540-4_9","DOI":"10.1007\/978-3-540-72540-4_9"},{"key":"253_CR13","doi-asserted-by":"publisher","unstructured":"Deng Y, Lin D (2007) Resettable zero knowledge with concurrent soundness in the bare public-key model under standard assumption. In: Inscrypt. Lecture notes in computer science, vol. 4990, pp. 123\u2013137. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-79499-8_11","DOI":"10.1007\/978-3-540-79499-8_11"},{"key":"253_CR14","doi-asserted-by":"publisher","unstructured":"Dwork C, Naor M (2000) Zaps and their applications. In: FOCS, pp. 283\u2013293. IEEE computer society, USA. https:\/\/doi.org\/10.1109\/SFCS.2000.892117","DOI":"10.1109\/SFCS.2000.892117"},{"issue":"1","key":"253_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U Feige","year":"1999","unstructured":"Feige U, Lapidot D, Shamir A (1999) Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J Comput 29(1):1\u201328. https:\/\/doi.org\/10.1137\/S0097539792230010","journal-title":"SIAM J Comput"},{"key":"253_CR16","doi-asserted-by":"publisher","unstructured":"Goldwasser S, Micali S, Rackoff C (1985) The knowledge complexity of interactive proof-systems (extended abstract). In: STOC, pp. 291\u2013304. ACM, New York. https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"253_CR17","doi-asserted-by":"publisher","unstructured":"Micali S, Reyzin L (2001) Min-round resettable zero-knowledge in the public-key model. In: EUROCRYPT. Lecture notes in computer science, vol. 2045, pp. 373\u2013393. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-44987-6_23","DOI":"10.1007\/3-540-44987-6_23"},{"key":"253_CR18","doi-asserted-by":"publisher","unstructured":"Micali S, Reyzin L (2001) Soundness in the public-key model. In: CRYPTO. Lecture notes in computer science, vol. 2139, pp. 542\u2013565. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-44647-8_32","DOI":"10.1007\/3-540-44647-8_32"},{"key":"253_CR19","doi-asserted-by":"publisher","unstructured":"Pass R (2003) Simulation in quasi-polynomial time, and its application to protocol composition. In: EUROCRYPT. Lecture notes in computer science, vol. 2656, pp. 160\u2013176. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-39200-9_10","DOI":"10.1007\/3-540-39200-9_10"},{"key":"253_CR20","doi-asserted-by":"publisher","unstructured":"Visconti I (2006) Efficient zero knowledge on the internet. In: ICALP (2). Lecture notes in computer science, vol. 4052, pp. 22\u201333. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11787006_3","DOI":"10.1007\/11787006_3"},{"key":"253_CR21","doi-asserted-by":"publisher","unstructured":"Yung M, Zhao Y (2007) Generic and practical resettable zero-knowledge in the bare public-key model. In: EUROCRYPT. Lecture notes in computer science, vol. 4515, pp. 129\u2013147. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-72540-4_8","DOI":"10.1007\/978-3-540-72540-4_8"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00253-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00253-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00253-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T02:02:24Z","timestamp":1731808944000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00253-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,17]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["253"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00253-5","relation":{},"ISSN":["2523-3246"],"issn-type":[{"type":"electronic","value":"2523-3246"}],"subject":[],"published":{"date-parts":[[2024,11,17]]},"assertion":[{"value":"19 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"60"}}