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

Dianzi xuebao

A Distributed Random Key Distribution System with Distributed Characteristics of Space and Time

Yuefei Zhu

Published Jan 1, 2005• 0 citations
OpenAlex

Abstract

This paper first gives the notion about distributed cryptographic protocol with distributed characteristics of space and time.Then research distributed cryptographic protocol based on the notion.For an instance,we use proactive security in an distributed key distribution system only with distributed characteristic of space and give a distributed protocol against mobile adversary.This paper enlarges research field of distributed cryptographic protocol.At last,this paper proves the security of distributed random key distribution protocol based on the probability space.

Related papers

Quantum Identity Authentication in the Counterfactual Quantum Key Distribution Protocol

Bin Liu, Zhifeng Gao, Di Xiao +3 more

In this paper, a quantum identity authentication protocol is presented based on the counterfactual quantum key distribution system. Utilizing the proposed protocol, two participants can verify each other's identity through the counterfactual quantum communication system. The security of the protocol is proved against individual attacks. Furthermore, according to the characteristics of the counterfactual quantum key distribution system, we propose an authenticated counterfactual quantum key distribution protocol based on a novel strategy of mixing the two types of quantum cryptographic protocols randomly. The authenticated quantum key distribution can also be used to update the extent of the authentication keys.

Entropy•May 23, 2019•19 citations

Secret Key Distribution Protocol in MIMO Systems with 3D-3GPP Channel Model

Boqian Liu, Aiqun Hu

At present, wireless communication technology greatly improves the transmission data rate, but at the same time, it also has higher and higher requirements for the realization of secure communication. From the perspective of information theory, the physical layer key system provides a new way to solve the problem of secure communication in wireless communication system. The uplink and downlink wireless channels with natural reciprocity are used as random sources to generate shared key. Firstly, this paper introduces the steps of a key distribution protocol with multi-level quantization based on the characteristics of wireless channel CSI. Secondly, the security of this kind of key distribution protocol is analyzed by the key generation rate and other evaluation metrics. Furthermore, it is verified by simulation in the typical channel model scenario of 4G communication mode. The simulation results show that the key distribution protocol based on the characteristics of wireless channel can achieve a key generation rate of 5 bits/resource block under the condition of high signal-to-noise ratio (such as 20dB) in the current communication network circumstance, and the generated key sequence has sufficient randomness, so as to achieve effective secure communication.

IEEE International Conference on Computer and Communications (ICCC)•Dec 11, 2020•1 citation

New Notions of Secrecy and User Generated Randomness in Cryptography

Mohsen Alimomeni

Randomness plays a central role in computer science, in particular cryptography. Almost all cryptographic primitives depend crucially on randomness because randomness and unpredictability in secret keys provides the means for security. Usually one assumes that perfect randomness, a sequence of independently and uniformly distributed bits, are accessible to algorithms. This is a strong assumption. Physical sources of randomness are neither uniformly random, nor produce necessarily independent bits. Therefore, the aim of this thesis is to start from a realistic model of randomness, investigate notions of secrecy and their randomness requirements and finally find practical methods for generation of randomness that matches the requirements of cryptographic primitives. We consider a model of random source where the source output follows one distribution from a set of possible distributions, each with the property that the maximum probability of symbols is bounded and can not be arbitrarily close to 1. This model does not assume independence or uniformity of the output symbols, and is considered to be a realistic model of randomness. From this point, the thesis can be divided into two main parts: In the first part, considering various notions of information theoretic secrecy, a fundamental problem is to find the properties of randomness needed to achieve security in these notions. Traditional cryptographic protocols simply assume perfect randomness and build on this assumption. We explore the results that show secrecy can not be based on imperfect randomness that is not uniform or independent. Thus a line of work attempts to relax notions of secrecy in such a way that they can be constructed with non-perfect sources, and possibly require smaller key sizes. Yet they should match real life applications. An important work in this context is entropic security where the key size could be smaller than the message depending on message distribution. Inspired by this, we propose two relaxed notions of secrecy that are motivated by practical applications. In the first notion, motivated by an application in biometrics authentication, we propose guessing secrecy where the probability of guessing the message for a computational unbounded adversary with the best strategy remains the same when a ciphertext is given or when it is not. We compare the randomness requirements of guessing secrecy with stronger notions and show that in some cases such as key length, the requirements are the same. For key distribution however, we found a family of distributions that provide guessing secrecy but not perfect secrecy. In the second notion, we investigate randomness requirements of multiple message encryption. Considering a natural extension of secrecy definition to multiple messages, we show that independent keys are needed to encrypt each message. We then propose a relaxed notion in which the security of last message is more important than past messages, although the leakage of past messages is bounded using entropic security. By this assumption, we achieve smaller key length compared to indistinguishability, and comparable to key length for entropic security. This notion has applications such as location privacy. In the second part of the thesis, since secrecy crucially depends on perfect randomness, we investigate how perfect randomness can be practically generated, specifically from human game-play. Unlike many random number generators that assume independent or uniform random bits in the random source, we base our work on the realistic model of randomness. Our main observation is that human game-play has an element of randomness coming from the errors in their game-play which is the main entertaining factor of the game. We also observed that this game-play can distinguish among a group of people if the right features are collected from the game-play. We incrementally changed our game design until the distinguishability among a small population is maximized, and then run the experiments required to show the viability of this approach over a larger population. This approach can also provide a hard to delegate authentication property where a human could not emulate the behavior of another human even given statistical information about their game-play.

•Jan 1, 2014•1 citation

Distributed cryptography and distributed transmission of space information

Shengli Liu, Haijun Lu, Fei Kang +1 more

This paper presents the formal definition of distributed cryptography based on the notion of distributed characteristics of space and time, and also defines algorithm group and correlation of algorithm that describes the relationship of algorithms of space and algorithm of time. Then, based on the idea of distributed characteristics of space and time, this paper establishes a model of distributed transmission. The model gives a new method to solve security transmission of space information.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 17, 2005•0 citations

A Practical Perfect Secrecy Approach for IoBT Systems

Mohammad Moltafet, Hamid R. Sadjadpour, Zouheir Rezki

We consider an Internet of battlefield things (IoBT) system in which multiple devices want to communicate securely with each other in the presence of an adversary with unbounded storage and unbounded computational power. We provide an information-theoretically secure protocol to exchange highly confidential messages among the devices in the system. The main idea behind the protocol is to provide one-time pad secret keys to exchange messages via using a random string that is securely shared among all the devices and pair-wise random secret keys established between each pair of devices. We show that the protocol provides ever-lasting security against the adversary with unbounded storage and unbounded computational power. More specifically, the protocol guarantees that the adversary gains no information about a message, except for an exponentially small probability in a security parameter. Moreover, we prove that revealing all the pair-wise secret keys does not provide any information to the adversary. In addition, we show that the pair-wise secret keys are established once to securely exchange multiple messages between devices in the system. Besides that, we prove that even if the random string is revealed to the adversary, the provided protocol is computationally secure.

IEEE Military Communications Conference (MILCOM)•Oct 30, 2023•1 citation

Applied Research on Quantum Key Distribution Technology in Distributed Space TT&C Network

Changqing Gong, Yuan-qing Bai, Zhou Hong-yuan +1 more

The quantum key distribution technology is an emerging technology, which uses quantum mechanics properties of micro-particles. The progress of quantum key distribution can generate the quantum key which can be kept strictly confidential. The application of quantum key distribution technology in distributed space TT & C network can improve the existing communication environment and enhance communications security. This article will detail the model of quantum key distribution technology in distributed space TT & C network and simulate the situation with self-designed simulation platform.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2009•0 citations
This paper first gives the notion about distributed cryptographic protocol with distributed characteristics of space and time.Then research distributed cryptographic protocol based on the notion.For an instance,we use proactive security in an distributed key distribution system only with distributed characteristic of space and give a distributed protocol against mobile adversary.This paper enlarges research field of distributed cryptographic protocol.At last,this paper proves the security of distributed random key distribution protocol based on the probability space.
In this paper, a quantum identity authentication protocol is presented based on the counterfactual quantum key distribution system. Utilizing the proposed protocol, two participants can verify each other's identity through the counterfactual quantum communication system. The security of the protocol is proved against individual attacks. Furthermore, according to the characteristics of the counterfactual quantum key distribution system, we propose an authenticated counterfactual quantum key distribution protocol based on a novel strategy of mixing the two types of quantum cryptographic protocols randomly. The authenticated quantum key distribution can also be used to update the extent of the authentication keys.
At present, wireless communication technology greatly improves the transmission data rate, but at the same time, it also has higher and higher requirements for the realization of secure communication. From the perspective of information theory, the physical layer key system provides a new way to solve the problem of secure communication in wireless communication system. The uplink and downlink wireless channels with natural reciprocity are used as random sources to generate shared key. Firstly, this paper introduces the steps of a key distribution protocol with multi-level quantization based on the characteristics of wireless channel CSI. Secondly, the security of this kind of key distribution protocol is analyzed by the key generation rate and other evaluation metrics. Furthermore, it is verified by simulation in the typical channel model scenario of 4G communication mode. The simulation results show that the key distribution protocol based on the characteristics of wireless channel can achieve a key generation rate of 5 bits/resource block under the condition of high signal-to-noise ratio (such as 20dB) in the current communication network circumstance, and the generated key sequence has sufficient randomness, so as to achieve effective secure communication.
Randomness plays a central role in computer science, in particular cryptography. Almost all cryptographic primitives depend crucially on randomness because randomness and unpredictability in secret keys provides the means for security. Usually one assumes that perfect randomness, a sequence of independently and uniformly distributed bits, are accessible to algorithms. This is a strong assumption. Physical sources of randomness are neither uniformly random, nor produce necessarily independent bits. Therefore, the aim of this thesis is to start from a realistic model of randomness, investigate notions of secrecy and their randomness requirements and finally find practical methods for generation of randomness that matches the requirements of cryptographic primitives. We consider a model of random source where the source output follows one distribution from a set of possible distributions, each with the property that the maximum probability of symbols is bounded and can not be arbitrarily close to 1. This model does not assume independence or uniformity of the output symbols, and is considered to be a realistic model of randomness. From this point, the thesis can be divided into two main parts: In the first part, considering various notions of information theoretic secrecy, a fundamental problem is to find the properties of randomness needed to achieve security in these notions. Traditional cryptographic protocols simply assume perfect randomness and build on this assumption. We explore the results that show secrecy can not be based on imperfect randomness that is not uniform or independent. Thus a line of work attempts to relax notions of secrecy in such a way that they can be constructed with non-perfect sources, and possibly require smaller key sizes. Yet they should match real life applications. An important work in this context is entropic security where the key size could be smaller than the message depending on message distribution. Inspired by this, we propose two relaxed notions of secrecy that are motivated by practical applications. In the first notion, motivated by an application in biometrics authentication, we propose guessing secrecy where the probability of guessing the message for a computational unbounded adversary with the best strategy remains the same when a ciphertext is given or when it is not. We compare the randomness requirements of guessing secrecy with stronger notions and show that in some cases such as key length, the requirements are the same. For key distribution however, we found a family of distributions that provide guessing secrecy but not perfect secrecy. In the second notion, we investigate randomness requirements of multiple message encryption. Considering a natural extension of secrecy definition to multiple messages, we show that independent keys are needed to encrypt each message. We then propose a relaxed notion in which the security of last message is more important than past messages, although the leakage of past messages is bounded using entropic security. By this assumption, we achieve smaller key length compared to indistinguishability, and comparable to key length for entropic security. This notion has applications such as location privacy. In the second part of the thesis, since secrecy crucially depends on perfect randomness, we investigate how perfect randomness can be practically generated, specifically from human game-play. Unlike many random number generators that assume independent or uniform random bits in the random source, we base our work on the realistic model of randomness. Our main observation is that human game-play has an element of randomness coming from the errors in their game-play which is the main entertaining factor of the game. We also observed that this game-play can distinguish among a group of people if the right features are collected from the game-play. We incrementally changed our game design until the distinguishability among a small population is maximized, and then run the experiments required to show the viability of this approach over a larger population. This approach can also provide a hard to delegate authentication property where a human could not emulate the behavior of another human even given statistical information about their game-play.
We consider an Internet of battlefield things (IoBT) system in which multiple devices want to communicate securely with each other in the presence of an adversary with unbounded storage and unbounded computational power. We provide an information-theoretically secure protocol to exchange highly confidential messages among the devices in the system. The main idea behind the protocol is to provide one-time pad secret keys to exchange messages via using a random string that is securely shared among all the devices and pair-wise random secret keys established between each pair of devices. We show that the protocol provides ever-lasting security against the adversary with unbounded storage and unbounded computational power. More specifically, the protocol guarantees that the adversary gains no information about a message, except for an exponentially small probability in a security parameter. Moreover, we prove that revealing all the pair-wise secret keys does not provide any information to the adversary. In addition, we show that the pair-wise secret keys are established once to securely exchange multiple messages between devices in the system. Besides that, we prove that even if the random string is revealed to the adversary, the provided protocol is computationally secure.
The quantum key distribution technology is an emerging technology, which uses quantum mechanics properties of micro-particles. The progress of quantum key distribution can generate the quantum key which can be kept strictly confidential. The application of quantum key distribution technology in distributed space TT & C network can improve the existing communication environment and enhance communications security. This article will detail the model of quantum key distribution technology in distributed space TT & C network and simulate the situation with self-designed simulation platform.