Zero knowledge LTCs and their applications

DOI10.1007/978-3-642-40328-6_42zbMATH Open1405.68114OpenAlexW21768620MaRDI QIDQ2851889FDOQ2851889

Authors: Yuval Ishai, Amit Sahai, Michael Viderman, Mor Weiss 

Publication date: 4 October 2013

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40328-6_42

Recommendations

• Locally testable codes and PCPs of almost-linear length
• Locally Testable Codes Require Redundant Testers
• Strong locally testable codes with relaxed local decoders
• Strong locally testable codes with relaxed local decoders
• Zero-knowledge proofs from secure multiparty computation

Mathematics Subject Classification ID

Randomized algorithms (68W20) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62) Other types of codes (94B60)

Cited In (6)

• ZK-PCPs from leakage-resilient secret sharing
• Title not available (Why is that?)
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
• Protecting distributed primitives against leakage: equivocal secret sharing and more
• Zero-knowledge IOPs approaching witness length
• Bounded indistinguishability and the complexity of recovering secrets

This page was built for publication: Zero knowledge LTCs and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851889)