Description
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.
.- Secure Computation I.
.- Honest Majority Constant-Round MPC with Linear Communication
from One-Way Functions.
.- Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols.
.- Efficient Garbled Pseudorandom Functions and Lookup Tables from Minimal Assumption.
.- Practical Secure Delegated Linear Algebra with Trapdoored Matrices.
.- On Achieving Best-in-the-Multiverse MPC.
.- Information-Theoretic Broadcast-Optimal MPC.
.- Homomorphic Primitives.
.- Vive Galois! Part 1: Optimal SIMD Packing and Packed Bootstrapping for FHE.
.- Fully-Homomorphic Encryption from Lattice Isomorphism.
.- Large-Plaintext Functional Bootstrapping in FHE with Small Bootstrapping Keys.
.- Slightly Sublinear Trapdoor Hash Functions and PIR from Low-Noise LPN.
.- Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank
.- Proofs I.
.- Linear Prover IOPs in Log Star Rounds.
.- Linear-Time Accumulation Schemes.
.- Relativized Succinct Arguments in the ROM Do Not Exist.
.- SNARK Lower Bounds via Communication Complexity.
.- A Fiat-Shamir Transformation From Duplex Sponges.
