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

Advances and Applications in Discrete Mathematics

INFORMATION THEORETICALLY SECURE KEY EXCHANGE ALGORITHM

Khaldoun Besoul, Qassim Al Mahmoud, Ayman Nayef Al Halaybeh

Published Apr 11, 2023• 0 citations
Publisher
DOI
10.17654/0974165823023

Related papers

SECURE INFORMATION EXCHANGE THROUGH QUANTUM KEY PROVISION METHOD

D.T. Muhamediyeva, Farxad Abduvaxabovich Tagaev

In this article, a model of secure key exchange based on the BB84 protocol of quantum cryptography was developed and simulated. In the study, photons transmitted through a quantum channel between Alice and Bob were encoded in quantum states, and security was ensured by random selection of bases when reading them. An error indicator was calculated to detect Eavesdropping (Eve) interference. After generating the key, a simple ECC encryption algorithm based on XOR was used to transmit data in a protected manner. The results showed that it is possible to effectively maintain information confidentiality using a key formed through the BB84 protocol.

•Apr 17, 2026•0 citations

Information leakage in encrypted key exchange

Sarvar Patel

DIMACS series in discrete mathematics and theoretical computer science•Nov 25, 1997•8 citations

QUANTUM-RESISTANT ELLIPTIC CURVE-BASED SECURE KEY EXCHANGE

D.T. Muhamediyeva, Tagaev Farkhad Abduvahabovich

In this paper, a secure public key exchange algorithm is proposed, combining classical elliptic curve cryptography (ECC) and quantum algorithms. The algorithm is implemented using Python and the Qiskit library. Public keys are generated by point multiplication on ECC, and quantum superposition and isogeny mapping simulations are performed using Qiskit. The proposed approach can be stable against quantum attacks and can serve as the basis for future quantum-resistant cryptosystems.

•Dec 3, 2025•0 citations

Information Theoretically Secure Secret Key Agreement

Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu

IEICE Technical Report; IEICE Tech. Rep.•Feb 23, 2012•0 citations

AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS

Christophe Tartary, Huaxiong Wang, Yun Zhang

The design of rational cryptographic protocols is a recently created research area at the intersection of cryptography and game theory. In this paper, we propose a new m-out-of-n rational secret sharing scheme requiring neither the involvement of the dealer (except during the initial share distribution) nor a trusted mediator. Our protocol leads to a Nash equilibrium surviving the iterated deletion of weakly dominated strategies for m ≥ 4. Our construction is information theoretically secure and it is immune against backward induction attacks. Contrary to Kol and Naor who used a specific cryptographic primitive in their TCC'08 paper (namely, meaningful/meaningless encryption), the immunity of our scheme is based on the use of bivariate polynomials and one-time pads. To the best of our knowledge, it is the first time that such polynomials have been used for rational secret sharing. Our scheme is efficient and does not require any physical assumptions such as envelopes or ballot boxes. As most of existing rational protocols, our construction requires simultaneous broadcast channels. However, our proposed scheme does not require any computational assumption and it provides information theoretical security.

International Journal of Foundations of Computer Science•Sep 1, 2011•6 citations

Designing secure key exchange protocols

Colin Boyd, Wenbo Mao

Lecture notes in computer science•Jan 1, 1994•18 citations
In this article, a model of secure key exchange based on the BB84 protocol of quantum cryptography was developed and simulated. In the study, photons transmitted through a quantum channel between Alice and Bob were encoded in quantum states, and security was ensured by random selection of bases when reading them. An error indicator was calculated to detect Eavesdropping (Eve) interference. After generating the key, a simple ECC encryption algorithm based on XOR was used to transmit data in a protected manner. The results showed that it is possible to effectively maintain information confidentiality using a key formed through the BB84 protocol.
The design of rational cryptographic protocols is a recently created research area at the intersection of cryptography and game theory. In this paper, we propose a new m-out-of-n rational secret sharing scheme requiring neither the involvement of the dealer (except during the initial share distribution) nor a trusted mediator. Our protocol leads to a Nash equilibrium surviving the iterated deletion of weakly dominated strategies for m ≥ 4. Our construction is information theoretically secure and it is immune against backward induction attacks. Contrary to Kol and Naor who used a specific cryptographic primitive in their TCC'08 paper (namely, meaningful/meaningless encryption), the immunity of our scheme is based on the use of bivariate polynomials and one-time pads. To the best of our knowledge, it is the first time that such polynomials have been used for rational secret sharing. Our scheme is efficient and does not require any physical assumptions such as envelopes or ballot boxes. As most of existing rational protocols, our construction requires simultaneous broadcast channels. However, our proposed scheme does not require any computational assumption and it provides information theoretical security.