An Efficient Lattice-based Distributed IBE

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 l...

Full description

Saved in:
Bibliographic Details
Main Authors: Yin, Lu, Zhang, Quan, Li, Rui-Lin
Format: Conference Proceeding
Language:English
Subjects:
Construction standards
Encryption
Interpolation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2271-2097
2431-7578
2271-2097
DOI:10.1051/itmconf/20160701014