Sciweavers

1894 search results - page 11 / 379
» A TLA Proof System
Sort
View
TCC
2004
Springer
835views Cryptology» more  TCC 2004»
14 years 3 months ago
On the Possibility of One-Message Weak Zero-Knowledge
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
Boaz Barak, Rafael Pass
CADE
2010
Springer
13 years 11 months ago
Focused Inductive Theorem Proving
Abstract. Focused proof systems provide means for reducing and structuring the non-determinism involved in searching for sequent calculus proofs. We present a focused proof system ...
David Baelde, Dale Miller, Zachary Snow
JAR
2010
123views more  JAR 2010»
13 years 8 months ago
A Framework for Proof Systems
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
Vivek Nigam, Dale Miller
EUROCRYPT
2008
Springer
14 years 5 days ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
CHARME
2001
Springer
162views Hardware» more  CHARME 2001»
14 years 2 months ago
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Kenneth L. McMillan