skip to main content
10.1145/3634737.3657022acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
research-article
Open access

Nomadic: Normalising Maliciously-Secure Distance with Cosine Similarity for Two-Party Biometric Authentication

Published: 01 July 2024 Publication History

Abstract

Computing the distance between two non-normalized vectors x and y, represented by Δ (x, y) and comparing it to a predefined public threshold τ is an essential functionality used in privacy-sensitive applications such as biometric authentication, identification, machine learning algorithms (e.g., linear regression, k-nearest neighbors, etc.), and typo-tolerant password-based authentication. Tackling a widely used distance metric, Nomadic studies the privacy-preserving evaluation of cosine similarity in a two-party (2PC) distributed setting. We illustrate this setting in a scenario where a client uses biometrics to authenticate to a service provider, outsourcing the distance calculation to two computing servers. In this setting, we propose two novel 2PC protocols to evaluate the normalising cosine similarity between non-normalised two vectors followed by comparison to a public threshold, one in the semi-honest and one in the malicious setting. Our protocols combine additive secret sharing with function secret sharing, saving one communication round by employing a new building block to compute the composition of a function f yielding a binary result with a subsequent binary gate. Overall, our protocols outperform all prior works, requiring only two communication rounds under a strong threat model that also deals with malicious inputs via normalisation. We evaluate our protocols in the setting of biometric authentication using voice, and the obtained results reveal a notable efficiency improvement compared to existing state-of-the-art works.

References

[1]
Shashank Agrawal and David J Wu. 2017. Functional encryption: deterministic to randomized functions from simple assumptions. In Advances in Cryptology-EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30--May 4, 2017, Proceedings, Part II 36. Springer, 30--61.
[2]
Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, and Kazuma Ohara. 2016. High-throughput semi-honest secure three-party computation with an honest majority. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. 805--817.
[3]
Manuel Barbosa, Dario Catalano, Azam Soleimanian, and Bogdan Warinschi. 2019. Efficient function-hiding functional encryption: From inner-products to orthogonality. In Topics in Cryptology-CT-RSA 2019: The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4--8, 2019, Proceedings. Springer, 127--148.
[4]
Mauro Barni, Giulia Droandi, Riccardo Lazzeretti, and Tommaso Pignata. 2019. SEMBA: secure multi-biometric authentication. IET Biometrics 8, 6 (2019), 411--421.
[5]
Donald Beaver. 1992. Efficient Multiparty Protocols Using Circuit Randomization. In Advances in Cryptology --- CRYPTO '91, Joan Feigenbaum (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 420--432.
[6]
Donald Beaver, Silvio Micali, and Phillip Rogaway. 1990. The round complexity of secure protocols. In Proceedings of the twenty-second annual ACM symposium on Theory of computing. 503--513.
[7]
Aner Ben-Efraim, Michael Nielsen, and Eran Omri. 2019. Turbospeedz: double your online SPDZ! improving SPDZ using function dependent preprocessing. In International Conference on Applied Cryptography and Network Security. Springer, 530--549.
[8]
Vishnu Naresh Boddeti. 2018. Secure face matching using fully homomorphic encryption. In 2018 IEEE 9th International Conference on Biometrics Theory, Applications and Systems (BTAS). IEEE, 1--10.
[9]
Dan Boneh, Amit Sahai, and Brent Waters. 2011. Functional encryption: Definitions and challenges. In Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28--30, 2011. Proceedings 8. Springer, 253--273.
[10]
Elette Boyle, Nishanth Chandran, Niv Gilboa, Divya Gupta, Yuval Ishai, Nishant Kumar, and Mayank Rathee. 2021. Function secret sharing for mixed-mode and fixed-point secure computation. In Advances in Cryptology-EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17--21, 2021, Proceedings, Part II. Springer, 871--900.
[11]
Elette Boyle, Niv Gilboa, and Yuval Ishai. 2015. Function secret sharing. In Annual international conference on the theory and applications of cryptographic techniques. Springer, 337--367.
[12]
Elette Boyle, Niv Gilboa, and Yuval Ishai. 2019. Secure computation with preprocessing via function secret sharing. In Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg, Germany, December 1--5, 2019, Proceedings, Part I 17. Springer, 341--371.
[13]
Elette Boyle, Niv Gilboa, and Yuval Ishai. 2019. Secure computation with pre-processing via function secret sharing. In Theory of Cryptography Conference. Springer, 341--371.
[14]
Megha Byali, Harsh Chaudhari, Arpita Patra, and Ajith Suresh. 2019. FLASH: Fast and robust framework for privacy-preserving machine learning. Cryptology ePrint Archive (2019).
[15]
Nishanth Chandran, Divya Gupta, Sai Lakshmi Bhavana Obbattu, and Akash Shah. 2022. {SIMC}:{ML} Inference Secure Against Malicious Clients at {Semi-Honest} Cost. In 31st USENIX Security Symposium (USENIX Security 22). 1361--1378.
[16]
Harsh Chaudhari, Rahul Rachuri, and Ajith Suresh. 2019. Trident: Efficient 4pc framework for privacy preserving machine learning. arXiv preprint arXiv:1912.02631 (2019).
[17]
Nan Cheng. 2023. CondEval. https://github.com/nann-cheng/CondEval.
[18]
Jung Hee Cheon, Dongwoo Kim, Duhyeong Kim, Hun Hee Lee, and Keewoo Lee. 2019. Numerical method for comparison on homomorphically encrypted numbers. In Advances in Cryptology-ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8--12, 2019, Proceedings, Part II. Springer, 415--445.
[19]
Joon Son Chung, Arsha Nagrani, and Andrew Zisserman. 2018. Voxceleb2: Deep speaker recognition. arXiv preprint arXiv:1806.05622 (2018).
[20]
Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, and Chaoping Xing. 2018. SPDZ2k: efficient MPC mod 2k for dishonest majority. In Annual International Cryptology Conference. Springer, 769--798.
[21]
Anders Dalskov, Daniel Escudero, and Marcel Keller. 2021. Fantastic four:{Honest-Majority} {Four-Party} secure computation with malicious security. In 30th USENIX Security Symposium (USENIX Security 21). 2183--2200.
[22]
Ivan Damgård, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel P Smart. 2013. Practical covertly secure MPC for dishonest majority-or: breaking the SPDZ limits. In European Symposium on Research in Computer Security. Springer, 1--18.
[23]
Pratish Datta, Ratna Dutta, and Sourav Mukhopadhyay. 2016. Functional encryption for inner product with full function privacy. In Public-Key Cryptography-PKC 2016: 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6--9, 2016, Proceedings, Part I. Springer, 164--195.
[24]
Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY-A framework for efficient mixed-protocol secure two-party computation. In NDSS.
[25]
Brecht Desplanques, Jenthe Thienpondt, and Kris Demuynck. 2020. Ecapatdnn: Emphasized channel attention, propagation and aggregation in tdnn based speaker verification. arXiv preprint arXiv:2005.07143 (2020).
[26]
Diana-Elena Fălămaş, Kinga Marton, and Alin Suciu. 2021. Assessment of Two Privacy Preserving Authentication Methods Using Secure Multiparty Computation Based on Secret Sharing. Symmetry 13, 5 (2021), 894.
[27]
Junfeng Fan and Frederik Vercauteren. 2012. Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012).
[28]
Craig Gentry. 2009. A fully homomorphic encryption scheme. Stanford university.
[29]
Oded Goldreich, Silvio Micali, and Avi Wigderson. 2019. How to play any mental game, or a completeness theorem for protocols with honest majority. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. 307--328.
[30]
Kanav Gupta, Deepak Kumaraswamy, Nishanth Chandran, and Divya Gupta. 2022. LLAMA: A Low Latency Math Library for Secure Inference. Proceedings on Privacy Enhancing Technologies 4 (2022), 274--294.
[31]
Haiping Huang, Tianhe Gong, Ping Chen, Reza Malekian, and Tao Chen. 2016. Secure two-party distance computation protocol based on privacy homomorphism and scalar product in wireless sensor networks. Tsinghua Science and Technology 21, 4 (2016), 385--396.
[32]
Alberto Ibarrondo, Hervé Chabanne, Vincent Despiegel, and Melek Önen. 2023. Grote: Group testing for privacy-preserving face identification. In Proceedings of the Thirteenth ACM Conference on Data and Application Security and Privacy. 117--128.
[33]
Alberto Ibarrondo, Hervé Chabanne, and Melek Önen. 2023. Funshade: Function Secret Sharing for Two-Party Secure Thresholded Distance Evaluation. Proceedings on Privacy Enhancing Technologies (2023).
[34]
Ilia Iliashenko and Vincent Zucca. 2021. Faster homomorphic comparison operations for BGV and BFV. Proceedings on Privacy Enhancing Technologies 2021, 3 (2021), 246--264.
[35]
Taeyun Kim, Yongwoo Oh, and Hyoungshick Kim. 2020. Efficient privacy-preserving fingerprint-based authentication system using fully homomorphic encryption. Security and Communication Networks 2020 (2020), 1--11.
[36]
Brian Knott, Shobha Venkataraman, Awni Hannun, Shubho Sengupta, Mark Ibrahim, and Laurens van der Maaten. 2021. Crypten: Secure multi-party computation meets machine learning. Advances in Neural Information Processing Systems 34 (2021), 4961--4973.
[37]
Tom Ko, Vijayaditya Peddinti, Daniel Povey, Michael L Seltzer, and Sanjeev Khudanpur. 2017. A study on data augmentation of reverberant speech for robust speech recognition. In 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 5220--5224.
[38]
Nishat Koti, Mahak Pancholi, Arpita Patra, and Ajith Suresh. 2021. {SWIFT}: Super-fast and robust {Privacy-Preserving} machine learning. In 30th USENIX Security Symposium (USENIX Security 21). 2651--2668.
[39]
Nishat Koti, Arpita Patra, Rahul Rachuri, and Ajith Suresh. 2021. Tetrad: Actively secure 4pc for secure training and inference. arXiv preprint arXiv:2106.02850 (2021).
[40]
Nishant Kumar, Mayank Rathee, Nishanth Chandran, Divya Gupta, Aseem Rastogi, and Rahul Sharma. 2020. Cryptflow: Secure tensorflow inference. In 2020 IEEE Symposium on Security and Privacy (SP). IEEE, 336--353.
[41]
Ryan Lehmkuhl, Pratyush Mishra, Akshayaram Srinivasan, and Raluca Ada Popa. 2021. Muse: Secure inference resilient to malicious clients. In 30th USENIX Security Symposium (USENIX Security 21). 2201--2218.
[42]
Yun Li, Yufei Duan, Zhicong Huang, Cheng Hong, Chao Zhang, and Yifan Song. 2023. Efficient {3PC} for Binary Circuits with Application to {Maliciously-Secure} {DNN} Inference. In 32nd USENIX Security Symposium (USENIX Security 23). 5377--5394.
[43]
Shaofeng Lu, Cheng Li, Xinyi Feng, Yuefeng Lu, Yulong Hu, and Wenxi Li. 2021. Privacy-preserving Hamming distance Protocol and Its Applications. In 2021 2nd International Conference on Electronics, Communications and Information Technology (CECIT). IEEE, 848--853.
[44]
Silvio Micali, Oded Goldreich, and Avi Wigderson. 1987. How to play any mental game. In Proceedings of the Nineteenth ACM Symp. on Theory of Computing, STOC. ACM, 218--229.
[45]
Payman Mohassel and Peter Rindal. 2018. ABY3: A mixed protocol framework for machine learning. In Proceedings of the 2018 ACM SIGSAC conference on computer and communications security. 35--52.
[46]
Mahesh Kumar Morampudi, Munaga VNK Prasad, and USN Raju. 2020. Privacy-preserving iris authentication using fully homomorphic encryption. Multimedia Tools and Applications 79 (2020), 19215--19237.
[47]
A. Nagrani, J. S. Chung, and A. Zisserman. 2017. VoxCeleb: a large-scale speaker identification dataset. In INTERSPEECH.
[48]
Andreas Nautsch, Jose Patino, Amos Treiber, Themos Stafylakis, Petr Mizera, Massimiliano Todisco, Thomas Schneider, and Nicholas Evans. 2019. Privacy-preserving speaker recognition with cohort score normalisation. arXiv preprint arXiv:1907.03454 (2019).
[49]
Arpita Patra, Thomas Schneider, Ajith Suresh, and Hossein Yalame. 2021. {ABY2.0}: Improved {Mixed-Protocol} Secure {Two-Party} Computation. In 30th USENIX Security Symposium (USENIX Security 21). 2165--2182.
[50]
Arpita Patra and Ajith Suresh. 2020. BLAZE: blazing fast privacy-preserving machine learning. arXiv preprint arXiv:2005.09042 (2020).
[51]
Yogachandran Rahulamathavan. 2022. Privacy-preserving similarity calculation of speaker features using fully homomorphic encryption. arXiv preprint arXiv:2202.07994 (2022).
[52]
Yogachandran Rahulamathavan, Safak Dogan, Xiyu Shi, Rongxing Lu, Muttukrishnan Rajarajan, and Ahmet Kondoz. 2020. Scalar product lattice computation for efficient privacy-preserving systems. IEEE Internet of Things Journal 8, 3 (2020), 1417--1427.
[53]
Deevashwer Rathee, Mayank Rathee, Nishant Kumar, Nishanth Chandran, Divya Gupta, Aseem Rastogi, and Rahul Sharma. 2020. CrypTFlow2: Practical 2-party secure inference. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. 325--342.
[54]
Théo Ryffel, Pierre Tholoniat, David Pointcheval, and Francis Bach. 2020. Ariann: Low-interaction privacy-preserving deep learning via function secret sharing. arXiv preprint arXiv:2006.04593 (2020).
[55]
Théo Ryffel, Pierre Tholoniat, David Pointcheval, and Francis Bach. 2022. Ariann: Low-interaction privacy-preserving deep learning via function secret sharing. Proceedings on Privacy Enhancing Technologies 2022, 1 (2022), 291--316.
[56]
Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612--613.
[57]
LI Shundong, ZHANG Mengyu, and XU Wenting. 2021. Secure Scalar Product Protocols. Chinese Journal of Electronics 30, 6 (2021), 1059--1068.
[58]
David Snyder, Guoguo Chen, and Daniel Povey. 2015. Musan: A music, speech, and noise corpus. arXiv preprint arXiv:1510.08484 (2015).
[59]
Junichi Tomida, Masayuki Abe, and Tatsuaki Okamoto. 2016. Efficient functional encryption for inner-product values with full-hiding security. In Information Security: 19th International Conference, ISC 2016, Honolulu, HI, USA, September 3--6, 2016. Proceedings 19. Springer, 408--425.
[60]
Amos Treiber, Andreas Nautsch, Jascha Kolberg, Thomas Schneider, and Christoph Busch. 2019. Privacy-preserving PLDA speaker verification using outsourced secure computation. Speech Communication 114 (2019), 60--71.
[61]
Florian Van Daalen, Lianne Ippel, Andre Dekker, and Inigo Bermejo. 2023. Privacy Preserving n-Party Scalar Product Protocol. IEEE Transactions on Parallel and Distributed Systems (2023).
[62]
Thijs Veugen, Robbert de Haan, Ronald Cramer, and Frank Muller. 2014. A framework for secure computations with two non-colluding servers and multiple clients, applied to recommendations. IEEE Transactions on Information Forensics and Security 10, 3 (2014), 445--457.
[63]
Sameer Wagh, Shruti Tople, Fabrice Benhamouda, Eyal Kushilevitz, Prateek Mittal, and Tal Rabin. 2021. F: Honest-majority maliciously secure framework for private deep learning. Proceedings on Privacy Enhancing Technologies 2021, 1 (2021), 188--208.
[64]
Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In 27th annual symposium on foundations of computer science (Sfcs 1986). IEEE, 162--167.

Index Terms

  1. Nomadic: Normalising Maliciously-Secure Distance with Cosine Similarity for Two-Party Biometric Authentication

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ASIA CCS '24: Proceedings of the 19th ACM Asia Conference on Computer and Communications Security
    July 2024
    1987 pages
    ISBN:9798400704826
    DOI:10.1145/3634737
    This work is licensed under a Creative Commons Attribution International 4.0 License.

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 July 2024

    Check for updates

    Author Tags

    1. privacy-preserving protocols
    2. malicious security
    3. function secret sharing
    4. cosine similarity

    Qualifiers

    • Research-article

    Funding Sources

    • 3IA Côte d?Azur

    Conference

    ASIA CCS '24
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 418 of 2,322 submissions, 18%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 209
      Total Downloads
    • Downloads (Last 12 months)209
    • Downloads (Last 6 weeks)42
    Reflects downloads up to 17 Feb 2025

    Other Metrics

    Citations

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media