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

通讯和计算机:中英文版

A Study of Secure Multi-Party Elementary Function Computation Protocols

Wenjun, Luo -, ■ Xiang, LI .

Published Jan 1, 2005• 1 citation
OpenAlex

Related papers

Research and Application of Secure Multi-party Computation Protocols

Ke Chen

•Jan 1, 2003•2 citations

An elementary completeness proof for secure two-party computation primitives

Ye Wang, Prakash Sharma Ishwar, Shantanu D. Rane

In the secure two-party computation problem, two parties wish to compute a (possibly randomized) function of their inputs via an interactive protocol, while ensuring that neither party learns more than what can be inferred from only their own input and output. For semi-honest parties and information-theoretic security guarantees, it is well-known that, if only noise-less communication is available, only a limited set of functions can be securely computed; however, if interaction is also allowed over general communication primitives (multi-input/output channels), there are “complete” primitives that enable any function to be securely computed. The general set of complete primitives was characterized recently by Maji, Prabhakaran, and Rosulek leveraging an earlier specialized characterization by Kilian. Our contribution in this paper is a simple, self-contained, alternative derivation using elementary information-theoretic tools.

arXiv:1402.4360•IEEE Information Theory Workshop (ITW)•Nov 1, 2014•0 citations

Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation

Thomas H. Schneider

•Aug 4, 2012•25 citations

A study of secure multi-party elementary function computation protocols

Wenjun Luo, Li Xiang

The growth of the Internet has triggered tremendous opportunities for cooperative computation, where people are jointly conducting computation tasks based on the private inputs they each supply. These computations could occur between mutually untrusted parties, or even between competitors. Today, to conduct such computations, one entity must usually know the inputs from all the participants; however if nobody can be trusted enough to know all the inputs, privacy will become a primary concern. This problem is referred to as Secure Multi-party Computation Problem (SMC) in the literature. Research in the SMC area has been focusing on only a limited set of specific SMC problems, while privacy concerned cooperative computations call for SMC studies in a variety of computation domains. About the specific SMC problems, have some result [6,7,8,9,11,12,13], and all the result are concern Two-party computations. Recently, the paper of China has [23~28].

•Nov 14, 2004•4 citations

Structural Framing of Protocol for Secure Multiparty Cloud Computation

Nikhar Maheshwari, Krati Kiyawat

Secure Multi party Computation (SMC) is a paradigm that keeps data of individual parties as secret and provides the private data for computation to evaluate some function of their common interest. The outcome of the computation is made available to all the parties. Cloud Computing is a paradigm shift from the distributed computing where an organization uses resources "as service". With the"pay-as-you-go" model, an organization can improve efficiency while minimizing the expenditure and the operation overhead. However, users of the cloud are worrying about the privacy of their data that has been supplied to the cloud provider. The solutions to these problems can be provided by the protocols of the Secured Multi party Cloud Computing (SMCC). In this tutorial, we propose SMC solution techniques that can be embedded while designing architecture of cloud computing especially when multiple cloud users jointly compute some function of their private data inputs. With our experience of developing protocols and devising algorithms for SMC problem we anticipate a crucial role of SMC in cloud computing. In this tutorial, we explore such scenario while discussing various protocols of SMC and their applicability in cloud computing, with the design of SMCC Architecture.

Asia Modelling Symposium•May 1, 2011•13 citations

Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation

Thomas H. Schneider

Springer eBooks•Jan 1, 2012•12 citations
In the secure two-party computation problem, two parties wish to compute a (possibly randomized) function of their inputs via an interactive protocol, while ensuring that neither party learns more than what can be inferred from only their own input and output. For semi-honest parties and information-theoretic security guarantees, it is well-known that, if only noise-less communication is available, only a limited set of functions can be securely computed; however, if interaction is also allowed over general communication primitives (multi-input/output channels), there are “complete” primitives that enable any function to be securely computed. The general set of complete primitives was characterized recently by Maji, Prabhakaran, and Rosulek leveraging an earlier specialized characterization by Kilian. Our contribution in this paper is a simple, self-contained, alternative derivation using elementary information-theoretic tools.
The growth of the Internet has triggered tremendous opportunities for cooperative computation, where people are jointly conducting computation tasks based on the private inputs they each supply. These computations could occur between mutually untrusted parties, or even between competitors. Today, to conduct such computations, one entity must usually know the inputs from all the participants; however if nobody can be trusted enough to know all the inputs, privacy will become a primary concern. This problem is referred to as Secure Multi-party Computation Problem (SMC) in the literature. Research in the SMC area has been focusing on only a limited set of specific SMC problems, while privacy concerned cooperative computations call for SMC studies in a variety of computation domains. About the specific SMC problems, have some result [6,7,8,9,11,12,13], and all the result are concern Two-party computations. Recently, the paper of China has [23~28].
Secure Multi party Computation (SMC) is a paradigm that keeps data of individual parties as secret and provides the private data for computation to evaluate some function of their common interest. The outcome of the computation is made available to all the parties. Cloud Computing is a paradigm shift from the distributed computing where an organization uses resources "as service". With the"pay-as-you-go" model, an organization can improve efficiency while minimizing the expenditure and the operation overhead. However, users of the cloud are worrying about the privacy of their data that has been supplied to the cloud provider. The solutions to these problems can be provided by the protocols of the Secured Multi party Cloud Computing (SMCC). In this tutorial, we propose SMC solution techniques that can be embedded while designing architecture of cloud computing especially when multiple cloud users jointly compute some function of their private data inputs. With our experience of developing protocols and devising algorithms for SMC problem we anticipate a crucial role of SMC in cloud computing. In this tutorial, we explore such scenario while discussing various protocols of SMC and their applicability in cloud computing, with the design of SMCC Architecture.