Related papers: Group key management based on semigroup actions
Group management is a fundamental building block of today's Internet applications. Mailing lists, chat systems, collaborative document edition but also online social networks such as Facebook and Twitter use group management systems. In…
Cryptographic group actions are a leading contender for post-quantum cryptography, and have also been used in the development of quantum cryptographic protocols. In this work, we explore quantum state group actions, which consist of a group…
We describe the structure of $E-$dense acts over $E-$dense semigroups in an analogous way to that for inverse semigroup acts over inverse semigroups. This is based, to a large extent, on the work of Schein on representations of inverse…
We review the main protocols for key distribution based on principles of quantum mechanics, describing the general underlying ideas, discussing implementation requirements and pointing out directions of current experiments. The issue of…
Post-quantum cryptography is essential for securing digital communications against threats posed by quantum computers. Re-searchers have focused on developing algorithms that can withstand attacks from both classical and quantum computers,…
Our goal is to provide different semiring-based formal tools for the specification of security requirements: we quantitatively enhance the open-system approach, according to which a system is partially specified. Therefore, we suppose the…
Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the…
Quantum cryptography has attracted much attention in recent years. In most existing quantum cryptographic protocols, players usually need the full quantum power of generating, manipulating or measuring quantum states. Semiquantum…
Three closely-related polynomial-based group key pre-distribution schemes have recently been proposed, aimed specifically at wireless sensor networks. The schemes enable any subset of a predefined set of sensor nodes to establish a shared…
We propose a semi-quantum conference key agreement (SQCKA) protocol that leverages on GHZ states. We provide a comprehensive security analysis for our protocol that does not rely on a trusted mediator party. We present information-theoretic…
We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about…
Quantum key distribution (QKD) protocols are essential to guarantee information-theoretic security in quantum communication. Although there was some previous work on quantum group key distribution, they still face many challenges under a…
Non-interactive key exchange (NIKE) enables two or multiple parties (just knowing the public system parameters and each other's public key) to derive a (group) session key without the need for interaction. Recently, NIKE in multi-party…
Semi-quantum cryptography involves at least one user who is semi-quantum or "classical" in nature. Such a user can only interact with the quantum channel in a very restricted way. Many semi-quantum key distribution protocols have been…
This paper addresses an interesting security problem in wireless ad hoc networks: the Dynamic Group Key Agreement key establishment. For secure group communication in an Ad hoc network, a group key shared by all group members is required.…
We consider an application to the discrete log problem using completely regular semigroups which may provide a more secure symmetric cryptosystem than the classic system based on groups. In particular we describe a scheme that would appear…
In key agreement protocols, the user will send a request to the server and the server will respond to that message. After two-way authentication, a secure session key will be created between them. They use the session key to create a secure…
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which…
In a recent paper [arXiv:2009.00716], Rahman and Shpilrain proposed a new key-exchange protocol MAKE based on external semidirect product of groups. The purpose of this paper is to show that the key exchange protocol is insecure. We were…
Distributed-phase-reference quantum key distribution stands out for its easy implementation with present day technology. Since many years, a full security proof of these schemes in a realistic setting has been elusive. For the first time,…