Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing

DOI10.1007/978-3-642-54631-0_9MaRDI QIDQ5402969zbMATH OpenOpenAlexFDO

Authors Nishanth Chandran, Vipul Goyal, Bhavana Kanukurthi, Rafail Ostrovsky, Prabhanjan 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)

Recommendations

• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Multi-client non-interactive verifiable computation
• Verifiable computation on outsourced encrypted data

Cited in

(24)

• Multi-clients verifiable computation via conditional disclosure of secrets
• Verifiable computation on outsourced encrypted data
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• Multi-client non-interactive verifiable computation
• Verifiable multi-party computation with perfectly private audit trail
• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Flexible and efficient verifiable computation on encrypted data
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• Secure outsourced computation
• Verifiable computation for randomized algorithm
• Verifiable computation with reduced informational costs and computational costs
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• Boosting verifiable computation on encrypted data
• Confidentiality-preserving publicly verifiable computation
• Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
• Multi-client verifiable computation with stronger security guarantees
• Sum it up: verifiable additive homomorphic secret sharing
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Revisiting the secret hiding assumption used in verifiable (outsourced) computation
• Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
• Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption
• Efficient computation outsourcing for inverting a class of homomorphic functions
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems
• Multi-client outsourced computation

This page was built for publication: Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing

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