Public-Key Cryptography Based on Modular Lattices
This work addresses cryptographic security for identity-based encryption systems, but it is incremental as it extends an existing scheme without proven security.
The paper tackles the problem of generalizing the Boneh-Franklin Identity-Based Encryption scheme to modular lattices and vector spaces over finite fields, but notes that the original security proof does not hold in these structures, indicating it is still a work in progress with no concrete results reported.
We present an approach to generalization of practical Identity-Based Encryption scheme of Boneh and Franklin. In particular we show how the protocol could be used on finite modular lattices and as a special case on vector spaces over finite field. The original proof of security for this protocol does not hold in this general algebraic structure, thus this is still a work in progress.