2967 search results - page 326 / 594 » Cryptology |
252
click to vote
CRYPTO
1999
Springer
15 years 11 months ago
1999
Springer
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
173
Voted
CRYPTO
1999
Springer
15 years 11 months ago
1999
Springer
We prove the equivalence of two definitions of non-malleable encryption appearing in the literature— the original one of Dolev, Dwork and Naor and the later one of Bellare, Desa...
181
click to vote
CRYPTO
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
167
click to vote
CRYPTO
1999
Springer
15 years 11 months ago
1999
Springer
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
165
click to vote
EUROCRYPT
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...