{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:28:33Z","timestamp":1760059713015,"version":"build-2065373602"},"reference-count":56,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"State Research Agency of Spain (Agencia Estatal de Investigaci\u00f3n\u2014AEI)","award":["PID2021-124176OB-I00","PID2023-152984OB-I00"],"award-info":[{"award-number":["PID2021-124176OB-I00","PID2023-152984OB-I00"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>As the demand for expansive back-end systems in online applications continues to grow, novel frameworks are necessitated to address the escalating operational demands, energy consumption, and associated costs. Traditional Client\u2013Server models, while offering centralized security and reliability, are characterized by their high deployment and maintenance expenses. Conversely, Peer-to-Peer (P2P) models, despite being cost-effective and scalable, are hindered by inherent security and data integrity challenges. Moreover, the lack of a central authority in P2P systems complicates a definitive resolution of scenarios involving stakes, where users cannot withdraw without incurring a tangible loss. In this research work, a hybrid back-end framework is introduced, combining the advantages of both models through the utilization of cryptographic algorithms and Secure Multi-Party Computation (MPC) protocols. The baseline solution is lightweight and fully composable, making it capable of utilizing different more complex slot-in MPC techniques. The proposed framework\u2019s effectiveness is demonstrated through a simplified two-player Spades game, although it is fully generalizable to any application. Evaluations across multiple case studies reveal substantial performance enhancements compared to conventional approaches, particularly post-initialization, highlighting the scheme\u2019s potential as a cost-effective, energy-efficient, and secure solution for modern online applications.<\/jats:p>","DOI":"10.3390\/cryptography9030048","type":"journal-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:11:04Z","timestamp":1751429464000},"page":"48","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Composable Privacy-Preserving Framework for Stakes-Based Online Peer-to-Peer Applications"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2194-1112","authenticated-orcid":false,"given":"Nikola","family":"Hristov-Kalamov","sequence":"first","affiliation":[{"name":"Escuela T\u00e9cnica Superior de Ingenier\u00eda Inform\u00e1tica, Universidad Rey Juan Carlos, C\/Tulip\u00e1n S\/N, 28933 M\u00f3stoles, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8325-5372","authenticated-orcid":false,"given":"Ra\u00fal","family":"Fern\u00e1ndez-Ruiz","sequence":"additional","affiliation":[{"name":"Escuela T\u00e9cnica Superior de Ingenier\u00eda Inform\u00e1tica, Universidad Rey Juan Carlos, C\/Tulip\u00e1n S\/N, 28933 M\u00f3stoles, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agust\u00edn","family":"\u00c1lvarez-Marquina","sequence":"additional","affiliation":[{"name":"Neuromorphic Speech Processing Lab, Center for Biomedical Technology, Universidad Polit\u00e9cnica de Madrid Campus de Montegancedo, 28223 Pozuelo de Alarc\u00f3n, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7539-7063","authenticated-orcid":false,"given":"Julio","family":"Guill\u00e9n-Garc\u00eda","sequence":"additional","affiliation":[{"name":"Escuela T\u00e9cnica Superior de Ingenier\u00eda Inform\u00e1tica, Universidad Rey Juan Carlos, C\/Tulip\u00e1n S\/N, 28933 M\u00f3stoles, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3209-924X","authenticated-orcid":false,"given":"Roberto","family":"Gallardo-Cava","sequence":"additional","affiliation":[{"name":"Escuela T\u00e9cnica Superior de Ingenier\u00eda Inform\u00e1tica, Universidad Rey Juan Carlos, C\/Tulip\u00e1n S\/N, 28933 M\u00f3stoles, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6063-4898","authenticated-orcid":false,"given":"Daniel","family":"Palacios-Alonso","sequence":"additional","affiliation":[{"name":"Escuela T\u00e9cnica Superior de Ingenier\u00eda Inform\u00e1tica, Universidad Rey Juan Carlos, C\/Tulip\u00e1n S\/N, 28933 M\u00f3stoles, Madrid, Spain"},{"name":"Neuromorphic Speech Processing Lab, Center for Biomedical Technology, Universidad Polit\u00e9cnica de Madrid Campus de Montegancedo, 28223 Pozuelo de Alarc\u00f3n, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,1]]},"reference":[{"key":"ref_1","first-page":"34","article-title":"Impact of Energy Consumption in Data Centers","volume":"6","author":"Author","year":"2021","journal-title":"Rev. Digit. Energ."},{"key":"ref_2","unstructured":"Statista (2025, June 24). Energy Demand Data Centers Globally by Type 2021|Statista. Available online: https:\/\/www.statista.com\/statistics\/186992\/global-derived-electricity-consumption-in-data-centers-and-telecoms\/."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s40869-019-00084-2","article-title":"Toward greener gaming: Estimating national energy use and energy efficiency potential","volume":"8","author":"Mills","year":"2019","journal-title":"Comput. Games J."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/2.933501","article-title":"P2P networking: An information sharing alternative","volume":"34","author":"Parameswaran","year":"2001","journal-title":"Computer"},{"key":"ref_5","unstructured":"Karagiannis, T., Broido, A., Brownlee, N., Claffy, K., and Faloutsos, M. (December, January 29). Is P2P dying or just hiding? [P2P traffic measurement]. Proceedings of the IEEE Global Telecommunications Conference, 2004. GLOBECOM \u201904, Dallas, TX, USA."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/SURV.2009.090102","article-title":"Peer-to-peer overlays for real-time communication: Security issues and solutions","volume":"11","author":"Chopra","year":"2009","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1016\/j.eswa.2014.08.053","article-title":"Framework for preserving security and privacy in peer-to-peer content distribution systems","volume":"42","author":"Qureshi","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"103216","DOI":"10.1016\/j.micpro.2020.103216","article-title":"Design of peer-to-peer protocol with sensible and secure IoT communication for future internet architecture","volume":"78","author":"Devi","year":"2020","journal-title":"Microprocess. Microsyst."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Jia, Y., Tople, S., Moataz, T., Gong, D., Saxena, P., and Liang, Z. (December, January 29). Robust P2P Primitives Using SGX Enclaves. Proceedings of the 23rd International Symposium on Research in Attacks, Intrusions and Defenses (RAID 2020), Singapore.","DOI":"10.1109\/ICDCS47774.2020.00134"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Al-Otaiby, N., Alhindi, A., and Kurdi, H. (2022). AntTrust: An Ant-Inspired Trust Management System for Peer-to-Peer Networks. Sensors, 22.","DOI":"10.3390\/s22020533"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ahmed, W., Di, W., and Mukathe, D. (2023). Blockchain-Assisted Privacy-Preserving and Context-Aware Trust Management Framework for Secure Communications in VANETs. Sensors, 23.","DOI":"10.3390\/s23125766"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1109\/TCSVT.2022.3204753","article-title":"SNIS: A Signal Noise Separation-Based Network for Post-Processed Image Forgery Detection","volume":"33","author":"Chen","year":"2023","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"7236","DOI":"10.1109\/TCSVT.2023.3278310","article-title":"FAMM: Facial Muscle Motions for Detecting Compressed Deepfake Videos Over Social Networks","volume":"33","author":"Liao","year":"2023","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1561\/3300000019","article-title":"A pragmatic introduction to secure multi-party computation","volume":"2","author":"Evans","year":"2018","journal-title":"Found. Trends\u00ae Priv. Secur."},{"key":"ref_15","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_16","doi-asserted-by":"crossref","unstructured":"Seo, M. (2021). Fair and Secure Multi-Party Computation with Cheater Detection. Cryptography, 5.","DOI":"10.3390\/cryptography5030019"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Baum, C., Melissaris, N., Rachuri, R., and Scholl, P. (2024, January 18\u201322). Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. Proceedings of the CRYPTO 2024, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-031-68397-8_14"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s11042-007-0163-2","article-title":"Cheating detection through game time modeling: A better way to avoid time cheats in P2P MOGs?","volume":"37","author":"Ferretti","year":"2008","journal-title":"Multimed. Tools Appl."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Buyukkaya, E., Abdallah, M., and Cavagna, R. (2009, January 10\u201313). VoroGame: A Hybrid P2P Architecture for Massively Multiplayer Games. Proceedings of the 2009 6th IEEE Consumer Communications and Networking Conference, Las Vegas, NV, USA.","DOI":"10.1109\/CCNC.2009.4784788"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TNET.2006.886289","article-title":"Cheat-Proof Playout for Centralized and Peer-to-Peer Gaming","volume":"15","author":"Baughman","year":"2007","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_21","first-page":"93","article-title":"A Cryptographically Secured Real-Time Peer-to-Peer Multiplayer Framework For Browser WebRTC","volume":"12","author":"Han","year":"2022","journal-title":"Comput. Sci. Inf. Technol. (CS IT)"},{"key":"ref_22","unstructured":"Davidson, A., Faz-Hernandez, A., Sullivan, N., and Wood, C.A. (2025, June 24). Oblivious Pseudorandom Functions (OPRFs) Using Prime-Order Groups. RFC 9497. Available online: https:\/\/www.rfc-editor.org\/info\/rfc9497."},{"key":"ref_23","first-page":"89","article-title":"Wallet Databases with Observers","volume":"Volume 658","author":"Chaum","year":"1993","journal-title":"Advances in Cryptology\u2014EUROCRYPT\u201992, Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, Balatonf\u00fcred, Hungary, 24\u201328 May 1992"},{"key":"ref_24","unstructured":"Yakoubov, S. (2025, June 24). A Gentle Introduction to Yao\u2019s Garbled Circuits. Available online: https:\/\/web.mit.edu\/sonka89\/www\/papers\/2017ygc.pdf."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., and Rogaway, P. (2012, January 16\u201318). Foundations of Garbled Circuits. Proceedings of the 2012 ACM Conference on Computer and Communications Security, Raleigh, NC, USA.","DOI":"10.1145\/2382196.2382279"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Choudhury, A., and Patra, A. (2022). Oblivious Transfer. Secure Multi-Party Computation Against Passive Adversaries, Springer International Publishing.","DOI":"10.1007\/978-3-031-12164-7"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C. (1986, January 27\u201329). How to generate and exchange secrets. Proceedings of the 27th Annual Symposium on Foundations of Computer Science, Toronto, ON, Canada.","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., and Schneider, T. (2008). Improved Garbled Circuit: Free XOR Gates and Applications. Automata, Languages and Programming, Proceedings of the 35th International Colloquium, ICALP 2008, Part II, Reykjavik, Iceland, 7\u201311 July 2008, Springer.","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Zahur, S., Rosulek, M., and Evans, D. (2015, January 26\u201330). Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates. Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria.","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., and Rogaway, P. (1990, January 13\u201317). The round complexity of secure protocols. Proceedings of the Symposium on the Theory of Computing, Baltimore, MD, USA.","DOI":"10.1145\/100216.100287"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V., Keelveedhi, S., and Rogaway, P. (2013, January 19\u201322). Efficient Garbling from a Fixed-Key Blockcipher. Proceedings of the 2013 IEEE Symposium on Security and Privacy, Berkeley, CA, USA.","DOI":"10.1109\/SP.2013.39"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Sadeghi, A.R., and Schneider, T. (2009, January 12\u201314). Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima. Proceedings of the 8th International Conference, CANS 2009, Kanazawa, Japan.","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Ball, M., Malkin, T., and Rosulek, M. (2016, January 24\u201328). Garbling Gadgets for Boolean and Arithmetic Circuits. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria.","DOI":"10.1145\/2976749.2978410"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Mohassel, P., and Rosulek, M. (2014, January 17\u201321). FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR. Proceedings of the 34th Annual Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-662-44381-1_25"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., and Williams, S.C. (2009, January 6\u201310). Secure Two-Party Computation Is Practical. Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan.","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/s00145-014-9177-x","article-title":"An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries","volume":"28","author":"Lindell","year":"2014","journal-title":"J. Cryptol."},{"key":"ref_38","unstructured":"Shelat, A., and Shen, C.h. (2011, January 15\u201319). Two-Output Secure Computation with Malicious Adversaries. Proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Mohassel, P., and Franklin, M. (2006, January 24\u201326). Efficiency Tradeoffs for Malicious Two-Party Computation. Proceedings of the 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA.","DOI":"10.1007\/11745853_30"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Huang, Y., Katz, J., and Evans, D. (2012, January 20\u201323). Quid-Pro-Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution. Proceedings of the IEEE Symposium on Security and Privacy (S&P), San Francisco, CA, USA.","DOI":"10.1109\/SP.2012.43"},{"key":"ref_41","first-page":"328","article-title":"Going Beyond Dual Execution: MPC for Functions with Efficient Verification","volume":"Volume 12111","author":"Hazay","year":"2020","journal-title":"Public-Key Cryptography\u2014PKC 2020, Proceedings of the 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, 4\u20137 May 2020"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Hazay, C., and Yang, Y. (2024, January 26\u201330). Toward Malicious Constant-Rate 2PC via Arithmetic Garbling. Proceedings of the 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland.","DOI":"10.1007\/978-3-031-58740-5_14"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Cui, H., Wang, X., Yang, K., and Yu, Y. (2023, January 23\u201327). Actively Secure Half-Gates with Minimum Overhead under Duplex Networks. Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France.","DOI":"10.1007\/978-3-031-30617-4_2"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., and Ishai, Y. (2015, January 26\u201330). Function Secret Sharing. Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria.","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., and Ishai, Y. (2016, January 24\u201328). Function Secret Sharing: Improvements and Extensions. Proceedings of the CCS\u201916: 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria.","DOI":"10.1145\/2976749.2978429"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Boyle, E., Chandran, N., Gilboa, N., Gupta, D., Ishai, Y., Kumar, N., and Rathee, M. (2021, January 17\u201321). Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation. Proceedings of the 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia.","DOI":"10.1007\/978-3-030-77886-6_30"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., and Zakarias, S. (2012, January 19\u201323). Multiparty Computation from Somewhat Homomorphic Encryption. Proceedings of the 32nd Annual Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"ref_48","unstructured":"Wang, X., Malozemoff, A.J., and Katz, J. (2025, June 24). EMP-toolkit: Efficient Multi-Party Computation Toolkit. Available online: https:\/\/github.com\/emp-toolkit."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., and Zohner, M. (2015, January 8\u201311). ABY: A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. Proceedings of the 22nd NDSS Symposium 2015, San Diego, CA, USA.","DOI":"10.14722\/ndss.2015.23113"},{"key":"ref_50","unstructured":"Kalamov, N.H. (2025, June 24). Spades Emulation Repo. Available online: https:\/\/github.com\/SA-BIO\/Securing-Online-Applications."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Blackburn, J., Simha, R., Kourtellis, N., Zuo, X., Long, C., Ripeanu, M., Skvoretz, J., and Iamnitchi, A. (2011). Cheaters in the Steam Community Gaming Social Network. arXiv.","DOI":"10.1145\/2160803.2160871"},{"key":"ref_52","unstructured":"Irdeto (2024, July 23). Global Gaming Survey: Consumer Trust and the Battle Against Cheating in Online Gaming. Available online: https:\/\/irdeto.com\/hubfs\/resources\/reports\/global-gaming-report-2018.pdf."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Kamvar, S.D., Schlosser, M.T., and Garcia-Molina, H. (2003, January 20\u201324). The Eigentrust algorithm for reputation management in P2P networks. Proceedings of the 12th International Conference on World Wide Web, Budapest, Hungary.","DOI":"10.1145\/775240.775242"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Cunningham, R., Fuller, B., and Yakoubov, S. (December, January 29). Catching MPC Cheaters: Identification and Openability. Proceedings of the Information Theoretic Security: 10th International Conference, ICITS 2017, Hong Kong, China.","DOI":"10.1007\/978-3-319-72089-0_7"},{"key":"ref_55","first-page":"500","article-title":"Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement","volume":"Volume 10957","author":"David","year":"2018","journal-title":"Financial Cryptography and Data Security, Proceedings of the 22nd International Conference, FC 2018, Nieuwpoort, Cura\u00e7ao, 26 February\u20132 March 2018"},{"key":"ref_56","first-page":"282","article-title":"ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement","volume":"Volume 11598","author":"David","year":"2019","journal-title":"Financial Cryptography and Data Security, Proceedings of the 23rd International Conference, FC 2019, Frigate Bay, St. Kitts and Nevis, 18\u201322 February 2019"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/3\/48\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:02:41Z","timestamp":1760032961000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/3\/48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,1]]},"references-count":56,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["cryptography9030048"],"URL":"https:\/\/doi.org\/10.3390\/cryptography9030048","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2025,7,1]]}}}