Approximated Computationally Bounded Simulation Relations for Probabilistic Automata

Authors:
Roberto Segala;Andrea Turrini
Affiliations:
Universita di Verona, Italy;Universita di Verona, Italy
Venue:
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Year:
2007

Citing 0
Cited 11

The power of simulation relations

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Computational indistinguishability logic

Proceedings of the 17th ACM conference on Computer and communications security
Conditional automata: a tool for safe removal of negligible events

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Semantic analysis of gossip protocols for wireless sensor networks

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)

Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic relational reasoning for differential privacy

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verified indifferentiable hashing into elliptic curves

POST'12 Proceedings of the First international conference on Principles of Security and Trust
Probabilistic relational hoare logics for computer-aided security proofs

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Probabilistic Relational Reasoning for Differential Privacy

ACM Transactions on Programming Languages and Systems (TOPLAS)
Beyond differential privacy: composition theorems and relational logic for f-divergences between probabilistic programs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Verified indifferentiable hashing into elliptic curves

Journal of Computer Security - Security and Trust Principles

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. These relations are meant to provide rigorous grounds to parts of correctness proofs for cryptographic protocols that are usually carried out by semi-formal arguments. We illustrate our ideas by recasting a correctness proof of Bellare and Rogaway based on the notion of matching conversation.