Sciweavers

154 search results - page 7 / 31
» Cryptographically Sound Theorem Proving
Sort
View
JSYML
2008
73views more  JSYML 2008»
13 years 7 months ago
Examining fragments of the quantified propositional calculus
When restricted to proving q i formulas, the quantified propositional proof system G i is closely related to the b i theorems of Buss's theory Si 2. Namely, G i has polynomial...
Steven Perron
CORR
2011
Springer
175views Education» more  CORR 2011»
12 years 11 months ago
Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
Mihhail Aizatulin, Andrew D. Gordon, Jan Jürj...
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
13 years 12 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 1 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
ICALP
2005
Springer
14 years 1 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi