From Passive to Covert Security at Low Cost

  • Ivan Damgård
  • Martin Geisler
  • Jesper Buus Nielsen
Conference paper

DOI: 10.1007/978-3-642-11799-2_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5978)
Cite this paper as:
Damgård I., Geisler M., Nielsen J.B. (2010) From Passive to Covert Security at Low Cost. In: Micciancio D. (eds) Theory of Cryptography. TCC 2010. Lecture Notes in Computer Science, vol 5978. Springer, Berlin, Heidelberg

Abstract

Aumann and Lindell defined security against covert attacks, where the adversary is malicious, but is only caught cheating with a certain probability. 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.

Copyright information

© IFIP International Federation for Information Processing 2010

Authors and Affiliations

  • Ivan Damgård
    • 1
  • Martin Geisler
    • 1
  • Jesper Buus Nielsen
    • 1
  1. 1.Dept. of Computer ScienceUniversity of AarhusDenmark

Personalised recommendations