Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting

DOI10.1007/978-3-662-48000-7_37zbMath1352.94024OpenAlexW2295268597MaRDI QIDQ3457094

Rafail Ostrovsky, Hong-Sheng Zhou, Joël Alwen, Vassilis Zikas

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_37

zbMATH Keywords

receipt-freenessmulti-party computationuniversal compositionelectronic voting protocols

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (4)

Traceable receipt-free encryption ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Ceremonies for End-to-End Verifiable Elections

Cites Work

• Towards trustworthy elections. New directions in electronic voting
• A proof of security of Yao's protocol for two-party computation
• Security and composition of multiparty cryptographic protocols
• The reactive simulatability (RSIM) framework for asynchronous systems
• Formalising Receipt-Freeness
• Universally Composable Incoercibility
• Universally Composable Security with Global Setup
• Founding Cryptography on Oblivious Transfer – Efficiently
• A Formal Framework for Modelling Coercion Resistance and Receipt Freeness
• Universally Composable Synchronous Computation
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy

This page was built for publication: Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting