Sciweavers

321 search results - page 6 / 65
» Secure Multiparty Computation of Approximations
Sort
View
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 10 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
FC
2010
Springer
196views Cryptology» more  FC 2010»
14 years 2 months ago
Secure Multiparty AES
Abstract We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires 2200 + 400 255 expected elementary operations in expe...
Ivan Damgård, Marcel Keller
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
Ivan Damgård, Claudio Orlandi
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 10 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
ACNS
2010
Springer
132views Cryptology» more  ACNS 2010»
14 years 1 months ago
Efficient Implementation of the Orlandi Protocol
Abstract. We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is...
Thomas P. Jakobsen, Marc X. Makkes, Janus Dam Niel...