2846 search results - page 41 / 570 » Not one click for security |
112
click to vote
ASIACRYPT
1999
Springer
15 years 8 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
112
click to vote
FC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. MAC algorithms can provide cryptographically secure authentication services. One of the most popular algorithms in commercial appli
139
click to vote
JUCS
2008
15 years 4 months ago
2008
Abstract: Message Authentication Code (MAC) algorithms can provide cryptographically secure authentication services. One of the most popular algorithms in commercial
201
click to vote
ACISP
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. SIMD is one of the second round candidates of the SHA3 competition hosted by NIST. In this paper, we present some results
155
click to vote
EUROCRYPT
2009
Springer
16 years 4 months ago
2009
Springer
Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky (BHHO) solved the longstanding open problem of "circular encryption," by presenting a public key encrypti...