Broadcast and Trace with $N^{\varepsilon }$ Ciphertext Size from Standard Assumptions
ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT III(2019)
摘要
We construct a broadcast and trace scheme (also known as trace and revoke or broadcast, trace and revoke) with N users, where the ciphertext size can be made as low as \(O(N^\varepsilon )\), for any arbitrarily small constant \(\varepsilon >0\). This improves on the prior best construction of broadcast and trace under standard assumptions by Boneh and Waters (CCS ‘06), which had ciphertext size \(O(N^{1/2})\). While that construction relied on bilinear maps, ours uses a combination of the learning with errors (LWE) assumption and bilinear maps.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络