Multi-Client Non-interactive Verifiable Computation

DOI10.1007/978-3-642-36594-2_28zbMath1316.68053OpenAlexW24999078MaRDI QIDQ4910295

Carlos Cid, Seung Geol Choi, Ranjit Kumaresan, Jonathan N. 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

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

Related Items (15)

Revocation in Publicly Verifiable Outsourced Computation ⋮ Verifiable Computation for Randomized Algorithm ⋮ 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 ⋮ Private polynomial commitments and applications to MPC ⋮ Multi-key Homomorphic Authenticators ⋮ Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption ⋮ An Efficient and Provably Secure Private Polynomial Evaluation Scheme ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ 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 ⋮ VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA

This page was built for publication: Multi-Client Non-interactive Verifiable Computation