In this paper, we consider some aspects of binding properties that bind an anonymous user with messages. According to whether all the messages or some part of the messages are bound with an anonymous user, the protocol is said to satisfy the full binding property or the partial binding property, respectively. We propose methods to combine binding properties and anonymity-based authenticated key agreement protocols. Our protocol with the full binding property guarantees that while no participant's identity is revealed, a participant completes a key agreement protocol confirming that all the received messages came from the other participant. Our main idea is to use an anonymous signature scheme with a signer-controlled yet partially enforced linkability. Our protocols can be modified to provide additional properties, such as revocable anonymity. We formally prove that the constructed protocols are secure.
In this paper, we consider some aspects of binding properties that bind an anonymous user with messages. According to whether all the messages or some part of the messages are bound with an anonymous user, the protocol is said to satisfy the full binding property or the partial binding property, respectively. We propose methods to combine binding properties and anonymity-based authenticated key agreement protocols. Our protocol with the full binding property guarantees that while no participant's identity is revealed, a participant completes a key agreement protocol confirming that all the received messages came from the other participant. Our main idea is to use an anonymous signature scheme with a signer-controlled yet partially enforced linkability. Our protocols can be modified to provide additional properties, such as revocable anonymity. We formally prove that the constructed protocols are secure.
In this work we propose a two-party anonymous authenticated key exchange protocol that provides a communication binding property. The proposed protocol makes use of a compact structure to ensure key exchange and anonymity by adopting an anonymous implicit proof on the possession of a credential. We formally prove that the proposed protocol achieves anonymity, AKE-security, and a communication binding property. The protocol yields short communication messages and runs in two rounds. We show that our protocol is efficient via a comparison analysis with best-known anonymous authenticated key exchange protocols.
Authenticated key agreement protocol is designed to provide pair of parties communicating over an insecure network with a secure session key.However,most of the existing authenticated key agreement protocols are not designed for protecting privacy.We emphasize user's privacy properties in network services,in particular we stress anonymity and deniability.We specify the desired security properties of privacy-enhancing authentication key agreement protocols,i.e.mutual authentication,key control,key confirmation,session-key confidentiality,known-key security,forward secrecy,anonymity of user,forward anonymity of user,unlinkability,deniability.Based on elliptic curve cryptosystem we also propose a protocol which satisfies all the desired security properties.
Identity-based key agreement protocols allow the participants in a group exchange information over an open network with each other. However, in most of proposed IDbased protocol, identities of group users are exposed, so that eavesdroppers can easily learn who belongs to the specific group. In this paper, we proposed a complete anonymous group key agreement protocol based on the Burmester and Desmedt mechanism and ID-based encryption cryptosystems. The proposed protocol is provably-secure in the random oracle model, and achieves the following security attribute: complete anonymity, unlinkability, group key secrecy, perfect forward secrecy for the group session key and entity authentication.
Most of the existing authenticated key agreement protocols are not designed for anonymity of user.Based on mutually authenticated key agreement protocols(MAKAP),this paper proposed a new AKAPA,which protected privacy of user.Proved the security of the protocols in ROM,and then enhanced security properties,such as perfect forward secrecy,also analyzed unknown key share and perfected denial of service.Moreover,analyzed performance of AKAPA.And the result shows that the protocol is more efficient,so it is quite practical.
A two-message two-party key agreement protocol with explicit authentication provides perfect forward secrecy. Digital signatures can usually be used as providing explicit authentication for a key agreement protocol. Shim proposed an efficient identity-based signature scheme using bilinear pairings; however, he did not give a formal security proof for it. In this paper, we present a formal security proof for Shim's signature scheme. Using Shim's signature scheme as building blocks, we propose a new two-party identity-based key agreement protocol with explicit authentication. The proposed protocol satisfies a set of desirable security properties. Compared with the related protocols, the proposed protocol has distinct advantages in terms of security and computational efficiency.
With the rise of the Internet of Things (IoT), maintaining data confidentiality and protecting user privacy have become increasingly challenging. End devices in the IoT are often deployed in unattended environments and connected to open networks, making them vulnerable to physical tampering and other security attacks. Different authentication key agreement (AKA) schemes have been used in practice; several of them do not cover the necessary security features or are incompatible with resource-constrained end devices. Their security proofs have been performed under the Random-Oracle model. We present an AKA protocol for end devices and servers. The proposal leverages the ECC-based key exchange mechanism and one-way hash function-based message authentication method to achieve mutual authentication, user anonymity, and forward security. A formal security proof of the proposed scheme is performed under the standard model and the eCK model with the elliptic curve encryption computational assumptions, and formal verification is performed with ProVerif. According to the performance comparison, it is revealed that the proposed scheme offers user anonymity, perfect forward security, and mutual authentication, and resists typical attacks such as ephemeral secret leakage attacks, impersonation attacks, man-in-the-middle attacks, and key compromise impersonation attacks. Moreover, the proposed scheme has the lowest computational and communication overhead compared to existing schemes.