Sciweavers

3228 search results - page 112 / 646
» Computationally Sound Proofs
Sort
View
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
14 years 21 days ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
ENTCS
2008
153views more  ENTCS 2008»
13 years 9 months ago
Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...
Johan Dovland, Einar Broch Johnsen, Olaf Owe
FOCS
2009
IEEE
14 years 3 months ago
Two-Message Quantum Interactive Proofs Are in PSPACE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
Rahul Jain, Sarvagya Upadhyay, John Watrous
CSR
2006
Springer
14 years 19 days ago
SZK Proofs for Black-Box Group Problems
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
Vikraman Arvind, Bireswar Das
TCS
2011
13 years 3 months ago
Correctness of linear logic proof structures is NL-complete
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
Paulin Jacobé de Naurois, Virgile Mogbil