Sciweavers

252 search results - page 38 / 51
» How Secure is Deterministic Encryption
Sort
View
FSE
2007
Springer
107views Cryptology» more  FSE 2007»
14 years 1 months ago
Message Freedom in MD4 and MD5 Collisions: Application to APOP
Abstract. In Wang’s attack, message modifications allow to deterministically satisfy certain sufficient conditions to find collisions efficiently. Unfortunately, message modi...
Gaëtan Leurent
SP
2007
IEEE
137views Security Privacy» more  SP 2007»
14 years 1 months ago
A Cryptographic Decentralized Label Model
Information-flow security policies are an appealing way of specifying confidentiality and integrity policies in information systems. Most previous work on language-based securit...
Jeffrey A. Vaughan, Steve Zdancewic
MOBIHOC
2009
ACM
14 years 8 months ago
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
Dong-Hoon Shin, Saurabh Bagchi
ECCC
2007
185views more  ECCC 2007»
13 years 7 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
ICC
2009
IEEE
113views Communications» more  ICC 2009»
13 years 5 months ago
Using GMM and SVM-Based Techniques for the Classification of SSH-Encrypted Traffic
When employing cryptographic tunnels such as the ones provided by Secure Shell (SSH) to protect their privacy on the Internet, users expect two forms of protection. First, they aim...
Maurizio Dusi, Alice Este, Francesco Gringoli, Luc...