Open AccessEfficient Ring Signature Scheme Without Random Oracle from Lattices
Author(s) -
GAO Wen,
HU Yupu,
WANG Baocang,
CHEN Jiangshan,
WANG Xin
Publication year - 2019
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2018.12.005
Subject(s) - random oracle , ring signature , computer science , schnorr signature , theoretical computer science , merkle signature scheme , oracle , voting , cryptography , encryption , algorithm , mathematics , blind signature , public key cryptography , computer security , software engineering , politics , political science , law
Among post‐quantum alternatives, latticebased cryptography is the most promising one, due to its simple operations, reduction from aver‐age‐case to worstcase hardness, and supporting of rich functionalities. Ring signature enables a user to sign anonymously on behalf of an adaptively chosen group, and has multiple applications in anonymous e‐voting, anonymous authentication, whistle blowing etc. However, most lattice‐based ring signature schemes were constructed in the random oracle model from lattice basis delegation and they suffer large verification key sizes as a common disadvantage. This work proposes an efficient ring signature scheme from lattice basis delegation without random oracle based on the extended split‐SIS problem, whose security is approximately as hard as the worst‐case SIVP problem. Our scheme is proved to be anonymous and existentially unforgeable under latticebased assumptions. Finally, the verification key size is significantly reduced to a small constant, instead of increasing linearly with the number of ring members.