Secure anonymous union computation among malicious partners

被引:0
|
作者
Boettcher, Stefan [1 ]
Obermeier, Sebastian [1 ]
机构
[1] Univ Gesamthsch Paderborn, Inst Comp Sci, Furstenalle 11, D-33102 Paderborn, Germany
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
When applications require a union calculation of different distributed datasets, two requirements are often necessary to fulfill: anonymity and security. Anonymity means for scenarios with more than 2 participants that the owner of a certain data item cannot be identified. Security means that no participant can prevent that data items of other participants will be included in the union set. In this paper we present a union protocol that guarantees both properties: anonymity and security even if participants act malicious, i.e. to modify messages or change the protocol. We prove the correctness of protocol and give experimental results that show the applicability of our protocol in a common environment.
引用
收藏
页码:128 / +
页数:3
相关论文
共 50 条
  • [1] Secure computation of common data among malicious partners
    Obermeier, Sebastian
    Boettcher, Stefan
    SECRYPT 2007: PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY, 2007, : 345 - 354
  • [2] Secure Multi-Party Computation of Graphs' Intersection and Union under the Malicious Model
    Liu, Xin
    Tu, Xiao-Fen
    Luo, Dan
    Xu, Gang
    Xiong, Neal N.
    Chen, Xiu-Bo
    ELECTRONICS, 2023, 12 (02)
  • [3] Secure Maximum (Minimum) Computation in Malicious Model
    Li S.-D.
    Xu W.-T.
    Wang W.-L.
    Zhang M.-Y.
    1600, Science Press (44): : 2076 - 2089
  • [4] Feasibility and Infeasibility of Secure Computation with Malicious PUFs
    Dachman-Soled, Dana
    Fleischhacker, Nils
    Katz, Jonathan
    Lysyanskaya, Anna
    Schroeder, Dominique
    JOURNAL OF CRYPTOLOGY, 2020, 33 (02) : 595 - 617
  • [5] Feasibility and Infeasibility of Secure Computation with Malicious PUFs
    Dachman-Soled, Dana
    Fleischhacker, Nils
    Katz, Jonathan
    Lysyanskaya, Anna
    Schroeder, Dominique
    ADVANCES IN CRYPTOLOGY - CRYPTO 2014, PT II, 2014, 8617 : 405 - 420
  • [6] Feasibility and Infeasibility of Secure Computation with Malicious PUFs
    Dana Dachman-Soled
    Nils Fleischhacker
    Jonathan Katz
    Anna Lysyanskaya
    Dominique Schröder
    Journal of Cryptology, 2020, 33 : 595 - 617
  • [7] Malicious Computation Prevention Protocol for Secure Multi-Party Computation
    Mishra, Durgesh Kumar
    Koria, Neha
    Kapoor, Nikhil
    Bahety, Ravish
    TENCON 2009 - 2009 IEEE REGION 10 CONFERENCE, VOLS 1-4, 2009, : 490 - +
  • [8] Secure linear system computation in the presence of malicious adversaries
    ZHANG Bo
    ZHANG FangGuo
    Science China(Information Sciences), 2014, 57 (09) : 146 - 155
  • [9] Secure linear system computation in the presence of malicious adversaries
    Zhang Bo
    Zhang FangGuo
    SCIENCE CHINA-INFORMATION SCIENCES, 2014, 57 (09) : 1 - 10
  • [10] Two-Output Secure Computation with Malicious Adversaries
    Shelat, Abhi
    Shen, Chih-Hao
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2011, 2011, 6632 : 386 - 405