Cheesecloth: Zero-Knowledge Proofs of Real-World Vulnerabilities

被引:0
|
作者
Cuellar, Santiago [1 ]
Harris, Bill [1 ]
Parker, James [1 ]
Pernsteiner, Stuart [1 ]
Tromer, Eran [2 ]
机构
[1] Galois Inc, Portland, OR 97204 USA
[2] Columbia Univ, New York, NY USA
来源
PROCEEDINGS OF THE 32ND USENIX SECURITY SYMPOSIUM | 2023年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Currently, when a security analyst discovers a vulnerability in critical software system, they must navigate a fraught dilemma: immediately disclosing the vulnerability to the public could harm the system's users; whereas disclosing the vulnerability only to the software's vendor lets the vendor disregard or deprioritize the security risk, to the detriment of unwittingly-affected users. A compelling recent line of work aims to resolve this by using Zero Knowledge (ZK) protocols that let analysts prove that they know a vulnerability in a program, without revealing the details of the vulnerability or the inputs that exploit it. In principle, this could be achieved by generic ZK techniques. In practice, ZK vulnerability proofs to date have been restricted in scope and expressibility, due to challenges related to generating proof statements that model real-world software at scale and to directly formulating violated properties. This paper presents CHEESECLOTH, a novel proof-statement compiler, which proves practical vulnerabilities in ZK by soundly-but-aggressively preprocessing programs on public inputs, selectively revealing information about executed control segments, and formalizing information leakage using a novel storage-labeling scheme. CHEESECLOTH's practicality is demonstrated by generating ZK proofs of well-known vulnerabilities in (previous versions of) critical software, including the Heartbleed information leakage in OpenSSL and a memory vulnerability in the FFmpeg multi-media encoding framework.
引用
收藏
页码:6525 / 6540
页数:16
相关论文
共 50 条
  • [41] Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
    Ishai, Yuval
    Weiss, Mor
    THEORY OF CRYPTOGRAPHY (TCC 2014), 2014, 8349 : 121 - 145
  • [42] ZPiE: Zero-Knowledge Proofs in Embedded Systems
    Salleras, Xavier
    Daza, Vanesa
    MATHEMATICS, 2021, 9 (20)
  • [43] General properties of quantum zero-knowledge proofs
    Kobayashi, Hirotada
    THEORY OF CRYPTOGRAPHY, 2008, 4948 : 107 - 124
  • [44] Distributed Zero-Knowledge Proofs Over Networks
    Bick, Aviv
    Kol, Gillat
    Oshman, Rotem
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 2426 - 2458
  • [45] Physical Zero-Knowledge Proofs for Five Cells
    Ruangwises, Suthee
    PROGRESS IN CRYPTOLOGY, LATINCRYPT 2023, 2023, 14168 : 315 - 330
  • [46] An Introduction to Zero-Knowledge Proofs in Blockchains and Economics
    Berentsen, Aleksander
    Lenzi, Jeremias
    Nyffenegger, Remo
    FEDERAL RESERVE BANK OF ST LOUIS REVIEW, 2023, 105 (04): : 280 - 294
  • [47] Zero-Knowledge Proofs via Polynomial Representations
    Di Crescenzo, Giovanni
    Fedyukovych, Vadym
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 335 - 347
  • [48] Practical Zero-Knowledge Proofs for Circuit Evaluation
    Ghadafi, Essam
    Smart, Nigel P.
    Warinschi, Bogdan
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2009, 5921 : 469 - 494
  • [49] Round-optimal zero-knowledge proofs of knowledge for NP
    Li HongDa
    Feng DengGuo
    Li Bao
    Xue HaiXia
    SCIENCE CHINA-INFORMATION SCIENCES, 2012, 55 (11) : 2473 - 2484
  • [50] Round-optimal zero-knowledge proofs of knowledge for NP
    HongDa Li
    DengGuo Feng
    Bao Li
    HaiXia Xue
    Science China Information Sciences, 2012, 55 : 2473 - 2484