Verifiable multi-party computation with perfectly private audit trail

DOI10.1007/978-3-319-39555-5_20MaRDI QIDQ2822682zbMATH OpenOpenAlexFDO

Authors Édouard Cuvelier, Olivier Pereira

Publication date 4 October 2016

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-39555-5_20

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• Publicly auditable secure multi-party computation
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation

Cites work

• How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• Multi-client non-interactive verifiable computation
• Multi-client verifiable computation with stronger security guarantees
• Multi-input functional encryption
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Proofs of Restricted Shuffles
• Publicly auditable secure multi-party computation
• Secure multiparty computation goes live

Cited in

(7)

• Cryptanalysis of a privacy preserving auditing for data integrity protocol from TrustCom 2013
• Absentia: secure multiparty computation on ethereum
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Certificate validation in secure computation and its use in verifiable linear programming
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• Publicly auditable secure multi-party computation
• scientific article; zbMATH DE number 6829278 (Why is no real title available?)

Describes a project that uses

Uses Software

• Pinocchio
• ADSNARK
• Geppetto
• Helios

This page was built for publication: Verifiable multi-party computation with perfectly private audit trail

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