Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

DOI10.1007/978-3-540-70936-7_8zbMath1129.94010MaRDI QIDQ3596377

Yonatan Aumann, Yehuda Lindell

Publication date: 30 August 2007

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_8

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Hashing Garbled Circuits for Free, Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries, Efficient Fully-Simulatable Oblivious Transfer, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, Economically Optimal Variable Tag Length Message Authentication, 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, Efficient set intersection with simulation-based security, Partial fairness in secure two-party computation, Efficient set operations in the presence of malicious adversaries, 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, Learning under \(p\)-tampering poisoning attacks, Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles, Secure linear system computation in the presence of malicious adversaries, On actively-secure elementary MPC reductions, Secure Outsourced Computation, Secure Set Intersection with Untrusted Hardware Tokens, Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious, From Passive to Covert Security at Low Cost, Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens