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 条
  • [21] Zero-knowledge proofs for finite field arithmetic, or:: Can zero-knowledge be for free?
    Cramer, R
    Damgård, I
    ADVANCES IN CRYPTOLOGY - CRYPTO'98, 1998, 1462 : 424 - 441
  • [22] Zero-knowledge sets with short proofs
    Catalano, Dario
    Fiore, Dario
    Messina, Mariagrazia
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2008, 2008, 4965 : 433 - +
  • [23] Symbolic Malleable Zero-knowledge Proofs
    Backes, Michael
    Bendun, Fabian
    Maffei, Matteo
    Mohammadi, Esfandiar
    Pecina, Kim
    2015 IEEE 28TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM CSF 2015, 2015, : 412 - 426
  • [24] MINIMUM RESOURCE ZERO-KNOWLEDGE PROOFS
    KILIAN, J
    MICALI, S
    OSTROVSKY, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 435 : 545 - 557
  • [25] ZERO-KNOWLEDGE PROOFS OF COMPUTATIONAL POWER
    YUNG, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 434 : 196 - 207
  • [26] Experimenting with Zero-Knowledge Proofs of Training
    Garg, Sanjam
    Goel, Aarushi
    Jha, Somesh
    Mahloujifar, Saeed
    Mahmoody, Mohammad
    Policharla, Guru-Vamsi
    Wang, Mingyuan
    PROCEEDINGS OF THE 2023 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, CCS 2023, 2023, : 1880 - 1894
  • [27] Doubly adaptive zero-knowledge proofs
    Botta, Vincenzo
    Visconti, Ivan
    THEORETICAL COMPUTER SCIENCE, 2023, 968
  • [28] Zero-Knowledge Sets With Short Proofs
    Catalano, Dario
    Di Raimondo, Mario
    Fiore, Dario
    Messina, Mariagrazia
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 2488 - 2502
  • [29] Zero-Knowledge Proofs with Witness Elimination
    Kiayias, Aggelos
    Zhou, Hong-Sheng
    PUBLIC KEY CRYPTOGRAPHY-PKC 2009, PROCEEDINGS, 2009, 5443 : 124 - 138
  • [30] Complex zero-knowledge proofs of knowledge are easy to use
    Canard, Sebastien
    Coisel, Iwen
    Traore, Jacques
    PROVABLE SECURITY, PROCEEDINGS, 2007, 4784 : 122 - +