6978 search results - page 5 / 1396 » On Proofs in System P |
TYPES
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
STOC
2006
ACM
14 years 7 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 ...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the rst prover is trying to convince a veri er to accept and the secon...
COCO
2009
Springer
14 years 2 months 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...
CONEXT
2007
ACM
13 years 11 months ago
2007
ACM