64 search results - page 9 / 13 » crypto 2006 |
110
Voted
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
119
Voted
EUROCRYPT
2008
Springer
15 years 3 months ago
2008
Springer
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
114
Voted
IJISEC
2007
15 years 1 months ago
2007
Abstract. We examine the popular proof models for group key establishment of Bresson et al. [BCPQ01,BCP01] and point out missing security properties addressing malicious protocol p...
131
click to vote
EUROCRYPT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
DCC
2006
IEEE
16 years 1 months ago
2006
IEEE
At Crypto '85, Desmedt and Odlyzko described a chosen-ciphertext attack against plain RSA encryption. The technique can also be applied to RSA signatures and enables an existe...