Exploring the Limitations of Deletion Codes

• Project/Area Number: 18K11159
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Review Section: Basic Section 60010:Theory of informatics-related
• Research Institution: Tokyo Institute of Technology (2021-2023); Osaka University (2018-2020)
• Principal Investigator: Yasunaga Kenji 東京工業大学, 情報理工学院, 准教授 (50510004)
• Project Period (FY): 2018-04-01 – 2024-03-31
• Project Status: Completed (Fiscal Year 2023)
• Budget Amount: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000); Fiscal Year 2021: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000); Fiscal Year 2020: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000); Fiscal Year 2019: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000); Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
• Keywords: 誤り訂正符号 / 挿入・削除訂正 / リスト復号 / 連接符号 / 挿入・削除誤り

Outline of Final Research Achievements

Focusing on error correctability of list decoding for insertions and deletions, we derived a bound generalizing the Johnson bound for ordinary symbol errors to the Levenshtein distance. The bound implies that the correctability for insertions is superior to deletions in list decoding. Also, we construct a code to achieve the correctability of this bound based on concatenated codes. In addition, based on the bound for list decodability, we derived a bound representing the trade-off between insertion/deletion correctability and coding rate by a probabilistic argument. This bound is superior to the existing ones for binary codes.

Academic Significance and Societal Importance of the Research Achievements

挿入・削除と呼ばれる誤りを訂正するための技術は，DNAストレージにおける誤り訂正に利用できる．本研究は，そのための基礎理論に関する研究である．リスト復号は，複数の候補を出力することを許す復号法であり，候補を一つだけ出力する一意復号の要件を弱めることで，多くの誤りを訂正できることが期待される．本研究では，挿入・削除誤りに対してリスト復号で訂正可能な誤りの数に関する限界式を導出し，さらにその誤りを効率的に訂正可能な符号方式の提案も行った．リスト復号可能な符号は，一意復号可能な符号を構成するための要素技術として利用されることも多く，挿入・削除誤りを訂正する優れた符号の構成の可能性を広げている．

Research Products

• [Journal Article] Improved bounds for codes correcting insertions and deletions (2024)
  • Author(s): Yasunaga Kenji
  • Journal Title: Designs, Codes and Cryptography Volume: － Issue: 5 Pages: 1267-1278
  • DOI: 10.1007/s10623-023-01342-1
  • Peer Reviewed / Open Access
• [Journal Article] On the Limitations of Computational Fuzzy Extractors (2023)
  • Author(s): YASUNAGA Kenji、YUZAWA Kosuke
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E106.A Issue: 3 Pages: 350-354
  • DOI: 10.1587/transfun.2022CIL0001
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2023-03-01
  • Peer Reviewed / Open Access
• [Journal Article] Fuzzy Signature with Biometric-Independent Verification (2023)
  • Author(s): Higo Haruna、Isshiki Toshiyuki、Otsuki Saki、Yasunaga Kenji
  • Journal Title: 2023 International Conference of the Biometrics Special Interest Group Volume: － Pages: 1-6
  • DOI: 10.1109/biosig58226.2023.10345774
  • Peer Reviewed / Open Access
• [Journal Article] Perfectly Secure Message Transmission Against Rational Adversaries (2022)
  • Author(s): Fujita Maiki、Koshiba Takeshi、Yasunaga Kenji
  • Journal Title: IEEE Journal on Selected Areas in Information Theory Volume: 3 Issue: 2 Pages: 390-404
  • DOI: 10.1109/jsait.2022.3188923
  • Peer Reviewed / Open Access
• [Journal Article] Practical Card-Based Protocol for Three-Input Majority (2020)
  • Author(s): YASUNAGA Kenji
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E103.A Issue: 11 Pages: 1296-1298
  • DOI: 10.1587/transfun.2020EAL2025
  • NAID: 130007933523
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2020-11-01
  • Peer Reviewed
• [Journal Article] On the List Decodability of Insertions and Deletions (2020)
  • Author(s): Hayashi Tomohiro、Yasunaga Kenji
  • Journal Title: IEEE Transactions on Information Theory Volume: 66 Issue: 9 Pages: 5335-5343
  • DOI: 10.1109/tit.2020.2981321
  • Peer Reviewed
• [Journal Article] Error correction by structural simplicity: correcting samplable additive errors (2019)
  • Author(s): Kenji Yasunaga
  • Journal Title: The Computer Journal Volume: 62-9 Issue: 9 Pages: 1265-1276
  • DOI: 10.1093/comjnl/bxy100
  • Peer Reviewed
• [Journal Article] Perfectly secure message transmission against independent rational adversaries (2019)
  • Author(s): Kenji Yasunaga and Takeshi Koshiba
  • Journal Title: Lecture Notes in Computer Science, Proc. of Decision and Game Theory for Security - 10th International Conference, GameSec 2019 Volume: 11836 Pages: 563-582
  • DOI: 10.1007/978-3-030-32430-8_33
  • ISBN: 9783030324292, 9783030324308
  • Peer Reviewed
• [Journal Article] On the List Decodability of Insertions and Deletions (2018)
  • Author(s): Hayashi Tomohiro、Yasunaga Kenji
  • Journal Title: Proc. of 2018 IEEE International Symposium on Information Theory, ISIT 2018 Volume: 2018 Pages: 86-90
  • DOI: 10.1109/isit.2018.8437894
  • Peer Reviewed
• [Journal Article] Perfectly Secure Message Transmission Against Rational Timid Adversaries (2018)
  • Author(s): Fujita Maiki、Yasunaga Kenji、Koshiba Takeshi
  • Journal Title: Lecture Notes in Computer Science, Proc. of Decision and Game Theory for Security - 9th International Conference, GameSec 2018 Volume: 11199 Pages: 127-144
  • DOI: 10.1007/978-3-030-01554-1_8
  • ISBN: 9783030015534, 9783030015541
  • Peer Reviewed
• [Journal Article] Repeated Games for Generating Randomness in Encryption (2018)
  • Author(s): YASUNAGA Kenji、YUZAWA Kosuke
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E101.A Issue: 4 Pages: 697-703
  • DOI: 10.1587/transfun.E101.A.697
  • NAID: 130006601962
  • ISSN: 0916-8508, 1745-1337
  • Peer Reviewed
• [Presentation] 挿入・削除訂正符号のサイズの上下界式 (2022)
  • Author(s): 安永 憲司
  • Organizer: 第45回情報理論とその応用シンポジウム
• [Presentation] 明示的構成の計算量と値域回避問題 (2022)
  • Author(s): 安永 憲司
  • Organizer: エクスパンダーグラフの構成手法の確立とその応用
• [Presentation] Quantifying the Security Levels of Cryptographic Primitives (2022)
  • Author(s): Kenji Yasunaga
  • Organizer: 2022 IEEE Region 10 Conference (TEN- CON 2022)
  • Int'l Joint Research / Invited
• [Presentation] Replacing Probability Distributions in Security Games via Hellinger Distance. (2021)
  • Author(s): Kenji Yasunaga
  • Organizer: 2nd Conference on Information-Theoretic Cryptography
  • Int'l Joint Research
• [Presentation] Bit Security as Computational Cost for Winning Games with High Probability (2021)
  • Author(s): Shun Watanabe and Kenji Yasunaga
  • Organizer: ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security
  • Int'l Joint Research
• [Presentation] 暗号学的ハッシュ関数を用いた挿入・削除訂正 (2021)
  • Author(s): 長谷場 保亮, 安永 憲司
  • Organizer: 第44回情報理論とその応用シンポジウム (SITA2021)
• [Presentation] 少ない順位付けを用いるランキング手法の評価:決定性と乱択 (2021)
  • Author(s): 草地翔斗, 安永憲司
  • Organizer: 日本オペレーションズ・リサーチ学会 2021年秋季研究発表会
• [Presentation] A Construction of Robustly Reusable Fuzzy Extractors over Blockchains (2020)
  • Author(s): Kodai Sato, Kenji Yasunaga, Toru Fujiwara,
  • Organizer: ISITA2020
  • Int'l Joint Research
• [Presentation] すべての通信路が敵に支配されてもゲーム理論的には安全な通信ができる (2020)
  • Author(s): 安永 憲司, 小柴 健史
  • Organizer: 2020 年 暗号と情報セキュリティシンポジウム (SCIS2020)
• [Presentation] すべての通信路が敵に支配されてもゲーム理論的には安全な通信ができる (2020)
  • Author(s): 安永 憲司, 小柴 健史
  • Organizer: LA シン ポジウム
• [Presentation] Perfectly secure message transmission against independent rational adversaries (2019)
  • Author(s): Kenji Yasunaga and Takeshi Koshiba
  • Organizer: 10th Conference on Decision and Game Theory for Security (GameSec 2019)
  • Int'l Joint Research
• [Presentation] On the List Decodability of Insertions and Deletions (2018)
  • Author(s): Tomohiro Hayashi, Kenji Yasunaga
  • Organizer: 2018 IEEE International Symposium on Information Theory, ISIT 2018
  • Int'l Joint Research
• [Presentation] 挿入と削除に対するリスト復号 (2018)
  • Author(s): 安永 憲司，林 智弘
  • Organizer: 第７回 誤り訂正符号のワークショップ