Sciweavers

273 search results - page 20 / 55
» Modular Security Proofs for Key Agreement Protocols
Sort
View
225
Voted
TIT
2008
187views more  TIT 2008»
15 years 6 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
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...
Stefan Dziembowski, Ueli M. Maurer
199
Voted
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
16 years 8 months ago
Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols
A key exchange protocol allows a set of parties to agree upon a secret session key over a public network. Two-party key exchange (2PKE) protocols have been rigorously analyzed unde...
Colin Boyd, Juan Manuel González Nieto, M. ...
EUROCRYPT
2009
Springer
16 years 8 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
165
Voted
ACISP
2006
Springer
15 years 11 months ago
An Extension to Bellare and Rogaway (1993) Model: Resetting Compromised Long-Term Keys
Abstract. A security proof in the Bellare
Colin Boyd, Kim-Kwang Raymond Choo, Anish Mathuria
222
Voted
LOPSTR
2001
Springer
15 years 12 months ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle