Paper 2013/205
Practical and Employable Protocols for UC-Secure Circuit Evaluation over
Jan Camenisch, Robert R. Enderlein, and Victor Shoup
Abstract
We present a set of new, efficient, universally composable
two-party protocols for evaluating
reactive arithmetic circuits modulo n,
where n is a safe RSA modulus of unknown factorization.
Our protocols are based on
a homomorphic encryption scheme with message space
Note: This is the full version of a paper due to appear at the 18th European Symposium on Research in Computer Security (ESORICS 2013).
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Accepted for publication at ESORICS 2013.
- Keywords
- Two-party computationPractical ProtocolsUC-Security
- Contact author(s)
- eprint @ e7n ch
- History
- 2016-01-07: last of 3 revisions
- 2013-04-14: received
- See all versions
- Short URL
- https://ia.cr/2013/205
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/205, author = {Jan Camenisch and Robert R. Enderlein and Victor Shoup}, title = {Practical and Employable Protocols for {UC}-Secure Circuit Evaluation over $Z_n$}, howpublished = {Cryptology {ePrint} Archive, Paper 2013/205}, year = {2013}, url = {https://eprint.iacr.org/2013/205} }