Sciweavers

608 search results - page 19 / 122
» Interactive Oracle Proofs
Sort
View
IANDC
2006
77views more  IANDC 2006»
13 years 9 months ago
Weakly complete axiomatization of exogenous quantum propositional logic
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...
Paulo Mateus, Amílcar Sernadas
JAPLL
2006
104views more  JAPLL 2006»
13 years 9 months ago
A proof-centric approach to mathematical assistants
We present an approach to mathematical assistants which uses readable, executable proof scripts as the central language for interaction. We examine an implementation that combines...
Lucas Dixon, Jacques D. Fleuriot
ASIACRYPT
2008
Springer
13 years 12 months ago
A Modular Security Analysis of the TLS Handshake Protocol
We study the security of the widely deployed Secure Session Layer/Transport Layer Security (TLS) key agreement protocol. Our analysis identifies, justifies, and exploits the modul...
Paul Morrissey, Nigel P. Smart, Bogdan Warinschi
CRYPTO
1991
Springer
144views Cryptology» more  CRYPTO 1991»
14 years 1 months ago
Interactive Proofs with Space Bounded Provers
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
Joe Kilian, Ronitt Rubinfeld
STACS
2005
Springer
14 years 3 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