default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSusumu Kiyoshima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Susumu Kiyoshima:
Resettable Statistical Zero-Knowledge for $\ensuremath {\textsf{NP}}$. CRYPTO (9) 2024: 288-320- [i15]Susumu Kiyoshima:
Resettable Statistical Zero-Knowledge for NP. IACR Cryptol. ePrint Arch. 2024: 806 (2024) - 2023
- [j5]Susumu Kiyoshima:
No-Signaling Linear PCPs. J. Cryptol. 36(2): 9 (2023) - [c16]Susumu Kiyoshima:
Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors. TCC (3) 2023: 333-362 - [i14]Susumu Kiyoshima:
Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors. IACR Cryptol. ePrint Arch. 2023: 1500 (2023) - 2022
- [j4]Susumu Kiyoshima:
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance. J. Cryptol. 35(3): 16 (2022) - [c15]Susumu Kiyoshima:
Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash. CRYPTO (1) 2022: 444-473 - [i13]Susumu Kiyoshima:
Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash. IACR Cryptol. ePrint Arch. 2022: 820 (2022) - 2021
- [c14]Susumu Kiyoshima:
Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness. TCC (1) 2021: 369-400 - [i12]Susumu Kiyoshima:
Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness. IACR Cryptol. ePrint Arch. 2021: 1214 (2021) - 2020
- [j3]Susumu Kiyoshima:
Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions. J. Cryptol. 33(3): 1318-1361 (2020) - [c13]Susumu Kiyoshima:
Round-Optimal Black-Box Commit-and-Prove with Succinct Communication. CRYPTO (2) 2020: 533-561 - [i11]Susumu Kiyoshima:
Round-optimal Black-box Commit-and-prove with Succinct Communication. IACR Cryptol. ePrint Arch. 2020: 832 (2020)
2010 – 2019
- 2019
- [j2]Susumu Kiyoshima:
Round-Efficient Black-Box Construction of Composable Multi-Party Computation. J. Cryptol. 32(1): 178-238 (2019) - [j1]Susumu Kiyoshima:
Non-black-box Simulation in the Fully Concurrent Setting, Revisited. J. Cryptol. 32(2): 393-434 (2019) - 2018
- [c12]Sanjam Garg, Susumu Kiyoshima, Omkant Pandey:
A New Approach to Black-Box Concurrent Secure Computation. EUROCRYPT (2) 2018: 566-599 - [c11]Susumu Kiyoshima:
No-signaling Linear PCPs. TCC (1) 2018: 67-97 - [i10]Sanjam Garg
, Susumu Kiyoshima, Omkant Pandey:
A New Approach to Black-Box Concurrent Secure Computation. IACR Cryptol. ePrint Arch. 2018: 156 (2018) - [i9]Susumu Kiyoshima:
No-signaling Linear PCPs. IACR Cryptol. ePrint Arch. 2018: 649 (2018) - 2017
- [c10]Sanjam Garg, Susumu Kiyoshima, Omkant Pandey:
On the Exact Round Complexity of Self-composable Two-Party Computation. EUROCRYPT (2) 2017: 194-224 - [c9]Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam:
A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models. TCC (1) 2017: 776-809 - [i8]Sanjam Garg, Susumu Kiyoshima, Omkant Pandey:
On the Exact Round Complexity of Self-Composable Two-Party Computation. IACR Cryptol. ePrint Arch. 2017: 124 (2017) - [i7]Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam:
A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models. IACR Cryptol. ePrint Arch. 2017: 944 (2017) - 2016
- [c8]Susumu Kiyoshima:
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance. EUROCRYPT (2) 2016: 93-123 - [i6]Carmen Kempka, Ryo Kikuchi, Susumu Kiyoshima, Koutarou Suzuki:
Garbling Scheme for Formulas with Constant Size of Garbled Gates. IACR Cryptol. ePrint Arch. 2016: 563 (2016) - 2015
- [c7]Carmen Kempka, Ryo Kikuchi, Susumu Kiyoshima, Koutarou Suzuki:
Garbling Scheme for Formulas with Constant Size of Garbled Gates. ASIACRYPT (1) 2015: 758-782 - [c6]Susumu Kiyoshima:
Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions. CRYPTO (2) 2015: 85-106 - [c5]Susumu Kiyoshima:
An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting. TCC (1) 2015: 290-318 - [i5]Susumu Kiyoshima:
An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting. IACR Cryptol. ePrint Arch. 2015: 67 (2015) - [i4]Susumu Kiyoshima:
Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions. IACR Cryptol. ePrint Arch. 2015: 620 (2015) - [i3]Susumu Kiyoshima:
Constant-round Leakage-resilient Zero-knowledge from Collision Resistance. IACR Cryptol. ePrint Arch. 2015: 1235 (2015) - 2014
- [c4]Susumu Kiyoshima:
Round-Efficient Black-Box Construction of Composable Multi-Party Computation. CRYPTO (2) 2014: 351-368 - [c3]Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto:
Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. TCC 2014: 343-367 - [i2]Susumu Kiyoshima:
Round-Efficient Black-Box Construction of Composable Multi-Party Computation. IACR Cryptol. ePrint Arch. 2014: 557 (2014) - 2013
- [i1]Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto:
Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. IACR Cryptol. ePrint Arch. 2013: 811 (2013) - 2012
- [c2]Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto:
Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security. IWSEC 2012: 216-232 - [c1]Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida:
Constant-Time Approximation Algorithms for the Knapsack Problem. TAMC 2012: 131-142
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
