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

Author:   Benny Applebaum ,  Huijia (Rachel) Lin
Publisher:   Springer Nature Switzerland AG
ISBN:  

9783032122865


Pages:   476
Publication Date:   02 December 2025
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $211.17 Quantity:  
Add to Cart

Share |

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


Overview

Full Product Details

Author:   Benny Applebaum ,  Huijia (Rachel) Lin
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
ISBN:  

9783032122865


ISBN 10:   3032122864
Pages:   476
Publication Date:   02 December 2025
Audience:   College/higher education ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

NOV RG 20252

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List