AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

A verifiable random function with short proofs and keys

IACR Cryptology ePrint Archive, (2005): 416-431

被引用420|浏览11
EI
下载 PDF 全文
引用

摘要

We give a simple and efficient construction of a verifiable random function (VRF) on bilinear groups. Our construction is direct. In contrast to prior VRF constructions [14,15], it avoids using an inefficient Goldreich-Levin transformation, thereby saving several factors in security. Our proofs of security are based on a decisional biline...更多

代码

数据

您的评分 :
0

 

标签
评论
小科