Results 1  10
of
1,271
Multiparty Computation Goes Live ⋆
"... Abstract. In this note, we briefly report on the first largescale and practical application of multiparty computation, which took place in ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. In this note, we briefly report on the first largescale and practical application of multiparty computation, which took place in
Realizing Secure Multiparty Computations
, 2009
"... A multiparty computation is where three or more parties compute a commonly agreed function with secret input and public output. Using this technique, virtually any cryptographic protocol problem involving a trusted party can be solved without the need for such a party. Typical problems are electroni ..."
Abstract
 Add to MetaCart
A multiparty computation is where three or more parties compute a commonly agreed function with secret input and public output. Using this technique, virtually any cryptographic protocol problem involving a trusted party can be solved without the need for such a party. Typical problems
Secure multiparty computation of approximations
, 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. Furthermore, for some applications, the ..."
Abstract

Cited by 108 (25 self)
 Add to MetaCart
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. Furthermore, for some applications
Statistical Multiparty Computation Based on
, 2005
"... With respect to a special class of access structures based on connectivity of graphs, we start from a linear secret sharing scheme and turn it into a secret sharing scheme with perfect security and exponentially small error probability by randomizing the reconstruction algorithm through random w ..."
Abstract
 Add to MetaCart
walks on graphs. It reduces the polynomial work space to logarithmic. Then we build the corresponding statistical multiparty computation protocol by using the secret sharing scheme.
Secure Multiparty Computations on Bitcoin
"... Bitcoin is a decentralized digital currency, introduced in 2008, that has recently gained noticeable popularity. Its main features are: (a) it lacks a central authority that controls the transactions, (b) the list of transactions is publicly available, and (c) its syntax allows more advanced transac ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
transactions than simply transferring the money. The goal of this paper is to show how these properties of Bitcoin can be used in the area of secure multiparty computation protocols (MPCs). Firstly, we show that the Bitcoin system provides an attractive way to construct a version of “timed commitments”, where
Studies in Secure Multiparty Computation and Applications
, 1996
"... Consider a set of parties who do not trust each other, nor the channels by which they communicate. Still, the parties wish to correctly compute some common function of their local inputs, while keeping their local data as private as possible. This, in a nutshell, is the problem of secure multiparty ..."
Abstract

Cited by 82 (7 self)
 Add to MetaCart
Consider a set of parties who do not trust each other, nor the channels by which they communicate. Still, the parties wish to correctly compute some common function of their local inputs, while keeping their local data as private as possible. This, in a nutshell, is the problem of secure multiparty
Incoercible Multiparty Computation
 Proc. 37th IEEE Symp. on Foundations of Computer Science
, 1996
"... Current secure multiparty protocols have the following deficiency. The public transcript of the communication can be used as an involuntary commitment of the parties to their inputs and outputs. Thus parties can be later coerced by some authority to reveal their private data. Previous work that has ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
of the general paradigm used for defining secure multiparty protocols. Next we show that if trapdoor permutations exist then any function can be incoercibly computed (i.e., computed by a protocol that provides resilience to coercion) in the presence of computationally bounded adversaries and only public
Secure Multiparty Computation Goes Live ⋆
"... Abstract. In this note, we report on the first largescale and practical application of multiparty computation, which took place in January 2008. We also report on the novel cryptographic protocols that were used. 1 Introduction and History In multiparty computation (MPC), we consider a number of pl ..."
Abstract

Cited by 44 (2 self)
 Add to MetaCart
Abstract. In this note, we report on the first largescale and practical application of multiparty computation, which took place in January 2008. We also report on the novel cryptographic protocols that were used. 1 Introduction and History In multiparty computation (MPC), we consider a number
1 introduction Multiparty Computation, an Introduction
"... These lecture notes introduce the notion of secure multiparty computation. We introduce some concepts necessary to define what it means for a multiparty protocol to be secure, and survey ..."
Abstract
 Add to MetaCart
These lecture notes introduce the notion of secure multiparty computation. We introduce some concepts necessary to define what it means for a multiparty protocol to be secure, and survey
Secure Multiparty Computations Without Computers
, 1998
"... Many simple calculations can be done easier without computers than by using them. We show that the same holds for secure multiparty computations if the function to be computed is simple enough. Our starting point is an observation of Bert den Boer: a multiparty computation of a logical ANDgate can b ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Many simple calculations can be done easier without computers than by using them. We show that the same holds for secure multiparty computations if the function to be computed is simple enough. Our starting point is an observation of Bert den Boer: a multiparty computation of a logical ANDgate can
Results 1  10
of
1,271