清島　奨

English / Japanese

所属：NTT社会情報研究所
専門：暗号理論

2011年3月 京都大学工学部情報学科を卒業
2013年3月 京都大学大学院情報学研究科修士課程を修了
2013年4月 日本電信電話株式会社に入社。セキュアプラットフォーム研究所に配属
2018年3月 京都大学博士（情報学）を取得
2019年7月 NTT Researchへ出向
2023年7月 日本電信電話株式会社に帰任。社会情報研究所に配属

メールアドレス：susumu at kiyoshima.info もしくは susumu.kiyoshima at ntt.com

お知らせ: 従来のメールアドレス（kiyoshima.susumu at lab.ntt.co.jp、susumu.kiyoshima.ad at hco.ntt.co.jp、susumu.kiyoshima at ntt-research.com）は使用を停止いたしました。今後のご連絡には上記のメールアドレスをご利用ください。

論文

国際会議（査読付き）

  1. Constant-Time Approximation Algorithms for the Knapsack Problem.
    Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida.
    TAMC 2012 (The 9th Annual Conference on Theory and Applications of Models of Computation).
    proceeding version
  2. Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security.
    Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto.
    IWSEC 2012 (The 7th International Workshop on Security).    Best Student Paper
    proceeding version
  3. Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol.
    Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto.
    TCC 2014 (The 11th Theory of Cryptography Conference).
    proceeding version    author version
  4. Round-Efficient Black-Box Construction of Composable Multi-Party Computation.
    Susumu Kiyoshima.
    CRYPTO 2014 (The 34th International Cryptology Conference).
    proceeding version    (see also this journal paper)
  5. An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting.
    Susumu Kiyoshima.
    TCC 2015 (The 12th Theory of Cryptography Conference).
    proceeding version    (see also this journal paper)
  6. Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions.
    Susumu Kiyoshima.
    CRYPTO 2015 (The 35th International Cryptology Conference).
    proceeding version    author version    (see also this journal paper)
  7. Garbling Scheme for Formulas with Constant Size of Garbled Gates.
    Carmen Kempka, Ryo Kikuchi, Susumu Kiyoshima, Koutarou Suzuki.
    ASIACRYPT 2015 (The 21st Annual International Conference on the Theory and Application of Cryptology and Information Security).
    proceeding version    author version
  8. Constant-round Leakage-resilient Zero-knowledge from Collision Resistance.
    Susumu Kiyoshima.
    EUROCRYPT 2016 (The 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques).
    proceeding version    author version    (see also this journal paper)
  9. On the Exact Round Complexity of Self-Composable Two-Party Computation.
    Sanjam Garg, Susumu Kiyoshima, Omkant Pandey.
    EUROCRYPT 2017 (The 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques).
    proceeding version    author version
  10. A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models.
    Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam.
    TCC 2017 (The 15th Theory of Cryptography Conference).
    proceeding version    author version
  11. A New Approach to Black-Box Concurrent Secure Computation.
    Sanjam Garg, Susumu Kiyoshima, Omkant Pandey.
    EUROCRYPT 2018 (The 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques).
    proceeding version    author version
  12. No-signaling Linear PCPs.
    Susumu Kiyoshima.
    TCC 2018 (The 16th Theory of Cryptography Conference).
    proceeding version    author version    (see also this journal paper)
  13. Round-optimal Black-box Commit-and-prove with Succinct Communication.
    Susumu Kiyoshima.
    CRYPTO 2020 (The 40th Annual International Cryptology Conference).
    proceeding version    author version
  14. Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness.
    Susumu Kiyoshima.
    TCC 2021 (The 19th Theory of Cryptography Conference).
    proceeding version    author version
  15. Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash.
    Susumu Kiyoshima.
    CRYPTO 2022 (The 42nd Annual International Cryptology Conference).
    proceeding version    author version
  16. Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors.
    Susumu Kiyoshima.
    TCC 2023 (The 21st Theory of Cryptography Conference).
    proceeding version    author version

論文誌

  1. Round-Efficient Black-Box Construction of Composable Multi-Party Computation.
    Susumu Kiyoshima.
    Journal of Cryptology, Volume 32, Issue 1. 2019.
    publisher version    author version
    (A preliminary version of this paper was presented at CRYPTO 2014.)
  2. Non-black-box Simulation in the Fully Concurrent Setting, Revisited.
    Susumu Kiyoshima.
    Journal of Cryptology, Volume 32, Issue 2. 2019.
    publisher version    author version
    (A preliminary version of this paper was presented at TCC 2015.)
  3. Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions.
    Susumu Kiyoshima.
    Journal of Cryptology, Volume 33, Issue 3. 2020.
    publisher version
    (A preliminary version of this paper was presented at CRYPTO 2015.)
  4. Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance
    Susumu Kiyoshima.
    Journal of Cryptology, Volume 35, Issue 3. 2022.
    publisher version
    (A preliminary version of this paper was presented at EUROCRYPT 2016.)
  5. No-Signaling Linear PCPs
    Susumu Kiyoshima.
    Journal of Cryptology, Volume 36, Issue 2. 2023.
    publisher version
    (A preliminary version of this paper was presented at TCC 2018.)

学位論文

  1. Constant-Time Approximation Algorithms for the Knapsack Problem.
    特別研究報告書（卒業論文）. 京都大学. 2011.
    指導教員: 伊藤大雄 准教授.
  2. Composably Secure Cryptographic Protocols.
    修士論文. 京都大学. 2013.
    指導教員: 岡本龍明 教授.
  3. A Study on Cryptographic Protocols: Achieving Strong Security for Zero-knowledge Proofs and Secure Computation
    博士論文. 京都大学. 2018.

国内シンポジウム・研究会

  1. ナップサック問題に対する定数時間近似アルゴリズム.
    伊藤大雄, 清島奨, 吉田悠一.
    コンピュテーション研究会（COMP）. 2011年3月.
  2. Constant-Round Concurrent Zero-Knowledge in Super-Polynomial Simulation Security.
    清島奨, 真鍋義文, 岡本龍明.
    SCIS 2012.
  3. On the Round-Complexity Lower Bound of CCA-Secure Commitments.
    清島奨, 真鍋義文, 岡本龍明.
    SCIS 2013.     SCIS論文賞
  4. On Concurrently Extractable Commitment Schemes.
    清島奨.
    SCIS 2014.
  5. 非ブラックボックスシミュレーションによる並行ゼロ知識証明.
    清島奨.
    SCIS 2015.
  6. 定数長のGarbled Gateを実現するGarbling Scheme.
    鈴木幸太郎, Carmen Kempka, 菊池亮, 清島奨.
    SCIS 2016.
  7. 漏洩情報に無頓着なシミュレータを持つ耐漏洩ゼロ知識証明について.
    清島奨.
    SCIS 2017.

招待講演

  1. Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol.
    第7回公開鍵暗号の安全な構成とその応用ワークショップ.
    2014年3月.
  2. Round-Efficient Black-Box Construction of Composable Multi-Party Computation.
    情報セキュリティ研究会（ISEC）.
    2014年12月.
  3. Round-Efficient Black-Box Construction of Composable Multi-Party Computation.
    第8回公開鍵暗号の安全な構成とその応用ワークショップ.
    2015年2月.
  4. An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting.
    PKC, TCC, CT-RSAを勉強する会2015.
    2015年7月.
  5. Constant-round Leakage-resilient Zero-knowledge from Collision Resistance.
    情報セキュリティ研究会（ISEC）.
    2016年9月.
  6. A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models.
    Tokyo Crypto Day.
    2017年10月.
  7. On the Exact Round Complexity of Self-Composable Two-Party Computation.
    第11回公開鍵暗号の安全な構成とその応用ワークショップ.
    2018年3月.
  8. No-signaling Linear PCPs.
    第12回公開鍵暗号の安全な構成とその応用ワークショップ.
    2019年3月.
  9. Round-optimal Black-box Commit-and-prove with Succinct Communication.
    2020年 暗号と情報セキュリティワークショップ（WCIS2020）.
    2020年9月.
  10. LWE仮定と鍵なし多重衝突困難ハッシュ関数に基づく公開コイン3ラウンドゼロ知識証明.
    第22回情報科学技術フォーラム（FIT2023）トップコンファレンスセッション.
    2023年9月.

学会活動

プログラム委員

  1. TCC 2019
  2. EUROCRYPT 2020
  3. TCC 2022

運営委員

  1. SCIS 2016 (2016年暗号と情報セキュリティシンポジウム).

Created: 2023-10-08 日 11:59