WEKO3
アイテム
A Concretely Compact Lattice-Based Aggregate Signature Scheme
https://ipsj.ixsq.nii.ac.jp/records/228759
https://ipsj.ixsq.nii.ac.jp/records/2287595fbb4e4b-12ac-4066-b188-800045298c8b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-CSS2023146.pdf (316.4 kB)
2025年10月23日からダウンロード可能です。
|
Copyright (c) 2023 by the Information Processing Society of Japan
|
|
| 非会員：¥660, IPSJ:学会員：¥330, CSEC:会員：¥0, SPT:会員：¥0, DLIB:会員：¥0 | ||
| 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
× Toi, Tomita
× Junji, Shikata
|
|||||||||
| 著者名(英) |
Toi, Tomita
× 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 | |||||||||
| 出版者 | 情報処理学会 | |||||||||
