Results 261 to 270 of about 7,306 (290)

Secure multi-party quantum computation

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker
Claude Crépeau, Daniel Gottesman, Adam D. Smith 0001   +2 more
openaire   +1 more source

Secure Multi-party Computational Geometry

2001
The general secure multi-party computation problem is when multiple parties (say, Alice and Bob) each have private data (respectively, a and b) and seek to compute some function f(a, b) without revealing to each other anything unintended (i.e., anything other than what can be inferred from knowing f(a, b)). It is well known that, in theory, the general
Mikhail J. Atallah, Wenliang Du 0001
openaire   +1 more source

Secure Multi-Party Computation with Security Modules.

, 2005
We consider the problem of secure multi-party computation (SMC) in a new model where individual processes contain a tamper-proof security module. Security modules can be trusted by other processes and can establish secure channels between each other ...
Benenson, Zinaida, Freiling, Felix, Kesdogan, Dogan   +2 more
openaire   +3 more sources

Secure Multi-Party Computation on Blockchain: An Overview

2020
Secure multi-party computation (SMPC) is a hot topic in the field of cryptography. It focuses on finishing computation tasks without revealing users’ inputs and outputs in decentralized scenarios. Although many researches have been conducted to perform SMPC protocols, it is hard to obtain fairness while most participants in SMPC are dishonest. Recently,
Hanrui Zhong, Yingpeng Sang, Yongchun Zhang, Zhicheng Xi   +3 more
openaire   +1 more source

Secure Multi-Party Computation without Agreement

Journal of Cryptology, 2005
It 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

Research on Secure Multi-party Computational Geometry

2011
With 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, Shoushan Luo, Yang Xin 0001, Xiaofeng Du, Yixian Yang   +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, 2003
Secure 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 for Elliptic Curves

2014
In 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

2015
Secure 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

FairplayMP

Proceedings of the 15th ACM conference on Computer and communications security, 2008
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptography, enabling a set of untrusting parties to compute any function of their private inputs while revealing nothing but the result of the function.
Assaf Ben-David, Noam Nisan, Benny Pinkas   +2 more
openaire   +2 more sources