… To define what it means that the real protocol is incoercible (or more precisely, as
incoercible as the ideal model), we will use the concept of simulation that underlies many …

… the first universally composable notion of incoercible multi-… We define natural notions of UC
incoercibility corresponding … which realize our notions of UC incoercibility given access to an …

… This simplifies security proofs since we only need to prove universal composability to … ,
universal composability of a voting scheme does not guarantee universal verifiability, incoercibility…

… Universal Composability model, given that the underlying commitment is universally
composable… that is receipt-free under our definition is incoercible as well). Loosely, both definitions …

… security model for incoercible signature schemes … incoercible signature scheme can be
viewed as a transformation of any generic signature scheme. Indeed, we present two incoercible …

We introduce a variant of the Universal Composability framework (UC; Canetti, FOCS 2001)
that uses symbolic cryptography. Two salient properties of the UC framework are secure …

… definition and is also universally composable. Furthermore, … incoercible distributed function
evaluation. Let f : (10, 1l∗ )n → (10, 1l∗ )n be an n-party function, and let Jf be the incoercible …

… definition and is also universally composable. Furthermore, … We say that π is incoercible if
it UC-emulates an incoercible … notion of incoercibility: Indeed, F provides “ideal incoercibility” …

… is secure in the universal composability (UC) framework, … are not, themselves, universally
composable (we propose using a … -based models (such as universal composability), since the …

… Incoercibility has been defined and examined in the universally composable framework in
the context of general multiparty computation [22, 90]. These definitions examine whether the …