Susumu Kiyoshima

发表

Round-optimal Black-box Commit-and-prove with Succinct Communication

Susumu Kiyoshima, Susumu Kiyoshima, 2020, IACR Cryptol. ePrint Arch..

Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions

Susumu Kiyoshima, Susumu Kiyoshima, 2015, Journal of Cryptology.

No-Signaling Linear PCPs

Susumu Kiyoshima, Susumu Kiyoshima, 2018, Journal of Cryptology.

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

Susumu Kiyoshima, 2014, CRYPTO.

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

Susumu Kiyoshima, Susumu Kiyoshima, 2016, Journal of Cryptology.

Constant-Round Concurrent Zero-Knowledge in Super-Polynomial Simulation Security

Tatsuaki Okamoto, Susumu Kiyoshima, Yoshifumi Manabe, 2012 .

A New Approach to Black-Box Concurrent Secure Computation

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey, 2018, IACR Cryptol. ePrint Arch..

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

Susumu Kiyoshima, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2017, TCC.

A Study on Cryptographic Protocols: Achieving Strong Security for Zero-knowledge Proofs and Secure Computation

Susumu Kiyoshima, 2018 .

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

Tatsuaki Okamoto, Susumu Kiyoshima, Yoshifumi Manabe, 2014, TCC.

Constant-Time Approximation Algorithms for the Knapsack Problem

Yuichi Yoshida, Hiro Ito, Susumu Kiyoshima, 2012, TAMC.

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

Susumu Kiyoshima, Susumu Kiyoshima, 2019, Journal of Cryptology.

Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security

Tatsuaki Okamoto, Susumu Kiyoshima, Yoshifumi Manabe, 2012, IWSEC.

Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions

Susumu Kiyoshima, 2020, Journal of Cryptology.

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

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey, 2017, EUROCRYPT.

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

Susumu Kiyoshima, 2018, Journal of Cryptology.

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

Susumu Kiyoshima, 2015, TCC.

Garbling Scheme for Formulas with Constant Size of Garbled Gates

Koutarou Suzuki, Susumu Kiyoshima, Ryo Kikuchi, 2015, ASIACRYPT.

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

Susumu Kiyoshima, Susumu Kiyoshima, 2021, IACR Cryptol. ePrint Arch..