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 条
  • [21] Secure computation of hidden Markov models and secure floating-point arithmetic in the malicious model
    Mehrdad Aliasgari
    Marina Blanton
    Fattaneh Bayatbabolghani
    International Journal of Information Security, 2017, 16 : 577 - 601
  • [22] Among Partners The Eurasian Economic Union
    Vinokurov, Evgenij
    OSTEUROPA, 2016, 66 (05): : 129 - +
  • [23] Secure set union and bag union computation for guaranteeing anonymity of distrustful participants
    Böttcher, Stefan
    Obermeier, Sebastian
    Journal of Software, 2008, 3 (01) : 9 - 17
  • [24] POOL: Scalable On-Demand Secure Computation Service Against Malicious Adversaries
    Zhu, Ruiyu
    Huang, Yan
    Cassel, Darion
    CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, : 245 - 257
  • [25] An efficient protocol for secure two-party computation in the presence of malicious adversaries
    Lindell, Yehuda
    Pinkas, Benny
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2007, 2007, 4515 : 52 - +
  • [26] An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
    Yehuda Lindell
    Benny Pinkas
    Journal of Cryptology, 2015, 28 : 312 - 350
  • [27] An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
    Lindell, Yehuda
    Pinkas, Benny
    JOURNAL OF CRYPTOLOGY, 2015, 28 (02) : 312 - 350
  • [28] Introducing a Framework to Enable Anonymous Secure Multi-Party Computation in Practice
    Breuer, Malte
    Meyer, Ulrike
    Wetzel, Susanne
    2021 18TH INTERNATIONAL CONFERENCE ON PRIVACY, SECURITY AND TRUST (PST), 2021,
  • [29] Secure two-party computation of Squared Euclidean Distances in the presence of malicious adversaries
    Mouffron, Marc
    Rousseau, Frederic
    Zhu, Huafei
    INFORMATION SECURITY AND CRYPTOLOGY, 2008, 4990 : 138 - 152
  • [30] Faster Malicious 2-party Secure Computation with Online/Offline Dual Execution
    Rindal, Peter
    Rosulek, Mike
    PROCEEDINGS OF THE 25TH USENIX SECURITY SYMPOSIUM, 2016, : 297 - 314