Sciweavers

608 search results - page 11 / 122
» Interactive Oracle Proofs
Sort
View
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
14 years 1 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
14 years 1 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
STACS
1997
Springer
14 years 1 months ago
Probabilistic Proof Systems - A Survey
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
Oded Goldreich
TACAS
2000
Springer
149views Algorithms» more  TACAS 2000»
14 years 1 months ago
Proof General: A Generic Tool for Proof Development
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant. Interaction is based around a proof script, which is the target of a pr...
David Aspinall
CSL
2007
Springer
14 years 4 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin