256 search results - page 21 / 52 » Reusing Static Keys in Key Agreement Protocols |
122
click to vote
CCS
2005
ACM
15 years 7 months ago
2005
ACM
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
135
click to vote
ESORICS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
136
click to vote
EUROCRYPT
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
133
click to vote
CSREASAM
2006
15 years 3 months ago
2006
Group communication is becoming increasingly popular in Internet applications such as videoconferences, online chatting programs, games, and gambling. For secure communications, th...
139
click to vote
STOC
2009
ACM
16 years 2 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...