Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Identity-based Blind Multisignature from Lattices
作者 曾一凡
Tseng, Yi-Fan
Tso, Raylin
Liu, Zi-Yuan
貢獻者 資科系
關鍵詞 Lattice-based cryptography ; blind multisignature ; quantum-resistant
日期 2019-12
上傳時間 23-Dec-2021 15:42:13 (UTC+8)
摘要 Blind multisignature (BMS), first introduced by Horster et al, constitutes a crucial primitive that allows a user to generate a signature of a message from multiple signers, while the signers cannot obtain any information about the message. With these useful properties, blind multisignature is suitable for electronic payments and electronic voting. However, most of the current BMS schemes may be attacked by quantum computers in the future because they are based on traditional number theories, such as discrete logarithm assumption and large integer factor assumption. In this work, we first formalize the notion and the sound security models of the identity-based blind multisignature scheme (IDBMS). Then we present an instantiation based on lattices, along with rigorous proofs of the blindness and unforgeability under the lattice hard assumption (short integer solution, SIS), which is considered to remain secure under quantum computer attacks. To the best of our knowledge, it is the first identity-based quantum-resistant scheme that has the advantages of blind signature and multisignature.
關聯 IEEE ACCESS, Vol.7, pp.182316-182923
資料類型 article
DOI https://doi.org/10.1109/ACCESS.2019.2959943
dc.contributor 資科系-
dc.creator (作者) 曾一凡-
dc.creator (作者) Tseng, Yi-Fan-
dc.creator (作者) Tso, Raylin-
dc.creator (作者) Liu, Zi-Yuan-
dc.date (日期) 2019-12-
dc.date.accessioned 23-Dec-2021 15:42:13 (UTC+8)-
dc.date.available 23-Dec-2021 15:42:13 (UTC+8)-
dc.date.issued (上傳時間) 23-Dec-2021 15:42:13 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/138328-
dc.description.abstract (摘要) Blind multisignature (BMS), first introduced by Horster et al, constitutes a crucial primitive that allows a user to generate a signature of a message from multiple signers, while the signers cannot obtain any information about the message. With these useful properties, blind multisignature is suitable for electronic payments and electronic voting. However, most of the current BMS schemes may be attacked by quantum computers in the future because they are based on traditional number theories, such as discrete logarithm assumption and large integer factor assumption. In this work, we first formalize the notion and the sound security models of the identity-based blind multisignature scheme (IDBMS). Then we present an instantiation based on lattices, along with rigorous proofs of the blindness and unforgeability under the lattice hard assumption (short integer solution, SIS), which is considered to remain secure under quantum computer attacks. To the best of our knowledge, it is the first identity-based quantum-resistant scheme that has the advantages of blind signature and multisignature.-
dc.format.extent 3698841 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) IEEE ACCESS, Vol.7, pp.182316-182923-
dc.subject (關鍵詞) Lattice-based cryptography ; blind multisignature ; quantum-resistant-
dc.title (題名) Identity-based Blind Multisignature from Lattices-
dc.type (資料類型) article-
dc.identifier.doi (DOI) 10.1109/ACCESS.2019.2959943-
dc.doi.uri (DOI) https://doi.org/10.1109/ACCESS.2019.2959943-