Extensional schemes of multipartite non-interactive key exchange from multilinear maps and their applications Online publication date: Wed, 22-Aug-2018
by Huiwen Jia; Yupu Hu
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 12, No. 2, 2018
Abstract: The question of generalising the celebrated 2-party non-interactive key exchange (NIKE), Diffie-Hellman protocol, to a multipartite setting was left as an important open problem. In 2003, Boneh and Silverberg put forward a theoretical construction of multipartite NIKE protocol from a new notion called multilinear maps. In their protocol, however, the number of users N and the multilinearity k are related by N = k + 1, resulting in the system initialising another multilinear map when the number of users who want to exchange a session key changes. In this paper, we describe two extensional schemes of multipartite NIKE, which enables any less than or equal to N users derive a common shared key from an (N − 1)-multilinear map. In addition, using our extensional schemes, we show a concrete scenario: the establishment of any discussion group in a user group and its privacy version. Furthermore, we analyse its security.
Online publication date: Wed, 22-Aug-2018
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org