Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems

DOI10.1007/978-3-319-28166-7_1zbMath1459.68072OpenAlexW2232878900MaRDI QIDQ2794490

Berry Schoenmakers, Meilof Veeningen

Publication date: 10 March 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-28166-7_1

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Computer security (68M25)

Related Items (9)

MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Function-Dependent Commitments for Verifiable Multi-party Computation ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ SCRAPE: Scalable Randomness Attested by Public Entities ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ Efficient constant-round MPC with identifiable abort and public verifiability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security and composition of multiparty cryptographic protocols
• Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
• Multiparty Computation from Somewhat Homomorphic Encryption
• Publicly Auditable Secure Multi-Party Computation
• Efficient Binary Conversion for Paillier Encrypted Values
• From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security
• Secure Arithmetic Computation with No Honest Majority
• Random Oracles and Auxiliary Input
• Zero Knowledge in the Random Oracle Model, Revisited
• Secure Multiparty Computation Goes Live
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols
• Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing
• Advances in Cryptology - CRYPTO 2003
• Practical Two-Party Computation Based on the Conditional Gate
• Reusable garbled circuits and succinct functional encryption

This page was built for publication: Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems