Sciweavers

211 search results - page 36 / 43
» A Message Recognition Protocol Based on Standard Assumptions
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
EJWCN
2010
162views more  EJWCN 2010»
13 years 2 months ago
OMNeT++-Based Cross-Layer Simulator for Content Transmission over Wireless Ad Hoc Networks
Flexbility and deployment simplicity are among the numerous advantages of wireless links when compared to standard wired communications. However, challenges do remain high for wire...
Raphaël Massin, Catherine Lamy-Bergot, Christ...
CRYPTO
2005
Springer
113views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
Serge Vaudenay
SAC
2010
ACM
13 years 8 months ago
Visual processing-inspired fern-audio features for noise-robust speaker verification
In this paper, we consider the problem of speaker verification as a two-class object detection problem in computer vision, where the object instances are 1-D short-time spectral v...
Anindya Roy, Sébastien Marcel
CSE
2009
IEEE
13 years 9 months ago
Time Critical Content Delivery Using Predictable Patterns in Mobile Social Networks
In Mobile Social Networks (MSN) individuals with similar interests or commonalities connect to each other using the mobile phones. MSN are special kind of Ad-hoc Networks in which ...
Fawad Nazir, Jianhua Ma, Aruna Seneviratne