Buch, Englisch, 488 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 756 g
28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Røros, Norway, May 12-15, 2025, Proceedings, Part I
Buch, Englisch, 488 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 756 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-031-91819-3
Verlag: Springer Nature Switzerland
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
MPC and Friends: Non-Interactive Distributed Point Functions.- Watermarkable and Zero-Knowledge Verifiable Delay Functions from any Proof of Exponentiation.- Higher Residuosity Attacks on Small RSA Subgroup Decision Problems. Advanced PKE: Adaptively Secure IBE from Lattices with Asymptotically Better Effciency.- Adaptively-Secure Big-Key Identity-Based Encryption.- Non-Committing Identity based Encryption: Constructions and Applications.- Registration-Based Encryption in the Plain Model. Security of Post-Quantum Signatures: Thorough Power Analysis on Falcon Gaussian Samplers and Practical Countermeasure.- Finding a polytope: A practical fault attack against Dilithium.- One Bit to Rule Them All - Imperfect Randomness Harms Lattice Signatures.- The Security of Hash-and-Sign with Retry against Superposition Attacks. Proofs and Arguments: Split Prover Zero-Knowledge SNARKs.- Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler.- Transparent SNARKs over Galois Rings.- Lattice-based Proof-Friendly Signatures from Vanishing Short Integer Solutions.
