Sciweavers

92 search results - page 4 / 19
» Probabilistic Proof Systems - A Survey
Sort
View
LPAR
2010
Springer
13 years 5 months ago
On the Equality of Probabilistic Terms
We consider a mild extension of universal algebra in which terms are built both from deterministic and probabilistic variables, and are interpreted as distributions. We formulate a...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
STOC
2006
ACM
115views Algorithms» more  STOC 2006»
14 years 7 months ago
Zero knowledge with efficient provers
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...
Minh-Huyen Nguyen, Salil P. Vadhan
ICFEM
2007
Springer
13 years 11 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
CSFW
2005
IEEE
14 years 1 months ago
A Cryptographically Sound Dolev-Yao Style Security Proof of an Electronic Payment System
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
Michael Backes, Markus Dürmuth
ECCC
2011
171views ECommerce» more  ECCC 2011»
12 years 11 months ago
Testing Linear Properties: Some general themes
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
Madhu Sudan