利用格具有快速高效且抗量子攻击的特性,基于环上错误学习问题(R-LWE)提出了一个可证明安全的身份类广播加密方案。首先,利用改进的理想格上陷门产生算法和盆景树模型,生成广播用户的私钥;在此基础上,为保证消息的合法性,加入一次签名算法;最后,在标准模型下证明方案是选择消息攻击下语义不可区分安全,且安全性可以高效地归约到判定性R-LWE困难性假设。分析表明,该方案具有加解密速度快、密文扩展率低的优势,且能够有效地实现用户端的动态扩展功能。
By using the characteristics of fast and efficient and quantumattack resistance from lattice, this paper proposed a provable secure identity-based broadcast encryption based on learning with errors over rings . Firstly, by making use of improved trapdoor function based on ideal lattice and bonsai trees, it generated users' private keys. Then, added an once signature algorithm to ensure the legitimacy of message. Lastly, this paper proved the scheme to be indistinguishable chosen message attack security under the standard model , and its security could reduce to decision R-LWE hardness assumption. Analysis shows that the proposed scheme has the advantage of fast encryption speed and low cipher extension rate. and can effectively realize the dynamic extension of the client for applying.