Results 141 to 150 of about 938 (179)

Secure Multiparty Computation of DNF

Lecture Notes in Computer Science, 2007
Homomorphism based multiparty computation techniques are studied in this paper as they have several advantages over the other multiparty computation schemes. A new homomorphism based multiparty computation technique is proposed to evaluate functions in DNF form.
Peng Kun
exaly   +2 more sources

Secure Multiparty Computation of Approximations

ACM Transactions on Algorithms, 2001
Approximation algorithms can sometimes provide efficient solutions when no efficient exact computation is known. In particular, approximations are often useful in a distributed setting where the inputs are held by different parties and may be extremely large.
Joan Feigenbaum   +5 more
openaire   +2 more sources

Secure multiparty graph computation

2016 8th International Conference on Communication Systems and Networks (COMSNETS), 2016
The recent explosion of online networked data and the discovery of universal topological characteristics in real world networks has led to the emergence of a new domain of research, namely, social networks. However, much research in this domain remains unexplored due to the inaccessibility of data of sensitive networks, which include hate networks ...
Varsha Bhat Kukkala   +2 more
openaire   +1 more source

Secure Multiparty Computation with Free Branching

2022
We study secure multi-party computation (MPC) protocols for branching circuits that contain multiple sub-circuits (i.e., branches) and the output of the circuit is that of single “active” branch. Crucially, the identity of the active branch must remain hidden from the protocol participants.
Goel, Aarushi   +3 more
openaire   +2 more sources

Secure Multiparty Computation and Secret Sharing

2015
In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. How can parties handle confidential data if they do not trust everyone involved? This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and ...
R.J.F. Cramer (Ronald)   +2 more
openaire   +4 more sources

Secure Multiparty Computation

2018
The Secure Multiparty computation is characterized by computation by a set of multiple parties each participating using the private input they have. There are different types of models for Secure Multiparty computation based on assumption about the type of adversaries each model is assumed to protect against including Malicious and Covert Adversaries ...
Kannan Balasubramanian, M. Rajakani
openaire   +1 more source

Secure Multiparty Computation for Comparator Networks

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008
We propose a multiparty protocol for comparator networks which are used to compute various functions in statistical analysis, such as the maximum, minimum, median, and quartiles, for example, through sorting and searching. In the protocol, all values which are inputted to a comparator network and all intermediate outputs are kept secret assuming the ...
Gembu Morohashi   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy