Sciweavers

145 search results - page 3 / 29
» Secure Two-Party Computation with Low Communication
Sort
View
AC
1998
Springer
13 years 9 months ago
The Search for the Holy Grail in Quantum Cryptography
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
Louis Salvail
AINA
2005
IEEE
13 years 11 months ago
An Improved Low Computation Cost User Authentication Scheme for Mobile Communication
Most of existing user authentication schemes require high computation cost of exponentiation operations for the purpose of security. However, it is not suitable for mobile devices...
Chia-Yin Lee, Chu-Hsing Lin, Chin-Chen Chang
CCS
2008
ACM
13 years 7 months ago
FairplayMP: a system for secure multi-party computation
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
Assaf Ben-David, Noam Nisan, Benny Pinkas
CMS
2011
229views Communications» more  CMS 2011»
12 years 5 months ago
Twin Clouds: Secure Cloud Computing with Low Latency - (Full Version)
Abstract. Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations. However, existing approaches for provably secure ...
Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sa...
EUROCRYPT
2007
Springer
13 years 11 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan