Nov 9, 2022 · This paper introduces a general-purpose framework, called Distiller, in which a user translates to constraints not the original computation but ...

A proof of refinement then yields a blueprint for the prover to satisfy the abstract constraints. (Coupling). For Conciseness, a consequence of Distiller and ...

This paper introduces a general-purpose framework, called Distiller, in which a user translates to constraints not the original computation but an abstracted ...

Duration: 13:44
Posted: Jun 23, 2023

Less is more: refinement proofs for probabilistic proofs. May 2023. DOI ... These more abstract proof rules make it simpler to carry out refinement proofs.

Less is more: refinement proofs for probabilistic proofs. K Jiang, D Chait-Roth, Z DeStefano, M Walfish, T Wies. 2023 IEEE Symposium on Security and Privacy (SP) ...

Less is more: refinement proofs for probabilistic proofs. Kunming Jiang, Devora Chait-Roth, Zachary DeStefano, Michael Walfish, and Thomas Wies IEEE ...

Less is more: refinement proofs for probabilistic proofs. IEEE Symposium on Security and Privacy 44 ; Defending against Malicious Peripherals with Cinch. USENIX ...

2022: Less is more: refinement proofs for probabilistic proofs. New York ... We initiate research into efficiently embedding probabilistic computations in ...

Zachary DeStefano's 3 research works with 2 citations, including: Less is more: refinement proofs for probabilistic proofs.