From Passive to Covert Security at Low Cost

Aumann and Lindell defined security against covert attacks, where the adversary is malicious, but is only caught cheating with a certain probability, where the idea is that in many real-world cases, a large probability of being caught is sufficient to prevent the adversary from trying to cheat. In this paper, we show how to compile a passively secure protocol for honest majority into one that is secure against covert attacks, again for honest majority and catches cheating with probability 1/4. The cost of the modified protocol is essentially twice that of the original plus an overhead that only depends on the number of inputs.

• Type: Conference
• Year: 2010
• Where: TCC
• Authors: Ivan Damgård, Martin Geisler, Jesper Buus Nielsen
• Keywords: Certain Probability, Covert Attacks, Cryptography, Honest Majority, TCC 2010