Public-Key Cryptography - PKC 2025

The five-volume set LNCS 15674-15678 constitutes the refereed proceedings of the 28th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2025, held in Røros, Norway, during May 12 15, 2025.

The 60 papers included in these proceedings were carefully reviewed and selected from 199 submissions. They are grouped into these topical sections: MPC and friends; advanced PKE; security of post-quantum signatures; proofs and arguments; multi-signatures; protocols; foundations of lattices and LPN; threshold signatures; isogenies and group actions; secure computation; security against real-world attacks; batch arguments and decentralized encryption; and cryptography for blockchains.

Secure Computation: Single-Input Functionality against a Dishonest Majority: Practical and Round-Optimal. - Securely Instantiating `Half Gates Garbling in the Standard Model. - Effcient Permutation Correlations and Batched Random Access for Two-Party Computation. - : A Unified Framework for Computational Verifiable Secret Sharing. Security against Real-World Attacks: Intermundium-DL: Assessing the Resilience of Current Schemes to Discrete-Log-Computation Attacks on Public Parameters. - Public-Algorithm Substitution Attacks: Subverting Hashing and Verification. - Kleptographic Attacks against Implicit Rejection. - Deny Whatever You Want: Dual-Deniable Public-Key Encryption. Batch Arguments and Decentralized Encryption: Monotone-Policy BARGs and More from BARGs and Quadratic Residuosity. - Chosen Ciphertext Security via BARGs. - Dynamic Decentralized Functional Encryption: Generic Constructions with Strong Security. - Dynamic Decentralized Functional Encryptions from Pairings in the Standard Model.