91 search results - page 6 / 19 » Bounded Key-Dependent Message Security |
EUROCRYPT
1999
Springer
14 years 1 months ago
1999
Springer
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
ESORICS
2009
Springer
14 years 10 months ago
2009
Springer
We present a traffic analysis of the ADU anonymity scheme presented at ESORICS 2008, and the related RADU scheme. We show that optimal attacks are able to de-anonymize messages mor...
CRYPTO
2005
Springer
14 years 3 months ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
IACR
2011
12 years 9 months ago
2011
Abstract. Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purpose...
FSTTCS
2003
Springer
14 years 2 months ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...