Find in Library

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.