Lightweight Authentication of Web Data via Garble-Then-Prove
Xiang Xie, Kang Yang, Xiao Wang, Yu Yu
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Arke: Scalable and Byzantine Fault Tolerant Privacy-Preserving Contact DiscoveryNicolas Mohnblatt, Alberto Sonnino, Kobi Gurkan, Philipp JovanovicCCS 2024 · 被引用 2 次
- ACTS: Attestations of Contents in TLS SessionsPierpaolo Della Monica, Ivan Visconti, Andrea Vitaletti, Marco ZecchiniNDSS 2026 · 被引用 1 次
- DiStefano: Decentralized Infrastructure for Sharing Trusted Encrypted Facts and Nothing MoreSofía Celi, Alex Davidson, Hamed Haddadi, Gonçalo Pestana 等NDSS 2025
- Zero-Knowledge Location Privacy via Accurate Floating-Point SNARKsJens Ernstberger, Chengru Zhang, Luca Ciprian, Philipp Jovanovic 等S&P 2025
它引用的顶会 Paper21
- MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious TransferMarcel Keller, Emmanuela Orsini, Peter SchollCCS 2016 · 被引用 487 次
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSAlessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra 等EUROCRYPT 2020 · 被引用 356 次
- Efficient Two-Round OT Extension and Silent Non-Interactive Secure ComputationElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CCS 2019 · 被引用 238 次
- Authenticated Garbling and Efficient Maliciously Secure Two-Party ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 被引用 212 次
- Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic CircuitsChenkai Weng, Kang Yang, Jonathan Katz, Xiao WangS&P 2021 · 被引用 205 次
相关 Paper
- TLS-N: Non-repudiation over TLS Enablign Ubiquitous Content SigningHubert Ritzdorf, Karl Wüst, Arthur Gervais, Guillaume Felley 等NDSS 2018 · 被引用 32 次
- Global-Scale Secure Multiparty ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 被引用 220 次
- DECO: Liberating Web Data Using Decentralized Oracles for TLSFan Zhang, Deepak Maram, Harjasleen Malvai, Steven Goldfeder 等CCS 2020 · 被引用 110 次
- zkGPT: An Efficient Non-interactive Zero-knowledge Proof Framework for LLM InferenceWenjie Qu, Yijun Sun, Xuanming Liu, Tao Lu 等USENIX Security 2025
- Efficient 3PC for Binary Circuits with Application to Maliciously-Secure DNN InferenceYun Li, Yufei Duan, Zhicong Huang, Cheng Hong 等USENIX Security 2023
