Summary

I am a researcher working at NTT, Japan. My main research area is cryptography, and my primary interest lies in the design and analysis of cryptographic protocols. My previous works include designing cryptographic protocols that provide strong security guarantees (such as non-malleability, concurrent security, composability, and leakage resilience).

Before joining NTT, I was a student at Kyoto University. I obtained my Master's degree in Informatics in 2013 and my Bachelors' degree in Engineering in 2011.

In 2016, I stayed at UC Berkeley as a visiting scholar (hosted by Prof. Sanjam Garg).

Email: kiyoshima.susumu at lab.ntt.co.jp
PGP key: here

Publications

Conference Papers

  1. 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]
  2. 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]
  3. 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]
  4. Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions.
    Susumu Kiyoshima.
    CRYPTO 2015 (The 35th International Cryptology Conference).
    [proceeding version]    [author version]
  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]    [author version]
  6. Round-Efficient Black-Box Construction of Composable Multi-Party Computation.
    Susumu Kiyoshima.
    CRYPTO 2014 (The 34th International Cryptology Conference).
    [proceeding version]    [author version]
  7. 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]
  8. 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]
  9. 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]

Theses

  1. Composably Secure Cryptographic Protocols.
    Master Thesis. Kyoto University. 2013.
    Supervisor: Tatsuaki Okamoto.
  2. Constant-Time Approximation Algorithms for the Knapsack Problem.
    Undergraduate Thesis. Kyoto University. 2011.
    Supervisor: Hiro Ito.