Verifiable Multi-party Computation with Perfectly Private Audit Trail

DOI10.1007/978-3-319-39555-5_20zbMath1346.68035OpenAlexW2479190638MaRDI QIDQ2822682

Olivier Pereira, Édouard Cuvelier

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

Cryptography (94A60) Network protocols (68M12)

Uses Software

• Pinocchio
• ADSNARK
• Geppetto
• Helios

Cites Work

• Unnamed Item
• Publicly Auditable Secure Multi-Party Computation
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Proofs of Restricted Shuffles
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Secure Multiparty Computation Goes Live
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Multi-Client Non-interactive Verifiable Computation
• How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
• Multi-Client Verifiable Computation with Stronger Security Guarantees
• Multi-input Functional Encryption

This page was built for publication: Verifiable Multi-party Computation with Perfectly Private Audit Trail