Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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

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

Published Jan 1, 2015• 24 citations
Publisher
DOI
10.1007/978-3-662-48000-7_37

Related papers

4. Universally Composable Multi-party Computation

Yehuda Lindell

Lecture notes in computer science•Jan 1, 2003•7 citations

Universally Composable Multi-party Computation Using Tamper-Proof Hardware

Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2007•217 citations

Universally Composable Quantum Multi-party Computation

Dominique Unruh

arXiv:0910.2912•Lecture notes in computer science•Jan 1, 2010•131 citations

Universally Composable Multi-party Computation with an Unreliable Common Reference String

Vipul Goyal, Jonathan I. Katz

Springer eBooks•Feb 25, 2008•19 citations

Universally Composable Multiparty Computation with Partially Isolated Parties

Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs

Lecture notes in computer science•Jan 1, 2009•35 citations

Universally-Composable Two-Party Computation in Two Rounds

Omer Horvitz, Jonathan I. Katz

Springer eBooks•Aug 9, 2007•60 citations