Verification of Quantitative Hyperproperties Using Trace Enumeration Relations

05/10/2020
by   Shubham Sahai, et al.
0

Many important cryptographic primitives offer probabilistic guarantees of security that can be specified as quantitative hyperproperties; these are specifications that stipulate the existence of a certain number of traces in the system satisfying certain constraints. Verification of such hyperproperties is extremely challenging because they involve simultaneous reasoning about an unbounded number of different traces. In this paper, we introduce a technique for verification of quantitative hyperproperties based on the notion of trace enumeration relations. These relations allow us to reduce the problem of trace-counting into one of model-counting of formulas in first-order logic. We also introduce a set of inference rules for machine-checked reasoning about the number of satisfying solutions to first-order formulas (aka model counting). Putting these two components together enables semi-automated verification of quantitative hyperproperties on infinite state systems. We use our methodology to prove confidentiality of access patterns in Path ORAMs of unbounded size, soundness of a simple interactive zero-knowledge proof protocol as well as other applications of quantitative hyperproperties studied in past work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2020

Counting the Number of Solutions to Constraints

Compared with constraint satisfaction problems, counting problems have r...
research
06/24/2019

Verifying Relational Properties using Trace Logic

We present a logical framework for the verification of relational proper...
research
04/24/2022

A Generic Approach to Quantitative Verification

This thesis is concerned with quantitative verification, that is, the ve...
research
03/08/2022

ProbTA: A sound and complete proof rule for probabilistic verification

We propose a sound and complete proof rule ProbTA for quantitative analy...
research
05/14/2019

Quantitative Logic Reasoning

In this paper we show several similarities among logic systems that deal...
research
07/02/2018

Monitoring Hyperproperties

Hyperproperties, such as non-interference and observational determinism,...
research
01/26/2023

Quantitative Safety and Liveness

Safety and liveness are elementary concepts of computation, and the foun...

Please sign up or login with your details

Forgot password? Click here to reset