Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer GroupsKey Agreement Protocol • March 21st, 2004
Abstract. We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key is updated, in a tree-based method, it suffices to send the update to a small subset of the group, instead of entire group, as current methods require. Our scheme distributes each updated public key to a relatively small subgroup, called its trust set, greatly improving performance. Moreover, we use a threshold secret sharing method to distribute the function of the trusted authority across trust sets, thereby guaranteeing key authentication, enhancing fault-tolerance, and protecting our protocol from impersonation attacks. Our performance analysis suggests that our scheme significantly reduces the communication overhead and storage requirement.
Key agreement based on homomorphisms of algebraic structures.Key Agreement Protocol • May 9th, 2016
Highly Efficient Privacy-Preserving Key Agreement for Wireless Body Area NetworksKey Agreement Protocol • May 17th, 2018
Abstract—In 2012, the IEEE introduced IEEE Std 802.15.6 as the communication standard for Wireless Body Area Networks (WBANs). All key agreement protocols offered by this standard have been shown to exhibit grave security weaknesses. However, to date, no key agreement protocol has been proposed which fulfills all the requisite security and privacy objectives for deployment in a resource constrained WBAN environment. In this paper, based upon symmetric cryptographic primitives only, a key agreement protocol is presented which, in addition to good performance also offers the desirable privacy attributes of node anonymity and session unlinkability. The protocol is also suitable for post-quantum deployment scenarios as it is independent of any public key based operations.
EÆcient Hybrid Key Agreement Protocol for Wireless Ad Hoc NetworksKey Agreement Protocol • July 26th, 2002
Abstract| Secure and eÆcient communication among a set of mobile nodes is one of the most important aspects in ad-hoc wireless networks. To ensure the security, several cryptography protocols must be implemented. Due to the resource scarcity in wireless networks, the protocols must be communication eÆcient and need as less computational power as possible. To secure the group broadcasting in wireless networks, often a group key is needed so that eÆcient conventional encryption, such as DES and AES, can be used. Several group key management protocols have been proposed. However, not all of them are communica- tion eÆcient when applied to wireless ad-hoc networks. In this paper, we propose a key agreement protocol that is communica- tion eÆcient by using connected dominating set concept to set up subgroups among all wireless nodes. We also show how to manage the group eÆciently in a mobile environment.
Perfect Forward Secure Identity-Based Authenticated Key Agreement Protocol in the Escrow ModeKey Agreement Protocol • February 1st, 2008
Abstract. There are several essential features in key agreement protocols such as key escrow (essential when confidentiality, audit trail and legal interception are required) and perfect forward secrecy (i.e., the security of a session key estab- lished between two or more entities is guaranteed even when the private keys of the entities are compromised). Majority of the existing escrowable identity-based key agreement protocols, however, only provide partial forward secrecy. Therefore, such protocols are unsuitable for real-word applications that require a stronger sense of forward secrecy — perfect forward secrecy. In this paper, we propose an efficient perfect forward secure identity-based key agreement protocol in the escrow mode. We prove the security of our protocol in the random oracle model, assuming the intractability of the Gap Bilinear Diffie-Hellman (GBDH) problem. Security proofs are invaluable tools in assuring protocol implementers about the security properties of protoc
The PQXDH Key Agreement ProtocolKey Agreement Protocol • September 24th, 2023
Post-Quantum Static-Static Key Agreement Using Multiple Protocol InstancesKey Agreement Protocol • September 21st, 2017
Making the Key Agreement Protocol in Mobile Ad Hoc Network More EfficientKey Agreement Protocol • August 14th, 2003
Just Fast Keying: Key Agreement in a Hostile InternetKey Agreement Protocol • May 22nd, 2004
We describe Just Fast Keying (JFK), a new key-exchange protocol, primarily designed for use in the IP security architecture. It is simple, efficient, and secure; we sketch a proof of the latter property. JFK also has a number of novel engineering parameters that permit a variety of tradeoffs, most notably the ability to balance the need for perfect forward secrecy against susceptibility to denial- of-service attacks.
An Efficient MQV Key Agreement SchemeKey Agreement Protocol • May 8th, 2014
Menezes et al. proposed the first key agreement protocol (MQV) that employs a signature to sign Diffie-Hellman public keys without using a one-way hash function. The IEEE Standard Committee adopted the MQV protocol as a standard. In order to establish multiple common secret keys between two parties, Harn and Lin proposed a new protocol based on the MQV protocol. However, this pro- tocol has a limit that only n2-1 keys out of n2 keys for can be used avoiding the known key attack. Afterwards, Tseng proposed a protocol that can use n keys to avoid the known key attack. In this article, we shall extend Tseng’s protocol and make it able to generate (n2 + 1) keys in one session, and all the keys can be used against the known-key attack.
CELLULAR AUTOMATA BASED KEY AGREEMENTKey Agreement Protocol • November 15th, 2010
Debdeep Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur, India
Provable password-based tripartite key agreementKey Agreement Protocol • July 21st, 2007
An Improved Diffie-Hellman Two Party Key Agreement Protocol based on Elliptic Curves.Key Agreement Protocol • September 17th, 2020
Elliptic curves have been intensively studied in number theory and algebraic geometry for over 100 years and there is an enormous amount of literature on the subject. To quote the mathematician Serge Lang: It is possible to write endlessly on elliptic curves. (This is not a threat.)Elliptic curves also figured prominently in the recent proof of Fermat's Last Theorem by Andrew Wiles. Originally pursued for purely aesthetic reasons, elliptic curves have recently been utilized in devising algorithms for factoring integers, primality proving, and in public-key cryptography. In this article, we aim to give the reader an introduction to elliptic curve cryptosystems, and to demonstrate why these systems provide relatively small block sizes, high-speed software and hardware implementations, and offer the highest strength-per-key-bit of any known public-key scheme.
A secure chaotic key agreement without clock synchronizationKey Agreement Protocol • November 12th, 2010
Abstract—Recently, Han-Chang proposed a flexible chaotic key agreement protocol based on nonce. In this paper, we demonstrate that it is vulnerable to spoofing attack and replaying attack. Furthermore, a secure improvement is suggested, which avoids the flaws while keeping all the merits of the original scheme.
Linking Classical and Quantum Key Agreement:Key Agreement Protocol • February 5th, 2008
Two-party Authenticated Multiple-key Agreement Based on Elliptic Curve Discrete Logarithm Problem⋆Key Agreement Protocol • September 21st, 2012
In this paper, we propose a protocol to generate n2 keys in one session under the assumption of the intractability of the elliptic curve discrete logarithm problem and MQV protocol. Our protocol has the advantage of requiring less computing time compared with other protocols. Therefore, it is easy to apply in resource-constrained key agreement such as wireless sensor networks, mobile Ad-hoc networks, and cell phones which are severely constrained processor, battery, and memory.
A Key Agreement Protocol based on Spiking Neural P systems with Anti-SpikesKey Agreement Protocol • June 10th, 2022
Abstract. Spiking Neural P systems, SN P systems for short, have found various applications over time. Perhaps the most important ap- plication to date is in the area of artificial intelligence where SN P sys- tems are significant models of the third generation of neural networks. Another application of SN P systems that has not been researched much is cryptography. SN P systems can be used as computational devices on which various cryptographic algorithms can be implemented. Many of the machine learning algorithms that are applied in cryptography are based on neural networks which can be implemented using SN P sys- tems. In this paper, we propose a new type of SN P system called Anti Spiking Neural Tree Parity Machine. The system is inspired by the way in which a Tree Parity Machine works and is constructed using SN P sys- tems with anti-spikes. Based on the new system we propose a novel key agreement protocol that allows two parties to communicate over a public channel and obtain a s
Winter 2010Key Agreement Protocol • January 31st, 2010
A Secure and Efficient Key Agreement Protocol Based on Certificateless CryptographyKey Agreement Protocol • December 20th, 2012
Almost all the certificateless two-party authenticated key agreement (CTAKA) protocols found in the literature, suffer either serious security problems or inefficient performance that involves high computational costs. In this paper, we design a secure and efficient CTAKA protocol. Within the proposed CTAKA protocol, the KGC publishes the public keys of the users in a public directory (LDAP server) that has a certificate to prove its identity to the users. The LDAP certificate is the only existing certificate within the scheme. Both the two communicating parties are able to compute a common secret per session key using a secure generated random number. The protocol is fully secure against type 1 attack and fully secure against type 2 attacks under the assumptions that the KGC is an honest party and each party within the network has the full capability to keep its secret values safe. Moreover, the setup of the protocol does not include pairings and the whole key agreement process requir
A Simple and Secure Key Agreement Protocol to Integrate a Key Distribution Procedure into the DSS1Key Agreement Protocol • October 25th, 2012
*2Department of Computer Science and Information Engineering, Asia University No. 500, Lioufeng Road, Wufeng Shiang, Taichung, Taiwan( R.O.C).
Highly Efficient Privacy-Preserving Key Agreement for Wireless Body Area NetworksKey Agreement Protocol • June 15th, 2018
Wireless Body Area Networks (WBANs) consist of miniaturized computing devices which can be fitted inside or around the human body. Through use of short range communication technologies, these devices talk to a designated centralized node (Hub) which further communicates with external networks via a Gateway. Mindful of the peculiarities of communicating in and around the human body, the IEEE published IEEE Std 802.15.6 for WBAN communications in 2012. In addition to conventional security guarantees, privacy is of utmost importance for typical target application areas such as healthcare and the military. The security of traffic in IEEE Std 802.15.6 is protected using authenticated encryption, which requires the establishment of symmetric session keys. The procedure for agreeing these keys is thus critical to the overall security and privacy of a WBAN.
Pairing-Based One-Round Tripartite Key Agreement ProtocolsKey Agreement Protocol • October 30th, 2004
Abstract. Since Joux published the first pairing-based one-round tripartite key agreement pro- tocol [13], many authenticated protocols have been proposed. However most of them were soon broken or demonstrated not to achieve some desirable security attributes. In this paper we present a protocol variant based on Shim’s work [20]. As the formalized model of this type of AK protocols is not mature, the security properties of the protocol are heuristically investigated by attempting a list of attacks. The attack list presented in the paper has both the importance in theory and the meaning in practice and can be used to evaluate other tripartite and group key agreement protocols.
A Key Agreement Protocol Using Non-Abelian GroupKey Agreement Protocol • February 5th, 2011
-ABSTRACT This paper presents a key agreement protocol based on a non abelian group. It is proved that the proposed protocol meets several security attributes under the assumption that the Root Problem (RP) in braid group is a hard problem.
A Pairing-free ID-based Key Agreement Protocol with Different PKGsKey Agreement Protocol • May 19th, 2015
This paper proposes an identity based key agreement pro- tocol based on elliptic curve cryptography (ECC) between users of different networks with independent private key generations (PKGs). Instead of bilinear pairings which commonly used for contracting identity based schemes, the proposed protocol makes use of elliptic curves to ob- tain more computational efficiency. The proposed proto- col develops Cao et al’s protocol for situations that two users of independent organizations or networks with sep- arate servers (that in this article, are named PKGs, based on their main duty, generating private keys for the users) want to share a secret key via an insecure link. The main novelty of this paper is security proof of the proposed protocol in the random oracle model. The security proof argues the security attributes of the proposed protocol.
KEY AGREEMENT PROTOCOL FOR DISTRIBUTED SECURE MULTICAST FOR eASSESSMENTKey Agreement Protocol • February 13th, 2018
Abstract: eAssessment is typical for online and distance learning, but nowadays it is also applicable in institutions with blended-learning delivery mode, because of advantages that proposes to teachers and learners: performance of online examination in time suitable for learners and from any geolocation, immediate feedback and exam results. In several learning scenarios, the eAssessment could occur in groups where the multicast communication from type one-to-many or man-to-many could be performed. In this case, the arising problem concerns security in collaborative and synchronous environment. It is important to protect all participants from false messaging and illegal behavior. One solution of this problem is implementation of multicast security which main benefits are related to: high scalable, fast re-key operation, decreased network load. The aim of the paper is to present a key exchange protocol for distributed multicast security. The advantage of the protocol is that it offers m
ContractKey Agreement Protocol • April 10th, 2024
This document describes the “CLCKD” (or “Consensus-Protocol Ledger-Based CRYSTALS-Kyber/Dilithium”) key agreement protocol. CLCKD allows forward secrecy and secure signatures using CRYSTALS-Dilithium signatures1 and CRYSTALS-Kyber post-quantum key encapsulation.2 CLCKD provides a distributed ledger of authenticated ephemeral public keys allowing two parties to mutually authenticate each other based on constantly updating one-time public keys maintained on an XMSS distributed ledger.3 CLCKD provides post-quantum forward secrecy, while adding a post-quantum secure signature scheme for authentication and non-repudiation where both parties are using CLCKD, or interoperability and post-quantum forward secrecy without authentication and non-repudiation when only the recipient is using CLCKD.
Improved Exponentiation and Key Agreement in the Infrastructure of a Real Quadratic FieldKey Agreement Protocol • August 17th, 2012
Department of Computer Science, University of Calgary 2500 University Drive NW, Calgary, Alberta, Canada T2N 1N4 vanessa.dixon@gmail.com, {jacobs,rscheidl}@ucalgary.ca
An efficient and secure two-party key agreement protocol based on chaotic mapsAKey Agreement Protocol • August 6th, 2018
tion between the user and the server is established, the key ski = Tr(Ts(x)) = Ts(Tr(x)) is used as the shared secret key between these two participants.
ID-based tripartite key agreement with signaturesKey Agreement Protocol • August 11th, 2022
Abstract : This paper proposes a new identity based tripartite key agreement protocol which is more efficient than the existing ID-based tripartite protocol. This protocol is based on the Joux's protocol for key agreement, and introduces signature along with key agreement to overcome man-in-the-middle attacks and to provide authentication. The new protocol resists existential forgeries against adaptively chosen message attacks under the random oracle model.
KEY AGREEMENT, THE ALGEBRAIC ERASERT M , AND LIGHTWEIGHT CRYPTOGRAPHYKey Agreement Protocol • December 6th, 2005
Key Agreement Protocol Based On EC-MQV Algorithm for Cooperative Wireless CommunicationKey Agreement Protocol • April 23rd, 2015
Abstract: In wireless communication user cooperation is important because in wireless communication number of nodes is available in the network. It is seen that in normal wireless communication the performance is not good as compare to the cooperative communication, where cooperation among multiple nodes presents in the network and hence it is the topic of interest for most of the researchers. Although some of the wireless communication system is not uses cooperative, nature of communication and may cause a performance reduction since the node not trusted or it may prone to some of the attacks. To solve these issues in the wireless communication where number of nodes presents in the network, a simulation model is proposed based on Elliptic Curve Manezes Qu Vanstone algorithm (EC-MQV). In the proposed work the comparison between simple wireless communication and cooperative wireless communication is presented. The work used EC-MQV algorithm further to support the security of existing ke
https:// --> Information Encryption --> Secure Channel --> Information ConfidentialityKey Agreement Protocol • September 22nd, 2020
Kerchoff principle: a cryptosystem must be secure if its algorithm is publicly known and its security must rely only on the secrecy of its secret keys.
A Security-Provable Mutually Authenticated Key Agreement Protocol in Mobile CommunicationKey Agreement Protocol • August 1st, 2003
Deng HS, Zuo YQ, Zhao YM, Bao ZD. A security-provable mutually authenticated key agreement protocol in mobile communication. Journal of Software, 2003,14(8):1489~1494.
A Secure and E cient Three-Pass Authenticated Key Agreement Protocol Based on EllipticKey Agreement Protocol • February 21st, 2008
Abstract. Key agreement protocol is of fundamental importance in pro- viding data con dentiality and integrity between two or more parties over an insecure network. In 2004, Popescu [14] proposed an authenticated key agreement protocol in which its security is claimed. However, Yoon and Yoo [19] discovered its vulnerabilities two years later and proposed an improved variant of it. In this paper, we highlight the vulnerability of this improved variant under the LaMacchia et al.'s extended Canetti- Krawczyk security model [12]. With this, we propose another enhanced version of Popescu's protocol which o ers stronger security features and appears to be signi cantly more e cient than Yoon-Yoo's scheme. In or- der to justify our claims, we present a thorough heuristic security anal- ysis on our scheme and compare the computational cost and security attributes with the surveyed schemes.
A n2 + n MQV Key Agreement ProtocolKey Agreement Protocol • October 31st, 2012
