Signatures of correct computation
From MaRDI portal
Recommendations
- Homomorphic signatures with efficient verification for polynomial functions
- Verifiable delegation of computation over large datasets
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Batch verifiable computation of outsourced functions
- Batch verifiable computation of polynomials on outsourced data
Cited in
(44)- Efficient transparent polynomial commitments for zk-SNARKs
- FLI: folding lookup instances
- An algebraic framework for universal and updatable SNARKs
- Time- and space-efficient arguments from groups of unknown order
- Trusted computing with addition machines. II
- Analytical signatures and proper actions
- Distributed-prover interactive proofs
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- Private polynomial commitments and applications to MPC
- On privacy-preserving biometric authentication
- Natively compatible super-efficient lookup arguments and how to apply them
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Verifiable computation for randomized algorithm
- Linear-map vector commitments and their practical applications
- Functional commitments for all functions, with transparent setup and from SIS
- Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Batch verifiable computation of outsourced functions
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- On the impossibility of algebraic NIZK in pairing-free groups
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Boosting verifiable computation on encrypted data
- Confidentiality-preserving publicly verifiable computation
- On knowledge-soundness of Plonk in ROM from falsifiable assumptions
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- On extractability of the KZG family of polynomial commitment schemes
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
- WHIR: Reed-Solomon proximity testing with super-fast verification
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Functional commitments for arbitrary circuits of bounded sizes
- Algebraic (trapdoor) one-way functions: constructions and applications
- Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Polymath: Groth16 is not the limit
- Succinct functional commitment for a large class of arithmetic circuits
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Committed private information retrieval
This page was built for publication: Signatures of correct computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910280)
