Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On a Class of Key Agreement Protocols Which Cannot Be Unconditionally Secure

Frank Niedermeyer, Werner Schindler

Published Jan 1, 2003• 0 citations
Publisher
DOI
10.1007/3-540-36413-7_10

Related papers

Unconditionally Secure Key Agreement Protocol

Cyril Prissette

Lecture notes in computer science•Jan 1, 2001•1 citation

Unconditionally secure key agreement using BCH codes

Hirano Kensuke, Hidenori Kuwakado, Masakatu Morii +1 more

IEICE Technical Report; IEICE Tech. Rep.•Sep 20, 2005•0 citations

A Lightweight Key Agreement Protocol with Authentication Capability

Albert Guan

Computationally lightweight and unconditionally secure key agreement protocols are very useful for secure communication in public networks. Recently, Guan et al. proposed a key agreement protocol whose security is based on the unpredictability of channel noise rather than computationally hard problems. These protocols are efficient, computationally lightweight, and unconditionally secure. However, authentication was not integrated into these protocols. In this article, we propose a new protocol with authentication capability that enables two nodes in the network to establish a secret session key for secure communication. It is more efficient, and it also preserves the lightweight and unconditional secure features of the key agreement protocols proposed by Guan et al. Therefore, it is more suitable for devices with limited computing power, such as sensors in Internet of Things (IoT).

International Journal of Foundations of Computer Science•Mar 16, 2021•0 citations

Bayesian estimates in cryptography

George Stephanides

A new method of estimating the most important cryptographic measures of the key generators and of the unconditionally secure key agreement protocols is presented. The aim of this article is to give a Bayesian estimation of a general class of entropies that includes Shannon entropy and Renyi entropy of order 2, which are cryptographic measures for the key generator module and for the key agreement protocol, respectively. It is also given a numerical simulation where the Bayesian estimate is computed using binary codification of the source.

International Conference on Communications•Jul 14, 2005•5 citations

Security Analysis and Applications of Standard Key Agreement Protocols

Soohyun Oh, Jin Kwak, Seungwoo Lee +1 more

Lecture notes in computer science•Jan 1, 2003•7 citations

A New Security Model for Authenticated Key Agreement

Augustin P. Sarr, Philippe Elbaz–Vincent, Jean-Claude Bajard

Lecture notes in computer science•Jan 1, 2010•82 citations
Computationally lightweight and unconditionally secure key agreement protocols are very useful for secure communication in public networks. Recently, Guan et al. proposed a key agreement protocol whose security is based on the unpredictability of channel noise rather than computationally hard problems. These protocols are efficient, computationally lightweight, and unconditionally secure. However, authentication was not integrated into these protocols. In this article, we propose a new protocol with authentication capability that enables two nodes in the network to establish a secret session key for secure communication. It is more efficient, and it also preserves the lightweight and unconditional secure features of the key agreement protocols proposed by Guan et al. Therefore, it is more suitable for devices with limited computing power, such as sensors in Internet of Things (IoT).
A new method of estimating the most important cryptographic measures of the key generators and of the unconditionally secure key agreement protocols is presented. The aim of this article is to give a Bayesian estimation of a general class of entropies that includes Shannon entropy and Renyi entropy of order 2, which are cryptographic measures for the key generator module and for the key agreement protocol, respectively. It is also given a numerical simulation where the Bayesian estimate is computed using binary codification of the source.