{"created":"2023-06-20T13:20:48.647921+00:00","id":864,"links":{},"metadata":{"_buckets":{"deposit":"fbcc0d69-9bfa-4a47-a13d-6b34a70db11c"},"_deposit":{"created_by":1,"id":"864","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"864"},"status":"published"},"_oai":{"id":"oai:ir.soken.ac.jp:00000864","sets":["2:429:19"]},"author_link":["0","0","0"],"item_1_creator_2":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"HUDA, MD. Nurul"}],"nameIdentifiers":[{"nameIdentifier":"0","nameIdentifierScheme":"WEKO"}]}]},"item_1_creator_3":{"attribute_name":"フリガナ","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"モハマドフーダヌルル"}],"nameIdentifiers":[{"nameIdentifier":"0","nameIdentifierScheme":"WEKO"}]}]},"item_1_date_granted_11":{"attribute_name":"学位授与年月日","attribute_value_mlt":[{"subitem_dategranted":"2007-03-23"}]},"item_1_degree_grantor_5":{"attribute_name":"学位授与機関","attribute_value_mlt":[{"subitem_degreegrantor":[{"subitem_degreegrantor_name":"総合研究大学院大学"}]}]},"item_1_degree_name_6":{"attribute_name":"学位名","attribute_value_mlt":[{"subitem_degreename":"博士(情報学)"}]},"item_1_description_12":{"attribute_name":"要旨","attribute_value_mlt":[{"subitem_description":"A multi-party computation (MPC) allows η parties to compute an agreed-upon func- <br />tion of their inputs and every party learns the correct function output. To solve a <br />multi-party computation problem (MPCP), the participants may need to share their <br />private data (inputs) between one another, resulting in data privacy loss. The key <br />research issue that has been addressed in this thesis is - how to solve multi-party <br />computation problems without disclosing anyone's private data to others. <br /><br />   Firstly, by studying and analyzing the traditional computational models, we have <br />devised a privacy loss model for multi-party computation problems and proposed a <br />novel metric, called the Min privacy metric, for quantitatively measuring the amount <br />of data privacy loss in solving the MPCPs. Then, we have presented a mobile agent- <br />based scheduling algorithm that applies pseudonymization technique to reduce data <br />privacy loss. Finally, we have proposed the security system design, including security <br />policies and security architecture, of an agent server platform for enhancing data <br />privacy protection while solving the MPCPs.<br /><br />   The privacy loss model has identified three factors affecting the amount of privacy <br />loss in solving the MPCPs: (1) the fraction ofprivate data which is shared with others, <br />(2) the probability of associating the shared private data with the data subject, and <br />(3) the probability of disclosing the shared private data to unauthorized parties.<br />Privacy loss can be reduced by any mechanisms which reduces the values of any <br />of the three factors. The proposed Min privacy metric accounts for the number of <br />participants that lose their private data and the amount of private data disclosed to <br />unauthorized parties, regardless of how many parties they are revealed to. <br /><br />  Existing scheduling algorithms aim for a global objective function. As a result,<br />they incur performance penalties in computational complexity and data privacy. This <br />thesis describes a mobile agent-based scheduling scheme called Efiicient and Privacy-<br />aware Meeting Scheduling (EPMS), which results in a tradeoff arnong complexity,<br />privacy, and global utility for scheduling multiple events concurrently. We have intro- <br />duced multiple criteria for evaluating privacy in the meeting scheduling problem. A <br />common computational space has been utilized in EPMS for reducing the complexity <br />and pseudonymization technique has been applied to reduce the privacy loss in the <br />scheduling problem. The analytical results show that EPMS has a polynomial time <br />computational complexity. In addition, simulation results show that the obtained <br />global utility for scheduling multiple meetings with EPMS is close to the optimal <br />level and the resulting privacy loss is less than for those in extsting algorithms. <br />   Cryptography-based aJgorithms for MPCPs are either too complex to be used <br />practically or applicable only to the specific applications for which they have been <br />developed. In addition, traditional (non-cryptography-based) algorithms do not pro- <br />vide good privacy protection for MPCPs. We have proposed a novel privacy pro- <br />tection mechanism in which MPCPs are solved by mobile agents using traditional <br />algorithms at an agent server platform, called isolated Closed-door One-way Plat- <br />form (iCOP). The participating mobile agents are trapped into iCOP where they <br />are allowed to share their private information to solve the problem using traditional <br />algorithms. However, they are protected from disclosing the shared private infor- <br />mation to the outside world. The enforcement of the security policies protects the <br />participating agents from sending anything other than the computational result to <br />the users. The security and privacy analysis illustrates that the proposed mechanism <br />provides very good privacy protection if the participants solve the problem with dis- <br />tributed algorithms and can provide complete privacy protection if the participants <br />exchange inputs within the iCOP and each of them solve the problem with centralized <br />algorithms. Finally, experimental evaluation shows that the proposed agent platform <br />security system significantly enhances privacy protection while solving many MPCPs <br />with traditional algorithms.<br /> ","subitem_description_type":"Other"}]},"item_1_description_18":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_1_description_7":{"attribute_name":"学位記番号","attribute_value_mlt":[{"subitem_description":"総研大甲第1054号","subitem_description_type":"Other"}]},"item_1_select_14":{"attribute_name":"所蔵","attribute_value_mlt":[{"subitem_select_item":"有"}]},"item_1_select_8":{"attribute_name":"研究科","attribute_value_mlt":[{"subitem_select_item":"複合科学研究科"}]},"item_1_select_9":{"attribute_name":"専攻","attribute_value_mlt":[{"subitem_select_item":"17 情報学専攻"}]},"item_1_text_10":{"attribute_name":"学位授与年度","attribute_value_mlt":[{"subitem_text_value":"2006"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"HUDA, MD. Nurul","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"0","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-02-17"}],"displaytype":"simple","filename":"甲1054_要旨.pdf","filesize":[{"value":"322.2 kB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"要旨・審査要旨","url":"https://ir.soken.ac.jp/record/864/files/甲1054_要旨.pdf"},"version_id":"d6033db3-b71e-44e8-a2a2-88b62c17bac0"},{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-02-17"}],"displaytype":"simple","filename":"甲1054_本文.pdf","filesize":[{"value":"14.1 MB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"本文","url":"https://ir.soken.ac.jp/record/864/files/甲1054_本文.pdf"},"version_id":"de08fa80-539a-41cf-9bb2-c14cca6a3402"}]},"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":"A Mobile Agent-based Privacy Protection Mechanism in Solving Multi-party Computation Problems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Mobile Agent-based Privacy Protection Mechanism in Solving Multi-party Computation Problems"},{"subitem_title":"A Mobile Agent-based Privacy Protection Mechanism in Solving Multi-party Computation Problems","subitem_title_language":"en"}]},"item_type_id":"1","owner":"1","path":["19"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-02-22"},"publish_date":"2010-02-22","publish_status":"0","recid":"864","relation_version_is_last":true,"title":["A Mobile Agent-based Privacy Protection Mechanism in Solving Multi-party Computation Problems"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-06-20T16:10:44.337356+00:00"}