Sciweavers

391 search results - page 6 / 79
» Secure Multiparty AES
Sort
View
EUROCRYPT
1998
Springer
13 years 11 months ago
Quorum-Based Secure Multi-party Computation
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
Donald Beaver, Avishai Wool
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 6 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
ACNS
2010
Springer
132views Cryptology» more  ACNS 2010»
13 years 10 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...
SACRYPT
2004
Springer
105views Cryptology» more  SACRYPT 2004»
14 years 1 days ago
Provably Secure Masking of AES
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
Johannes Blömer, Jorge Guajardo, Volker Krumm...
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
14 years 24 days ago
On the Necessity of Rewinding in Secure Multiparty Computation
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
Michael Backes, Jörn Müller-Quade, Domin...