Asset Details
Do you wish to reserve the book?
Constructing Efficient Identity‐Based Signatures on Lattices
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Constructing Efficient Identity‐Based Signatures on Lattices
Do you wish to request the book?
Constructing Efficient Identity‐Based Signatures on Lattices
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Constructing Efficient Identity‐Based Signatures on Lattices
2025
Overview
In this work, we explore the recent developments related to lattice‐based signature and preimage sampling, and specify a compact identity‐based signature (IBS) on an ideal lattice for practical use. Specifically, we first propose an ellipsoid version of the G + G signature scheme (Asiacrypt 2023) that achieves slightly better signature size and higher security. Then, by adapting a specific preimage sampling algorithm to the modified G + G signature, we obtain an efficient IBS scheme. In addition, we prove its security in the quantum random oracle model (QROM), following the paradigm introduced by Zhangdry (Crypto 2012). Finally, a complete specification of the IBS, featuring three distinct parameter sets, is accompanied by a proof‐of‐concept implementation. We believe that the combination of the preimage sampling with the Fiat–Shamir transformation holds potential for application in the other advanced digital signature schemes.
Publisher
John Wiley & Sons, Inc
