Sciweavers

169 search results - page 7 / 34
» Which Languages Have 4-Round Zero-Knowledge Proofs
Sort
View
WOLLIC
2009
Springer
14 years 2 months ago
Ludics and Its Applications to Natural Language Semantics
Abstract. Proofs in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We shall follow the same idea by proposing that sentenc...
Alain Lecomte, Myriam Quatrini
STACS
2005
Springer
14 years 1 months ago
Quantum Interactive Proofs with Competing Provers
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
Gus Gutoski, John Watrous
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 7 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
JCS
2007
80views more  JCS 2007»
13 years 7 months ago
Secure information flow for a concurrent language with scheduling
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow ty...
Gilles Barthe, Leonor Prensa Nieto
ESOP
2005
Springer
14 years 1 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi