About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Collaborative Computing: Networking, Applications and Worksharing. 19th EAI International Conference, CollaborateCom 2023, Corfu Island, Greece, October 4-6, 2023, Proceedings, Part II

Research Article

Secure and Private Approximated Coded Distributed Computing Using Elliptic Curve Cryptography

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-031-54528-3_20,
        author={Houming Qiu and Kun Zhu},
        title={Secure and Private Approximated Coded Distributed Computing Using Elliptic Curve Cryptography},
        proceedings={Collaborative Computing: Networking, Applications and Worksharing. 19th EAI International Conference, CollaborateCom 2023, Corfu Island, Greece, October 4-6, 2023, Proceedings, Part II},
        proceedings_a={COLLABORATECOM PART 2},
        year={2024},
        month={2},
        keywords={Coded distributed computing Distributed system Security Privacy Stragglers Collaborative computing},
        doi={10.1007/978-3-031-54528-3_20}
    }
    
  • Houming Qiu
    Kun Zhu
    Year: 2024
    Secure and Private Approximated Coded Distributed Computing Using Elliptic Curve Cryptography
    COLLABORATECOM PART 2
    Springer
    DOI: 10.1007/978-3-031-54528-3_20
Houming Qiu1, Kun Zhu1,*
  • 1: College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics
*Contact email: zhukun@nuaa.edu.cn

Abstract

In large-scale distributed computing systems, coded computing has attracted considerable attention since it can effectively mitigate the impact of stragglers. Nonetheless, several emerging issues seriously restrict the performance of coded distributed systems. First, the presence of colluding workers collude results in serious privacy leakage issues. Second, few existing works consider security issues in data transmission. Third, the number of required results to wait for increases with the degree of polynomial functions. In this paper, we propose a secure and private approximated coded distributed computing (SPACDC) scheme that addresses the aforementioned issues simultaneously. The SPACDC scheme ensures data security during the transmission process by leveraging a proposed matrix encryption algorithm based on elliptic curve cryptography. Unlike existing coding schemes, our SPACDC scheme does not impose strict constraints on the minimum number of results required to wait for. Furthermore, the SPACDC scheme provides information-theoretic privacy protection for raw data. Finally, extensive performance analysis is provided to demonstrate the effectiveness of the proposed SPACDC scheme.

Keywords
Coded distributed computing Distributed system Security Privacy Stragglers Collaborative computing
Published
2024-02-23
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-031-54528-3_20
Copyright © 2023–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL