惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

酷 壳 – CoolShell
酷 壳 – CoolShell
GbyAI
GbyAI
SecWiki News
SecWiki News
Project Zero
Project Zero
C
Cisco Blogs
Simon Willison's Weblog
Simon Willison's Weblog
P
Privacy International News Feed
D
Darknet – Hacking Tools, Hacker News & Cyber Security
Scott Helme
Scott Helme
A
Arctic Wolf
Security Latest
Security Latest
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
P
Privacy & Cybersecurity Law Blog
Apple Machine Learning Research
Apple Machine Learning Research
T
Tailwind CSS Blog
The Hacker News
The Hacker News
T
Tenable Blog
雷峰网
雷峰网
有赞技术团队
有赞技术团队
V
V2EX
C
CXSECURITY Database RSS Feed - CXSecurity.com
T
Threat Research - Cisco Blogs
T
Threatpost
AWS News Blog
AWS News Blog
L
LINUX DO - 热门话题
Application and Cybersecurity Blog
Application and Cybersecurity Blog
K
KPMG report finds enterprise disconnect between AI and its ROI | CIO
S
SegmentFault 最新的问题
月光博客
月光博客
Spread Privacy
Spread Privacy
S
Secure Thoughts
宝玉的分享
宝玉的分享
博客园 - 三生石上(FineUI控件)
Forbes - Security
Forbes - Security
T
The Exploit Database - CXSecurity.com
G
GRAHAM CLULEY
The Last Watchdog
The Last Watchdog
Y
Y Combinator Blog
I
Intezer
博客园 - 【当耐特】
B
Blog RSS Feed
Attack and Defense Labs
Attack and Defense Labs
I
InfoQ
博客园 - 叶小钗
Cyberwarzone
Cyberwarzone
V2EX - 技术
V2EX - 技术
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Hugging Face - Blog
Hugging Face - Blog
H
Help Net Security
C
CERT Recently Published Vulnerability Notes

Cryptology ePrint Archive

Fast Isogeny Evaluation on Binary Curves Quick Draw Queries: Lightweight Searchable Public-key Ciphertexts with Hidden Structures via Non-Interactive Key Exchange A Constructive Treatment of Authentication Boolean Arithmetic over $\mathbb{F}_2$ from Group Commutators HAWK with Hint: Algebraic Key Recovery from Side-Channel Leakage Post-Quantum Secure k-Times Traceable Ring Signature A Key Schedule Design and Evaluation under Boundary Round-Key Leakage 2G2T: Constant-Size, Statistically Sound MSM Outsourcing Proximity Signatures Breaking Optimized HQC: The First Cache-Timing Full Decryption Oracle Key-Recovery Attack in Post-Quantum Cryptography Efficient Partially Blind Signatures from Isogenies Evaluating PQC KEMs, Combiners, and Cascade Encryption via Adaptive IND-CPA Testing Using Deep Learning High-Throughput Side-Channel-Protected Stream Cipher Hardware for 6G Systems Efficient e = 3 Threshold RSA via Integer Coordinates for Intel SGX Zeal: PIR for Non-Cooperative Databases VEIL: Lightweight Zero-Knowledge for Hash-Based Multilinear Proof Systems Witness-Indistinguishable Arguments of Knowledge and One-Way Functions The many faces of Schnorr: a touch-up Open Problems in List Decoding and Correlated Agreement Compressed Key Exchange Protocol from Orientations of Large Discriminant Using AVX-512 SPLASH: SPeculative Leakage-Adaptive Secure Hardware An Efficient Identity-Based Blind Signature Scheme from SM9 Efficient Batch Threshold Encryption Using Partial Fraction Techniques A note on the Unsuitability of LIGA for Linkable Ring Signatures: The perils of non-commutativity Verification Facade: Masquerading Insecure Cryptographic Implementations as Verified Code Cryptographic Implications of Worst-Case Hardness of Time-Bounded Kolmogorov Complexity Efficient Merkle-Tree Consistent Accumulator FLOSS: Fast Linear Online Secret-Shared Shuffling Which Privacy Blanket is Optimal in the Shuffle Model? Applications of Bruhat-Chevalley-Renner Decomposition to Metric-Aware Code-Based Cryptography Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR Verifiable Divide-and-Conquer Pseudorandomness of UFLM: A Characterization via Its Linear Layer QED-Lite: Lightweight Detection of Quantum-Vulnerable ELF Binaries via Cryptographic Library Version Fingerprinting Reformulating the SNOVA Signature Scheme Game Theory Does Not Always Help: The Case of Statistical Multi-Party Coin Tossing Improved Codes and Decoders for HQC Delegate: Coalition Proof Incentivized Outsourced Computation with Smart Contracts Fast and Efficient Perfectly Secure Network-Agnostic Secure Computation Tighter Bounds for the Oblivious Bit-Fixing Inner Product Extractor on Biased Seeds Random Robust Secret Sharing with Perfect Privacy and its Applications Counting and recovering the quadratic relations of a vectorial function A Search-to-Decision Reduction for Continuous LWE Robot: Robust Threshold BBS+ in Two Rounds Perils of Parallelism: Transaction Fee Mechanisms under Execution Uncertainty Synthesis of RTL-based Characterization Programs for Fault Injection SSLE-DAG: A High-Throughput Proof-of-Stake Consensus Protocol Combining an Adaptive DAG with a Single Secret Leader Election On Optimal Information-Theoretic Security in Symmetric Encryption under Low-Entropy Keys Efficient and Parallel Implementation of Isogeny-based Deterministic Group Actions Fast and Compact Lattice-Based Registration-Based Encryption Graph-based Asynchrony with Quasilinear Complexity for Any Linear Verifiable Secret Sharing Scheme MTSF --- Market-Theoretic Security Framework: A Unified Paradigm For The Art Of Proving and Disproving Security Ticket to Hide: Private, Practical Proofs of Provenance for TLS Linear Code Equivalence via Plücker Coordinates Survey of isogeny-based signature schemes resistant to Castryck–Decru attack On the Need for (Quantum) Memory with Short Outputs Simulating Noisy Leakage with Bounded Leakage: Simpler, Better, Faster Relaxed Modular PCS from Arbitrary PCS and Applications to SNARKs for Integers Tripling on Hessian curves via isogeny decomposition Reducing the Number of Qubits in Quantum Discrete Logarithms on Elliptic Curves At-Compromise Security: The Case for Alert Blindness A Practical Neighborhood Search Attack on Oracle MLWE Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index Abelian surfaces in Hesse form and explicit isogeny formulas Efficiently Provable Approximations for Non-Polynomial Functions Laminate: Succinct SIMD-Friendly Verifiable FHE Accelerating FrodoKEM in Hardware TSS-PV: Traceable Secret Sharing with Public Verifiability PIRANHAS: PrIvacy-Preserving Remote Attestation in Non-Hierarchical Asynchronous Swarms Small-field hash-based SNARGs are less sound than conjectured Hash-Based Blind Signatures: First Steps Partial Fraction Techniques for Cryptography VIA: Communication-Efficient Single-Server Private Information Retrieval Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications Accurate BGV Parameters Selection: Accounting for Secret and Public Key Dependencies in Average-Case Analysis Multi-Party Functional Encryption (MPFE): A tool in the distributed and decentralized world Compact, Efficient and CCA-Secure Updatable Encryption from Isogenies Faster Homomorphic Integer Computer Tempo: An ML-KEM to PAKE Compiler Resilient to Timing Attacks OhLaLa: Combined Security against Region Fault Attacks in Constant Protection Order Threshold Signatures Reloaded: ML-DSA and Enhanced Raccoon with Identifiable Aborts The Pipes Model for Latency and Throughput Analysis Tighter Quantum Security for Fiat-Shamir-with-Aborts and Hash-and-Sign-with-Retry Signatures InstaRand: Instantly Available and Instantly Verifiable On-chain Randomness Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts BERMUDA: A BPSec-Compatible Key Management Scheme for DTNs Making Uncertified DAG BFT Provably Live with Linear Payload and Quadratic Metadata Communication A proof of P≠NP (New symmetric encryption algorithm against any linear attacks and differential attacks) ETK: External-Operations TreeKEM and the Security of MLS in RFC 9420 A Combinatorial Attack on Ternary Sparse Learning with Errors (sLWE) A Divide-and-Conquer Strategy for Hard-Label Extraction of Deep Neural Networks via Side-Channel Attacks On the practicality of quantum sieving algorithms for the shortest vector problem Dynamic zk-SNARKs (with applications to sparse zk-SNARKs and IVC) ProxCode: Efficient Proximity Searchable Encryption from Error Correcting Codes Two-Round Threshold Signature from Algebraic One-More Learning with Errors The Last Challenge Attack on Fiat-Shamir in KZG-based SNARKs A New Perspective on Key Switching for BGV-like Schemes Improved Circuit Synthesis with Multi-Value Bootstrapping for FHEW-like Schemes DiStefano: Decentralized Infrastructure for Sharing Trusted Encrypted Facts and Nothing More Finding and Evaluating Parameters for BGV
Hadal: Centralized Label DP Training without a Trusted Party
James Choncholas, Google (United States), Georgia Institute of T · 2026-03-26 · via Cryptology ePrint Archive

Paper 2026/600

Hadal: Centralized Label DP Training without a Trusted Party

Stanislav Peceny, Stealth Software Technologies, Inc., Georgia Institute of Technology

Amit Agarwal, University of Illinois Urbana-Champaign, Category Labs

Mariana Raykova, Google (United States)

Baiyu Li, Google (United States)

Karn Seth, Google (United States)

Abstract

We explore distributed training in a setting where features are held by one party and labels are held by another. In this context, we focus on label Differential Privacy (DP), where the labels require privacy protection from the other party who learns the trained model. Previous approaches struggle to train accurate models in high-privacy settings (i.e. when $\epsilon \leq 1$), or typically require a trusted third party. To eliminate this trusted party while preserving model utility, we present PostScale, a novel Homomorphic Encryption (HE)-based protocol suited for high-privacy regimes with ciphertext multiplicative depth of two. Our protocol is suitable for a wide variety of models in the semi-honest setting and avoids leaking the model architecture as well as costly ciphertext operations like bootstrapping and rotations. We also present a multi-party sampling protocol for generating DP noise, and Hadal, a general-purpose dataflow-based framework for encrypted computation implementing our protocols. Hadal repurposes existing tools for use with HE, including comprehensive performance profiling capabilities, dual execution modes (eager and deferred), graph compiler-based optimization, and hyperparameter tuning. Our techniques achieve model utility similar to centralized DP while reducing communication by over 90% (from 1 TB to 8 GB per batch) and training time by 99% (from 54 minutes to 33 seconds) compared to related work that protects both features and labels. These improvements unlock larger models; we train Bert-tiny of Devlin et al. (2019), with 6.5 MB of parameters, in 20 ms per example in a LAN setting.

BibTeX

@misc{cryptoeprint:2026/600,
      author = {James Choncholas and Stanislav Peceny and Amit Agarwal and Mariana Raykova and Baiyu Li and Karn Seth},
      title = {Hadal: Centralized Label {DP} Training without a Trusted Party},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/600},
      year = {2026},
      url = {https://eprint.iacr.org/2026/600}
}