Applebaum / Lin Theory of Cryptography

23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025, Proceedings, Part IV
Erscheinungsjahr 2025
ISBN: 978-3-032-12290-2
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 710 Seiten

Reihe: 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)

Inhaltsverzeichnis

.- Proofs II.
.- Plonk is Simulation Extractable in ROM Under Falsifiable Assumptions.
.- Time-Space Trade-Offs for Sumcheck.
.- A Hidden-Bits Approach to Statistical ZAPs from LWE.
.- Justvengers: Batched VOLE ZK Disjunctions in O(R+B+C) Communication.
.- Four-round Statistical Non-malleable Zero-knowledge.
.- Space-Deniable Proofs.
.- Young Researcher Award and Outstanding Paper Awards.
.- Optimal Bounds on the Existence of Pseudorandom Codes.
.- Separating Pseudorandom Codes from Local Oracles.
.- Generalized and Unified Equivalences between Hardness and Pseudoentropy.
.- Special Genera of Hermitian Lattices and Applications to HAWK.
.- Differential Privacy.
.- Differentially Private Learning Beyond the Classical Dimensionality Regime.
.- Differentially Private Compression and the Sensitivity of LZ77.
.- Securing Unbounded Differential Privacy Against Timing Attacks.
.- Cryptography with Weak Privacy.
.- Timed Cryptography and Verifiable Random Function .
.- Time/Space Tradeoffs for Generic Attacks on Delay Functions. 
.- Constrained Verifiable Random Functions Without Obfuscation and Friends.
.- Provably Memory-Hard Proofs of Work With Memory-Easy Verification.
.- Secure Computation II.
.- On the Impossibility of Actively Secure Distributed Samplers.
.- Scalable Multi-Server Private Information Retrieval.
.- Multi-Server Doubly Efficient PIR in the Classical Model and Beyond.
.- Universally Composable Succinct Vector Commitments and Applications.
.- An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast.