Advances in Cryptology – EUROCRYPT 2025 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, May 4–8, 2025, Proceedings, Part VII /

This eight-volume set, LNCS 15601-15608, constitutes the proceedings of the 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2025, held in Madrid, Spain, during May 4–8, 2025. The 123 papers included in these proceedings were carefully review...

Descripció completa

Guardat en:
Dades bibliogràfiques
Autor corporatiu: SpringerLink (Online service)
Altres autors: Fehr, Serge (Editor), Fouque, Pierre-Alain (Editor)
Format: Electrònic eBook
Idioma:anglès
Publicat: Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Edició:1st ed. 2025.
Col·lecció:Lecture Notes in Computer Science, 15607
Matèries:
Accés en línia:https://doi.org/10.1007/978-3-031-91098-2
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
Taula de continguts:
  • Theoretical Foundations: Oracle Separation Between Quantum Commitments and Quantum One-wayness
  • A New World in the Depths of Microcrypt: Separating OWSGs and Quantum Money from QEFID
  • Hard Quantum Extrapolations in Quantum Cryptography
  • A Meta-complexity Characterization of Quantum Cryptography
  • The power of a single Haar random state: constructing and separating quantum pseudorandomness
  • Pseudorandomness in the (Inverseless) Haar Random Oracle Model
  • Verifiable random function from the Deuring correspondence and higher dimensional isogenies
  • Exponent-VRFs and Their Applications
  • Good Things Come to Those Who Wait: Dishonest-Majority Coin-Flipping Requires Delay Functions
  • LEAP: A Fast, Lattice-based OPRF with Application to Private Set Intersection
  • Pseudorandom Functions with Weak Programming Privacy and Applications to Private Information Retrieval
  • Distributed Randomness using Weighted VUFs
  • A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More
  • Fine-Grained Complexity in a World without Cryptography
  • Succinct Randomized Encodings from Laconic Function Evaluation, Faster and Simpler
  • BitGC: Garbled Circuits with 1 Bit per Gate.