Applied Cryptography and Network Security 23rd International Conference, ACNS 2025, Munich, Germany, June 23–26, 2025, Proceedings, Part I

This three-volume set LNCS 15825-15827 constitutes the proceedings of the 23rd International Conference on Applied Cryptography and Network Security, ACNS 2025, held in Munich, Germany, during June 23-26, 2025.
The 55 full papers included in these proceedings were carefully reviewed and selected from 241 submissions. The papers cover all technical aspects of applied cryptography, network and computer security and privacy, representing both academic research work as well as developments in industrial and technical frontiers.

Encryption & Secret Sharing: Registered Matchmaking Encryption.- Sum-Preserving Encryption: Improved Bounds and Constructions for Long Vectors.- Fully Secure Searchable Encryption from PRFs, Pairings, and Lattices.- Pre-Constructed Publicly Verifiable Secret Sharing and Applications. Blockchains & Decentralized Systems: HCC: A Language-Independent Hardening Contract Compiler for Smart Contracts.- Double Auction Meets Blockchain: Consensus from Scored Bid-Assignment.- SoK: Measuring Blockchain Decentralization.- Automated Selfish Mining Analysis for DAG-Based PoW Consensus Protocols.- Sassafras: Effcient Batch Single Leader Election. Multi-Party Computation: Oblivious suffx sorting: A multi-party computation scheme for secure and effcient suffx sorting.- Share&Shrink: Effcient and Delegatable MPC in one Broadcast then Asynchrony.- Delayed-Input Multi-Party Computation.- Quantum-Safe Public Key Blinding from MPC-in-the-Head Signature Schemes. Network Security: Opening Pandora’s Packet: Expose IPv6 Implementations Vulnerabilities Using Differential Fuzzing.- TAU: Trust via Asynchronous Updates for Satellite Network Resiliency. Cryptographic primitives and protocols: Spilling-Cascade: an Optimal PKE Combiner for KEM Hybridization.- Distributed Asynchronous Remote Key Generation.- Anonymous Authenticated Key Exchange.- Key Recovery Attacks on Unpatched MEGA from Four Queries: Solving Approximate Divisor Problem with Help of Approximation of Squared Divisor.- Tighter provable security for TreeKEM.