A Concretely Compact Lattice-Based Aggregate Signature Scheme

• Item type: Symposium(1)
• 公開日: 2023-10-23
• タイトル: A Concretely Compact Lattice-Based Aggregate Signature Scheme
• タイトル / 言語: en
• タイトル: A Concretely Compact Lattice-Based Aggregate Signature Scheme
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_5794
• 資源タイプ: conference paper
• 著者所属: Yokohama National University
• 著者所属: Yokohama National University
• 著者所属(英): en
• 著者所属(英): Yokohama National University
• 著者所属(英): en
• 著者所属(英): Yokohama National University
• 著者名: Toi, Tomita; Junji, Shikata
• 著者名(英): Toi, Tomita; Junji, Shikata
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: We present the first aggregate signature (AS) scheme that: (1) its security is based on the standard lattice-based assumptions in the random oracle model, (2) the size of the aggregated signature is logarithmic, (3) it has no one-time restriction, and (4) it can be aggregated non-interactively. In addition, our AS scheme is concretely compact because the size of the aggregated signature required to aggregate 10^6 signatures is only a few hundred kilobytes. This result shows that our scheme is superior to the existing lattice-based schemes in compressing many signatures. To obtain our scheme, we construct a new lattice-based succinct non-interactive argument of knowledge (SNARK) system for batch signature verification of a SNARK-friendly variant of Lyubashefsky's signature scheme.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: We present the first aggregate signature (AS) scheme that: (1) its security is based on the standard lattice-based assumptions in the random oracle model, (2) the size of the aggregated signature is logarithmic, (3) it has no one-time restriction, and (4) it can be aggregated non-interactively. In addition, our AS scheme is concretely compact because the size of the aggregated signature required to aggregate 10^6 signatures is only a few hundred kilobytes. This result shows that our scheme is superior to the existing lattice-based schemes in compressing many signatures. To obtain our scheme, we construct a new lattice-based succinct non-interactive argument of knowledge (SNARK) system for batch signature verification of a SNARK-friendly variant of Lyubashefsky's signature scheme.
• 書誌情報: コンピュータセキュリティシンポジウム2023論文集; p. 1068-1075, 発行日 2023-10-23
• 出版者 / 言語: ja
• 出版者: 情報処理学会