252 search results - page 51 / 51 » Computationally secure two-round authenticated message excha... |
STOC
2009
ACM
14 years 6 months ago
2009
ACM
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...
ESAS
2004
Springer
13 years 11 months ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...