102 search results - page 8 / 21 » Perfectly Secure Multiparty Computation and the Computationa... |
70
Voted
ICPPW
2003
IEEE
15 years 2 months ago
2003
IEEE
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
ESORICS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
EUROCRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...