Achieving Efficient and Privacy-preserving Biometric Identification in Cloud Computing

被引:0
|
作者
Xu, Chang [1 ]
Zhang, Lvhan [2 ]
Zhu, Liehuang [1 ]
Zhang, Chuan [1 ]
Sharif, Kashif [2 ]
机构
[1] Beijing Inst Technol, Sch Cyberspace Sci & Technol, Beijing, Peoples R China
[2] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing, Peoples R China
来源
2021 IEEE 20TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM 2021) | 2021年
基金
中国国家自然科学基金;
关键词
Biometric Identification; Cloud Server; Data outsourcing; Privacy-preserving; SCHEME;
D O I
10.1109/TRUSTCOM53373.2021.00063
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Biometrics identification has been used in a growing number of fields in recent years, since it is more secure, classified and convenient. With the development of cloud computing, database systems are able to upload large amounts of biometric data to cloud server for storage and identification to save local memory and improve computational efficiency. However, this involves potential privacy concerns because of the introduction of third-party platforms. In this paper, we achieve computational and communication efficiency in biometric identification, while preserving the privacy of data. Specifically, the database system firstly encrypts all biometric data and query data. Then, it sends the ciphertext to a cloud server to carry out matching tasks. Finally, the cloud server returns the index of final matches to the system so that it can check whether the biometric vector is legal or not. Detailed security analysis indicates that the proposed scheme can resist powerful attacks. Beyond that, Experiments show that the scheme is more efficient in computation and communication than stat of art biometric identification schemes.
引用
收藏
页码:363 / 370
页数:8
相关论文
共 50 条
  • [31] Efficient and privacy-preserving outsourced unbounded inner product computation in cloud computing
    Yan, Jiayun
    Chen, Jie
    Qian, Chen
    Fu, Anmin
    Qian, Haifeng
    JOURNAL OF SYSTEMS ARCHITECTURE, 2024, 153
  • [32] An efficient privacy-preserving rank query over encrypted data in cloud computing
    Cheng, Fang-Quan
    Peng, Zhi-Yong
    Song, Wei
    Wang, Shu-Lin
    Cui, Yi-Hui
    Jisuanji Xuebao/Chinese Journal of Computers, 2012, 35 (11): : 2215 - 2227
  • [33] An Efficient Privacy-Preserving Publish-Subscribe Service Scheme for Cloud Computing
    Xiao, Yanping
    Lin, Chuang
    Jiang, Yixin
    Chu, Xiaowen
    Liu, Fangqin
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [34] Efficient Privacy-Preserving Range Queries over Encrypted Data in Cloud Computing
    Samanthula, Bharath K.
    Jiang, Wei
    2013 IEEE SIXTH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD 2013), 2013, : 51 - 58
  • [35] Efficient Privacy-Preserving Access Control of Mobile Multimedia Data in Cloud Computing
    Li, Qi
    Tian, Youliang
    Zhang, Yinghui
    Shen, Limin
    Guo, Jingjing
    IEEE ACCESS, 2019, 7 : 131534 - 131542
  • [36] Secure and Efficient Privacy-Preserving Ciphertext Retrieval in Connected Vehicular Cloud Computing
    Fan, Kai
    Wang, Xin
    Suto, Katsuya
    Li, Hui
    Yang, Yintang
    IEEE NETWORK, 2018, 32 (03): : 52 - 57
  • [37] Achieving Efficient and Privacy-Preserving Multi-Domain Big Data Deduplication in Cloud
    Yang, Xue
    Lu, Rongxing
    Shao, Jun
    Tang, Xiaohu
    Ghorbani, Ali A.
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2021, 14 (05) : 1292 - 1305
  • [38] Achieving Efficient and Privacy-Preserving Multi-Keyword Conjunctive Query Over Cloud
    Yin, Fan
    Zheng, Yandong
    Lu, Rongxing
    Tang, Xiaohu
    IEEE ACCESS, 2019, 7 : 165862 - 165872
  • [39] Achieving Efficient and Privacy-Preserving Cross-Domain Big Data Deduplication in Cloud
    Yang, Xue
    Lu, Rongxing
    Choo, Kim Kwang Raymond
    Yin, Fan
    Tang, Xiaohu
    IEEE TRANSACTIONS ON BIG DATA, 2022, 8 (01) : 73 - 84
  • [40] A survey of privacy-preserving access control in cloud computing
    Li, Hongjiao, 1600, Binary Information Press (10):