Provably Secure Group Signature Schemes from Code-Based Assumptions

  • Ezerman, M.F.; 
  • Lee, H.T.; 
  • Ling, S.; 
  • Nguyen, K.; 
  • Wang, H.
Citations

WEB OF SCIENCE

25
Citations

SCOPUS

30

초록

We solve an open question in code-based cryptography by introducing two provably secure group signature schemes from code-based assumptions. Our basic scheme satisfies the CPA-anonymity and traceability requirements in the random oracle model, assuming the hardness of the McEliece problem, the Learning Parity with Noise problem, and a variant of the Syndrome Decoding problem. The construction produces smaller key and signature sizes than the previous group signature schemes from lattices, as long as the cardinality of the underlying group does not exceed 224, which is roughly comparable to the current population of the Netherlands. We develop the basic scheme further to achieve the strongest anonymity notion, i.e., CCA-anonymity, with a small overhead in terms of efficiency. The feasibility of two proposed schemes is supported by implementation results. Our two schemes are the first in their respective classes of provably secure groups signature schemes. Additionally, the techniques introduced in this work might be of independent interest. These are a new verifiable encryption protocol for the randomized McEliece encryption and a novel approach to design formal security reductions from the Syndrome Decoding problem.

키워드

Code-based group signature; McEliece encryption; syndrome decoding; zero-knowledge protocol
제목
Provably Secure Group Signature Schemes from Code-Based Assumptions
저자
Ezerman, M.F.; Lee, H.T.; Ling, S.; Nguyen, K.; Wang, H.
DOI
10.1109/TIT.2020.2976073
발행일
2020-09
유형
Article
저널명
IEEE Transactions on Information Theory
권
66
호
9
페이지
5754 ~ 5773

파일 다운로드

Thumbnail