{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T08:02:39Z","timestamp":1750492959991},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_42","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T09:17:34Z","timestamp":1376644654000},"page":"607-622","source":"Crossref","is-referenced-by-count":7,"title":["Zero Knowledge LTCs and Their Applications"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Viderman","sequence":"additional","affiliation":[]},{"given":"Mor","family":"Weiss","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"22","key":"42_CR1","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.ipl.2012.08.003","volume":"112","author":"S. Agrawal","year":"2012","unstructured":"Agrawal, S.: Verifiable secret sharing in a total of three rounds. Inf. Process. Lett.\u00a0112(22), 856\u2013859 (2012)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking Computations in Polylogarithmic Time. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC), New Orleans, Louisiana, USA, May 5-8, pp. 21\u201331. ACM (1991)","key":"42_CR2","DOI":"10.1145\/103418.103428"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","key":"42_CR3","DOI":"10.1145\/62212.62213"},{"unstructured":"Ben-Or, M., Rabin, T.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), Seattle, Washigton, USA, May 14-17, pp. 73\u201385. ACM (1989)","key":"42_CR4"},{"issue":"4","key":"42_CR5","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0097539705446810","volume":"36","author":"E. Ben-Sasson","year":"2006","unstructured":"Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM Journal on Computing\u00a036(4), 889\u2013974 (2006)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539704445445","volume":"35","author":"E. Ben-Sasson","year":"2005","unstructured":"Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3CNF Properties Are Hard to Test. SIAM Journal on Computing\u00a035(1), 1\u201321 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"42_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1002\/rsa.20120","volume":"28","author":"E. Ben-Sasson","year":"2006","unstructured":"Ben-Sasson, E., Sudan, M.: Robust locally testable codes and products of codes. Random Struct. Algorithms\u00a028(4), 387\u2013402 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-03685-9_29","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E. Ben-Sasson","year":"2009","unstructured":"Ben-Sasson, E., Viderman, M.: Composition of Semi-LTCs by Two-Wise Tensor Products. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 378\u2013391. Springer, Heidelberg (2009)"},{"issue":"1","key":"42_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.4086\/toc.2009.v005a012","volume":"5","author":"E. Ben-Sasson","year":"2009","unstructured":"Ben-Sasson, E., Viderman, M.: Tensor Products of Weakly Smooth Codes are Robust. Theory of Computing\u00a05(1), 239\u2013255 (2009)","journal-title":"Theory of Computing"},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319 (1988)","key":"42_CR10","DOI":"10.1145\/62212.62214"},{"doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS, pp. 383\u2013395 (1985)","key":"42_CR11","DOI":"10.1109\/SFCS.1985.64"},{"doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364\u2013369 (1986)","key":"42_CR12","DOI":"10.1145\/12130.12168"},{"key":"42_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 501\u2013520. Springer, Heidelberg (2006)"},{"issue":"3","key":"42_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I. Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM\u00a054(3), 12:1\u201312:44 (2007)","journal-title":"Journal of the ACM"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/11830924_29","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I. Dinur","year":"2006","unstructured":"Dinur, I., Sudan, M., Wigderson, A.: Robust Local Testability of Tensor Products of LDPC Codes. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX and RANDOM 2006. LNCS, vol.\u00a04110, pp. 304\u2013315. Springer, Heidelberg (2006)"},{"key":"42_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/3-540-45708-9_36","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"S. Fehr","year":"2002","unstructured":"Fehr, S., Maurer, U.M.: Linear VSS and distributed commitments based on secret sharing and pairwise checks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 565\u2013580. Springer, Heidelberg (2002)"},{"unstructured":"Feldman, J., Malkin, T., Servedio, R.A., Stein, C.: Secure network coding via filtered secret sharing. In: Proceedings of the 42nd Annual Allerton Conference on Communication, Control, and Computing (2004)","key":"42_CR17"},{"doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS, pp. 427\u2013437. IEEE Computer Society (1987)","key":"42_CR18","DOI":"10.1109\/SFCS.1987.4"},{"key":"42_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11681878_17","volume-title":"Theory of Cryptography","author":"M. Fitzi","year":"2006","unstructured":"Fitzi, M., Garay, J.A., Gollakota, S., Pandu Rangan, C., Srinathan, K.: Round-optimal and efficient verifiable secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 329\u2013342. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: STOC, pp. 580\u2013589 (2001)","key":"42_CR20","DOI":"10.1145\/380752.380853"},{"unstructured":"Goldreich, O.: Short Locally Testable Codes and Proofs (Survey). Electronic Colloquium on Computational Complexity (ECCC)\u00a0(014) (2005)","key":"42_CR21"},{"key":"42_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-22670-0_22","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O. Goldreich","year":"2011","unstructured":"Goldreich, O.: Three XOR-lemmas \u2014 an exposition. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. LNCS, vol.\u00a06650, pp. 248\u2013272. Springer, Heidelberg (2011)"},{"issue":"4","key":"42_CR23","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/1162349.1162351","volume":"53","author":"O. Goldreich","year":"2006","unstructured":"Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost-linear length. Journal of the ACM\u00a053(4), 558\u2013655 (2006)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting correlations. In: FOCS, pp. 261\u2013270 (2009)","key":"42_CR24","DOI":"10.1109\/FOCS.2009.56"},{"key":"42_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-28914-9_9","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2012","unstructured":"Ishai, Y., Mahmoody, M., Sahai, A.: On efficient zero-knowledge PCPs. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 151\u2013168. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Tardos, G.: Probabilistically checkable proofs with zero knowledge. In: STOC, pp. 496\u2013505 (1997)","key":"42_CR26","DOI":"10.1145\/258533.258643"},{"key":"42_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-17373-8_25","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"R. Kumaresan","year":"2010","unstructured":"Kumaresan, R., Patra, A., Pandu Rangan, C.: The round complexity of verifiable secret sharing: The statistical case. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 431\u2013447. Springer, Heidelberg (2010)"},{"issue":"2","key":"42_CR28","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1137\/080729967","volume":"39","author":"O. Meir","year":"2009","unstructured":"Meir, O.: Combinatorial Construction of Locally Testable Codes. SIAM J. Comput.\u00a039(2), 491\u2013544 (2009)","journal-title":"SIAM J. Comput."},{"key":"42_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-03356-8_29","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"A. Patra","year":"2009","unstructured":"Patra, A., Choudhary, A., Rabin, T., Pandu Rangan, C.: The round complexity of verifiable secret sharing revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 487\u2013504. Springer, Heidelberg (2009)"},{"issue":"12","key":"42_CR30","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.jpdc.2011.07.009","volume":"71","author":"K. Peng","year":"2011","unstructured":"Peng, K.: Efficient VSS free of computational assumption. J. Parallel Distrib. Comput.\u00a071(12), 1592\u20131597 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"6","key":"42_CR31","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"D.A. Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory\u00a042(6), 1723\u20131731 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"unstructured":"Trevisan, L.: Some Applications of Coding Theory in Computational Complexity (September\u00a023, 2004)","key":"42_CR32"},{"unstructured":"Vazirani, U.V.: Randomness, adversaries and computation. Ph.D. Thesis, EECS, UC Berkeley","key":"42_CR33"},{"key":"42_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/978-3-642-32512-0_55","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Viderman","year":"2012","unstructured":"Viderman, M.: A combination of testability and decodability by tensor products. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX\/RANDOM 2012. LNCS, vol.\u00a07408, pp. 651\u2013662. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40328-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:56:13Z","timestamp":1558014973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}