Susumu Kiyoshima

According to our database, Susumu Kiyoshima authored at least 20 papers between 2012 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Four-round Statistical Non-malleable Zero-knowledge.

Susumu Kiyoshima

IACR Cryptol. ePrint Arch., 2025

2024

Resettable Statistical Zero-Knowledge for NP.

Susumu Kiyoshima

IACR Cryptol. ePrint Arch., 2024

Resettable Statistical Zero-Knowledge for $\ensuremath {\textsf{NP}}$.

Susumu Kiyoshima

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors.

Susumu Kiyoshima

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022

Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash.

Susumu Kiyoshima

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness.

Susumu Kiyoshima

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

2020

Round-Optimal Black-Box Commit-and-Prove with Succinct Communication.

Susumu Kiyoshima

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Non-black-box Simulation in the Fully Concurrent Setting, Revisited.

Susumu Kiyoshima

J. Cryptol., 2019

2018

No-signaling Linear PCPs.

Susumu Kiyoshima

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

A New Approach to Black-Box Concurrent Secure Computation.

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017

A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models.

Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

On the Exact Round Complexity of Self-composable Two-Party Computation.

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016

Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance.

Susumu Kiyoshima

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015

An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting.

Susumu Kiyoshima

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions.

Susumu Kiyoshima

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Garbling Scheme for Formulas with Constant Size of Garbled Gates.

Carmen Kempka, Ryo Kikuchi, Susumu Kiyoshima, Koutarou Suzuki

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014

Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol.

Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Round-Efficient Black-Box Construction of Composable Multi-Party Computation.

Susumu Kiyoshima

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2012

Constant-Time Approximation Algorithms for the Knapsack Problem.

Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida

Proceedings of the Theory and Applications of Models of Computation, 2012

Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security.

Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

Proceedings of the Advances in Information and Computer Security, 2012