Sciweavers

39 search results - page 6 / 8
» Entropic Security and the Encryption of High Entropy Message...
Sort
View
FSTTCS
2003
Springer
14 years 16 days ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
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...
Ramaswamy Ramanujam, S. P. Suresh
IACR
2011
73views more  IACR 2011»
12 years 7 months ago
Secure Authentication from a Weak Key, Without Leaking Information
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
Niek J. Bouman, Serge Fehr
SASN
2003
ACM
14 years 17 days ago
A security design for a general purpose, self-organizing, multihop ad hoc wireless network
We present a security design for a general purpose, selforganizing, multihop ad hoc wireless network, based on the IEEE 802.15.4 low-rate wireless personal area network standard. ...
Thomas S. Messerges, Johnas Cukier, Tom A. M. Keve...
WPES
2006
ACM
14 years 1 months ago
Measuring relationship anonymity in mix networks
Many applications of mix networks such as anonymous Web browsing require relationship anonymity: it should be hard for the attacker to determine who is communicating with whom. Co...
Vitaly Shmatikov, Ming-Hsiu Wang
CCS
2011
ACM
12 years 7 months ago
Automated black-box detection of side-channel vulnerabilities in web applications
Web applications divide their state between the client and the server. The frequent and highly dynamic client-server communication that is characteristic of modern web application...
Peter Chapman, David Evans