Zero Knowledge LTCs and Their Applications

No abstract is available for this paper.

• Publication year

  2013

• Venue

  International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

• Publication date

  2013-08-21

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-40328-6_42
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Verifiable secret sharing in a total of three rounds

  2012cited by this paper
• On Efficient Zero-Knowledge PCPs

  2012cited by this paper
• Algorithms and Techniques

  2011cited by this paper
• Efficient VSS free of computational assumption

  2011cited by this paper
• A combination of testability and decodability by tensor products

  2011cited by this paper
• The World is Not Enough: Another Look on Second-Order DPA

  2010cited by this paper
• The Round Complexity of Verifiable Secret Sharing: The Statistical Case

  2010cited by this paper
• The Round Complexity of Verifiable Secret Sharing Revisited

  2009cited by this paper
• Composition of semi-LTCs by two-wise tensor products

  2009cited by this paper
• Extracting Correlations

  2009cited by this paper
• Advances in cryptology : CRYPTO 2009 : 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009 : proceedings

  2009cited by this paper
• Tensor Products of Weakly Smooth Codes are Robust

  2008cited by this paper
• Combinatorial construction of locally testable codes

  2008cited by this paper
• Scalable Secure Multiparty Computation

  2006cited by this paper
• Round-Optimal and Efficient Verifiable Secret Sharing

  2006cited by this paper
• The PCP theorem by gap amplification

  2006cited by this paper
• Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings (Lecture Notes in Computer Science)

  2006cited by this paper
• Short Locally Testable Codes and Proofs (Survey)

  2005cited by this paper
• Robust locally testable codes and products of codes

  2004cited by this paper
• Robust pcps of proximity, shorter pcps and applications to coding

  2004cited by this paper
• Some Applications of Coding Theory in Computational Complexity

  2004cited by this paper
• Some 3CNF properties are hard to test

  2003cited by this paper
• The complexity of homomorphism and constraint satisfaction problems seen from the other side

  2003cited by this paper
• Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks

  2002cited by this paper
• Locally testable codes and PCPs of almost-linear length

  2002cited by this paper
• Advances in Cryptology — CRYPTO 2002

  2002cited by this paper
• The round complexity of verifiable secret sharing and secure multicast

  2001cited by this paper
• Probabilistically checkable proofs with zero knowledge

  1997cited by this paper
• Linear-time encodable and decodable error-correcting codes

  1995cited by this paper
• Three XOR-Lemmas - An Exposition

  1995cited by this paper
• Checking computations in polylogarithmic time

  1991cited by this paper
• Verifiable secret sharing and multiparty protocols with honest majority

  1989cited by this paper
• Multiparty unconditionally secure protocols

  1988cited by this paper
• Multiparty Unconditionally Secure Protocols (Extended Abstract)

  1988cited by this paper
• Completeness theorems for non-cryptographic fault-tolerant distributed computation

  1988cited by this paper
• A practical scheme for non-interactive verifiable secret sharing

  1987cited by this paper
• Limits on the security of coin flips when half the processors are faulty

  1986cited by this paper
• Verifiable secret sharing and achieving simultaneity in the presence of faults

  1985cited by this paper
• Electronic Colloquium on Computational Complexity, Report No. 118 (2006) Robust Local Testability of Tensor Products of LDPC Codes ⋆

  year unknowncited by this paper

• A Zero-Knowledge PCP Theorem

  2024cites this paper
• ZK-PCPs from Leakage-Resilient Secret Sharing

  2022cites this paper
• Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

  2022cites this paper
• Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience

  2022cites this paper
• Zero-Knowledge Succinct Arguments with a Linear-Time Prover

  2020cites this paper
• Efficient zero-knowledge proofs and their applications

  2019cites this paper
• Bounded Indistinguishability and the Complexity of Recovering Secrets

  2016cites this paper
• Secure Computation and Probabilistic Checking

  2016cites this paper
• Probabilistically Checkable Proofs of Proximity with Zero-Knowledge

  2014cites this paper