ITM Web Conf.
Volume 7, 20163rd Annual International Conference on Information Technology and Applications (ITA 2016)
|Number of page(s)||7|
|Section||Session 1: Communication and Networking|
|Published online||21 November 2016|
An Efficient Lattice-based Distributed IBE
School of Electronic Science and Engineering, National University of Defense Technology, NUDT, Changsha, China
This paper improves the lattice-based secret sharing method presented by Bansarkhani and Meziani and combines the method with the IBE based on the standard LWE problem constructing an efficient lattice-based distributed decryption IBE. Our construction avoids the weakness in the traditional method like Lagrange interpolation, Blakley’s space geometry method or Chinese remainder theorem method. Through theoretical analysis, compared with the bilinear pairing based distributed IBE, our scheme refrains from the complex pairing operation and has less calculation cost. A proof of security holds in the standard model.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.