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

Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn

Jan L. Camenisch, Robert R. Enderlein, Victor Shoup

Published Jan 1, 2013• 3 citations
Publisher
DOI
10.1007/978-3-642-40203-6_2

Related papers

Reusing Tamper-Proof Hardware in UC-Secure Protocols

Jeremias Mechler, Jörn Müller‐Quade, Tobias Nilges

Lecture notes in computer science•Jan 1, 2018•2 citations

New Constructions for UC Secure Computation Using Tamper-Proof Hardware

Nishanth Chandran, Vipul Goyal, Amit Sahai

Springer eBooks•Apr 4, 2008•96 citations

Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs

Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky +1 more

Lecture notes in computer science•Jan 1, 2017•17 citations

A simple protocol for secure circuit evaluation: Extended abstract

Martín Abadi, Joan Feigenbaum

Lecture notes in computer science•Jan 1, 1988•10 citations

Practical and Employable Protocols for UC-Secure Circuit Evaluation over Z n .

Jan L. Camenisch, Robert R. Enderlein, 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 Zn, 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. An additional contribution of this paper is a universally composable construction of the variant of the Dodis-Yampolskiy oblivious pseudorandom function in a group of order n as originally proposed by Jarecki and Liu.

•Jan 1, 2013•0 citations

A Practical Universal Circuit Construction and Secure Evaluation of Private Functions

Vladimir Kolesnikov, Thomas H. Schneider

Lecture notes in computer science•Aug 13, 2008•112 citations
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 Zn, 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. An additional contribution of this paper is a universally composable construction of the variant of the Dodis-Yampolskiy oblivious pseudorandom function in a group of order n as originally proposed by Jarecki and Liu.