Sciweavers

321 search results - page 14 / 65
» Secure Multiparty Computation of Approximations
Sort
View
109
Voted
IEEEARES
2007
IEEE
15 years 6 months ago
Agent Alliances: A Means for Practical Threshold Signature
In [7] we have proposed a model for the robust and private evaluation of a function within a group of cooperating mobile agents, called an agent Alliance. The model has been given...
Regine Endsuleit, Christoph Amma
120
Voted
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
15 years 6 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
ASIACRYPT
2005
Springer
15 years 6 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
IACR
2011
196views more  IACR 2011»
14 years 2 days ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
113
Voted
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
13 years 2 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...