Verifiable Random Functions From Standard Assumptions
TCC 2016-A: Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562(2016)
摘要
The question whether there exist verifiable random functions with exponential-sized input space and full adaptive security based on a non-interactive, constant-size assumption is a long-standing open problem. We construct the first verifiable random functions which achieve all these properties simultaneously.Our construction can securely be instantiated in groups with symmetric bilinear map, based on any member of the (n-1)-linear assumption family with n >= 3. This includes, for example, the 2-linear assumption, which is also known as the decision linear (DLIN) assumption.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络