期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Polynomial-Time Key-Recovery Attacks Against NTRURe Encrypt from ASIACCS'15
1
作者 LIU Zhen PAN Yanbin ZHENG Jinwei 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2024年第3期1308-1325,共18页
In ASIACCS 2015, Nu nez, et al. proposed a proxy re-encryption scheme, named NTRURe Encrypt, based on NTRU, which allows a proxy to translate ciphertext under the delegator’s public key into a re-encrypted ciphertext... In ASIACCS 2015, Nu nez, et al. proposed a proxy re-encryption scheme, named NTRURe Encrypt, based on NTRU, which allows a proxy to translate ciphertext under the delegator’s public key into a re-encrypted ciphertext that can be decrypted correctly by delegatee’s private key. Because of the potential resistance to quantum algorithm, high efficiency and various applications in real life,NTRURe Encrypt has drawn lots of attention and its security has been widely discussed and analyzed.In PQCrypto2019, Liu, et al. proposed two key recovery attacks against it. However, their first attack heavily relies on a weaken decryption oracle, and the second attack needs to collect about 260ciphertexts from the same message by theoretical analysis, which makes both of the attacks unrealistic. In this paper, inspired by the broadcast attack against NTRU, the authors find out that for NTRURe Encrypt the delegator and the delegatee can efficiently recover each other’s private key in polynomial time without any unrealistic assumptions. In addition, the authors also show how to fix NTRURe Encrypt to resist the proposed attacks. As a by-product, the authors also show how to commit broadcast attacks against NTRU 2001 with even dg, which was thought infeasible before. 展开更多
关键词 Broadcast attack key recovery NTRU ntrureencrypt
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部