A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting
[chapter]
2015
Lecture Notes in Computer Science
Composable notions of incoercibility aim to forbid a coercer from using anything beyond the coerced parties' inputs and outputs to catch them when they try to deceive him. Existing definitions are restricted to weak coercion types, and/or are not universally composable. Furthermore, they often make too strong assumptions on the knowledge of coerced parties-e.g., they assume they known the identities and/or the strategies of other coerced parties, or those of corrupted partieswhich makes them
doi:10.1007/978-3-662-48000-7_37
fatcat:6764qgvnpfarngnhouy4t6cove