一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復。謝謝您的支持!

姓名
郵箱
手機號碼
標題
留言內(nèi)容
驗證碼

布爾電路上保護隱私集合并集運算的研究與實現(xiàn)

孫茂華,  胡磊,  朱洪亮,  李祺

孫茂華, 胡磊, 朱洪亮, 李祺. 布爾電路上保護隱私集合并集運算的研究與實現(xiàn)[J]. 電子與信息學報, 2016, 38(6): 1412-1418. doi: 10.11999/JEIT150911
引用本文: 孫茂華, 胡磊, 朱洪亮, 李祺. 布爾電路上保護隱私集合并集運算的研究與實現(xiàn)[J]. 電子與信息學報, 2016, 38(6): 1412-1418. doi: 10.11999/JEIT150911
SUN Maohua, HU Lei, ZHU Hongliang, LI Qi. Research and Implementation of Privacy Preserving Set Union in Boolean Circuits[J]. Journal of Electronics & Information Technology, 2016, 38(6): 1412-1418. doi: 10.11999/JEIT150911
Citation: SUN Maohua, HU Lei, ZHU Hongliang, LI Qi. Research and Implementation of Privacy Preserving Set Union in Boolean Circuits[J]. Journal of Electronics & Information Technology, 2016, 38(6): 1412-1418. doi: 10.11999/JEIT150911

布爾電路上保護隱私集合并集運算的研究與實現(xiàn)

doi: 10.11999/JEIT150911
  • 1.

    (首都經(jīng)濟貿(mào)易大學信息學院 北京 100070) ②(北京郵電大學計算機學院 北京 100876)

基金項目: 

首都經(jīng)濟貿(mào)易大學青年科研啟動基金，國家自然科學基金(61302087)，首都經(jīng)濟貿(mào)易大學青年科學基金(2014XJQ016), 2016年北京市教委科研水平提高基金

Research and Implementation of Privacy Preserving Set Union in Boolean Circuits

  • 1.

    (Information School, Capital University of Economics and Business, Beijing 100070, China)

  • 2.

    (School of Computer, Beijing University of Posts and Telecommunications, Beijing 100876, China)

Funds: 

Young Scientific Research Starting Foundation of CUEB 2014, Young Scientists Program of CUEB (2014XJQ016), The National Natural Science Foundation of China (61302087), Improve Scientific Rescarch Foundation of Beijing Education 2016

  • 摘要: 隱私保護技術是當前信息安全領域的研究熱點。然而，現(xiàn)階段集合并集運算中的隱私保護技術側(cè)重理論研究，在實驗模型的開發(fā)上較為欠缺。針對該問題，該文首先設計了保護隱私的集合合并運算電路、去重電路和混淆電路，并應用YAO氏通用混淆電路估值技術提出了一種布爾電路上保護隱私的集合并集協(xié)議。然后，該文使用模擬器視圖仿真法證明了協(xié)議的安全性。最后，基于MightBeEvil中的YAO氏混淆電路估值框架，開發(fā)了該文理論方案對應的實驗模型。實驗結果表明，在安全計算稀疏集合的并集時，所提算法效率優(yōu)于當前布爾電路上的其他算法。
    Abstract: Privacy-preserving technology is the focus of information security area. Unfortunately, rare implementation of private set union protocol is developed. To solve the issue above, a novel private set union protocol based on the YAOs garbled circuit technology is presented. The specially designed circuits include the private set merge circuit, the private set filter circuit and the private set confusion circuit. Then, the security of the novel protocol is proven in semi-honest model. Finally, a prototype of the protocol is built based on the MightBeEvil framework. The simulation results show that this protocol is more efficient than the existing one when evaluating the union of sparse sets in a privacy-preserving manner.
    • HTML全文
  • KISSNER L and SONG D X. Privacy-preserving set operations[C]. Advances in Cryptology- CRYPTO, Santa Barbara, USA, 2005: 241-257.doi: 10.1007/11535218_15.
    FRIKKEN K B. Privacy-preserving set union[C]. Applied Cryptography and Network Security, Zhuhai, China, 2007: 237-252. doi: 10.1007/978-3-540-72738-5_16.
    SEO J H, CHEON J H, and KAZA J. Constant-round multi- party private set union using reversed laurent series[C]. Proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography, Darmstadt, 2012: 398-412. doi: 10.1007/978-3-642-30057-8_24.
    KERSCHBAUM F. Outsourced private set intersection using homomorphic encryption[C]. Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, Seoul, Republic of Korea, 2012: 85-86. doi: 10. 1145/2414456.2414506.
    DONG C Y, CHEN L Q, and WEN Z K. When private set intersection meets big data: an efficient and scalable protocol [C]. Proceedings of the 2013 ACM SIGSAC conference on Computer Communication Security, New York, 2013: 789-800.
    KAMARA S, MOHASSEL P, RAYKOVA M, et al. Scaling private set intersection to billion-element sets[C]. Financial Cryptography and Data Security, Barbados, West Indies, 2014: 195-215.
    FREEDMAN J F, HAZAY C, NISSIM K, et al. Efficient set-intersection with simulation-based security[J]. Journal of Cryptology, 2016, 29(1): 115-155. doi: 10.1007/s00145- 014-9190-0.
    PINKAS B, SCHNEIDER T, and ZOHNER M. Faster private set intersection based on OT extension[C]. Proceedings of the 23rd USENIX Security Symposium, San Diego, 2014: 797-812.
    HAZAY C. Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs[C]. Theory of Cryptography Conference, Warsaw, Poland, 2015: 90-120. doi: 10.1007/978-3-662-46497-7_4.
    DARCO P, VASCO M I G, DEL POZO A L P, et al. Size- hiding in private set intersection: What can be done and how to do it without random oracles[OL]. https://eprint.iacr. org/2015/321. 2015.
    ZHENG Q J and XU S H. Verifiable delegated set intersection operations on outsourced encrypted data[C]. 2015 IEEE International Conference on Cloud Engineering, Tempe, AZ, USA, 2015: 175-184. doi: 10.1109/IC2E.2015.38.
    WANG T T, ZHU Y Q, and LUO X Z. Publicly verifiable delegation of set intersection[C]. 2014 International Conference on Cloud Computing and Internet of Things, Changchun, China, 2014: 26-30. doi: 10.1109/CCIOT.2014. 7062500.
    LIU F, WEE K N, ZHANG W, et al. Encrypted set intersection protocol for outsourced datasets[C]. 2014 International Conference on Cloud Engineering, Boston, USA, 2014: 135-140.
    夏峰, 楊波, 張明武, 等. 基于LWE的集合相交和相等的兩方保密計算[J]. 電子與信息學報, 2012, 34(2): 462-467. doi: 10.3724/SP.J.1146.2011.00541.
    XIA F, YANG B, ZHANG M W, et al. Secure two-party computation for set intersection and set equality problems based on LWE[J]. Journal of Electronics Information Technology, 2012, 34(2): 462-467. doi: 10.3724/SP.J.1146. 2011.00541.
    BRICKELL J and SHMATIKOV V. Privacy-preserving graph algorithms in the semi-honest model[C]. Advances in Cryptology-ASIACRYPT, Chennai, India, 2005: 236-252.
    HUANG Y, EVANS D, and KATZ J. Private set intersection: Are garbled circuits better than custom protocols?[C]. Proceedings of the 19th Network and Distributed Security Symposium, San Diego, CA, USA, 2012.
    PINKAS B, SCHNEIDER T, SEGEV G, et al. Phasing: private set intersection using permutation-based hashing[C]. Proceedings of the 24th Conference on USENIX Security Symposium, Washington D.C., 2015: 515-530.
    KOLESNIKOV V, SADEGHI A R, and SCHNEIDER T. Improved garbled circuit building blocks and applications to auctions and computing minima[C]. Proceedings of the 8th International Conference on Cryptology and Network Security, Kanazawa, Japan, 2009: 1-20. doi: 10.1007/978-3- 642-10433-6_1.
    KOLESNIKOV V and SCHNEIDER T. Improved garbled circuit: free XOR gates and applications[C]. International Colloquium on Automata, Languages and Programming, Reykjavik, Iceland, 2008: 486-498.
    DE CRISTOFARO E and TSUDIK G. Practical private set intersection protocols with linear complexity[C]. Financial Cryptography and Data Security, Tenerife, Canary Islands, 2010: 143-159. doi: 10.1007/978-3-642-14577-3_13.
    NAOR M and PINKAS B. Efficient oblivious transfer protocols[C]. Proceedings of the 12th Annual Symposium on Discrete Alogrithms, Washington, D.C., USA, 2001: 448-457.
  • 加載中
計量
  • 文章訪問數(shù):  1775
  • HTML全文瀏覽量:  223
  • PDF下載量:  554
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2015-08-05
  • 修回日期:  2016-02-29
  • 刊出日期:  2016-06-19

目錄

    /

    返回文章
    返回