Multi-client verifiable computation with stronger security guarantees
From MaRDI portal
Publication:5261673
Recommendations
- Multi-client non-interactive verifiable computation
- Multi-client outsourced computation
- Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
Cited in
(17)- Verifiable multi-party computation with perfectly private audit trail
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
- Private polynomial commitments and applications to MPC
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Verifiable computation for randomized algorithm
- Multi-key Homomorphic Authenticators
- Multi-clients verifiable computation via conditional disclosure of secrets
- Specifying and verifying secrecy in workflows with arbitrarily many agents
- Verification protocol for stable matching from conditional disclosure of secrets
- Server-aided private set intersection based on reputation
- Function-Dependent Commitments for Verifiable Multi-party Computation
- Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption
- Efficient and secure outsourced approximate pattern matching protocol
- Multi-client outsourced computation
- Multi-client non-interactive verifiable computation
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
This page was built for publication: Multi-client verifiable computation with stronger security guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261673)