Results 231 to 240 of about 3,214 (260)
Some of the next articles are maybe not open access.
Research on Secure Multi-party Computational Geometry
2011With rapid growth of the internet, a plenty of collaboration opportunities exist when organizations and individuals share information or cooperate to compute in a distributed system. The cooperation may occur between mutually untrusted parties or competitors. This problem is referred to Secure Multi-party Computation (SMC) problem.
Tao Geng +4 more
openaire +1 more source
Leveraging the "Multi" in secure multi-party computation
Proceedings of the 2003 ACM workshop on Privacy in the electronic society, 2003Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in sensitive data on networked computers, along with improved ability to integrate and utilize that data, make the time ripe for practical secure multi-party computation.
Jaideep Vaidya, Chris Clifton
openaire +1 more source
Secure Multi-Party Computation without Agreement
Journal of Cryptology, 2005It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place.
Shafi Goldwasser, Yehuda Lindell
openaire +1 more source
Secure Multi-Party Computation for Elliptic Curves
2014In this paper, we propose the first multi-party computation protocols for scalar multiplication and other basic operations on elliptic curves, which achieve constant round complexity and linear communication complexity. The key idea is adopting point addition formula without conditional branch, i.e., Edwards curve.
Koutarou Suzuki, Kazuki Yoneyama
openaire +1 more source
Secure Multi-party Computation
2015Secure multi-party computation is an area of cryptography which deals with two or more parties computing a function on their private inputs. They wish to do so in a way that means that their private inputs still remain private. Of course depending on the function being computed, some information about the inputs may leak.
openaire +1 more source
The Price of Low Communication in Secure Multi-party Computation
2017Traditional protocols for secure multi-party computation among n parties communicate at least a linear (in n) number of bits, even when computing very simple functions. In this work we investigate the feasibility of protocols with sublinear communication complexity. Concretely, we consider two clients, one of which may be corrupted, who wish to perform
Juan A. Garay 0001 +3 more
openaire +2 more sources
Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation
ACM Transactions on Privacy and Security, 2022Alptekin Küpcü
exaly
An efficient approach for secure multi-party computation without authenticated channel
Information Sciences, 2020Duy-Hien Vu, Tu-Bao Ho
exaly