Imaxe de Portada

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 V /

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...

Descrición completa

Gardado en:
Detalles Bibliográficos
Autor Corporativo: SpringerLink (Online service)
Outros autores: Fehr, Serge (Editor), Fouque, Pierre-Alain (Editor)
Formato: Electrónico eBook
Idioma:inglés
Publicado: Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Edición:1st ed. 2025.
Series:Lecture Notes in Computer Science, 15605
Subjects:
Cryptography.
Data encryption (Computer science).
Computer networks > Security measures.
Computer networks .
Application software.
Data protection.
Cryptology.
Mobile and Network Security.
Computer Communication Networks.
Computer and Information Systems Applications.
Security Services.
Acceso en liña:https://doi.org/10.1007/978-3-031-91092-0
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
Table of Contents:
  • Secure Multiparty Computation II: Multi-key Homomorphic Secret Sharing
  • Disincentivize Collusion in Veri able Secret Sharing
  • Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement
  • MiniCast: Minimizing the Communication Complexity of Reliable Broadcast
  • Asymptotically Optimal Early Termination for Dishonest Majority Broadcast
  • Efficient Pseudorandom Correlation Generators for Any Finite Field
  • Efficient Distributed Randomness Generation from Minimal Assumptions where PArties Speak Sequentially Once
  • Simultaneous-Message and Succinct Secure Computation
  • Efficient Multiparty Private Simultaneous Messages for Symmetric Functions
  • MPC with Publicly Identi able Abort from Pseudorandomness and Homomorphic Encryption
  • The Complexity of Memory Checking with Covert Security
  • Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions
  • Black-Box Constant-Round Secure 2PC with Succinct Communication
  • Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries
  • Weakly Super-Invertible Matrices and Constant Communication Dishonest Majority MPC
  • Honest Majority MPC with Õ(/C/) Communication in Minicrypt.

Títulos similares