STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Incoercible multiparty computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Secret-Ballot Receipts: True Voter-Verifiable Elections
IEEE Security and Privacy
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
Universally composable security with global setup
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Bingo voting: secure and coercion-free voting using a trusted random number generator
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
A practical voter-verifiable election scheme
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Receipt-free universally-verifiable voting with everlasting privacy
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Adapting helios for provable ballot privacy
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Measuring vote privacy, revisited
Proceedings of the 2012 ACM conference on Computer and communications security
A game-based definition of coercion resistance and its applications
Journal of Computer Security - CSF 2010
| Hi-index | 0.00 |
We present the UC/c framework, a general definition for secure and incoercible multi-party protocols. Our framework allows to model arbitrary reactive protocol tasks (by specifying an ideal functionality) and comes with a universal composition theorem. We show that given natural setup assumptions, we can construct incoercible two-party protocols realising arbitrary functionalities (with respect to static adversaries).