基于双线性困难问题的电子彩票方案

E-lottery scheme based on bilinear hard problem

提出一个公正、高效的电子彩票方案。该方案引入基于双线性群上q-DBDHI困难性假设的可验证随机函数来产生中奖数字,实现了彩票购买者的匿名性、中奖数字产生的可参与性和可验证性。与以往的方案相比,该方案具有更短的密钥和证据空间。同时,采用分层hash链结构联接所有的彩票购买者数据,使得验证中奖数字的计算量大幅度降低。该方案特别适用于具有大量移动终端的电子彩票销售网络。

A new candid and efficient scheme of electronic lottery （e-lottery） is proposed. This scheme utilizes a verifiable random function on the q-DBDHI assumption over a bilinear group to generate the winning numbers of the e-lottery, tO assure the anonymity of lottery players and to enable players to participate in the generation of the winning numbers and in the verification of the result. In comparison with previous schemes, the new scheme has shorter key and witness sizes. Moreover, the cost of computation for verifying the winning numbers is reduced because of the multi-level hash chain adopted in the scheme. The proposed scheme is suitable for lottery sale systems with many mobile users.