Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
From MaRDI portal
(Redirected from Publication:3596377)
Recommendations
Cited in
(49)- Incentive-driven attacker for corrupting two-party protocols
- Stealthy protocols: metrics and open problems
- Generic compiler for publicly verifiable covert multi-party computation
- On publicly-accountable zero-knowledge and small shuffle arguments
- On succinct arguments and witness encryption from groups
- Black-box transformations from passive to covert security with public verifiability
- Efficient compiler to covert security with public verifiability for honest majority MPC
- Towards multiparty computation withstanding coercion of all parties
- Learning under \(p\)-tampering poisoning attacks
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- Covert security with public verifiability: faster, leaner, and simpler
- Secure linear system computation in the presence of malicious adversaries
- On actively-secure elementary MPC reductions
- Efficient set intersection with simulation-based security
- Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Verifiable computation in multiparty protocols with honest majority
- Secure outsourced computation
- Impracticality of Efficient PVSS in Real Life Security Standard (Poster)
- Secure set intersection with untrusted hardware tokens
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory
- From Passive to Covert Security at Low Cost
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- On the feasibility of consistent computations
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Partial fairness in secure two-party computation
- Efficient set operations in the presence of malicious adversaries
- Calling out cheaters: covert security with public verifiability
- Efficient multiparty computation for arithmetic circuits against a covert majority
- Optimal Secret Protections in Discrete-Event Systems
- The IPS compiler: optimizations, variants and concrete efficiency
- Hashing garbled circuits for free
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- Efficient Fully-Simulatable Oblivious Transfer
- Economically optimal variable tag length message authentication
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Putting the online phase on a diet: covert security from short MACs
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Financially backed covert security
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Locally covert learning
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- Broadcast-optimal secure computation from black-box oblivious transfer
- Cryptanalysis on lightweight verifiable homomorphic encryption
- Rational censorship attack: breaking blockchain with a blackboard
This page was built for publication: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596377)
