We argue that any realization of F_{eaa} must be deniable in the sense of Dodis et al. TCC 2009. To prove the deniability of similar primitives, previous work defined ad hoc notions of deniability for each task, and then each notion was showed equivalent to realizing the primitive in the Generalized Universal Composability framework (GUC, Canetti et al. TCC 2007). Instead, we put forward the question of whether deniability can be defined independently from any particular task. We answer this question in the affirmative providing a natural extension of the definition of Dodis et al. for arbitrary multiparty protocols. Furthermore, we show that a protocol satisfies this definition if an only if it realizes the ideal functionality F_{eaa} in the GUC framework. This result enables us to prove that most GUC functionalities we are aware of (and their realizations) are deniable.
We conclude by applying our results to the construction of a deniable protocol that realizes F_{eaa}.
Category / Keywords: foundations / deniability, anonymity, anonymous authentication Date: received 27 Sep 2014 Contact author: ahevia at dcc uchile cl Available format(s): PDF | BibTeX Citation Version: 20140929:083136 (All versions of this report) Short URL: ia.cr/2014/753 Discussion forum: Show discussion | Start new discussion