Private polynomial commitments and applications to MPC
From MaRDI portal
Recommendations
- Constant-Size Commitments to Polynomials and Their Applications
- Verifiable private polynomial evaluation
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
Cites work
- Actively secure garbled circuits with constant communication overhead in the plain model
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Algebraic (Trapdoor) one-way functions and their applications
- Asynchronous computational VSS with reduced communication complexity
- Ate Pairing on Hyperelliptic Curves
- Boosting verifiable computation on encrypted data
- Composable and modular anonymous credentials: definitions and practical constructions
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient circuit-based PSI with linear communication
- Efficient non-interactive secure computation
- Efficient signature generation by smart cards
- Flexible and efficient verifiable computation on encrypted data
- Homomorphic signatures with efficient verification for polynomial functions
- How to run Turing machines on encrypted data
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1301967 (Why is no real title available?)
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-complexity private set intersection protocols secure in malicious model
- Maliciously secure oblivious linear function evaluation with constant overhead
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge
- Multi-client non-interactive verifiable computation
- Multi-client verifiable computation with stronger security guarantees
- Multi-clients verifiable computation via conditional disclosure of secrets
- Non-interactive secure 2PC in the offline/online and batch settings
- Non-interactive secure computation based on cut-and-choose
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Oblivious key-value stores and amplification for private set intersection
- Oblivious Polynomial Evaluation
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Private set intersection in the internet setting from lightweight oblivious PRF
- Proofs for inner pairing products and applications
- PSI from PaXoS: fast, malicious private set intersection
- Scalable multi-party private set-intersection
- Signatures of correct computation
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- SpOT-light: lightweight private set intersection from sparse OT extension
- Structure-preserving signatures and commitments to group elements
- Theory of Cryptography
- Transparent SNARKs from DARK compilers
- Vector commitments and their applications
- Verifiable delegation of computation over large datasets
- Zero-knowledge argument for polynomial evaluation with application to blacklists
Cited in
(6)- Promise zero knowledge and its applications to round optimal MPC
- Insured MPC: efficient secure computation with financial penalties
- Constant-Size Commitments to Polynomials and Their Applications
- Encrypted polynomial control based on tailored two‐party computation
- Greyhound: fast polynomial commitments from lattices
- SNARK lower bounds via communication complexity
This page was built for publication: Private polynomial commitments and applications to MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6067356)
