@inproceedings{aa8bc228a67f4ee58053f315ec29df7c,
title = "A provably secure group signature scheme from code-based assumptions",
abstract = "We solve an open question in code-based cryptography by introducing the first provably secure group signature scheme from code-based 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.",
author = "Ezerman, {Martianus Frederic} and Lee, {Hyung Tae} and San Ling and Khoa Nguyen and Huaxiong Wang",
year = "2015",
doi = "10.1007/978-3-662-48797-6_12",
language = "English",
isbn = "9783662487969",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Springer Nature",
pages = "260--285",
editor = "Tetsu Iwata and Cheon, {Jung Hee}",
booktitle = "Advances in Cryptology - ASIACRYPT 2015",
address = "United States",
note = "21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015 ; Conference date: 29-11-2015 Through 03-12-2015",
}