{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T08:02:57Z","timestamp":1750492977871},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"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,10]]},"DOI":"10.1007\/s00145-022-09433-3","type":"journal-article","created":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T22:02:38Z","timestamp":1658786558000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["ZK-PCPs from Leakage-Resilient Secret Sharing"],"prefix":"10.1007","volume":"35","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mor","family":"Weiss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,25]]},"reference":[{"key":"9433_CR1","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, I. Damg\u00e5rd, J.B. Nielsen, M. Obremski, E. Purwanto, J.L. Ribeiro, M. Simkin, Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures, in CRYPTO, Proceedings, Part II (2019), pp. 510\u2013539","DOI":"10.1007\/978-3-030-26951-7_18"},{"key":"9433_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in FOCS, Proceedings (1992), pp. 14\u201323","DOI":"10.1109\/SFCS.1992.267823"},{"key":"9433_CR3","doi-asserted-by":"crossref","unstructured":"S. Arora, S. Safra, Probabilistic checking of proofs; A new characterization of NP, in FOCS, Proceedings (1992), pp. 2\u201313","DOI":"10.1109\/SFCS.1992.267824"},{"key":"9433_CR4","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, S. Guo, T. Malkin, L.-Y. Tan, Non-malleable codes for small-depth circuits, in FOCS (2018), pp. 826\u2013837","DOI":"10.1109\/FOCS.2018.00083"},{"key":"9433_CR5","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, Proceedings (2018), pp. 531\u2013561","DOI":"10.1007\/978-3-319-96884-1_18"},{"key":"9433_CR6","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, M. Kulkarni, T. Malkin, Non-malleable codes for bounded depth, bounded fan-in circuits, in EUROCRYPT (2016), pp. 881\u2013908","DOI":"10.1007\/978-3-662-49896-5_31"},{"key":"9433_CR7","doi-asserted-by":"crossref","unstructured":"E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, S.P. Vadhan, Robust PCPs of proximity, shorter PCPs and applications to coding, in STOC, Proceedings (2004), pp. 1\u201310","DOI":"10.1145\/1007352.1007361"},{"key":"9433_CR8","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in STOC (1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9433_CR9","doi-asserted-by":"crossref","unstructured":"E. Ben-Sasson, M. Sudan, Short PCPs with polylog query complexity. SIAM J. Comput., 38(2), 551\u2013607 (2008)","DOI":"10.1137\/050646445"},{"key":"9433_CR10","doi-asserted-by":"crossref","unstructured":"R. Canetti, I. Damg\u00e5rd, S. Dziembowski, Y. Ishai, T. Malkin, On adaptive vs. non-adaptive security of multiparty protocols, in EUROCRYPT, Proceedings (2001), pp. 262\u2013279","DOI":"10.1007\/3-540-44987-6_17"},{"key":"9433_CR11","doi-asserted-by":"crossref","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, H. Wee, Black-box construction of a non-malleable encryption scheme from any semantically secure one, in TCC (2008), pp. 427\u2013444","DOI":"10.1007\/978-3-540-78524-8_24"},{"key":"9433_CR12","doi-asserted-by":"crossref","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, H. Wee, A black-box construction of non-malleable encryption from semantically secure encryption. J. Cryptol., 31(1), 172\u2013201 (2018)","DOI":"10.1007\/s00145-017-9254-z"},{"key":"9433_CR13","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, J.B. Nielsen, Secure Multiparty Computation and Secret Sharing (Cambridge University Press, 2015)","DOI":"10.1017\/CBO9781107337756"},{"key":"9433_CR14","doi-asserted-by":"crossref","unstructured":"F. Dav\u00ec, S. Dziembowski, D. Venturi, Leakage-resilient storage, in SCN, Proceedings (2010), pp. 121\u2013137","DOI":"10.1007\/978-3-642-15317-4_9"},{"key":"9433_CR15","unstructured":"S.E. Decatur, O. Goldreich, D. Ron, A probabilistic error-correcting scheme. IACR Cryptol. ePrint Arch., 1997, 5 (1997)"},{"key":"9433_CR16","doi-asserted-by":"crossref","unstructured":"S.E. Decatur, O. Goldreich, D. Ron, Computational sample complexity. SIAM J. Comput., 29(3), 854\u2013879 (1999)","DOI":"10.1137\/S0097539797325648"},{"key":"9433_CR17","doi-asserted-by":"crossref","unstructured":"I. Dinur, The PCP theorem by gap amplification, in STOC, Proceedings (2006), pp. 241\u2013250","DOI":"10.1145\/1132516.1132553"},{"key":"9433_CR18","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, K. Pietrzak, Intrusion-resilient secret sharing, in FOCS, Proceedings (2007), pp. 227\u2013237","DOI":"10.1109\/FOCS.2007.63"},{"key":"9433_CR19","unstructured":"I. Dinur, O. Reingold, Assignment testers: towards a combinatorial proof of the PCP-theorem, in FOCS, Proceedings (2004), pp. 155\u2013164"},{"key":"9433_CR20","doi-asserted-by":"crossref","unstructured":"V. Goyal, A. Kumar, Non-malleable secret sharing, in STOC, Proceedings (2018), pp. 685\u2013698","DOI":"10.1145\/3188745.3188872"},{"key":"9433_CR21","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof-systems (extended abstract), in STOC, Proceedings (1985), pp. 291\u2013304","DOI":"10.1145\/22145.22178"},{"key":"9433_CR22","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge from secure multiparty computation, in STOC, Proceedings (2007), pp. 21\u201330","DOI":"10.1145\/1250790.1250794"},{"key":"9433_CR23","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput., 39(3), 1121\u20131152 (2009)","DOI":"10.1137\/080725398"},{"key":"9433_CR24","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Mahmoody, A. Sahai, On efficient zero-knowledge PCPs, in TCC, Proceedings (2012), pp. 151\u2013168","DOI":"10.1007\/978-3-642-28914-9_9"},{"key":"9433_CR25","doi-asserted-by":"crossref","unstructured":"Y. Ishai, A. Sahai, M. Viderman, M. Weiss, Zero knowledge LTCs and their applications, in RANDOM, Proceedings (2013), pp. 607\u2013622","DOI":"10.1007\/978-3-642-40328-6_42"},{"key":"9433_CR26","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Weiss, Probabilistically checkable proofs of proximity with zero-knowledge, in TCC, Proceedings (2014), pp. 121\u2013145","DOI":"10.1007\/978-3-642-54242-8_6"},{"key":"9433_CR27","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Weiss, G. Yang, Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits, in TCC, Proceedings (2016), pp. 3\u201332","DOI":"10.1007\/978-3-662-49099-0_1"},{"key":"9433_CR28","doi-asserted-by":"crossref","unstructured":"J. Kilian, E. Petrank, G. Tardos, Probabilistically checkable proofs with zero knowledge, in STOC, Proceedings (1997), pp. 496\u2013505","DOI":"10.1145\/258533.258643"},{"key":"9433_CR29","doi-asserted-by":"crossref","unstructured":"T. Mie, Short PCPPs verifiable in polylogarithmic time with $$O$$(1) queries. Ann. Math. Artif. Intell., 56(3\u20134), 313\u2013338 (2009)","DOI":"10.1007\/s10472-009-9169-y"},{"key":"9433_CR30","doi-asserted-by":"crossref","unstructured":"A. Shamir, How to share a secret. Commun. ACM, 22(11), 612\u2013613 (1979)","DOI":"10.1145\/359168.359176"},{"key":"9433_CR31","doi-asserted-by":"crossref","unstructured":"A. Srinivasan, P.N. Vasudevan, Leakage resilient secret sharing and applications, in CRYPTO, Proceedings (2019), pp. 480\u2013509","DOI":"10.1007\/978-3-030-26951-7_17"},{"key":"9433_CR32","unstructured":"M. Weiss, Secure Computation and Probabilistic Checking. PhD Thesis (2016)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09433-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09433-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09433-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T20:11:39Z","timestamp":1666296699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-022-09433-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,25]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["9433"],"URL":"https:\/\/doi.org\/10.1007\/s00145-022-09433-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,25]]},"assertion":[{"value":"6 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"23"}}