| Reference : Shorter and Faster Identity-Based Signatures with Tight Security in the (Q)ROM from L... |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science | |||
| Security, Reliability and Trust | |||
| http://hdl.handle.net/10993/55681 | |||
| Shorter and Faster Identity-Based Signatures with Tight Security in the (Q)ROM from Lattices | |
| English | |
| Sageloli, Éric [> >] | |
| Pébereau, Pierre [> >] | |
Meaux, Pierrick  [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > PI Coron] | |
| Chevalier, Céline [> >] | |
| 2023 | |
| Applied Cryptography and Network Security - 21st International Conference ACNS 2023, Kyoto, Japan, June 19-22, 2023, Proceedings, Part I | |
| Springer | |
| Lecture Notes in Computer Science | |
| 634--663 | |
| Yes | |
| International | |
| Applied Cryptography and Network Security | |
| from 19-06-2023 to 22-06-2023 | |
| Japan | |
| [en] We provide identity-based signature (IBS) schemes with tight security against adaptive
adversaries, in the (classical or quantum) random oracle model (ROM or QROM), in both unstructured and structured lattices, based on the SIS or RSIS assumption. These signatures are short (of size independent of the message length). Our schemes build upon a work from Pan and Wagner (PQCrypto’21) and improve on it in several ways. First, we prove their transformation from nonadaptive to adaptive IBS in the QROM. Then, we simplify the parameters used and give concrete values. Finally, we simplify the signature scheme by using a non-homogeneous relation, which helps us reduce the size of the signature and get rid of one costly trapdoor delegation. On the whole, we get better security bounds, shorter signatures and faster algorithms. | |
| http://hdl.handle.net/10993/55681 | |
| 10.1007/978-3-031-33488-7\_24 | |
| https://eprint.iacr.org/2023/489.pdf |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.
