Multi-Client Verifiable Computation with Stronger Security Guarantees

DOI10.1007/978-3-662-46497-7_6zbMath1379.94039OpenAlexW37483258MaRDI QIDQ5261673

Hong-Sheng Zhou, Feng-Hao Liu, S. Dov Gordon, Elaine Shi, Jonathan N. Katz

Publication date: 6 July 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_6

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (10)

Verifiable Computation for Randomized Algorithm ⋮ 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 ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Server-aided private set intersection based on reputation ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ Verifiable Multi-party Computation with Perfectly Private Audit Trail ⋮ 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 Verifiable Computation with Stronger Security Guarantees