91 search results - page 16 / 19 » Bounded Key-Dependent Message Security |
TCC
2010
Springer
14 years 4 months ago
2010
Springer
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to ...
EUROCRYPT
2005
Springer
14 years 29 days ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
ESORICS
2010
Springer
13 years 8 months ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...