WEKO3
アイテム
{"_buckets": {"deposit": "28e4fd13-7644-447f-b422-f481c3db7d99"}, "_deposit": {"created_by": 3, "id": "1137", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "1137"}, "status": "published"}, "_oai": {"id": "oai:uec.repo.nii.ac.jp:00001137", "sets": ["14"]}, "author_link": ["7100"], "control_number": "1137", "item_10006_alternative_title_1": {"attribute_name": "その他(別言語等)のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "比較器ネットワークを用いた安全なマルチパーティプロトコル", "subitem_alternative_title_language": "ja"}]}, "item_10006_date_granted_11": {"attribute_name": "学位授与年月日", "attribute_value_mlt": [{"subitem_dategranted": "2009-03-24"}]}, "item_10006_degree_grantor_9": {"attribute_name": "学位授与機関", "attribute_value_mlt": [{"subitem_degreegrantor": [{"subitem_degreegrantor_name": "電気通信大学"}]}]}, "item_10006_degree_name_8": {"attribute_name": "学位名", "attribute_value_mlt": [{"subitem_degreename": "博士(工学)"}]}, "item_10006_description_10": {"attribute_name": "学位授与年度", "attribute_value_mlt": [{"subitem_description": "2008", "subitem_description_type": "Other"}]}, "item_10006_description_7": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We consider statistical analysis with preserving the privacy of respondents. Wepropose a secure multiparty protocol using comparator networks for variouscomputations in statistical analysis. The comparator networks sort or searchtheir input values to obtain the maximum, minimum, median, quartiles, andso on. In the protocol, both the input values of a comparator network andthe intermediate outputs are kept secret, assuming the presence of an honestmajority. The proposed protocol employs secure circuit evaluations which canbe applied to compute a comparator network safely. The secure circuit evaluationis one of the cryptographic protocols that enables arbitrary operationson encrypted data without decryption. To anonymize the input values of theprotocol, we use the MIX-net, which is a cryptographic anonymous channel.The input values are shuffled by the MIX-net before applying a comparatornetwork. We discuss the effectiveness of the protocol for computing severalstatistics through a comparator network. We also introduce an application ofthe protocol to a secure (m+1)-st price auction, in which the highest m bidderswin and pay a uniform price determined by the (m + 1)-st price.We give another result of studies in merging networks. A merging networkis a comparator network that merges two sorted sequences. Let M(m, n) be theminimum number of comparators that construct an (m, n)-merging network,i.e., an optimal (m, n)-merging network consists of M(m, n) comparators. Weshow that Batcher’s (6, 8k+7)-, (9, 16k+9)-, (7, 8)-merging networks are optimalfor all k 0. Under an assumption of the existence of several comparatorsin an optimal merging network, we show that M(n, n) = M(n - 1, n) + 1 =M(n - 2, n) + 3.", "subitem_description_type": "Abstract"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "諸橋, 玄武", "creatorNameLang": "ja"}, {"creatorName": "モロハシ, ゲンブ", "creatorNameLang": "ja-Kana"}, {"creatorName": "Morohashi, Gembu", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "7100", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-09-16"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "9000000337.pdf", "filesize": [{"value": "292.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 292700.0, "url": {"label": "9000000337.pdf", "url": "https://uec.repo.nii.ac.jp/record/1137/files/9000000337.pdf"}, "version_id": "d2d109d3-6b25-432c-8e01-85d1202140e5"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "thesis", "resourceuri": "http://purl.org/coar/resource_type/c_46ec"}]}, "item_title": "Secure Multiparty Protocol Using Comparator Networks", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Secure Multiparty Protocol Using Comparator Networks", "subitem_title_language": "en"}]}, "item_type_id": "10006", "owner": "3", "path": ["14"], "permalink_uri": "https://uec.repo.nii.ac.jp/records/1137", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2009-03-24"}, "publish_date": "2009-03-24", "publish_status": "0", "recid": "1137", "relation": {}, "relation_version_is_last": true, "title": ["Secure Multiparty Protocol Using Comparator Networks"], "weko_shared_id": -1}
Secure Multiparty Protocol Using Comparator Networks
https://uec.repo.nii.ac.jp/records/1137
https://uec.repo.nii.ac.jp/records/1137cc9eaa20-1053-4697-838a-6ae23ba001e7
名前 / ファイル | ライセンス | アクション |
---|---|---|
9000000337.pdf (292.7 kB)
|
|
Item type | 学位論文 / Thesis or Dissertation(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2009-03-24 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Secure Multiparty Protocol Using Comparator Networks | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_46ec | |||||
資源タイプ | thesis | |||||
その他(別言語等)のタイトル | ||||||
その他のタイトル | 比較器ネットワークを用いた安全なマルチパーティプロトコル | |||||
言語 | ja | |||||
著者 |
諸橋, 玄武
× 諸橋, 玄武 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | We consider statistical analysis with preserving the privacy of respondents. Wepropose a secure multiparty protocol using comparator networks for variouscomputations in statistical analysis. The comparator networks sort or searchtheir input values to obtain the maximum, minimum, median, quartiles, andso on. In the protocol, both the input values of a comparator network andthe intermediate outputs are kept secret, assuming the presence of an honestmajority. The proposed protocol employs secure circuit evaluations which canbe applied to compute a comparator network safely. The secure circuit evaluationis one of the cryptographic protocols that enables arbitrary operationson encrypted data without decryption. To anonymize the input values of theprotocol, we use the MIX-net, which is a cryptographic anonymous channel.The input values are shuffled by the MIX-net before applying a comparatornetwork. We discuss the effectiveness of the protocol for computing severalstatistics through a comparator network. We also introduce an application ofthe protocol to a secure (m+1)-st price auction, in which the highest m bidderswin and pay a uniform price determined by the (m + 1)-st price.We give another result of studies in merging networks. A merging networkis a comparator network that merges two sorted sequences. Let M(m, n) be theminimum number of comparators that construct an (m, n)-merging network,i.e., an optimal (m, n)-merging network consists of M(m, n) comparators. Weshow that Batcher’s (6, 8k+7)-, (9, 16k+9)-, (7, 8)-merging networks are optimalfor all k 0. Under an assumption of the existence of several comparatorsin an optimal merging network, we show that M(n, n) = M(n - 1, n) + 1 =M(n - 2, n) + 3. | |||||
学位名 | ||||||
学位名 | 博士(工学) | |||||
学位授与機関 | ||||||
学位授与機関名 | 電気通信大学 | |||||
学位授与年度 | ||||||
内容記述タイプ | Other | |||||
内容記述 | 2008 | |||||
学位授与年月日 | ||||||
学位授与年月日 | 2009-03-24 |