Theory of Cryptography

23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part II
Erscheinungsjahr 2025
ISBN: 978-3-032-12292-6
Verlag: Springer

Buch, Englisch, 531 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 820 g

Reihe: Lecture Notes in Computer Science

The four-volume set LNCS 16268-16271 constitutes the refereed proceedings of the 23rd International Conference on Theory of Cryptography, TCC 2025, held in Aarhus, Denmark, during December 1–5, 2025. The total of 70 full papers presented in the proceedings was carefully reviewed and selected from 242 submissions. They were organized in topical sections as follows:

Part I: Secure Computation; Homomorphic Primitives; Proofs; 

Part II: Foundations; Obfuscation and Functional Encryption; Secret Sharing;

Part III: Quantum Cryptography; Signatures and Intractability Assumptions; 

Part IV: Proofs; Young Researcher Award and Outstanding Paper Awards; Differential Privacy; Times Cryptography and Verifiable Random Function; Secure Computation.

Zielgruppe

Research

Autoren/Hrsg.

Applebaum, Benny

Lin, Huijia (Rachel)

Fachgebiete

• Mathematik | Informatik EDV | Informatik Technische Informatik Computersicherheit Kryptographie, Datenverschlüsselung
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Informatik
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
• Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
• Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung Netzwerksicherheit

Inhaltsverzeichnis

.- Foundations.
.- Offline-Online Indifferentiability of Cryptographic Systems.
.- Seedless Condensers for Efficiently Samplable Sources.
.- Incompressible Encryption with Everlasting Security.
.- Relationships among FuncCPA and Its Related Notions.
.- Lower Bounds on Inner-Product Functional Encryption from All-or-Nothing Encryption Primitives.
.- A Meta-Complexity Theoretic Approach to Indistinguishability Obfuscation and Witness Pseudo-Canonicalization.
.- Obfuscation and Functional Encryption.
.- Obfuscating Pseudorandom Functions is Post-Quantum Complete.
.- Pseudorandom FE and iO with Applications.
.- Zeroizing Attacks against Evasive and Circular Evasive LWE.
.- (Multi-Input) FE for Randomized Functionalities, Revisited.
.- Adaptively Secure Streaming Functional Encryption.
.- Secret Sharing.
.- Simplified PIR and CDS Protocols and Improved Linear Secret-Sharing Schemes.
.- Deniable Secret Sharing.
.- Polynomial Secret Sharing Schemes and Algebraic Matroids.
.- Pseudorandom Correlation Functions for Garbled Circuits.
.-  Multiparty Homomorphic Secret Sharing and More from LPN and MQ.