Return to search

A Study on Cryptographic Protocols: Achieving Strong Security for Zero-knowledge Proofs and Secure Computation / 暗号プロトコルに関する研究 : ゼロ知識証明と秘密計算における高度な安全性の実現について

京都大学 / 0048 / 新制・論文博士 / 博士(情報学) / 乙第13184号 / 論情博第94号 / 新制||情||116(附属図書館) / (主査)教授 石田 亨, 教授 中村 佳正, 教授 岡部 寿男, 教授 岡本 龍明 / 学位規則第4条第2項該当 / Doctor of Informatics / Kyoto University / DFAM

Identiferoai:union.ndltd.org:kyoto-u.ac.jp/oai:repository.kulib.kyoto-u.ac.jp:2433/232156
Date26 March 2018
CreatorsKiyoshima, Susumu
Contributors石田, 亨, 中村, 佳正, 岡部, 寿男, 岡本, 龍明, 清島, 奨, キヨシマ, ススム
PublisherKyoto University, 京都大学
Source SetsKyoto University
LanguageEnglish
Detected LanguageEnglish
Typedoctoral thesis, Thesis or Dissertation
Formatapplication/pdf
Rights学位規則第9条第2項により要約公開, 許諾条件により本文は2024-10-01に公開, This thesis contains parts of the following earlier/subsequent publications. [Chapter 3] (1) Susumu Kiyoshima. Statistical concurrent non-malleable zero-knowledge from one-way functions. CRYPTO 2015. Volume 9216 of LNCS, pages 85-106. ©IACR 2015, https://dx.doi.org/10.1007/978-3-662-48000-7_5. (2) Susumu Kiyoshima. Statistical concurrent non-malleable zero-knowledge from one-way functions. Journal of Cryptology, Volume 33, pages 1318-1361, 2020. ©IACR 2020, https://doi.org/10.1007/s00145-020-09348-x. [Chapter 4] (1) Susumu Kiyoshima. Constant-round leakage-resilient zero-knowledge from collision resistance. EUROCRYPT 2016. Volume 9666 of LNCS, pages 93-123. ©IACR 2016, https://dx.doi.org/10.1007/978-3-662-49896-5_4. (2) Susumu Kiyoshima. Constant-round leakage-resilient zero-knowledge from collision resistance. Journal of Cryptology, Volume 35, article number 16, 2022. ©IACR 2022, https://doi.org/10.1007/s00145-022-09426-2. [Chapter 5] (1) Susumu Kiyoshima. An alternative approach to non-black-box simulation in fully concurrent setting. TCC 2015. Volume 9014 of LNCS, pages 290-318. ©IACR 2015, https://dx.doi.org/10.1007/978-3-662-46494-6_13. (2) Susumu Kiyoshima. Non-black-box simulation in the fully concurrent setting, revisited. Journal of Cryptology, Volume 32, pages 393-434, 2019. ©IACR 2019, https://doi.org/10.1007/s00145-018-09309-5. [Chapter 6] (1) Susumu Kiyoshima. Round-efficient black-box construction of composable multi-party computation. CRYPTO 2014. Volume 8617 of LNCS, pages 351-368. ©IACR 2014, https://dx.doi.org/10.1007/978-3-662-44381-1_20. (2) Susumu Kiyoshima. Round-efficient black-box construction of composable multi-party computation. Journal of Cryptology, Volume 32, pages 178-238, 2019. ©IACR 2019, https://doi.org/10.1007/s00145-018-9276-1.

Page generated in 0.0178 seconds