188 search results - page 20 / 38 » What Is a Skeptical Proof |
103
Voted
MPC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
116
Voted
CSL
2001
Springer
15 years 5 months ago
2001
Springer
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...
100
Voted
EUROCRYPT
2006
Springer
15 years 4 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
89
Voted
FSTTCS
1994
Springer
15 years 4 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
126
Voted
LICS
1991
IEEE
15 years 4 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...