Efficient compiler to covert security with public verifiability for honest majority MPC
From MaRDI portal
Publication:2096640
DOI10.1007/978-3-031-09234-3_33OpenAlexW4285079205MaRDI QIDQ2096640
Peter Langenkamp, Maarten Everts, Vincent Dunning, Thomas Attema
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_33
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Theory of compilers and interpreters (68N20) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Generic compiler for publicly verifiable covert multi-party computation
- Guaranteed output delivery comes free in honest majority MPC
- Black-box transformations from passive to covert security with public verifiability
- Covert security with public verifiability: faster, leaner, and simpler
- Efficient fully secure computation via distributed zero-knowledge proofs
- Public Verifiability in the Covert Model (Almost) for Free
- Publicly Verifiable Secret Sharing
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- How to share a secret
- From Passive to Covert Security at Low Cost
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Calling Out Cheaters: Covert Security with Public Verifiability
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
This page was built for publication: Efficient compiler to covert security with public verifiability for honest majority MPC
