Financially backed covert security
From MaRDI portal
Recommendations
- Covert security with public verifiability: faster, leaner, and simpler
- Calling out cheaters: covert security with public verifiability
- Public verifiability in the covert model (almost) for free
- From Passive to Covert Security at Low Cost
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Cites work
- Black-box transformations from passive to covert security with public verifiability
- Calling out cheaters: covert security with public verifiability
- Covert security with public verifiability: faster, leaner, and simpler
- Generic compiler for publicly verifiable covert multi-party computation
- How to use bitcoin to design fair protocols
- Modeling Bitcoin contracts by timed automata
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Public verifiability in the covert model (almost) for free
- Refereed delegation of computation
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Cited in
(5)- Public verifiability in the covert model (almost) for free
- Constant-round linear-broadcast secure computation with penalties
- 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
- Rational censorship attack: breaking blockchain with a blackboard
This page was built for publication: Financially backed covert security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169029)
