2967 search results - page 456 / 594 » Cryptology |
130
click to vote
INDOCRYPT
2003
Springer
15 years 10 months ago
2003
Springer
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
123
click to vote
INDOCRYPT
2003
Springer
15 years 10 months ago
2003
Springer
We consider a variant of the Complex Multiplication (CM) method for constructing elliptic curves (ECs) of prime order with additional security properties. Our variant uses Weber po...
173
click to vote
INDOCRYPT
2003
Springer
15 years 10 months ago
2003
Springer
A solution for obtaining impartial random values in on-line gambling is presented in this paper. Unlike most previous proposals, our method does not require any TTP and allows e-ga...
208
click to vote
TCC
2010
Springer
15 years 10 months ago
2010
Springer
We consider message authentication codes for streams where the key becomes known only at the end of the stream. This usually happens in key-exchange protocols like SSL and TLS wher...
120
click to vote
NDSS
1998
IEEE
15 years 9 months ago
1998
IEEE
Protocol failures are presented for two timestamping schemes. These failures emphasize the importance and di culty of implementing a secure protocol even though there exist secure...