2021
DOI: 10.1007/s12083-021-01120-7
|View full text |Cite
|
Sign up to set email alerts
|

MASK: Efficient and privacy-preserving m-tree based biometric identification over cloud

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 30 publications
0
4
0
Order By: Relevance
“…Feature extraction techniques are applied to isolate essential patterns and features within signatures. This proposed system aims to optimize accuracy and efficiency in both verification and recognition, ultimately bolstering security throughout the authentication process [4].…”
Section: Review Of Related Literaturementioning
confidence: 99%
“…Feature extraction techniques are applied to isolate essential patterns and features within signatures. This proposed system aims to optimize accuracy and efficiency in both verification and recognition, ultimately bolstering security throughout the authentication process [4].…”
Section: Review Of Related Literaturementioning
confidence: 99%
“…Building on the M-tree data structure and symmetric HE, Yang et al [ 61 ] proposed privacy-preserving biometric identification over the cloud, calling it MASK. With recognition accuracy maintained, MASK ensures the privacy of users’ recognition requests (e.g., face recognition) and service providers’ datasets, while greatly reducing cloud servers’ computing cost on biometric dataset searching.…”
Section: He-based Approaches To Biometric Securitymentioning
confidence: 99%
“…All these schemes are implemented based on fully homomorphic encryption techniques. Although fully homomorphic encryption schemes have evolved significantly since the Gentry blueprint, introducing many new construction techniques that have led to improvements in efficiency, Yang et al [13] suggests that the computational complexity of fully homomorphic encryption is still too large for the average user to be applied in practice, even if a certain number of multiplication operations are sacrificed to improve the computational efficiency. In conclusion, the existing fully homomorphic encryption schemes are still unable to meet the practicality requirements due to the efficiency problem and are not promoted in outsourced computing with privacy protection.…”
Section: Related Workmentioning
confidence: 99%