About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Broadband Communications, Networks, and Systems. 12th EAI International Conference, BROADNETS 2021, Virtual Event, October 28–29, 2021, Proceedings

Research Article

Efficient Privacy-Preserving User Matching with Intel SGX

Download(Requires a free EAI acccount)
2 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-030-93479-8_6,
        author={Junwei Luo and Xuechao Yang and Xun Yi and Fengling Han and Andrei Kelarev},
        title={Efficient Privacy-Preserving User Matching with Intel SGX},
        proceedings={Broadband Communications, Networks, and Systems. 12th EAI International Conference, BROADNETS 2021, Virtual Event, October 28--29, 2021, Proceedings},
        proceedings_a={BROADNETS},
        year={2022},
        month={1},
        keywords={Privacy-preserving user matching Intel SGX Oblivions data structure Searchable encryption Social network security},
        doi={10.1007/978-3-030-93479-8_6}
    }
    
  • Junwei Luo
    Xuechao Yang
    Xun Yi
    Fengling Han
    Andrei Kelarev
    Year: 2022
    Efficient Privacy-Preserving User Matching with Intel SGX
    BROADNETS
    Springer
    DOI: 10.1007/978-3-030-93479-8_6
Junwei Luo1,*, Xuechao Yang1, Xun Yi1, Fengling Han1, Andrei Kelarev1
  • 1: School of Computing Technologies, RMIT University, Melbourne
*Contact email: junwei.luo@rmit.edu.au

Abstract

User matching is one of the most essential features that allows users to identify other people by comparing the attributes of their profiles and finding similarities. While this facility enables the exploration of friends in the same network, it poses serious security concerns over the privacy of the users as the prevalence of modern cloud computing services, companies outsource computational power to untrusted cloud service providers and confidential data of the users can be exposed as the data storage is transparent in the remote host server. Encryption can hide the user data, but it is difficult to compare the encrypted profiles. While solutions utilising the homomorphic encryption can overcome such limitations, they incur significant performance overhead, which is impractical for large networks. To overcome these problems, we propose an efficient privacy-preserving user matching protocol with Intel SGX. Other techniques such as oblivious data structure and searchable encryption are deployed to resolve security issues that Intel SGX has suffered. Our construction relies on secure hardware which guarantees the integrity and confidentiality of the code execution, which enables the computation of similarities between the profiles of the users. Moreover, our protocol is designed to provide protection against several types of side-channel attacks. The security analysis and experimental results presented in this paper indicate that our protocol is efficient, secure, practical and prevents side-channel attacks.

Keywords
Privacy-preserving user matching Intel SGX Oblivions data structure Searchable encryption Social network security
Published
2022-01-01
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-030-93479-8_6
Copyright © 2021–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