Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

IMA
2001
Springer

favoriteEmaildiscussreport

78views Cryptology» more IMA 2001»

Unconditionally Secure Key Agreement Protocol

13 years 9 months ago

Unconditionally Secure Key Agreement Protocol

Download www.anarres.org

Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility under the assumption that Alice and Bob own speciﬁc devices such as quantum channel [2]. In this article, we propose a new key agreement protocol called CHIMERA which requires no speciﬁc device. This protocol is based on a generalization we propose of the reconciliation algorithm. This protocol is proved unconditionally secure.

Cyril Prissette

Real-time Traffic

Cryptology | IMA 2001 | Key Agreement Protocol | Protocol Called Chimera | Speciﬁc Device |

claim paper

Related Content

» A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange

» Refuting the Security Claims of Mathuria and Jain 2005 Key Agreement Protocols

» On the impossibility of building secure Cliquestype authenticated group key agreement prot...

» Tripartite Key Exchange in the CanettiKrawczyk Proof Model

» Dynamic Group Key Agreement in TreeBased Setting

» On The Security of a Group Key Agreement Protocol

» Reusing Static Keys in Key Agreement Protocols

» Offline Password Guessing Attack on an Efficient Key Agreement Protocol for Secure Authent...

» Certificateless Authenticated Group Key Agreement Protocol for Dynamic Groups

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	IMA
Authors	Cyril Prissette

Comments (0)