Multi-party Key Agreement Research Articles

Loss-tolerant quantum multi-party key agreement without quantum storage.

Quantum key distribution (QKD) and quantum key agreement (QKA) are two main branches of key establishment in quantum cryptography. However, the research of QKA falls far behind that of QKD, especially in practicability. The main reason is that QKA needs to resist not only the outside eavesdropping but also the participant cheating. Resisting dishonest participant is more difficult than resisting outside eavesdropping, especially when the apparatuses are imperfect. Actually, existing QKA protocols cannot tolerate the channel loss and have to rely on stable quantum storage. To solve this problem, we give a new quantum multi-party key agreement protocol based on the error-correcting code. Our protocol is loss tolerant, and the participants can measure the received qubits immediately in one of two conjugate bases, without storage, so our protocol can eliminate the requirement of quantum storage. Besides, our protocol is more fair because it can partially discriminate dishonest participants' cheating from outside eavesdropping (previously, these two attacks are generally checked simultaneously via decoy states but cannot be discriminated), as a result, dishonest participants generally will not cheat at the cost of losing good reputation.

Multi-Party Semi-Quantum Key Agreement Protocol Based on the Four-Qubit Cluster States

Multi-Party Semi-Quantum Key Agreement Protocol Based on the Four-Qubit Cluster States

A secure blockchain system for Internet of Vehicles based on 6G-enabled Network in Box

Network in Box (NIB) is a self-organizing and portable device. The six-generation wireless communication technologies (6G) can empower NIB with better spectrum efficiency by integrating satellite broadcasting. 6G-enabled NIB is promising to promote the communication efficiency of Internet of Vehicles (IoV). IoV has emerged as the concrete practice of intelligent transportation. However, IoV is vulnerable to attacks from quantum computers because they use traditional RSA and elliptic cure cryptographic systems. Therefore, it is critical to improving the security of IoV against quantum computer attacks. This paper proposes the first secure scheme based on post-quantum techniques for 6G-enabled NIB to protect IoV against quantum attacks. On the one hand, a blockchain-based public key infrastructure is proposed to authenticate the IoV devices securely. On the other hand, we design a blockchain-based multi-party key agreement and communication system to support multi-party communication among IoV devices. The extensive theoretical analysis and experimental results indicate that the proposed blockchain system based on 6G-enabled NIB can achieve high security and efficiency for IoV.

Secure multiparty quantum key agreement against collusive attacks

Quantum key agreement enables remote participants to fairly establish a secure shared key based on their private inputs. In the circular-type multiparty quantum key agreement mode, two or more malicious participants can collude together to steal private inputs of honest participants or to generate the final key alone. In this work, we focus on a powerful collusive attack strategy in which two or more malicious participants in particular positions, can learn sensitive information or generate the final key alone without revealing their malicious behaviour. Many of the current circular-type multiparty quantum key agreement protocols are not secure against this collusive attack strategy. As an example, we analyze the security of a recently proposed multiparty key agreement protocol to show the vulnerability of existing circular-type multiparty quantum key agreement protocols against this collusive attack. Moreover, we design a general secure multiparty key agreement model that would remove this vulnerability from such circular-type key agreement protocols and describe the necessary steps to implement this model. The proposed model is general and does not depend on the specific physical implementation of the quantum key agreement.

Quantum Secure Multiparty Summation Based on the Phase Shifting Operation of d-Level Quantum System and its Application

A quantum secure multiparty summation protocol is constructed based on the phase shifting operation of d-level quantum system which utilizes the integer-by-integer technique to calculate the modulo d addition. The semi-honest third party prepares d-level two-particle entangled states and transmits the particle sequence composed by all second particles to n secrecy owners. n secrecy owners in turn encode their respective secrecy on this particle sequence through the phase shifting operation. Detailed security analysis turns out that both the outside attack and the participant attack are ineffective towards this protocol. Compared with the quantum secure summation protocols with bit-by-bit calculations, its calculation efficiency is higher; and compared with the protocols with smaller modulo, its applications are more extensive. Especailly, this protocol has extensive applications in the realm of quantum secure multiparty computation, such as quantum multiparty private comparison, quantum multiparty anonymous ranking, quantum multiparty anonymous voting, quantum multiparty key agreement, etc.

Multi-party pairwise key agreement in linear number of Diffie–Hellman key exchanges

We consider a classical problem of multi-party pairwise key agreement (MP-KA): n parties wish to establish a secure communication channels to each other. Currently, this problem is easily solved with involvement of a trusted Key Distribution Center (KDC) or Key Translation Center (KTC), public key encryption or key pre-distribution protocols. But these solutions are not applicable when some parties are corrupted and all of them have only a link to the Certificate Verification Center (CVC). We develop MP-KA protocol without Trusted Setup and involvement of KDC or KTC, which reduces the number $$(n(n-1))/2$$ of Diffie–Hellman key exchanges (DH-KE). Precisely, for an adversary, who corrupts no more then t-out-of-n parties, $$t \le [n/2]-1$$ , we reduce this number to $$(n-t-1)\cdot (t+1)$$ , and thus to O(n) for the constant value of t. Our protocol consists of two phases: (1) $$k = (n-t-1)\cdot (t+1)$$ DH-KE runs to establish secure channels between a subset of all parties and (2) a protocol based on secret sharing, intended to agree on pairwise keys between other parties. We prove that the second phase of protocol is perfectly secure against semi-honest threshold adversary. As a result, we improve the efficiency of multi-party pairwise key agreement in comparison with direct Diffie–Hellman-based approach.

Multiparty Quantum Key Agreement With Strong Fairness Property

Multiparty Key Agreement (MKA) is the backbone for secure multiparty communication. Although numerous efficient MKA-cryptosystems are available in the classical field, their security relies on the assumption that some comput... | Find, read and cite all the research you need on Tech Science Press

Improving the security of quantum key agreement protocols with single photon in both polarization and spatial-mode degrees of freedom

Quantum key agreement enables remote users to fairly establish a secure shared key based on their private inputs. In the circular-type multiparty quantum key agreement protocol, two or more malicious participants can collude together to steal the private inputs of honest participants or to generate the final key alone. In this paper, we focus on a powerful collusive attack strategy in which two malicious participants in particular positions, can learn sensitive information or generate the final key alone without revealing their malicious behavior. Most of the proposed circular-type multiparty quantum key agreement protocols are not secure against this particular collusive attack strategy. As an example, we analyze the security of a recently proposed multiparty key agreement protocol to show the vulnerability of existing circular-type multiparty quantum key agreement protocols against this collusive attack. We then design a general secure multiparty key agreement model that would remove this vulnerability from such circular-type key agreement protocols and describe the necessary steps to implement this model. Our model is general and does not depend on the specific physical implementation of quantum key agreement.

Interdomain Identity-Based Key Agreement Schemes

In order to simplify key management, two-party and three-party key agreement schemes based on user identities have been proposed recently. Multiparty (including more than three parties) key agreement protocols, which also are called conference key schemes, can be applied to distributed systems and wireless environments, such as ad hoc networks, for the purpose of multiparty secure communication. However, it is hard to extend two- or three-party schemes to multiparty ones with the guarantee of efficiency and security. In addition to the above two properties, interdomain environments should also be considered in key agreement systems due to diversified network domains. However, only few identity-based multiparty conference key agreement schemes for single domain environments and none for interdomain environments were proposed in the literature and they did not satisfy all of the security attributes such as forward secrecy and withstanding impersonation. In this paper, we will propose a novel efficient single domain identity-based multiparty conference key scheme and extend it to an interdomain one. Finally, we prove that the proposed schemes satisfy the required security attributes via formal methods.

Identity-based cluster key agreement scheme in Ad Hoc network

In view of the characteristics of limited energy and dynamic change in Ad Hoc network,an identity-based group key agreement scheme was presented.The topology was in a structure composed by clusters,and allowed the synchronous execution of multi-party key agreement protocols based on pairings.The number of cluster members did not affect the key agreement,and it did not require interactivity during the key agreement.It provided the authentication and dynamics.In addition,the scheme was proved semantics secure under the Decisional Bilinear Diffie-Hellman(DBDH) problem.At last,compared with the previous schemes,the proposed scheme has advantages in terms of negotiation rounds and authentication.

A Novel Password based Multi Party Key Agreement Protocol on Elliptic Curve

Key agreement protocol a number of parties involved and communicate over a open public network to generate a common secret key called session key. This paper proposes an efficient password based multiparty Key Agreement Protocol. Security of the protocol is based difficulty of breaking Elliptic Curve Discrete Logarithm Problem and one way hash function. This is resistant against different attack. The security analysis have been discuss and proved in this aticle.

New scheme of ID-based authenticated multi-party key agreement

Authenticated key agreement protocol allows a group of users in an open network environment to identify each other and share a security session key.This article proposed a new scheme of ID-based authenticated multi-party key agreement based on McCullagh-Barreto scheme.Key seed was introduced to update temporary public/private key pairs.The new scheme is able to realize the authentication,improve the security,resist Reveal query attack and the key compromise impersonation attack successfully,and it has many properties such as non-key control and equal contribution.

Insider Attack on A Password-Based Group Key Agreement

In 2009, Zheng et al. proposed an efficient password-based group key agreement protocol resistant to the dictionary attacks by adding password-authentication services to a non-authenticated multi-party key agreement protocol proposed by Horng. They claimed that the proposed protocol is very efficient since it only requires constant rounds to agree upon a session key, and each user broadcasts a constant number of messages and only requires four exponentiations. Under the Decisional Diffie-Hellman assumption, they shown the proposed protocol is provably secure in both the ideal-cipher model and the random-oracle model. But in this paper, we show that the protocol Zheng et al. proposed is vulnerable to an active insider attack.

A cryptographic primitive based on hidden-order groups

Let G1 be a cyclic multiplicative group of order n. It is known that the computational Diffie–Hellman (CDH) problem is random self-reducible in G1 if φ(n) is known. That is, given g, gx ∈ G1 for some generator g and oracle access to a “Diffie-Hellman Problem solver” for g, it is possible to compute g1/x ∈ G1 in polynomial time (with which we can then solve the CDH problem w.r.t. any other generator). On the other hand, it is not clear if such a reduction exists when φ(n) is unknown. We exploit this “gap” to construct a novel cryptographic primitive, which we call an Oracle-based Group with Infeasible Inversion (O-GII). O-GIIs have applications in multiparty protocols. We demonstrate this by presenting a novel multi-party key agreement protocol that does not require interaction between the parties. Instead, the protocol requires each party to query a remote stateless device. Our method relies on the observation that it is considerably more expensive to interact with every party connected via an unreliable network, than it is to query one of several identical stateless devices, some of which may be located in a more reliable sub-network.

Efficient and provably secure password-based group key agreement protocol

This paper considers the issue on authenticated group key agreement protocol among n users broadcasting communication over an insecure public network. Many authenticated group Diffie-Hellman key agreement protocols have been proposed to meet the challenges. However, existing protocols are either limited by the use of public key infrastructure or by their scalability, requiring O(n) rounds. To overcome these disadvantages, we propose an efficient password-based group key agreement protocol resistant to the dictionary attacks by adding password-authentication services to a non-authenticated multi-party key agreement protocol proposed by Horng. The proposed protocol is very efficient since it only requires constant rounds to agree upon a session key, and each user broadcasts a constant number of messages and only requires four exponentiations. Under the Decisional Diffie-Hellman assumption, we will show the proposed protocol is provably secure in both the ideal-cipher model and the random-oracle model.

A strong multi-designated verifiers signature scheme

Based on Chameleon Hash and D. Boneh’s one round multi-party key agreement protocol, this paper proposes a multi-designated verifiers signature scheme. In this scheme only the verifiers designated by the signer can independently verify the signature. And no one else other than the designated person can be convinced by this signature even if one of the designated verifiers reveals the secret value. The analysis of the proposed scheme shows that it satisfies non-transferability, unforgeability and privacy of the signer’s identity and has to low computational cost.

Password-Based Encrypted Group Key Agreement

This paper presents an efficient password-based authenticated encrypted group key agreement protocol immune to dictionary attack under the computation Diffie-Hellman (CDH) assumption. In a password-based key agreement protocol, the users only share a human-memorable low entropy password; and using this low-entropy password, the users can agree upon a high-entropy session key which they may use to build a secure communication channel among themselves. While designing such protocols, one should limit the number of on-line password guessing and achieve the security against dictionary attack. Our protocol is obtained from the multi-party key agreement protocol of Kim et al. We analyze the security in the security model formalized by Bellare et al. following their proof techniques. Our proposed scheme achieves efficiency in both communication and computation aspects and is proven to be secure in both the ideal cipher model and the random oracle model.

A distributed multi-party key agreement protocol for dynamic collaborative groups using ECC

We present a multi-party key agreement protocol based on a novel authenticated two-party elliptic curve Diffie–Hellman (ECDH) key-exchange protocol for dynamic collaborative peer groups. The security of our two-party and multi-party key agreement protocols is based on the computational intractability of the elliptic curve discrete logarithm problem (ECDLP). The strength-per-key-bit is substantially greater in keys generated using ECDH than in keys generated using Diffie–Hellman (DH) key exchange. Thus, with much smaller parameters like the key size, ECDH keys provide equivalent security compared to DH keys. We show that the proposed protocols establish an authenticated, distributed, and contributory group secret key among a group of members. Our multi-party key agreement protocol supports group dynamics like member-join, member-leave, group-fusion, and group-fission securely. Further, it introduces array-based binary key-trees (ABKTs), which are balanced trees that bound the key-computation cost of handling member dynamics to O ( log n ) , where n is the number of members in the group.

A Key Agreement Scheme for Mobile Ad Hoc Networks Based on Password Authentication

As a new type of wireless mobile networks, Ad Hoc networks do not depend on any fixed infrastructure, and have no centralized control unit and so its computation capabilities are limited by mobile nodes. In this paper, a novel multi-party key agreement scheme with password authentication and sharing password evolvement for Ad Hoc networks is proposed based on ECC (elliptic curves cryptography). One of the functions of passwords is used as sharing information to authenticate the mobile node's secret keys, and the other is used as a symmetrical key to encrypt alternating information between mobile nodes. The freshness and security of passwords are guaranteed by sharing password evolvement every time in mobile node's secret keys authentication and key agreement. Consequently, the computational overheads and the store load of mobile nodes are lessened, moreover, secret keys authentication and information encryption between mobile nodes are provided. The new scheme enjoys many secure properties such as against man-in-the-middle attack, against replay attack, key independence, forward security, etc.

Attack on some multi-party key agreement protocols

Lee et al. recently presented a collection of n + 1 different n-party key agreement protocols based on multi-linear forms. Here we show that n − 2 of the protocols are completely insecure, being vulnerable to impersonation attacks.