152 search results - page 17 / 31 » On the Key Dependent Message Security of the Fujisaki-Okamot... |
CCS
2007
ACM
15 years 4 months ago
2007
ACM
We construct two new multiparty digital signature schemes that allow multiple signers to sequentially produce a compact, fixed-length signature. First, we introduce a new primiti...
CCS
2009
ACM
15 years 11 months ago
2009
ACM
In a proxy re-encryption (PRE) scheme [4], a proxy, authorized by Alice, transforms messages encrypted under Alice's public key into encryptions under Bob's public key w...
IJNSEC
2007
14 years 10 months ago
2007
We can view an existing Message Authentication Code (MAC) as a Carter-Wegman MAC in spite of the fact it may not have been designed as one. This will make the analysis easier than...
RFIDSEC
2010
14 years 8 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
104
click to vote
FSE
2004
Springer
15 years 3 months ago
2004
Springer
Symmetric encryption schemes are usually formalized so as to make the encryption operation a probabilistic or state-dependent function E of the message M and the key K: the user su...