WEKO3
アイテム
{"_buckets": {"deposit": "bc6e03d2-1267-4f2e-a29f-0fe7d6dc2b22"}, "_deposit": {"created_by": 13, "id": "9975", "owners": [13], "pid": {"revision_id": 0, "type": "depid", "value": "9975"}, "status": "published"}, "_oai": {"id": "oai:uec.repo.nii.ac.jp:00009975", "sets": ["6"]}, "author_link": ["26697", "26698", "26699", "26700"], "control_number": "9975", "item_10001_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2019-09-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "9", "bibliographicPageEnd": "1090", "bibliographicPageStart": "1079", "bibliographicVolumeNumber": "E102.A", "bibliographic_titles": [{"bibliographic_title": "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences", "bibliographic_titleLang": "en"}]}]}, "item_10001_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In recent years, multi-party computation (MPC) frameworks based on replicated secret sharing schemes (RSSS) have attracted the attention as a method to achieve high efficiency among known MPCs. However, the RSSS-based MPCs are still inefficient for several heavy computations like algebraic operations, as they require a large amount and number of communication proportional to the number of multiplications in the operations (which is not the case with other secret sharing-based MPCs). In this paper, we propose RSSS-based three-party computation protocols for modular exponentiation, which is one of the most popular algebraic operations, on the case where the base is public and the exponent is private. Our proposed schemes are simple and efficient in both of the asymptotic and practical sense. On the asymptotic efficiency, the proposed schemes require O(n)-bit communication and O(1) rounds,where n is the secret-value size, in the best setting, whereas the previous scheme requires O(n^2)-bit communication and O(n) rounds. On the practical efficiency, we show the performance of our protocol by experiments on the scenario for distributed signatures, which is useful for secure key management on the distributed environment (e.g., distributed ledgers). As one of the cases, our implementation performs a modular exponentiation on a 3,072-bit discrete-log group and 256-bit exponent with roughly 300ms, which is an acceptable parameter for 128-bit security, even in the WAN setting.", "subitem_description_type": "Abstract"}]}, "item_10001_publisher_8": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "The Institute of Electronics, Information and Communication Engineers"}]}, "item_10001_relation_14": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1587/transfun.E102.A.1079", "subitem_relation_type_select": "DOI"}}]}, "item_10001_relation_17": {"attribute_name": "関連サイト", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "https://search.ieice.org/index.html", "subitem_relation_type_select": "URI"}}]}, "item_10001_rights_15": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright (c) 2019 IEICE"}]}, "item_10001_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "09168508", "subitem_source_identifier_type": "ISSN"}]}, "item_10001_version_type_20": {"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": "OHARA, Kazuma", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "26697", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "WATANABE, Yohei", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "26698", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "IWAMOTO, Mitsugu", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "26699", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "OHTA, Kazuo", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "26700", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2021-04-16"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "(IEICE 2019) Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing.pdf", "filesize": [{"value": "1.3 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 1300000.0, "url": {"label": "(IEICE 2019) Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing", "url": "https://uec.repo.nii.ac.jp/record/9975/files/(IEICE 2019) Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing.pdf"}, "version_id": "6e25f1ed-9d88-43b3-be2e-fbcca2682d5b"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "multi-party computation", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "modular exponentiation", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "replicated secret sharing", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing", "subitem_title_language": "en"}]}, "item_type_id": "10001", "owner": "13", "path": ["6"], "permalink_uri": "https://uec.repo.nii.ac.jp/records/9975", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2021-04-16"}, "publish_date": "2021-04-16", "publish_status": "0", "recid": "9975", "relation": {}, "relation_version_is_last": true, "title": ["Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing"], "weko_shared_id": -1}
Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing
https://uec.repo.nii.ac.jp/records/9975
https://uec.repo.nii.ac.jp/records/9975dbcc6af3-5a88-498a-9843-216dd9c182d5
名前 / ファイル | ライセンス | アクション |
---|---|---|
(IEICE 2019) Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing (1.3 MB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2021-04-16 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
言語 | en | |||||
主題 | multi-party computation | |||||
キーワード | ||||||
言語 | en | |||||
主題 | modular exponentiation | |||||
キーワード | ||||||
言語 | en | |||||
主題 | replicated secret sharing | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
OHARA, Kazuma
× OHARA, Kazuma× WATANABE, Yohei× IWAMOTO, Mitsugu× OHTA, Kazuo |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | In recent years, multi-party computation (MPC) frameworks based on replicated secret sharing schemes (RSSS) have attracted the attention as a method to achieve high efficiency among known MPCs. However, the RSSS-based MPCs are still inefficient for several heavy computations like algebraic operations, as they require a large amount and number of communication proportional to the number of multiplications in the operations (which is not the case with other secret sharing-based MPCs). In this paper, we propose RSSS-based three-party computation protocols for modular exponentiation, which is one of the most popular algebraic operations, on the case where the base is public and the exponent is private. Our proposed schemes are simple and efficient in both of the asymptotic and practical sense. On the asymptotic efficiency, the proposed schemes require O(n)-bit communication and O(1) rounds,where n is the secret-value size, in the best setting, whereas the previous scheme requires O(n^2)-bit communication and O(n) rounds. On the practical efficiency, we show the performance of our protocol by experiments on the scenario for distributed signatures, which is useful for secure key management on the distributed environment (e.g., distributed ledgers). As one of the cases, our implementation performs a modular exponentiation on a 3,072-bit discrete-log group and 256-bit exponent with roughly 300ms, which is an acceptable parameter for 128-bit security, even in the WAN setting. | |||||
書誌情報 |
en : IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 巻 E102.A, 号 9, p. 1079-1090, 発行日 2019-09-01 |
|||||
出版者 | ||||||
出版者 | The Institute of Electronics, Information and Communication Engineers | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 09168508 | |||||
DOI | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1587/transfun.E102.A.1079 | |||||
権利 | ||||||
権利情報 | Copyright (c) 2019 IEICE | |||||
関連サイト | ||||||
識別子タイプ | URI | |||||
関連識別子 | https://search.ieice.org/index.html | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 |