USENIX Security2024Top-tier venue
Lightweight Authentication of Web Data via Garble-Then-Prove
Xiang Xie, Kang Yang, Xiao Wang, Yu Yu
Abstract
Transport Layer Security (TLS) establishes an authenticated and confidential channel to deliver data for almost all Internet applications. A recent work (Zhang et al., CCS'20) proposed a protocol to prove the TLS payload to a third party, without any modification of TLS servers, while ensuring the privacy and originality of the data in the presence of malicious adversaries. However, it required maliciously secure Two-Party Computation (2PC) for generic circuits, leading to significant computational and communication overhead. This paper proposes the garble-then-prove technique to achieve the same security requirement without using any heavy mechanism like generic malicious 2PC. Our end-to-end implementation shows 14× improvement in communication and an order of magnitude improvement in computation over the state-of-the-art protocol. We also show worldwide performance when using our protocol to authenticate payload data from Coinbase and Twitter APIs. Finally, we propose an efficient gadget to privately convert the above authenticated TLS payload to additively homomorphic commitments so that the properties of the payload can be proven efficiently using zkSNARKs.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4e59d8bd-18df-46a3-8f0e-ce9f839d0b3eCited by top-tier papers4
- Arke: Scalable and Byzantine Fault Tolerant Privacy-Preserving Contact DiscoveryNicolas Mohnblatt, Alberto Sonnino, Kobi Gurkan, Philipp JovanovicCCS 2024 · 2 citations
- ACTS: Attestations of Contents in TLS SessionsPierpaolo Della Monica, Ivan Visconti, Andrea Vitaletti, Marco ZecchiniNDSS 2026 · 1 citation
- DiStefano: Decentralized Infrastructure for Sharing Trusted Encrypted Facts and Nothing MoreSofía Celi, Alex Davidson, Hamed Haddadi, Gonçalo Pestana et al.NDSS 2025
- Zero-Knowledge Location Privacy via Accurate Floating-Point SNARKsJens Ernstberger, Chengru Zhang, Luca Ciprian, Philipp Jovanovic et al.S&P 2025
Builds on21
- MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious TransferMarcel Keller, Emmanuela Orsini, Peter SchollCCS 2016 · 487 citations
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSAlessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra et al.EUROCRYPT 2020 · 356 citations
- Efficient Two-Round OT Extension and Silent Non-Interactive Secure ComputationElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai et al.CCS 2019 · 238 citations
- Authenticated Garbling and Efficient Maliciously Secure Two-Party ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 212 citations
- Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic CircuitsChenkai Weng, Kang Yang, Jonathan Katz, Xiao WangS&P 2021 · 205 citations
Related papers
- TLS-N: Non-repudiation over TLS Enablign Ubiquitous Content SigningHubert Ritzdorf, Karl Wüst, Arthur Gervais, Guillaume Felley et al.NDSS 2018 · 32 citations
- Global-Scale Secure Multiparty ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 220 citations
- DECO: Liberating Web Data Using Decentralized Oracles for TLSFan Zhang, Deepak Maram, Harjasleen Malvai, Steven Goldfeder et al.CCS 2020 · 110 citations
- zkGPT: An Efficient Non-interactive Zero-knowledge Proof Framework for LLM InferenceWenjie Qu, Yijun Sun, Xuanming Liu, Tao Lu et al.USENIX Security 2025
- Efficient 3PC for Binary Circuits with Application to Maliciously-Secure DNN InferenceYun Li, Yufei Duan, Zhicong Huang, Cheng Hong et al.USENIX Security 2023
