Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

By Yonatan Aumann, Yehuda Lindell. 2007

415 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Information Systems

Citations in the corpus

Privacy-Preserving Distributed Linear Regression on High-Dimensional Data (2017, methodology): “For our solving phase, we use Yao’s two-party garbled circuits protocol, which was formally-described and proven secure by Lindell and Pinkas [49].”
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records (2013, background): “Informally, we allow the CSP to act as a covert adversary in the sense of [9] (see also [10]).”
A Pragmatic Introduction to Secure Multi-Party Computation (2019, methodology): “An effective practical approach may be to enable probabilistic checks on the generator, as first proposed by Aumann and Lindell (2007). Their idea is to allow the evaluator (P2) to challenge the generator (P1) at random to prove that the garbled circuit was constructed correctly.”
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol (2017, background): “[2], where the adversary wishes to break the protocol but prefers not to be caught doing so.”
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer (2011, background): “Both that proof and the proof of Step 7b are essentially the proof of Protocol B.2.”
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation (2020, background): “Though not the strongest model, this model forms the first step towards achieving protocols with stronger security guarantees [6, 29, 68, 71].”
FairplayMP: a system for secure multi-party computation (2008, background): “An alternative new security model considers “covert adversaries” [1].”
Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol (2012, background): “Whilst active security is the “gold standard” of security, many applications can accept a weaker notion called covert security [1, 2].”
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution (2012, background): “Aumann and Lindell et al. introduced the covert threat model [1].”
Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits (2013, background): “In [2, 3] Aumann and Lindell introduced the notion of covert security; in this security model an adversary who deviates from the protocol is detected with high (but not necessarily overwhelming) probability, say 90%, which still translates into an incentive on the adversary to behave in an honest ma”
Faster Secure Two-Party Computation Using Garbled Circuits (2011, background): “For example, one bit sufﬁces to represent D [ 1 ][ 1 ] while more bits are required to represent D [ i ][ j ] for larger i ’s and j ’s.”
Foundations of garbled circuits (2012, neutral): “5 for an example—consists of an Φ circ none NPS99 [46] privacy-preserving auctions prv Φ circ proxy OT KO04 [34] 2-party SFE (malicious) prv Φ circ OT, ZK proofs, commitment, trapdoor perm FAZ05 [19] private credit checking prv Φ size sym encryption FM06 [44] 2-party SFE (malicious) prv Φ circ OT, c”
Secure Multiparty Sorting Protocols with Covert Privacy (2016, background): “This form of simulatability with covert adversaries is preserved by sequential composition (taking the minimum of ε-s), as shown by a simple hybrid argument [1].”