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 ℤn, zero-knowledge proofs of existence, and a novel "mixed" trapdoor commitment scheme. Our protocols are proven secure against adaptive corruptions (assuming secure erasures) under standard assumptions in the CRS model (without random oracles). Our protocols appear to be the most efficient ones that satisfy these security requirements. In contrast to prior protocols, we provide facilities that allow for the use of our protocols as building blocks of higher-level protocols. © 2013 Springer-Verlag.
CITATION STYLE
Camenisch, J., Enderlein, R. R., & Shoup, V. (2013). Practical and employable protocols for UC-secure circuit evaluation over ℤn. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8134 LNCS, pp. 19–37). https://doi.org/10.1007/978-3-642-40203-6_2
Mendeley helps you to discover research relevant for your work.