Private polynomial commitments and applications to MPC

Cites Work

Unnamed Item
Unnamed Item
Structure-preserving signatures and commitments to group elements
Efficient signature generation by smart cards
Actively secure garbled circuits with constant communication overhead in the plain model
Transparent SNARKs from DARK compilers
Marlin: preprocessing zkSNARKs with universal and updatable SRS
Boosting verifiable computation on encrypted data
Flexible and efficient verifiable computation on encrypted data
Private set intersection in the internet setting from lightweight oblivious PRF
Spartan: efficient and general-purpose zkSNARKs without trusted setup
Multi-clients verifiable computation via conditional disclosure of secrets
PSI from PaXoS: fast, malicious private set intersection
Oblivious key-value stores and amplification for private set intersection
Efficient circuit-based PSI with linear communication
SpOT-light: lightweight private set intersection from sparse OT extension
Libra: succinct zero-knowledge proofs with optimal prover computation
Maliciously secure oblivious linear function evaluation with constant overhead
Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
How to Run Turing Machines on Encrypted Data
Homomorphic Signatures with Efficient Verification for Polynomial Functions
Efficient Non-interactive Secure Computation
Constant-Size Commitments to Polynomials and Their Applications
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Asynchronous Computational VSS with Reduced Communication Complexity
Signatures of Correct Computation
Multi-Client Non-interactive Verifiable Computation
Algebraic (Trapdoor) One-Way Functions and Their Applications
Vector Commitments and Their Applications
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
Verifiable Delegation of Computation over Large Datasets
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
Multi-Client Verifiable Computation with Stronger Security Guarantees
Non-interactive Secure 2PC in the Offline/Online and Batch Settings
Advances in Cryptology - EUROCRYPT 2004
Advances in Cryptology – CRYPTO 2004
Non-Interactive Secure Computation Based on Cut-and-Choose
Ate Pairing on Hyperelliptic Curves
Oblivious Polynomial Evaluation
Theory of Cryptography
Scalable Multi-party Private Set-Intersection
MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge
Proofs for inner pairing products and applications

This page was built for publication: Private polynomial commitments and applications to MPC