41 search results - page 4 / 9 » Secret Handshakes from Pairing-Based Key Agreements |
EUROCRYPT
2003
Springer
14 years 24 days ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
TIT
2008
13 years 7 months ago
2008
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
One of the basic problems in cryptography is the generation of a common secret key between two parties, for instance in order to communicate privately. In this paper we consider in...
TIFS
2011
13 years 2 months ago
2011
— “Pairing” is the establishment of authenticated key agreement between two devices over a wireless channel. Such devices are ad hoc in nature as they lack any common preshar...
STOC
2009
ACM
14 years 8 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...