{"created":"2023-05-15T15:27:21.219778+00:00","id":16116,"links":{},"metadata":{"_buckets":{"deposit":"0bc47462-89bf-4d6b-a7c1-7f0716c24de7"},"_deposit":{"created_by":3,"id":"16116","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"16116"},"status":"published"},"_oai":{"id":"oai:sucra.repo.nii.ac.jp:00016116","sets":["89:355:518"]},"author_link":["26220","26221"],"item_120_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2006","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"47","bibliographicPageStart":"40","bibliographicVolumeNumber":"39","bibliographic_titles":[{"bibliographic_title":"埼玉大学紀要. 工学部 第1編 第1部 論文集"},{"bibliographic_title":"The Science and Engineering Reports of Saitama University","bibliographic_titleLang":"en"}]}]},"item_120_date_31":{"attribute_name":"作成日","attribute_value_mlt":[{"subitem_date_issued_datetime":"2008-03-19","subitem_date_issued_type":"Created"}]},"item_120_description_19":{"attribute_name":"概要","attribute_value_mlt":[{"subitem_description":"We improve the upper bound on the round complexity for perfectly concealing bit commitment schemes based on the general computational assumption. The best known scheme is the one-way permutation based scheme due to Naor, Ostrovsky, Venkatesan and Yung and its round complexity is O(n). We consider a naive parallel version of their scheme of the multiplicity log n and obtain an O(n/ log n)-round scheme. Our improvement answers a question, raised by them, whether their O(n)-round scheme is essential with respect to the round complexity. Though such a parallelization raises an analytic difficulty, we introduce a new analysis technique and then overcome the difficulty. Our technique copes with expected almost pairwise independent random variables instead of the pairwise independence, which is a key property in their analysis. While the expected almost pairwise independence plays an important role in our security proof, it also provides alternative security proof for the original scheme.","subitem_description_type":"Other"}]},"item_120_description_29":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"text","subitem_description_type":"Other"}]},"item_120_description_30":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_120_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.24561/00016110","subitem_identifier_reg_type":"JaLC"}]},"item_120_publisher_11":{"attribute_name":"出版者名","attribute_value_mlt":[{"subitem_publisher":"埼玉大学工学部"}]},"item_120_publisher_12":{"attribute_name":"出版者名（別言語）","attribute_value_mlt":[{"subitem_publisher":"Faculty of Engineering, Saitama University"}]},"item_120_source_id_14":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"18804446","subitem_source_identifier_type":"ISSN"}]},"item_120_text_27":{"attribute_name":"版","attribute_value_mlt":[{"subitem_text_value":"[出版社版]"}]},"item_120_text_3":{"attribute_name":"著者 ローマ字","attribute_value_mlt":[{"subitem_text_value":"KOSHIBA, Takeshi"}]},"item_120_text_32":{"attribute_name":"アイテムID","attribute_value_mlt":[{"subitem_text_value":"KY-AN00095842-39-07"}]},"item_120_text_4":{"attribute_name":"著者 所属","attribute_value_mlt":[{"subitem_text_value":"埼玉大学大学院理工学研究科数理電子情報部門"}]},"item_120_text_5":{"attribute_name":"著者 所属(別言語)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Science and Engineering, Saitama University"}]},"item_120_text_9":{"attribute_name":"年月次","attribute_value_mlt":[{"subitem_text_value":"2006-7"}]},"item_120_version_type_28":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小柴, 健史"},{"creatorName":"コシバ, タケシ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"SERI, Yoshiharu"},{"creatorName":"セリ, ヨシハル","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-01-24"}],"displaytype":"detail","filename":"KY-AN00095842-39-07.pdf","filesize":[{"value":"827.0 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KY-AN00095842-39-07.pdf","url":"https://sucra.repo.nii.ac.jp/record/16116/files/KY-AN00095842-39-07.pdf"},"version_id":"c5815a52-42e7-4135-b6bc-663d002d8403"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"bit commitment","subitem_subject_scheme":"Other"},{"subitem_subject":"computational binding","subitem_subject_scheme":"Other"},{"subitem_subject":"one-way permutation","subitem_subject_scheme":"Other"},{"subitem_subject":"perfect concealing","subitem_subject_scheme":"Other"},{"subitem_subject":"round complexity","subitem_subject_scheme":"Other"},{"subitem_subject":"zero-knowledge argument","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes<論文>","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes<論文>"}]},"item_type_id":"120","owner":"3","path":["518"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-03-19"},"publish_date":"2008-03-19","publish_status":"0","recid":"16116","relation_version_is_last":true,"title":["Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes<論文>"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-05-15T18:50:57.943509+00:00"}