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

IEEE International Symposium on Information Theory (ISIT)

From weak to strong information-theoretic key agreement

Ueli M. Maurer, Stefan Wolf

Published Nov 7, 2002• 18 citations
Publisher

Abstract

In the original definitions of information-theoretic secret-key agreement, the required secrecy condition was too weak. We show, by a generic reduction, that it can be strengthened without any effect on the achievable key-generation rate.
DOI
10.1109/isit.2000.866308

Related papers

Agreement of a restricted secret key

Chung Chan

A secret key agreement problem is proposed with the additional restriction that the key is a function of a given secret source. An inner bound to the achievable rates, error and secrecy exponents is derived. The maximum key rate strongly achievable with positive exponents is characterized. The result leads to class of admissible restrictions on the key functions that does not diminish the strongly achievable key rate.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•10 citations

The intrinsic conditional mutual information and perfect secrecy

Ueli M. Maurer, Stefan Wolf

Conditions are derived for the possibility and impossibility of information-theoretic secret-key agreement by public discussion. A new quantity, the intrinsic information, is introduced and its relationship to secret-key agreement is investigated. A new protocol is described that allows secret-key agreement in situations for which previous protocols fail.

IEEE International Symposium on Information Theory (ISIT)•Nov 22, 2002•21 citations

Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free

Ueli M. Maurer, Stefan Wolf

Lecture notes in computer science•Jan 1, 2000•491 citations

Information-theoretical Secret-key agreement and Bound information

Martin Kreißig

One big problem of the communication between two parties is the secrecy. That means how\nmuch information a third party can obtain by intercepting the messages transmitted from\none honest party to the other one. Therefore cryptography offers a wide range of protocols\nto ensure security with assumptions on the eavesdropper. So one was looking for an\ninformation-theoretical description of the scenario to get unconditional secure communication.\nIn this scenario we are considering two honest parties that want to communicate over\nan authenticated channel that the eavesdropper is wiretapping. This scenario introduced the definition of the intrinsic information and the secret-key rate which are a measure of the secrecy in this setting. Later because of strong analogies to quantum mechanics it turned out that this description was lacking a phenomena called bound information which is the disability of a probability distribution to create a secret-key even though it has predicted secrecy.\nNearly ten years of research have shown the existence of bound information for the multipartite case where several parties are communicating but not yet for the bipartite case.\nHence the approach of non-distillability seems a very promising one to find this conjecture.\nMotivated by this the approach we implemented this tool and simulated some distributions that have conjectured bound information. Thereby we improved the tool to reduce its calculationtime and to get closer to the aim.

•Feb 25, 2009•1 citation

Information-theoretically secure key-insulated key-agreement

Takenobu Seito, Junji Shikata

In this paper, we study key-agreement which realizes the protection against key-exposure problems in the information-theoretic security setting. And we newly define a model and security notions for information-theoretically secure key-insulated key-agreement (KI-KA for short). In addition, we show tight lower bounds of sizes of entities' secret-keys required for KI-KA. We also propose constructions of KI-KA which are provably secure and optimal. Furthermore, we provide some applications of KI-KA.

IEEE Information Theory Workshop (ITW)•Oct 1, 2011•3 citations

Towards proving the existence of "bound" information

Renato Renner, Stefan Wolf

We show that information-theoretically secure key agreement and quantum distillation are strongly related. This leads to new evidence for the existence of bound information, i.e. correlated information not useful for the generation of a secret key.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2003•1 citation
One big problem of the communication between two parties is the secrecy. That means how\nmuch information a third party can obtain by intercepting the messages transmitted from\none honest party to the other one. Therefore cryptography offers a wide range of protocols\nto ensure security with assumptions on the eavesdropper. So one was looking for an\ninformation-theoretical description of the scenario to get unconditional secure communication.\nIn this scenario we are considering two honest parties that want to communicate over\nan authenticated channel that the eavesdropper is wiretapping. This scenario introduced the definition of the intrinsic information and the secret-key rate which are a measure of the secrecy in this setting. Later because of strong analogies to quantum mechanics it turned out that this description was lacking a phenomena called bound information which is the disability of a probability distribution to create a secret-key even though it has predicted secrecy.\nNearly ten years of research have shown the existence of bound information for the multipartite case where several parties are communicating but not yet for the bipartite case.\nHence the approach of non-distillability seems a very promising one to find this conjecture.\nMotivated by this the approach we implemented this tool and simulated some distributions that have conjectured bound information. Thereby we improved the tool to reduce its calculationtime and to get closer to the aim.
In this paper, we study key-agreement which realizes the protection against key-exposure problems in the information-theoretic security setting. And we newly define a model and security notions for information-theoretically secure key-insulated key-agreement (KI-KA for short). In addition, we show tight lower bounds of sizes of entities' secret-keys required for KI-KA. We also propose constructions of KI-KA which are provably secure and optimal. Furthermore, we provide some applications of KI-KA.