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

Information Sciences

Unconditional secure conference key distribution schemes with disenrollment capability

Carlo Blundo, Antonella Cresti

Published Nov 1, 1999• 3 citations
Publisher
DOI
10.1016/s0020-0255(99)00074-2

Related papers

Unconditionally secure key distribution schemes for preventing information leakage of key distribution centers

隆弘 吉田, Takahiro Yoshida

•Mar 16, 2019•0 citations

A consideration on unconditionally secure key distribution schemes considering leakage of secret information of key distribution centers

Takahiro Yoshida, Hajime Jinushi, Toshiyasu Matsushima

IEICE technical report. Information theory•Feb 24, 2011•0 citations

Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security

Hoi‐Kwong Lo, H. F. Chau, M. Ardehali

arXiv:quant-ph/0011056•Journal of Cryptology•Mar 3, 2004•591 citations

Unconditionally secure conference key distribution: Security definitions and their relations

Reihaneh Safavi–Naini, Shaoquan Jiang

A non-interactive conference key distribution scheme (NICKDS) is a system that allows selected sets of users to securely share a common key without interacting with each other. In this paper, we consider unconditionally secure setting where the is no limit on adversary's computation power. Unconditionally secure NICKDS has been considered with security against an adversary who can corrupt up to w users. We strengthen the security model of the system by allowing the adversary to also obtain conference keys of conferences whose members are honest, and use a game bases approach to define security. We give two other ways of defining security, using probability distance and mutual information and show the relationship between the three definitions of security.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2008•0 citations

Efficient and secure conference-key distribution

Mike V. D. Burmester, Yvo Desmedt

Lecture notes in computer science•Jan 1, 1997•102 citations

Unconditionally secure conference key distribution

Xing Qin

We focus on unconditionally secure conference key distribution. Many onetime keys shared by users are needed for perfect secure communication. Our approach is to use a twoparty key agreement system as an underlying cryptographic primitive and extend it to a conference system which is as secure as the twopart system. With the spanning tree in this paper, the conference key distribution system can be executed in parallel to the largest extent and it is efficient for dynmaic changing group.

Journal of Xidian University•Jan 1, 2003•0 citations
A non-interactive conference key distribution scheme (NICKDS) is a system that allows selected sets of users to securely share a common key without interacting with each other. In this paper, we consider unconditionally secure setting where the is no limit on adversary's computation power. Unconditionally secure NICKDS has been considered with security against an adversary who can corrupt up to w users. We strengthen the security model of the system by allowing the adversary to also obtain conference keys of conferences whose members are honest, and use a game bases approach to define security. We give two other ways of defining security, using probability distance and mutual information and show the relationship between the three definitions of security.
We focus on unconditionally secure conference key distribution. Many onetime keys shared by users are needed for perfect secure communication. Our approach is to use a twoparty key agreement system as an underlying cryptographic primitive and extend it to a conference system which is as secure as the twopart system. With the spanning tree in this paper, the conference key distribution system can be executed in parallel to the largest extent and it is efficient for dynmaic changing group.