How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs

No abstract is available for this paper.

• Publication year

  2019

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model

  2019cited by this paper
• Multi-prover interactive proofs: how to remove intractability assumptions

  2019cited by this paper
• Aurora: Transparent Succinct Arguments for R1CS

  2019cited by this paper
• Use your Brain! Arithmetic 3PC For Any Modulus with Active Security

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

  2019cited by this paper
• Interactive Distributed Proofs

  2018cited by this paper
• Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification

  2018cited by this paper
• Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs

  2018cited by this paper
• Scalable, transparent, and post-quantum secure computational integrity

  2018cited by this paper
• Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures

  2018cited by this paper
• Secure Computation with Low Communication from Cross-checking

  2018cited by this paper
• Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials

  2018cited by this paper
• Compact Zero-Knowledge Proofs of Small Hamming Weight

  2018cited by this paper
• Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings

  2018cited by this paper
• The Power of Distributed Verifiers in Interactive Proofs

  2018cited by this paper
• Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

  2018cited by this paper
• Doubly-Efficient zkSNARKs Without Trusted Setup

  2018cited by this paper
• SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority

  2018cited by this paper
• Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability

  2017cited by this paper
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

  2017cited by this paper
• vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases

  2017cited by this paper
• Full Accounting for Verifiable Outsourcing

  2017cited by this paper
• The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited

  2017cited by this paper
• Prio: Private, Robust, and Scalable Computation of Aggregate Statistics

  2017influential reference
• A Hierarchy Theorem for Interactive Proofs of Proximity

  2017cited by this paper
• Interactive Oracle Proofs with Constant Rate and Query Complexity

  2017cited by this paper
• A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority

  2017cited by this paper
• Bulletproofs : Efficient Range Proofs for Confidential Transactions

  2017cited by this paper
• Optimized Honest-Majority MPC for Malicious Adversaries — Breaking the 1 Billion-Gate Per Second Barrier

  2017cited by this paper
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

  2017cited by this paper
• A Protocol for Privately Reporting Ad Impressions at Scale

  2016cited by this paper
• Function Secret Sharing: Improvements and Extensions

  2016influential reference
• Constant-round interactive proofs for delegating computation

  2016influential reference
• High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority

  2016cited by this paper
• On Probabilistic Checking in Perfect Zero Knowledge

  2016cited by this paper
• Characterization of Secure Multiparty Computation Without Broadcast

  2016cited by this paper
• Interactive Oracle Proofs

  2016influential reference
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

  2016cited by this paper
• On the Size of Pairing-Based Non-interactive Arguments

  2016cited by this paper
• Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation

  2016cited by this paper
• Arguments of Proximity - [Extended Abstract]

  2015cited by this paper
• Geppetto: Versatile Verifiable Computation

  2015cited by this paper
• Riposte: An Anonymous Messaging System Handling Millions of Users

  2015influential reference
• Fast and Secure Three-party Computation: The Garbled Circuit Approach

  2015cited by this paper
• Efficient Private Statistics with Succinct Sketches

  2015cited by this paper
• ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data

  2015cited by this paper
• Circuits resilient to additive attacks with applications to secure computation

  2014cited by this paper
• PrivEx: Private Collection of Traffic Statistics for Anonymous Communication Networks

  2014cited by this paper
• Zerocash: Decentralized Anonymous Payments from Bitcoin

  2014cited by this paper
• Quadratic Span Programs and Succinct NIZKs without PCPs

  2013influential reference
• Pinocchio: Nearly Practical Verifiable Computation

  2013cited by this paper
• Vector Commitments and Their Applications

  2013cited by this paper
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

  2013cited by this paper
• Resolving the conflict between generality and plausibility in verified computation

  2013cited by this paper
• Time-Optimal Interactive Proofs for Circuit Evaluation

  2013cited by this paper
• Making argument systems for outsourced computation practical (sometimes)

  2012cited by this paper
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

  2012cited by this paper
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

  2012cited by this paper
• Verifying Computations with Streaming Interactive Proofs

  2011cited by this paper
• Practical verified computation with streaming interactive proofs

  2011cited by this paper
• Privacy-Preserving Aggregation of Time-Series Data

  2011cited by this paper
• Constant-Size Commitments to Polynomials and Their Applications

  2010cited by this paper
• Adnostic: Privacy Preserving Targeted Advertising

  2010cited by this paper
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments

  2010cited by this paper
• Probabilistically checkable proofs

  2009cited by this paper
• Annotations in Data Streams

  2009cited by this paper
• Are PCPs Inherent in Efficient Arguments?

  2009cited by this paper
• Delegating computation reliably: paradigms and constructions

  2009cited by this paper
• Algebrization: a new barrier in complexity theory

  2008cited by this paper
• Interactive PCP

  2008cited by this paper
• Efficient Arguments without Short PCPs

  2007influential reference
• Scalable and Unconditionally Secure Multiparty Computation

  2007cited by this paper
• Infeasibility of instance compression and succinct PCPs for NP

  2007cited by this paper
• Scalable Secure Multiparty Computation

  2006influential reference
• Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation

  2005cited by this paper
• Secure Multi-Party Computation without Agreement

  2005cited by this paper
• Computationally Secure Oblivious Transfer

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

  2004influential reference
• Efficient Multi-party Computation over Rings

  2003cited by this paper
• Rectangle size bounds and threshold covers in communication complexity

  2002cited by this paper
• On interactive proofs with a laconic prover

  2001cited by this paper
• A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

  2001cited by this paper
• The Foundations of Cryptography - Volume 1, Basic Techniques.

  2001cited by this paper
• Foundations of Cryptography: Volume 1, Basic Tools

  2001influential reference
• Security and Composition of Multiparty Cryptographic Protocols

  2000cited by this paper
• Computationally Sound Proofs

  2000cited by this paper
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

  1999cited by this paper
• Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries

  1999cited by this paper
• Compressing Cryptographic Resources

  1999cited by this paper
• Protecting data privacy in private information retrieval schemes

  1998cited by this paper
• Probabilistic checking of proofs: a new characterization of NP

  1998cited by this paper
• Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?

  1998cited by this paper
• Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments

  1996cited by this paper
• On the Power of Multi-Prover Interactive Protocols

  1994cited by this paper
• Random oracles are practical: a paradigm for designing efficient protocols

  1993cited by this paper
• IP = PSPACE

  1992cited by this paper
• Communication complexity of secure computation (extended abstract)

  1992cited by this paper
• Proof verification and hardness of approximation problems

  1992influential reference
• Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

  1991cited by this paper
• Approximating clique is almost NP-complete

  1991cited by this paper

• Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and more

  2024cites this paper
• FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning

  2020cites this paper
• Blinder -- Scalable, Robust Anonymous Committed Broadcast

  2020cites this paper
• Designing efficient zero-knowledge proofs in the ideal linear commitment model

  2019influential citation