Sciweavers

3228 search results - page 97 / 646
» Computationally Sound Proofs
Sort
View
BSL
2008
97views more  BSL 2008»
13 years 9 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
FM
2006
Springer
153views Formal Methods» more  FM 2006»
14 years 18 days ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
AML
2010
87views more  AML 2010»
13 years 9 months ago
On the form of witness terms
We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free p...
Stefan Hetzl
PKC
2012
Springer
219views Cryptology» more  PKC 2012»
11 years 11 months ago
On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
We identify a potential weakness in the standard security model for dynamic group signatures which appears to have been overlooked previously. More specifically, we highlight tha...
Yusuke Sakai, Jacob C. N. Schuldt, Keita Emura, Go...
TLCA
2009
Springer
14 years 3 months ago
Relating Classical Realizability and Negative Translation for Existential Witness Extraction
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
Alexandre Miquel