Access count of this item: 63

Files in This Item:
File Description SizeFormat 
yjohr00094.pdfAbstract_要旨554.08 kBAdobe PDFView/Open
gjohr00094.pdfDigest_要約18.17 kBAdobe PDFView/Open
Title: A Study on Cryptographic Protocols: Achieving Strong Security for Zero-knowledge Proofs and Secure Computation
Other Titles: 暗号プロトコルに関する研究 : ゼロ知識証明と秘密計算における高度な安全性の実現について
Authors: Kiyoshima, Susumu
Author's alias: 清島, 奨
Keywords: Cryptography
Cryptographic protocol
Zero-knowledge proof
Secure computation
Concurrent security
Leakage resilience
Issue Date: 26-Mar-2018
Publisher: Kyoto University
Conferring University: Kyoto University (京都大学)
Degree Level: 新制・論文博士
Degree Discipline: 博士(情報学)
Degree Report no.: 乙第13184号
Degree no.: 論情博第94号
Degree Call no.: 新制||情||116(附属図書館)
Examination Committee members: (主査)教授 石田 亨, 教授 中村 佳正, 教授 岡部 寿男, 教授 岡本 龍明
Provisions of the Ruling of Degree: 学位規則第4条第2項該当
Rights: 学位規則第9条第2項により要約公開
This thesis is based on the following earlier publications. ; Chapter 3. Susumu Kiyoshima. Statistical concurrent non-malleable zero-knowledge from one-way functions. CRYPTO 2015. Volume 9216 of LNCS, pages 85–106. ©IACR 2015. ; Chapter 4.Susumu Kiyoshima. Constant-round leakage-resilient zero-knowledge from collision resistance. EUROCRYPT 2016. Volume 9666 of LNCS, pages 93–123. ©IACR 2016. ; Chapter 5. 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. ; Chapter 6. Susumu Kiyoshima. Round-efficient black-box construction of composable multi-party computation. CRYPTO 2014. Volume 8617 of LNCS, pages 351–368. ©IACR 2014.
DOI: 10.14989/doctor.r13184
URI: http://hdl.handle.net/2433/232156
Appears in Collections:Doctoral Dissertation (Informatics)

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.