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

Efficient Secure Two-Party Exponentiation

Ching-Hua Yu, Sherman S. M. Chow, Kai-Min Chung, Feng-Hao Liu

Published Jan 1, 2011• 10 citations
Publisher
DOI
10.1007/978-3-642-19074-2_2

Related papers

Efficient Two-Party Exponentiation from Quotient Transfer

Yi Lu, Keisuke Hara, Kazuma Ohara +2 more

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

Efficient Two-Party Exponentiation from Quotient Transfer

Yi Lu, Keisuke Hara, Kazuma Ohara +2 more

Secure multi-party computation (MPC) allows participating parties to jointly compute a function over their inputs while keeping them private. In particular, MPC based on additive secret sharing has been widely studied as a tool to obtain efficient protocols secure against a dishonest majority, including the important two-party case. In this paper, we propose a two-party protocol for an exponentiation functionality based on an additive secret sharing scheme. Our proposed protocol aims to securely compute a public base exponentiation ax mod p for an odd prime p, where the exponent x ∈ ℤp is a (shared) secret and the base a ∈ ℤp is public. Our protocol is based on a new simple but efficient approach involving quotient transfer that allows the parties to perform the most expensive part of the computation locally, but requires the base a ∈ ℤp to be a quadratic residue. To address scenarios where the base does not fulfill this, we combine our exponentiation protocol with a new efficient modulus conversion protocol which might be of independent interest. Even taking into account a potential modulus conversion, our exponentiation protocol only requires 3 rounds and 4 invocations of multiplication.

IEICE Transactions on Information and Systems•Aug 20, 2025•1 citation

Efficient Secure Two-Party Computation

Thomas H. Schneider, Michael Zohner

•Dec 7, 2012•0 citations

Compilation Techniques for Actively Secure Mixed Mode Two Party Computation

Alex Norton

Secure multiparty computation allows two or more parties to compute a function without leaking unnecessary information about their inputs to other parties. In traditional secure multiparty computation protocols, the function is represented as a circuit and each gate of the circuit is securely computed. The mixed mode model is a generalization where only some gates are computed securely, and other gates are computed in a local, unsecured manner. There are computations where mixed mode protocols are known to be just as secure and much more efficient, and so it is natural to ask if it is possible to automatically construct optimized mixed mode secure protocols for a given function. \n \nPrevious results describe powerful compilation techniques to transform circuits into efficient mixed mode protocols, but the results are only secure against very restricted (passive) adversaries. These passively secure protocols can be secured against active adversaries using extensions of classic secure multiparty computation compilation techniques. However, this comes with a significant loss of concrete efficiency, which negates the mixed mode efficiency advantages. \n \nIn this thesis, we describe novel techniques that can efficiently compile mixed mode two party protocols from passive to active security. The techniques exploit structural properties of the underlying circuits to reduce the overhead of compilation without compromising the security. The gain in efficiency varies based on the circuit that is being compiled, and although for some circuits the techniques will yield no gains, for others the resulting secure protocols have exponentially lower computation and communication cost.

•Sep 3, 2019•0 citations

Efficient Secure Multi-party Computation

Martin Hirt, Ueli M. Maurer, Bartosz Przydatek

Lecture notes in computer science•Jan 1, 2000•128 citations

Secure Multi-Party Comparing Protocol Based on Multi-Threshold Secret Sharing Scheme

Wen Liu, Shoushan Luo, Yongbin Wang

The multi-party comparing problem with no information leaking is generalized from the millionaires' problem, which is used to get whether these parties' secret inputs are all equal and if not, the number of users whose inputs are the same to a indicated user Pn's. Based on the semantic secure homomorphic encryption and the multi-threshold secret sharing scheme, a protocol of comparing multi-party information of equality is proposed. The correctness, security and efficiency are analyzed. The round complexity is two, the computation complexity is O(nk) modular exponentiations and the communication complexity is O(O2l) bits.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2010•1 citation
Secure multi-party computation (MPC) allows participating parties to jointly compute a function over their inputs while keeping them private. In particular, MPC based on additive secret sharing has been widely studied as a tool to obtain efficient protocols secure against a dishonest majority, including the important two-party case. In this paper, we propose a two-party protocol for an exponentiation functionality based on an additive secret sharing scheme. Our proposed protocol aims to securely compute a public base exponentiation ax mod p for an odd prime p, where the exponent x ∈ ℤp is a (shared) secret and the base a ∈ ℤp is public. Our protocol is based on a new simple but efficient approach involving quotient transfer that allows the parties to perform the most expensive part of the computation locally, but requires the base a ∈ ℤp to be a quadratic residue. To address scenarios where the base does not fulfill this, we combine our exponentiation protocol with a new efficient modulus conversion protocol which might be of independent interest. Even taking into account a potential modulus conversion, our exponentiation protocol only requires 3 rounds and 4 invocations of multiplication.
Secure multiparty computation allows two or more parties to compute a function without leaking unnecessary information about their inputs to other parties. In traditional secure multiparty computation protocols, the function is represented as a circuit and each gate of the circuit is securely computed. The mixed mode model is a generalization where only some gates are computed securely, and other gates are computed in a local, unsecured manner. There are computations where mixed mode protocols are known to be just as secure and much more efficient, and so it is natural to ask if it is possible to automatically construct optimized mixed mode secure protocols for a given function. \n \nPrevious results describe powerful compilation techniques to transform circuits into efficient mixed mode protocols, but the results are only secure against very restricted (passive) adversaries. These passively secure protocols can be secured against active adversaries using extensions of classic secure multiparty computation compilation techniques. However, this comes with a significant loss of concrete efficiency, which negates the mixed mode efficiency advantages. \n \nIn this thesis, we describe novel techniques that can efficiently compile mixed mode two party protocols from passive to active security. The techniques exploit structural properties of the underlying circuits to reduce the overhead of compilation without compromising the security. The gain in efficiency varies based on the circuit that is being compiled, and although for some circuits the techniques will yield no gains, for others the resulting secure protocols have exponentially lower computation and communication cost.
The multi-party comparing problem with no information leaking is generalized from the millionaires' problem, which is used to get whether these parties' secret inputs are all equal and if not, the number of users whose inputs are the same to a indicated user Pn's. Based on the semantic secure homomorphic encryption and the multi-threshold secret sharing scheme, a protocol of comparing multi-party information of equality is proposed. The correctness, security and efficiency are analyzed. The round complexity is two, the computation complexity is O(nk) modular exponentiations and the communication complexity is O(O2l) bits.