Universally composable incoercibility

DOI10.1007/978-3-642-14623-7_22MaRDI QIDQ3582767zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Dominique Unruh, Joern Mueller-Quade

Publication date 24 August 2010

Published in Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14623-7_22

zbMATH Keywords

incoercibilityuniversal composabilityvoting

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Incoercible multi-party computation and universally composable receipt-free voting
• scientific article; zbMATH DE number 2009949
• scientific article; zbMATH DE number 1842484
• Universally composable security with local adversaries
• Universally composable two-party and multi-party secure computation

Cited in

(8)

• Towards multiparty computation withstanding coercion of all parties
• Cast-as-intended: a formal definition and case studies
• Composition, indiscernibility, coreferentiality
• Incoercible multi-party computation and universally composable receipt-free voting
• Perpetuality for Full and Safe Composition (in a Constructive Setting)
• scientific article; zbMATH DE number 149878 (Why is no real title available?)
• Traceable receipt-free encryption
• Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)

This page was built for publication: Universally composable incoercibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582767)