Covert security with public verifiability: faster, leaner, and simpler
From MaRDI portal
Publication:2292689
Recommendations
- Public verifiability in the covert model (almost) for free
- Calling out cheaters: covert security with public verifiability
- Efficient covert two-party computation
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Security against covert adversaries: Efficient protocols for realistic adversaries
Cited in
(14)- Generic compiler for publicly verifiable covert multi-party computation
- Efficient constant-round MPC with identifiable abort and public verifiability
- Black-box transformations from passive to covert security with public verifiability
- Efficient compiler to covert security with public verifiability for honest majority MPC
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- Public verifiability in the covert model (almost) for free
- From Passive to Covert Security at Low Cost
- Calling out cheaters: covert security with public verifiability
- Making private function evaluation safer, faster, and simpler
- Practical covert authentication
- Financially backed covert security
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
- Garbled circuit lookup tables with logarithmic number of ciphertexts
- Zero-knowledge protocols with PVC security: striking the balance between security and efficiency
This page was built for publication: Covert security with public verifiability: faster, leaner, and simpler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292689)
