Multiparty Key Agreement Using Bilinear Map
نویسندگان
چکیده
⎯ A key agreement protocol is a cryptographical primitive which allows participants to share a common secret key via insecure channel. In particular, a multiparty key agreement protocol is a key agreement protocol that can manage arbitrary number of participants at once. In the security point of view, authentication and forward secrecy are the most important requirements in such protocols. One interesting problem in key agreement protocols is to construct a multiparty key agreement protocol satisfying the above security requirements with minimal number of communication rounds (i.e. one-round). In literature, there has been no one-round multiparty key agreement protocol that satisfies both of authentication and forward secrecy. In this paper, we present a new multiparty key agreement protocol using bilinear map and adopting the key generation center. The protocol demands only one–round for arbitrary number of participants to share a group key and satisfies both authentication and (partial) forward secrecy. Keywords⎯Multiparty Key Agreement, Authentication, Bilinear Map, Weil Pairing
منابع مشابه
ID-based Authenticated Key Agreement for Low-Power Mobile Devices
In this paper we present an efficient ID-based authenticated key agreement (AKA) protocol by using bilinear maps, especially well suited to unbalanced computing environments : an ID-based AKA protocol for Server and Client. Particularly, considering low-power clients’ devices, we remove expensive operations such as bilinear maps from a client side. To achieve our goal we combine two notions, ke...
متن کاملIEEE 1363.3 Submission: Implicitly Authenticated ID-Based Key Agreement Protocol
In this submission, we propose an efficient identity-based and implicitly authenticated key agreement protocol IDAK based on pairing techniques. Though both Weil and Tate pairing could be used for IDAK, we recommend Tate pairing for IDAK to avoid extra ephemeral value validation process. The security of IDAK was formally proved in [22] in Bellare-Rogaway model with random oracle. In additon, ID...
متن کاملNew Paradigms in Group - Oriented Cryptography : Non - Interactive Key Agreement , Chain Signatures and Additive
Cryptography in the multiparty setting is inherently different from that in the two-party setting. Two major areas of research in this regard are Multiparty Key Establishment Protocols which allow a dynamic set of users to establish a shared secret key, and Multisignatures which allow combining a large number of individual signatures into one short object, the multisignature. In this respect, t...
متن کاملTwo-Party Attribute-based Key Agreement Protocol in the Standard Model
We present a new two-party attribute-based key agreement protocol that is secure without the random oracle model in groups equipped with a bilinear map. The attribute-based key agreement scheme is one type of the identity-based key agreement scheme, in which the identity can be viewed as a set of descriptive attributes. These kinds of schemes provide some new properties, such as hiding the iden...
متن کاملEfficient Key Agreement for Large and Dynamic Multicast Groups
Secure multicast represents the core component of many web and multimedia applications such as pay-TV, teleconferencing, real-time distribution of stock market price and etc. The main challenges for secure multicast is scalability, efficiency and authenticity. In this paper, we propose a scalable, efficient, authenticated group key agreement scheme for large and dynamic multicast systems. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007