Sciweavers

89 search results - page 2 / 18
» On Interactive Proofs with a Laconic Prover
Sort
View
COCO
1994
Springer
102views Algorithms» more  COCO 1994»
15 years 2 months ago
Alternation in Interaction
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...
Marcos A. Kiwi, Carsten Lund, Alexander Russell, D...
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 8 months ago
Quantum interactive proofs with short messages
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The ...
Salman Beigi, Peter W. Shor, John Watrous
JAR
2008
77views more  JAR 2008»
14 years 10 months ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson
ECCC
2006
88views more  ECCC 2006»
14 years 10 months ago
On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge
Abstract. This article points out a gap between two natural formulations of the concept of a proof of knowledge, and shows that in all natural cases (e.g., NP-statements) this gap ...
Mihir Bellare, Oded Goldreich
IANDC
2006
93views more  IANDC 2006»
14 years 10 months ago
Automation for interactive proof: First prototype
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
Jia Meng, Claire Quigley, Lawrence C. Paulson