WEKO3
アイテム
{"_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": ["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_35": {"attribute_name": "公開日(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "Mar 19, 2008 09:00:00"}]}, "item_120_text_36": {"attribute_name": "記録日(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "2008-03-19"}]}, "item_120_text_37": {"attribute_name": "最終更新日(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "Jun 23, 2017 10:21:48"}]}, "item_120_text_38": {"attribute_name": "公開日(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "Mar 19, 2008 09:00:00"}]}, "item_120_text_39": {"attribute_name": "更新履歴(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "Jun 23, 2017 著者 を変更"}, {"subitem_text_value": "Aug 5, 2014 出版者 ローマ字, 作成日, 更新日, 記録日, 上位タイトル, 翻訳, 版, 著者 を変更"}, {"subitem_text_value": "Sep 8, 2009 フリーキーワード, 著者 を変更"}, {"subitem_text_value": "Mar 18, 2009 フリーキーワード, キーワード を変更"}, {"subitem_text_value": "Oct 17, 2008 フリーキーワード, インデックス, キーワード を変更"}, {"subitem_text_value": "Mar 24, 2008 タイトル, フリーキーワード, インデックス, タイトル タイトル, 上位タイトル, キーワード を変更"}, {"subitem_text_value": "Mar 19, 2008 ID, フリーキーワード, インデックス, キーワード を変更"}]}, "item_120_text_4": {"attribute_name": "著者 所属", "attribute_value_mlt": [{"subitem_text_value": "埼玉大学大学院理工学研究科数理電子情報部門"}]}, "item_120_text_40": {"attribute_name": "登録者(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "sucra_jim4"}]}, "item_120_text_41": {"attribute_name": "閲覧数(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "1455"}]}, "item_120_text_42": {"attribute_name": "ダウンロード数(XooNIps)", "attribute_value_mlt": [{"subitem_text_value": "735"}]}, "item_120_text_43": {"attribute_name": "XooNIps_インデックス", "attribute_value_mlt": [{"subitem_text_value": "sucra_jim4|Public/埼玉大学/理工学研究科|Public/埼玉大学/理工学研究科/数理電子情報部門|Public/主題別/総合領域/情報学/ソフトウェア|Public/ジャンル別/研究紀要/埼玉大学/工学部紀要"}]}, "item_120_text_44": {"attribute_name": "XooNIps_ITEM_KEY", "attribute_value_mlt": [{"subitem_text_value": "2078"}]}, "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": [{"nameIdentifier": "26220", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SERI, Yoshiharu"}, {"creatorName": "セリ, ヨシハル", "creatorNameLang": "ja-Kana"}], "nameIdentifiers": [{"nameIdentifier": "26221", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-01-24"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "KY-AN00095842-39-07.pdf", "filesize": [{"value": "827.0 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 827000.0, "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\u003c論文\u003e", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes\u003c論文\u003e"}]}, "item_type_id": "120", "owner": "3", "path": ["518"], "permalink_uri": "https://doi.org/10.24561/00016110", "pubdate": {"attribute_name": "公開日", "attribute_value": "2008-03-19"}, "publish_date": "2008-03-19", "publish_status": "0", "recid": "16116", "relation": {}, "relation_version_is_last": true, "title": ["Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes\u003c論文\u003e"], "weko_shared_id": -1}
Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes<論文>
https://doi.org/10.24561/00016110
https://doi.org/10.24561/0001611026bee643-6930-4b2f-aa6c-b3399a553bf9
名前 / ファイル | ライセンス | アクション |
---|---|---|
KY-AN00095842-39-07.pdf (827.0 kB)
|
|
Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2008-03-19 | |||||
タイトル | ||||||
タイトル | Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes<論文> | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | bit commitment | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | computational binding | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | one-way permutation | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | perfect concealing | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | round complexity | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | zero-knowledge argument | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
ID登録 | ||||||
ID登録 | 10.24561/00016110 | |||||
ID登録タイプ | JaLC | |||||
著者 |
小柴, 健史
× 小柴, 健史× SERI, Yoshiharu |
|||||
著者 ローマ字 | ||||||
KOSHIBA, Takeshi | ||||||
著者 所属 | ||||||
埼玉大学大学院理工学研究科数理電子情報部門 | ||||||
著者 所属(別言語) | ||||||
Graduate School of Science and Engineering, Saitama University | ||||||
書誌情報 |
埼玉大学紀要. 工学部 第1編 第1部 論文集 en : The Science and Engineering Reports of Saitama University 巻 39, p. 40-47, 発行日 2006 |
|||||
年月次 | ||||||
2006-7 | ||||||
出版者名 | ||||||
出版者 | 埼玉大学工学部 | |||||
出版者名(別言語) | ||||||
出版者 | Faculty of Engineering, Saitama University | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 18804446 | |||||
概要 | ||||||
内容記述タイプ | Other | |||||
内容記述 | 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. | |||||
版 | ||||||
[出版社版] | ||||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
資源タイプ | ||||||
内容記述タイプ | Other | |||||
内容記述 | text | |||||
フォーマット | ||||||
内容記述タイプ | Other | |||||
内容記述 | application/pdf | |||||
作成日 | ||||||
日付 | 2008-03-19 | |||||
日付タイプ | Created | |||||
アイテムID | ||||||
KY-AN00095842-39-07 |