1 option
Theory of Cryptography : 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025, Proceedings, Part I / edited by Benny Applebaum, Huijia (Rachel) Lin.
Springer Nature - Springer Computer Science eBooks 2026 English International Available online
View online- Format:
- Book
- Author/Creator:
- Applebaum, Benny.
- Series:
- Lecture Notes in Computer Science, 1611-3349 ; 16268
- Language:
- English
- Subjects (All):
- Cryptography.
- Data encryption (Computer science).
- Data protection.
- Computer networks--Security measures.
- Computer networks.
- Computer systems.
- Data structures (Computer science).
- Information theory.
- Cryptology.
- Security Services.
- Mobile and Network Security.
- Computer Communication Networks.
- Computer System Implementation.
- Data Structures and Information Theory.
- Local Subjects:
- Cryptology.
- Security Services.
- Mobile and Network Security.
- Computer Communication Networks.
- Computer System Implementation.
- Data Structures and Information Theory.
- Physical Description:
- 1 online resource (830 pages)
- Edition:
- 1st ed. 2026.
- Place of Publication:
- Cham : Springer Nature Switzerland : Imprint: Springer, 2026.
- Summary:
- 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.
- Contents:
- 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.
- Notes:
- Description based on publisher supplied metadata and other sources.
- ISBN:
- 3-032-12287-2
- 9783032122872
- OCLC:
- 1564378941
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.