Multi-client non-interactive verifiable computation

DOI10.1007/978-3-642-36594-2_28MaRDI QIDQ4910295zbMATH OpenOpenAlexFDO

Authors Seung Geol Choi, Ranjit Kumaresan, Carlos Cid, Jonathan Katz

Publication date 18 March 2013

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36594-2_28

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Multi-client outsourced computation
• Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
• Multi-client verifiable computation with stronger security guarantees
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency

Cited in

(24)

• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
• Multi-clients verifiable computation via conditional disclosure of secrets
• Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
• Verifiable inner product computation on outsourced database for authenticated multi-user data sharing
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Multi-input functional encryption and its application in outsourcing computation
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• Verifiable multi-party computation with perfectly private audit trail
• The feasibility of outsourced database search in the plain model
• Multi-key Homomorphic Authenticators
• Verifiable computation for randomized algorithm
• Revocation in publicly verifiable outsourced computation
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Multi-client verifiable computation with stronger security guarantees
• Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
• Multi-client outsourced computation
• VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
• Private polynomial commitments and applications to MPC
• Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption
• An Efficient and Provably Secure Private Polynomial Evaluation Scheme
• On black-box verifiable outsourcing
• Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
• A new paradigm for server-aided MPC

This page was built for publication: Multi-client non-interactive verifiable computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910295)