상세 보기
A provably secure group signature scheme from code-based assumptions
- Ezerman, M.F.;
- Lee, H.T.;
- Ling, S.;
- Nguyen, K.;
- Wang, H.
WEB OF SCIENCE
38SCOPUS
39초록
We solve an open question in code-based cryptography by introducing the first provably secure group signature scheme from codebased assumptions. Specifically, the 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. Our construction produces smaller key and signature sizes than the existing post-quantum group signature schemes from lattices, as long as the cardinality of the underlying group does not exceed the population of the Netherlands (≈224 users). The feasibility of the scheme is supported by implementation results. Additionally, the techniques introduced in this work might be of independent interest: a new verifiable encryption protocol for the randomized McEliece encryption and a new approach to design formal security reductions from the Syndrome Decoding problem.
- 제목
- A provably secure group signature scheme from code-based assumptions
- 저자
- Ezerman, M.F.; Lee, H.T.; Ling, S.; Nguyen, K.; Wang, H.
- 발행일
- 2015-11
- 유형
- Proceedings Paper
- 권
- 9452
- 페이지
- 260 ~ 285
- 언어
- ENG
- 출판사
- Springer Verlag
- 발행국가
- 미국
- 분량
- 26 페이지
- ISSN
- E 1611-3349
P 0302-9743