{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T18:40:38Z","timestamp":1658774438337},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00145-022-09426-2","type":"journal-article","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T23:03:28Z","timestamp":1651619008000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance"],"prefix":"10.1007","volume":"35","author":[{"given":"Susumu","family":"Kiyoshima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"9426_CR1","doi-asserted-by":"crossref","unstructured":"P. Ananth, V. Goyal, O. Pandey, Interactive proofs under continual memory leakage, in CRYPTO (2014), pp. 164\u2013182","DOI":"10.1007\/978-3-662-44381-1_10"},{"key":"9426_CR2","unstructured":"R. Anderson, M. Kuhn, Tamper resistance: a cautionary note, in WOEC (1996), pp. 1\u201311"},{"key":"9426_CR3","doi-asserted-by":"crossref","unstructured":"B. Barak, How to go beyond the black-box simulation barrier, in FOCS (2001), pp. 106\u2013115","DOI":"10.1109\/SFCS.2001.959885"},{"issue":"2","key":"9426_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"Gilles Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau, Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci. 37(2), 156\u2013189 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"9426_CR5","doi-asserted-by":"crossref","unstructured":"N. Bitansky, R. Canetti, S. Halevi, Leakage-tolerant interactive protocols, in TCC (2012), pp. 266\u2013284","DOI":"10.1007\/978-3-642-28914-9_15"},{"key":"9426_CR6","doi-asserted-by":"crossref","unstructured":"F. Benhamouda, A. Degwekar, Y. Ishai, T. Rabin, On the local leakage resilience of linear secret sharing schemes, in CRYPTO (2018), pp. 531\u2013561","DOI":"10.1007\/978-3-319-96884-1_18"},{"key":"9426_CR7","doi-asserted-by":"crossref","unstructured":"N. Bitansky, D. Dachman-Soled, H. Lin, Leakage-tolerant computation with input-independent preprocessing, in CRYPTO (2014), pp. 146\u2013163","DOI":"10.1007\/978-3-662-44381-1_9"},{"issue":"5","key":"9426_CR8","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/070709244","volume":"38","author":"Boaz Barak","year":"2008","unstructured":"B. Barak, O. Goldreich, Universal arguments and their applications, SIAM J. Comput. 38(5), 1661\u20131694 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"9426_CR9","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Garg, A. Jain, Y.T. Kalai, A. Sahai, Secure computation against adaptive auxiliary information, in CRYPTO (2013), pp. 316\u2013334","DOI":"10.1007\/978-3-642-40041-4_18"},{"key":"9426_CR10","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Goldwasser, A. Jain, Y.T. Kalai, Multiparty computation secure against continual memory leakage, in STOC (2012), pp. 1235\u20131254","DOI":"10.1145\/2213977.2214087"},{"key":"9426_CR11","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Goldwasser, Y.T. Kalai, Leakage-resilient coin tossing. Distrib. Comput. 27(3), 147\u2013164 (2014)","DOI":"10.1007\/s00446-013-0206-z"},{"key":"9426_CR12","doi-asserted-by":"crossref","unstructured":"R. Canetti, S. Goldwasser, O. Poburinnaya, Adaptively secure two-party computation from indistinguishability obfuscation, in TCC (2015), pp. 557\u2013585","DOI":"10.1007\/978-3-662-46497-7_22"},{"key":"9426_CR13","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in STOC (2002), pp. 494\u2013503","DOI":"10.1145\/509907.509980"},{"issue":"2","key":"9426_CR14","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1137\/130946083","volume":"45","author":"Kai-min Chung","year":"2016","unstructured":"K. Chung, R. Pass, K. Seth, Non-black-box simulation from one-way functions and applications to resettable security. SIAM J. Comput. 45(2), 415\u2013458 (2016)","journal-title":"SIAM J. Comput."},{"key":"9426_CR15","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Poburinnaya, M. Venkitasubramaniam, Better two-round adaptive multi-party computation, in PKC (2017), pp. 396\u2013427","DOI":"10.1007\/978-3-662-54388-7_14"},{"key":"9426_CR16","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Poburinnaya, M. Venkitasubramaniam, Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model, in STOC (2017), pp. 497\u2013509","DOI":"10.1145\/3055399.3055495"},{"key":"9426_CR17","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, J. Katz, V. Rao, Adaptively secure, universally composable, multiparty computation in constant rounds, in TCC (2015), pp. 586\u2013613","DOI":"10.1007\/978-3-662-46497-7_23"},{"key":"9426_CR18","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, F.-H. Liu, H.-S. Zhou, Leakage-resilient circuits revisited - optimal number of computing components without leak-free hardware, in EUROCRYPT (2015), pp. 131\u2013158","DOI":"10.1007\/978-3-662-46803-6_5"},{"issue":"3","key":"9426_CR19","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/18.669255","volume":"44","author":"Ivan Damg\u00e5rd","year":"1998","unstructured":"I. Damg\u00e5rd, T.P. Pedersen, B. Pfitzmann, Statistical secrecy and multibit commitments. IEEE Trans. Inf. Theory 44(3), 1143\u20131151 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9426_CR20","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Shamir, Zero knowledge proofs of knowledge in two rounds, in CRYPTO (1989), pp. 526\u2013544","DOI":"10.1007\/0-387-34805-0_46"},{"key":"9426_CR21","doi-asserted-by":"crossref","unstructured":"V. Goyal, Y. Ishai, H.K. Maji, A. Sahai, A.A. Sherstov, Bounded-communication leakage resilience via parity-resilient circuits, in FOCS (2016)","DOI":"10.1109\/FOCS.2016.10"},{"key":"9426_CR22","doi-asserted-by":"crossref","unstructured":"S. Garg, A. Jain, A. Sahai, Leakage-resilient zero knowledge, in CRYPTO (2011), pp. 297\u2013315","DOI":"10.1007\/978-3-642-22792-9_17"},{"issue":"3","key":"9426_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00208001","volume":"9","author":"Oded Goldreich","year":"1996","unstructured":"O. Goldreich, A. Kahan, How to construct constant-round zero-knowledge proof systems for NP. J. Cryptol. 9(3), 167\u2013190 (1996)","journal-title":"J. Cryptol."},{"issue":"1","key":"9426_CR24","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"Shafi Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"9426_CR25","doi-asserted-by":"crossref","unstructured":"O. Goldreich, Foundations of Cryptography: Volume 1, Basic Tools (Cambridge University Press, August 2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"9426_CR26","doi-asserted-by":"crossref","unstructured":"O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications (Cambridge University Press, May 2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9426_CR27","doi-asserted-by":"crossref","unstructured":"S. Garg, A. Polychroniadou, Two-round adaptively secure MPC from indistinguishability obfuscation, in TCC (2015), pp. 614\u2013637","DOI":"10.1007\/978-3-662-46497-7_24"},{"issue":"4","key":"9426_CR28","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"Johan H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"9426_CR29","doi-asserted-by":"crossref","unstructured":"I. Haitner, M.-H. Nguyen, S.J. Ong, O. Reingold, S.P. Vadhan, Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM J. Comput. 39(3), 1153\u20131218 (2009)","DOI":"10.1137\/080725404"},{"key":"9426_CR30","doi-asserted-by":"crossref","unstructured":"P.C. Kocher, Timing attacks on implementations of Diffie\u2013Hellman, RSA, DSS, and other systems, in CRYPTO (1996), pp. 104\u2013113","DOI":"10.1007\/3-540-68697-5_9"},{"key":"9426_CR31","doi-asserted-by":"crossref","unstructured":"Y.T. Kalai, L. Reyzin, A survey of leakage-resilient cryptography. Cryptology ePrint Archive, Report 2019\/302 (2019). https:\/\/eprint.iacr.org\/2019\/302","DOI":"10.1145\/3335741.3335768"},{"issue":"4","key":"9426_CR32","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/s00145-010-9072-z","volume":"24","author":"Yehuda Lindell","year":"2011","unstructured":"Y. Lindell, H. Zarosim, Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. J. Cryptol. 24(4), 761\u2013799 (2011)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"9426_CR33","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"Moni Naor","year":"1991","unstructured":"M. Naor, Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"9426_CR34","doi-asserted-by":"crossref","unstructured":"M. Naor, M. Yung, Universal one-way hash functions and their cryptographic applications, in STOC (1989), pp. 33\u201343","DOI":"10.1145\/73007.73011"},{"key":"9426_CR35","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, G. Persiano, I. Visconti, Impossibility of black-box simulation against leakage attacks, in CRYPTO (2015), pp. 130\u2013149","DOI":"10.1007\/978-3-662-48000-7_7"},{"key":"9426_CR36","doi-asserted-by":"crossref","unstructured":"O. Pandey, Achieving constant round leakage-resilient zero-knowledge, in TCC (2014), pp. 146\u2013166","DOI":"10.1007\/978-3-642-54242-8_7"},{"issue":"6","key":"9426_CR37","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1137\/060661880","volume":"37","author":"Rafael Pass","year":"2008","unstructured":"R. Pass, A. Rosen, Concurrent nonmalleable commitments. SIAM J. Comput. 37(6), 1891\u20131925 (2008)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"9426_CR38","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/060671553","volume":"38","author":"Rafael Pass","year":"2008","unstructured":"R. Pass, A. Rosen, New and improved constructions of nonmalleable cryptographic protocols. SIAM J. Comput. 38(2), 702\u2013752 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"9426_CR39","doi-asserted-by":"crossref","unstructured":"R. Pass, H. Wee, Black-box constructions of two-party protocols from one-way functions, in TCC (2009), pp. 403\u2013418","DOI":"10.1007\/978-3-642-00457-5_24"},{"key":"9426_CR40","doi-asserted-by":"crossref","unstructured":"J.-J. Quisquater, D. Samyde, Electromagnetic analysis (EMA): measures and counter-measures for smart cards, in E-smart (2001), pp. 200\u2013210","DOI":"10.1007\/3-540-45418-7_17"},{"key":"9426_CR41","doi-asserted-by":"crossref","unstructured":"A. Srinivasan, P.N. Vasudevan, Leakage resilient secret sharing and applications, in CRYPTO (2019), pp. 480\u2013509","DOI":"10.1007\/978-3-030-26951-7_17"},{"key":"9426_CR42","unstructured":"A.C.-C. Yao, How to generate and exchange secrets (extended abstract), in FOCS (1986), pp. 162\u2013167"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09426-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09426-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09426-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T18:19:58Z","timestamp":1658773198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-022-09426-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,4]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["9426"],"URL":"https:\/\/doi.org\/10.1007\/s00145-022-09426-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,4]]},"assertion":[{"value":"21 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"16"}}