Theory of Cryptography

23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025, Proceedings, Part I

Benny Applebaum, Huijia (Rachel) Lin (Herausgeber)

Buch | Softcover

XIV, 476 Seiten

2025
Springer International Publishing (Verlag)
978-3-032-12286-5 (ISBN)

Infos

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.

Inhalt

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

Produkt-Details

• Erscheinungsdatum: 02.12.2025
• Reihe/Serie: Lecture Notes in Computer Science
• Zusatzinfo: XIV, 476 p. 55 illus., 17 illus. in color.
• Verlagsort: Cham
• Sprache: englisch
• Maße: 155 x 235 mm
• Themenwelt: Informatik ► Theorie / Studium ► Kryptologie
• Schlagworte: authentication • black-box separations • Consensus • cryptographic foundations • cryptographic proofs • cryptography • differential privacy • homomorphic primitives • information-theoretic cryptography • obfuscation • proof systems • Pseudorandomness • Quantum Cryptography • Secret Sharing • secure multi-party computation • theory
• ISBN-10: 3-032-12286-4 / 3032122864
• ISBN-13: 978-3-032-12286-5 / 9783032122865
• Zustand: Neuware