Aug 2026· International Conference on Automated Software Engineering· Vol 33· 0 citations· 49 references
TL;DR
An automated formal verification study of the Secure Aggregation protocol using ProVerif is presented, demonstrating how automated formal verification can support trustworthy and verifiable federated learning software systems.
It is proved that TriVer satisfies client data privacy, aggregation correctness, and aggregation-result non-forgeability in the Random Oracle Model under ECDLP hardness, HPRF pseudorandomness, and hash collision resistance, against a fully malicious server that may collude with a subset of aggregators and clients.
Guang-Ye Zhu, Liqiang Wu, Weidong Du· Journal of King Saud Univers...· 0 citations
Vehicular ad hoc networks (VANETs) have become a vital component of intelligent transport systems, with their security concerns increasingly drawing attention. To safeguard user privacy and ensure data authenticity and integrity, researchers have devised numerous certificateless conditional privacy-preserving authentication (CLCPPA) schemes. However, existing schemes generally suffer from insufficient security or high computational and communication overhead. Moreover, most implicitly assume the existence of a secure channel between vehicles and trusted entities during pseudonym generation and transmission, making it difficult to meet the real-time demands and practical deployment requirements of VANETs. To address these issues, this paper constructs a certificateless aggregated conditional privacy-preserving authentication (CL-ACPPA) scheme under elliptic curve cryptography that does not require bilinear operations. Formal security analysis demonstrates that, under the Random Oracle Model and the elliptic curve discrete logarithm problem assumption, the proposed scheme resists adaptive chosen-message attacks from adversaries with varying capabilities. Performance analysis and experimental results demonstrate that, compared with existing schemes, the proposed scheme achieves higher security while maintaining low communication and computational overhead.
Unknown authors· Italian National Conference...· 0 citations
Based on asymmetric cryptography, Passkeys Systems are a secure authentication method that can serve as an alternative to traditional authentication methods, such as usernames and passwords. In this paper, we propose a secure approach to enhance private key synchronization mechanisms in passkeys systems. Our secure service is based on Elliptic Curve Diffie-Hellman protocol and Zero-Knowledge Proofs in a peer-to-peer environment. Following a critical analysis of existing works, which highlights recurrent vulnerabilities related to authentication and confidentiality, we introduce a robust architecture using mutual identity verification, secure session key generation and encrypted passkey transfer. The security of our proposed protocol is assessed through a dual approach: an informal analysis based on potential attack modeling, and a formal validation using ProVerif and Scyther tools. The results demonstrate enhanced resistance to replay attacks, man-in-the-middle attacks, message modification, and identity impersonation, while ensuring optimized performance in terms of computational and communication costs.
Assane Ilboudo, Didier Bassolé, Désiré Guel· EPJ Web of Conferences· 0 citations
This paper introduces a novel PPCC method based on post-quantum fully homomorphic encryption that enables token-based replay fitness computation entirely in the encrypted domain using post-quantum FHE, and is the first method that enables token-based replay fitness computation entirely in the encrypted domain using post-quantum FHE.
Hector A. De la Fuente-Anaya, Miguel Morales-Sandoval, H. Marín-Castro· IEEE Access· 0 citations
A block chain-based Privacy-preserving and Secure Federated Learning (BPS-FL) system that uses threshold homomorphic encryption to safeguard the local gradients of clients in order to successfully solve such privacy and security assault challenges is suggested.
Umema Samreen, I. S. P. James· American Journal of AI Cyber...· 0 citations
Paras, the first two-server protocol for private histogram computation that achieves robustness against collusion between a malicious server and arbitrarily many malicious clients is presented, and is shown to be highly efficient and scalable.
Dimitris Mouris, Lucas Piske, Pratik Sarkar et al.· IACR Cryptology ePrint Archi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
