Provably secure group signature schemes from code-based assumptions

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 \textsf{CPA}-anonymity and traceability requirements in the random oracle model, assuming the hardness of the McEliece problem,...

Full description

Saved in:
Bibliographic Details
Main Authors: Ezerman, Martianus Frederic, Lee, Hyung Tae, Ling, San, Nguyen, Khoa, Wang, Huaxiong
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2020
Subjects:
Online Access:https://hdl.handle.net/10356/143454
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English