Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing

DOI10.1007/978-3-642-54631-0_9zbMath1335.94026OpenAlexW199266244MaRDI QIDQ5402969

Vipul Goyal, Rafail Ostrovsky, Nishanth Chandran, Bhavana Kanukurthi, Prabhanjan V. Ananth

Publication date: 25 March 2014

Published in: Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54631-0_9

zbMATH Keywords

verifiable computationgarbled circuitsdelegatable computationinput/output privacy

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Confidentiality-Preserving Publicly Verifiable Computation ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

This page was built for publication: Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing