{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T04:24:20Z","timestamp":1787027060573,"version":"build-2736575974"},"reference-count":25,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Secure authentication is an essential mechanism required by the vast majority of computer systems and various applications in order to establish user identity. Credentials such as passwords and biometric data should be protected against theft, as user impersonation can have serious consequences. Some practices widely used in order to make authentication more secure include storing password hashes in databases and processing biometric data under encryption. In this paper, we propose a system for both password-based and iris-based authentication that uses secure multiparty computation (SMPC) protocols and Shamir secret sharing. The system allows secure information storage in distributed databases and sensitive data is never revealed in plaintext during the authentication process. The communication between different components of the system is secured using both symmetric and asymmetric cryptographic primitives. The efficiency of the used protocols is evaluated along with two SMPC specific metrics: The number of communication rounds and the communication cost. According to our results, SMPC based on secret sharing can be successfully integrated in real-word authentication systems and the communication cost has an important impact on the performance of the SMPC protocols.<\/jats:p>","DOI":"10.3390\/sym13050894","type":"journal-article","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T12:17:16Z","timestamp":1621340236000},"page":"894","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Assessment of Two Privacy Preserving Authentication Methods Using Secure Multiparty Computation Based on Secret Sharing"],"prefix":"10.3390","volume":"13","author":[{"given":"Diana-Elena","family":"F\u0103l\u0103ma\u015f","sequence":"first","affiliation":[{"name":"Computer Science Department, Technical University of Cluj-Napoca, 400114 Cluj-Napoca, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2433-7535","authenticated-orcid":false,"given":"Kinga","family":"Marton","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technical University of Cluj-Napoca, 400114 Cluj-Napoca, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alin","family":"Suciu","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technical University of Cluj-Napoca, 400114 Cluj-Napoca, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,5,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.ins.2018.10.024","article-title":"Secure Multi-Party Computation: Theory, practice and applications","volume":"476","author":"Zhao","year":"2019","journal-title":"Inf. Sci."},{"key":"ref_2","unstructured":"Bogdanov, D. (2007). Foundations and Properties of Shamir\u2019s Secret Sharing Scheme, Research Seminar in Cryptography, University of Tartu, Institute of Computer Science. Available online: http:\/\/kodu.ut.ee\/~peeter_l\/teaching\/seminar07k\/bogdanov.pdf."},{"key":"ref_3","unstructured":"Bozkurt, I.N., Guloglu, A.M., Kaya, K., and Selcuk, A.A. (2008, January 25\u201327). Threshold Cryptography Based on Blakley Secret Sharing. Proceedings of the Information Security and Cryptology Conference (ISC), Ankara, Turkey."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kaya, K., Secuk, A.A., and Tezcan, Z. (2006, January 1\u20133). Threshold Cryptography Based on Asmuth-Bloom Secret Sharing. Proceedings of the International Symposium on Computer and Information Sciences (ISCIS), Istanbul, Turkey. Lecture Notes in Computer Science (LNCS).","DOI":"10.1007\/11902140_97"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TCSVT.2003.818350","article-title":"How iris recognition works","volume":"14","author":"Daugman","year":"2004","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2465","DOI":"10.1109\/TPAMI.2011.89","article-title":"Improved Iris Recognition through Fusion of Hamming Distance and Fragile Bit Distance","volume":"33","author":"Hollingsworth","year":"2011","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Rotaru, D., Scholl, P., Soria-Vazquez, E., and Vivek, S. (2017, January 10\u201312). Faster Secure Multi-party Computation of AES and DES Using Lookup Tables. Proceedings of the International Conference on Applied Cryptography and Network Security (ACNS), Kanazawa, Japan. Lecture Notes in Computer Science (LNCS).","DOI":"10.1007\/978-3-319-61204-1_12"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., and Shelat, A. (2019, January 19\u201323). Threshold ECDSA from ECDSA Assumptions: The Multiparty Case. Proceedings of the IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP.2019.00024"},{"key":"ref_9","unstructured":"Pattuk, E., Kantarcioglu, M., Ulusoy, H., and Malin, B. (2016, January 18\u201320). CheapSMC: A Framework to Minimize SMC Cost in Cloud. Proceedings of the Data and Applications Security and Privacy XXX, DBSec, Trento, Italy. Lecture Notes in Computer Science (LNCS)."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.comcom.2020.02.014","article-title":"Privacy preserving distributed data mining based on secure multi-party computation","volume":"153","author":"Liu","year":"2020","journal-title":"Comput. Commun."},{"key":"ref_11","unstructured":"Chen, V., Pastro, V., and Raykova, M. (2019). Secure Computation for Machine Learning With SPDZ. arXiv."},{"key":"ref_12","unstructured":"Nair, D.G., Binu, V.P., and Kumarc, G.S. (2015). An Improved E-voting scheme using Secret Sharing based Secure Multi-party Computation. arXiv."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Naidu, P.S., Kharat, R., Tekade, R., Mendhe, P., and Magade, V. (2016, January 12\u201313). E-Voting System Using Visual Cryptography & Secure Multi-party Computation. Proceedings of the International Conference on Computing Communication Control and Automation (ICCUBEA), Pune, India.","DOI":"10.1109\/ICCUBEA.2016.7860062"},{"key":"ref_14","unstructured":"Bissoli, A., and d\u2019Amore, F. (2018). Authentication as a service: Shamir Secret Sharing with byzantine components. arXiv."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Rosulek, M., and Zhang, Y. (2015, January 12\u201316). Fast and Secure Three-party Computation: The Garbled Circuit Approach. Proceedings of the 22nd ACM SIGSAC Conference, Denver, CO, USA.","DOI":"10.1145\/2810103.2813705"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"7129505","DOI":"10.1155\/2017\/7129505","article-title":"Privacy-preserving biometric authentication: Challenges and directions","volume":"2017","author":"Pagnin","year":"2017","journal-title":"Secur. Commun. Netw."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Blanton, M., and Gasti, P. (2011, January 12\u201314). Secure and Efficient Protocols for Iris and Fingerprint Identification. Proceedings of the European Symposium on Research in Computer Security (ESORICS), Leuven, Belgium.","DOI":"10.1007\/978-3-642-23822-2_11"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1049\/iet-bmt.2018.5138","article-title":"SEMBA: SEcure Multi-Biometric Authentication","volume":"8","author":"Barni","year":"2019","journal-title":"IET Biometr."},{"key":"ref_19","first-page":"1749","article-title":"From Keys to Databases\u2014Real-World Applications of Secure Multi-Party Computation","volume":"61","author":"Archer","year":"2018","journal-title":"Comput. J."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"F\u0103l\u0103ma\u015f, D.E., and Marton, K. (2019, January 10\u201312). Performance Impact Analysis of Rounds and Amounts of Communication in Secure Multiparty Computation Based on Secret Sharing. Proceedings of the 18th RoEduNet Conference: Networking in Education and Research, Gala\u021bi, Romania.","DOI":"10.1109\/ROEDUNET.2019.8909467"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","article-title":"Multiparty computation for interval, equality, and comparison without bit-decomposition protocol","volume":"Volume 4450","author":"Nishide","year":"2007","journal-title":"Public Key Cryptography\u2014PKC 2007"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Boesgaard, M., Vesterager, M., Pedersen, T., Christiansen, J., and Scavenius, O. (2003, January 24\u201326). Rabbit: A New High-Performance Stream Cipher. Proceedings of the International Workshop on Fast Software Encryption (FSE), Lund, Sweden. Lecture Notes in Computer Science (LNCS).","DOI":"10.1007\/978-3-540-39887-5_23"},{"key":"ref_23","unstructured":"De Canniere, C. (September, January 30). Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles. Proceedings of the ISC, Samos, Greece. Lecture Notes in Computer Science (LNCS)."},{"key":"ref_24","unstructured":"Turban, T. (2014). A Secure Multi-Party Computation Protocol Suite Inspired by Shamir\u2019s Secret Sharing Scheme. [Master\u2019s Thesis, Norwegian University of Science and Technology]."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Damgard, I., Fitzi, M., Kiltz, E., Nielsen, J.B., and Toft, T. (2006, January 4\u20137). Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. Proceedings of the Theory of Cryptography Conference (TCC), New York, NY, USA. Lecture Notes in Computer Science (LNCS).","DOI":"10.1007\/11681878_15"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/5\/894\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:03:14Z","timestamp":1760162594000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/5\/894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,18]]},"references-count":25,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,5]]}},"alternative-id":["sym13050894"],"URL":"https:\/\/doi.org\/10.3390\/sym13050894","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,18]]}}}