Sciweavers

391 search results - page 26 / 79
» Secure Multiparty AES
Sort
View
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
106
Voted
CTRSA
2006
Springer
146views Cryptology» more  CTRSA 2006»
15 years 4 months ago
Cache Attacks and Countermeasures: The Case of AES
We describe several software side-channel attacks based on inter-process leakage through the state of the CPU's memory cache. This leakage reveals memory access patterns, whic...
Dag Arne Osvik, Adi Shamir, Eran Tromer
134
Voted
INDOCRYPT
2010
Springer
14 years 10 months ago
Attack on a Higher-Order Masking of the AES Based on Homographic Functions
In the recent years, Higher-order Side Channel attacks have been widely investigated. In particular, 2nd-order DPA have been improved and successfully applied to break several mask...
Emmanuel Prouff, Thomas Roche
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...
90
Voted
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
15 years 5 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer