From Passive to Covert Security at Low Cost.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  • Department of Computer Science
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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Pages (from-to)128-145
Number of pages18
Publication statusPublished - 2010
Event7th Theory of Cryptography Conference. TCC - Zurich, Switzerland
Duration: 9 Feb 201011 Feb 2010


Conference7th Theory of Cryptography Conference. TCC

Bibliographical note

Title of the vol.: Theory of Cryptography. Proceedings. / Daniele Micciancio (ed.)
ISBN: 978-3-642-11798-5; 3642117988

See relations at Aarhus University Citationformats

ID: 19390781