58 search results - page 2 / 12 » Probabilistic Proof Systems: A Primer |
FOSSACS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
AAAI
1990
13 years 7 months ago
1990
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
COCO
2009
Springer
14 years 10 days ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
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...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
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 ...