• DocumentCode
    623865
  • Title

    Privacy-preserving data aggregation without secure channel: Multivariate polynomial evaluation

  • Author

    Taeho Jung ; Xufei Mao ; Xiang-Yang Li ; Shao-Jie Tang ; Wei Gong ; Lan Zhang

  • Author_Institution
    Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
  • fYear
    2013
  • fDate
    14-19 April 2013
  • Firstpage
    2634
  • Lastpage
    2642
  • Abstract
    Much research has been conducted to securely outsource multiple parties´ data aggregation to an untrusted aggregator without disclosing each individual´s privately owned data, or to enable multiple parties to jointly aggregate their data while preserving privacy. However, those works either require secure pair-wise communication channels or suffer from high complexity. In this paper, we consider how an external aggregator or multiple parties can learn some algebraic statistics (e.g., sum, product) over participants´ privately owned data while preserving the data privacy. We assume all channels are subject to eavesdropping attacks, and all the communications throughout the aggregation are open to others. We propose several protocols that successfully guarantee data privacy under this weak assumption while limiting both the communication and computation complexity of each participant to a small constant.
  • Keywords
    computational complexity; data privacy; telecommunication channels; computation complexity; multivariate polynomial evaluation; pairwise communication channels; privacy-preserving data aggregation; secure channel; Communication channels; Complexity theory; Computational modeling; Cryptography; Polynomials; Protocols; Privacy; SMC; aggregation; homomorphic; secure channels;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2013 Proceedings IEEE
  • Conference_Location
    Turin
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4673-5944-3
  • Type

    conf

  • DOI
    10.1109/INFCOM.2013.6567071
  • Filename
    6567071