Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

DOI10.1007/978-3-540-70936-7_8zbMath1129.94010OpenAlexW1515945955MaRDI 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

Cryptography (94A60)

Related Items (26)

Efficient set intersection with simulation-based security ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Partial fairness in secure two-party computation ⋮ Financially backed covert security ⋮ Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions ⋮ Learning under \(p\)-tampering poisoning attacks ⋮ Efficient set operations in the presence of malicious adversaries ⋮ On actively-secure elementary MPC reductions ⋮ Secure Outsourced Computation ⋮ Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries ⋮ Secure Set Intersection with Untrusted Hardware Tokens ⋮ Efficient Fully-Simulatable Oblivious Transfer ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ From Passive to Covert Security at Low Cost ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens ⋮ Secure linear system computation in the presence of malicious adversaries ⋮ Economically Optimal Variable Tag Length Message Authentication ⋮ 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 ⋮ Hashing Garbled Circuits for Free

This page was built for publication: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries