405 search results - page 58 / 81 » Practice-Oriented Provable Security |
FSE
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictabilit...
TIT
2008
13 years 7 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
CCS
2005
ACM
14 years 1 months ago
2005
ACM
We describe a new encryption technique that is secure in the standard model against adaptive chosen ciphertext (CCA2) attacks. We base our method on two very efficient Identity-Ba...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...
CCS
2006
ACM
13 years 11 months ago
2006
ACM
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...