分布式多重集众数及重数的保密计算
安全多方计算作为联合计算中隐私保护的核心技术, 为许多不同的隐私保护问题提供了解决方案, 目前关于多重集的众数及重数保密计算问题的研究很少. 本文设计了一种新的编码方案, 利用这种新的编码方案和 ElGamal 门限密码系统解决分布式多重集众数与重数的保密计算问题. 针对多重集是由多个参与者的单个隐私数据构成的情况, 设计了一个众数及重数的保密计算协议, 阈值众数保密计算协议和元素重数大于阈值的保密计算协议. 通过对编码方案的调整, 进一步针对多重集是由多个参与者的多重集构成的情况, 设计了多重集的并集的众数与重数的保密计算协议. 用广泛接受的模拟范例证明了协议在半诚实模型下是安全的. 理论分...
Gespeichert in:
| Veröffentlicht in: | Journal of Cryptologic Research 2023-02, Vol.10 (1), p.102-117 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Artikel |
| Sprache: | chi |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 117 |
|---|---|
| container_issue | 1 |
| container_start_page | 102 |
| container_title | Journal of Cryptologic Research |
| container_volume | 10 |
| creator | Zhu-Liang, JIA Xue-Ling, ZHAO Shun-Dong, LI 家珠亮 赵雪玲 李顺东 |
| description | 安全多方计算作为联合计算中隐私保护的核心技术, 为许多不同的隐私保护问题提供了解决方案, 目前关于多重集的众数及重数保密计算问题的研究很少. 本文设计了一种新的编码方案, 利用这种新的编码方案和 ElGamal 门限密码系统解决分布式多重集众数与重数的保密计算问题. 针对多重集是由多个参与者的单个隐私数据构成的情况, 设计了一个众数及重数的保密计算协议, 阈值众数保密计算协议和元素重数大于阈值的保密计算协议. 通过对编码方案的调整, 进一步针对多重集是由多个参与者的多重集构成的情况, 设计了多重集的并集的众数与重数的保密计算协议. 用广泛接受的模拟范例证明了协议在半诚实模型下是安全的. 理论分析和实验结果证明本文协议简单高效. |
| doi_str_mv | 10.13868/j.cnki.jcr.000582 |
| format | Article |
| fullrecord | <record><control><sourceid>wanfang_jour_proqu</sourceid><recordid>TN_cdi_proquest_journals_2878151270</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><wanfj_id>mmxb202301007</wanfj_id><sourcerecordid>mmxb202301007</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1287-f7b1ee8ae16e074940e3417f16c2f4b377e6294db6f4e755b85d73c4e62149243</originalsourceid><addsrcrecordid>eNpFjr1KA0EUhadQMMS8gK1Y7nrv_G8pwT8I2GgddjazktVs4q5BeyWKIKkkELEQrKOlRcCXyRjzFg5EsDrnHj7OPYRsIITItNTbWZjkZ-0wS4oQAISmK6RCIVIBR5RrpFaWbQNCSKYpxwoBdz9wnzduOnRv48Xd4-J5MJuOvp8-3PDBn97Mx7ezrxf3PviZvM4no3Wymsbnpa39aZWc7O0e1w-CxtH-YX2nEfSQahWkyqC1OrYoLSgecbCMo0pRJjTlhillJY14y8iUWyWE0aKlWMJ9ijyinFXJ1rL3Ks7TOD9tZt1-kfuPzU7n2lCgDBBAeW5zyfWK7kXflpf_oN-hUSBVwH4Bi7NheQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2878151270</pqid></control><display><type>article</type><title>分布式多重集众数及重数的保密计算</title><source>ProQuest One Community College</source><source>ProQuest Central UK/Ireland</source><source>ProQuest Central</source><creator>Zhu-Liang, JIA ; Xue-Ling, ZHAO ; Shun-Dong, LI ; 家珠亮 ; 赵雪玲 ; 李顺东</creator><creatorcontrib>Zhu-Liang, JIA ; Xue-Ling, ZHAO ; Shun-Dong, LI ; 家珠亮 ; 赵雪玲 ; 李顺东</creatorcontrib><description>安全多方计算作为联合计算中隐私保护的核心技术, 为许多不同的隐私保护问题提供了解决方案, 目前关于多重集的众数及重数保密计算问题的研究很少. 本文设计了一种新的编码方案, 利用这种新的编码方案和 ElGamal 门限密码系统解决分布式多重集众数与重数的保密计算问题. 针对多重集是由多个参与者的单个隐私数据构成的情况, 设计了一个众数及重数的保密计算协议, 阈值众数保密计算协议和元素重数大于阈值的保密计算协议. 通过对编码方案的调整, 进一步针对多重集是由多个参与者的多重集构成的情况, 设计了多重集的并集的众数与重数的保密计算协议. 用广泛接受的模拟范例证明了协议在半诚实模型下是安全的. 理论分析和实验结果证明本文协议简单高效.</description><identifier>ISSN: 2097-4116</identifier><identifier>ISSN: 2095-7025</identifier><identifier>DOI: 10.13868/j.cnki.jcr.000582</identifier><language>chi</language><publisher>Beijing: Chinese Association for Cryptologic Research, Journal of Cryptologic Research</publisher><subject>Coding ; Computation ; Privacy ; Protocol</subject><ispartof>Journal of Cryptologic Research, 2023-02, Vol.10 (1), p.102-117</ispartof><rights>2023. This work is published under http://www.jcr.cacrnet.org.cn/EN/column/column4.shtml Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://www.wanfangdata.com.cn/images/PeriodicalImages/mmxb/mmxb.jpg</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2878151270?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,21388,27924,27925,33744,43805,64385,64389,72469,73128,73129,73131</link.rule.ids></links><search><creatorcontrib>Zhu-Liang, JIA</creatorcontrib><creatorcontrib>Xue-Ling, ZHAO</creatorcontrib><creatorcontrib>Shun-Dong, LI</creatorcontrib><creatorcontrib>家珠亮</creatorcontrib><creatorcontrib>赵雪玲</creatorcontrib><creatorcontrib>李顺东</creatorcontrib><title>分布式多重集众数及重数的保密计算</title><title>Journal of Cryptologic Research</title><description>安全多方计算作为联合计算中隐私保护的核心技术, 为许多不同的隐私保护问题提供了解决方案, 目前关于多重集的众数及重数保密计算问题的研究很少. 本文设计了一种新的编码方案, 利用这种新的编码方案和 ElGamal 门限密码系统解决分布式多重集众数与重数的保密计算问题. 针对多重集是由多个参与者的单个隐私数据构成的情况, 设计了一个众数及重数的保密计算协议, 阈值众数保密计算协议和元素重数大于阈值的保密计算协议. 通过对编码方案的调整, 进一步针对多重集是由多个参与者的多重集构成的情况, 设计了多重集的并集的众数与重数的保密计算协议. 用广泛接受的模拟范例证明了协议在半诚实模型下是安全的. 理论分析和实验结果证明本文协议简单高效.</description><subject>Coding</subject><subject>Computation</subject><subject>Privacy</subject><subject>Protocol</subject><issn>2097-4116</issn><issn>2095-7025</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpFjr1KA0EUhadQMMS8gK1Y7nrv_G8pwT8I2GgddjazktVs4q5BeyWKIKkkELEQrKOlRcCXyRjzFg5EsDrnHj7OPYRsIITItNTbWZjkZ-0wS4oQAISmK6RCIVIBR5RrpFaWbQNCSKYpxwoBdz9wnzduOnRv48Xd4-J5MJuOvp8-3PDBn97Mx7ezrxf3PviZvM4no3Wymsbnpa39aZWc7O0e1w-CxtH-YX2nEfSQahWkyqC1OrYoLSgecbCMo0pRJjTlhillJY14y8iUWyWE0aKlWMJ9ijyinFXJ1rL3Ks7TOD9tZt1-kfuPzU7n2lCgDBBAeW5zyfWK7kXflpf_oN-hUSBVwH4Bi7NheQ</recordid><startdate>20230201</startdate><enddate>20230201</enddate><creator>Zhu-Liang, JIA</creator><creator>Xue-Ling, ZHAO</creator><creator>Shun-Dong, LI</creator><creator>家珠亮</creator><creator>赵雪玲</creator><creator>李顺东</creator><general>Chinese Association for Cryptologic Research, Journal of Cryptologic Research</general><general>陕西师范大学 计算机科学学院, 西安 710119</general><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>20230201</creationdate><title>分布式多重集众数及重数的保密计算</title><author>Zhu-Liang, JIA ; Xue-Ling, ZHAO ; Shun-Dong, LI ; 家珠亮 ; 赵雪玲 ; 李顺东</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1287-f7b1ee8ae16e074940e3417f16c2f4b377e6294db6f4e755b85d73c4e62149243</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>chi</language><creationdate>2023</creationdate><topic>Coding</topic><topic>Computation</topic><topic>Privacy</topic><topic>Protocol</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhu-Liang, JIA</creatorcontrib><creatorcontrib>Xue-Ling, ZHAO</creatorcontrib><creatorcontrib>Shun-Dong, LI</creatorcontrib><creatorcontrib>家珠亮</creatorcontrib><creatorcontrib>赵雪玲</creatorcontrib><creatorcontrib>李顺东</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>Journal of Cryptologic Research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhu-Liang, JIA</au><au>Xue-Ling, ZHAO</au><au>Shun-Dong, LI</au><au>家珠亮</au><au>赵雪玲</au><au>李顺东</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>分布式多重集众数及重数的保密计算</atitle><jtitle>Journal of Cryptologic Research</jtitle><date>2023-02-01</date><risdate>2023</risdate><volume>10</volume><issue>1</issue><spage>102</spage><epage>117</epage><pages>102-117</pages><issn>2097-4116</issn><issn>2095-7025</issn><abstract>安全多方计算作为联合计算中隐私保护的核心技术, 为许多不同的隐私保护问题提供了解决方案, 目前关于多重集的众数及重数保密计算问题的研究很少. 本文设计了一种新的编码方案, 利用这种新的编码方案和 ElGamal 门限密码系统解决分布式多重集众数与重数的保密计算问题. 针对多重集是由多个参与者的单个隐私数据构成的情况, 设计了一个众数及重数的保密计算协议, 阈值众数保密计算协议和元素重数大于阈值的保密计算协议. 通过对编码方案的调整, 进一步针对多重集是由多个参与者的多重集构成的情况, 设计了多重集的并集的众数与重数的保密计算协议. 用广泛接受的模拟范例证明了协议在半诚实模型下是安全的. 理论分析和实验结果证明本文协议简单高效.</abstract><cop>Beijing</cop><pub>Chinese Association for Cryptologic Research, Journal of Cryptologic Research</pub><doi>10.13868/j.cnki.jcr.000582</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2097-4116 |
| ispartof | Journal of Cryptologic Research, 2023-02, Vol.10 (1), p.102-117 |
| issn | 2097-4116 2095-7025 |
| language | chi |
| recordid | cdi_proquest_journals_2878151270 |
| source | ProQuest One Community College; ProQuest Central UK/Ireland; ProQuest Central |
| subjects | Coding Computation Privacy Protocol |
| title | 分布式多重集众数及重数的保密计算 |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T07%3A29%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=%E5%88%86%E5%B8%83%E5%BC%8F%E5%A4%9A%E9%87%8D%E9%9B%86%E4%BC%97%E6%95%B0%E5%8F%8A%E9%87%8D%E6%95%B0%E7%9A%84%E4%BF%9D%E5%AF%86%E8%AE%A1%E7%AE%97&rft.jtitle=Journal%20of%20Cryptologic%20Research&rft.au=Zhu-Liang,%20JIA&rft.date=2023-02-01&rft.volume=10&rft.issue=1&rft.spage=102&rft.epage=117&rft.pages=102-117&rft.issn=2097-4116&rft_id=info:doi/10.13868/j.cnki.jcr.000582&rft_dat=%3Cwanfang_jour_proqu%3Emmxb202301007%3C/wanfang_jour_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2878151270&rft_id=info:pmid/&rft_wanfj_id=mmxb202301007&rfr_iscdi=true |