The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Multiple key agreement (MKA) protocols allow two parties to generate two or more session keys in a run, which will be used for future secure communications in public network. In recent years, many MKA protocols have been proposed. However, most of them do not consider ephemeral key compromise resilience and also suffer from other security flaws. In this paper, we analyze Dehkordi and Alimoradi's MKA...
In 2009, Lee et al. proposed two password authenticated key exchange protocols based on Juang and Wu's protocols. In this paper, we will show that Lee et al.'s protocols cannot resist impersonation attack. It means that the adversary can impersonate the server to cheat the client and break their two protocols trivially. Furthermore, we propose an improvement of their protocols with impersonation attack...
In order to solve the increasingly serious problem of eutrophication in China, the government had issued a new wastewater discharge standard that focuses on reducing the nutrients from effluents (TN < 15 mg/L, TP<0.5 mg/L). These stringent new requirements had resulted in the need for improved nutriment removal from existing full-scale wastewater treatment plants. In this study a series...
Group key exchange protocols allow two or more users to generate a common group session key over an insecure channel, which can be used in the future communication. With the development of mobile communications, resourcelimited mobile users should be considered in the design of group key exchange protocols. In this paper, we propose a deniable group key exchange protocol for an imbalanced wireless...
In this paper, we present a new authenticated key exchange (AKE) protocol, called NS+, which allows the adversary to reveal all the ephemeral secret information, especially including the Diffie-Hellman exponets, used for building one party's outputting message. We also prove the security of this protocol in the eCK model, under the random oracle assumption and the gap Diffie-Hellman (GDH) assumption...
In 2009, Holbl et al. proposed two new identity-based authenticated key exchange protocols and claimed that their protocols can withstand various attacks. In this paper, we will show that Holbl et al.'s protocols cannot resist basic impersonation attack. It also means that their protocols are vulnerable to key compromise impersonation (KCI) attacks. Furthermore, we propose improvements of their protocols...
Recently, Wang et al. present a variant of McCullagh-Barreto key agreement protocol with key compromise impersonation resilience. Furthermore, they proof that their protocol can achieve perfect forward secrecy. In this paper, we will show that their new protocol can' t resist ephemeral key compromise attack, and only achieves weak perfect forward secrecy.
The conjugacy search problem in a group G is the problem of recovering an x ?? G from given g ?? G and h = x-1 gx. The alleged computational hardness of this problem in some groups was used in several recently suggested public key exchange protocols and the digital signature scheme, including the one due to Anshel, Anshel, and Goldfeld, and the one due to Ko, Lee et al. In this paper, using Miller...
The design of secure authenticated key exchange (AKE) protocols has always been a notorious hard problem. Many famous AKE protocols have been found flaws since they were finished. In this paper, we analyze two AKE protocols, which were proposed by Hassan et al. in 2007 and 2008. Then we present key compromise impersonation attack and ephemeral key compromise attack to their two AKE protocols.
In 2007, LaMacchia et al.proposed the extended Canetti-Krawczyk (eCK) model for authenticated key exchange (AKE) protocols. In this paper, we first modify the eCK model by adding a new query to make the adversary can reveal all ephemeral secret information. Then we propose a new efficient and strongly secure AKE protocol in the asymmetric setting, called E-NETS (enhanced NETS) protocol, and prove...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.