Calling out cheaters: covert security with public verifiability
From MaRDI portal
(Redirected from Publication:4911615)
Recommendations
- Covert security with public verifiability: faster, leaner, and simpler
- Public verifiability in the covert model (almost) for free
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Security against covert adversaries: Efficient protocols for realistic adversaries
- From Passive to Covert Security at Low Cost
Cited in
(17)- Generic compiler for publicly verifiable covert multi-party computation
- Towards accountability in CRS generation
- On publicly-accountable zero-knowledge and small shuffle arguments
- 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)
- Covert security with public verifiability: faster, leaner, and simpler
- Public verifiability in the covert model (almost) for free
- Making private function evaluation safer, faster, and simpler
- Hashing garbled circuits for free
- Putting the online phase on a diet: covert security from short MACs
- Financially backed covert security
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
- Zero-knowledge protocols with PVC security: striking the balance between security and efficiency
- Towards accountability in CRS generation
This page was built for publication: Calling out cheaters: covert security with public verifiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911615)
