Sciweavers

1888 search results - page 11 / 378
» Proof theory and computational analysis
Sort
View
IFIP
2004
Springer
14 years 20 days ago
Complementing Computational Protocol Analysis with Formal Specifications
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...
CCS
2009
ACM
14 years 2 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
WEWORC
2007
132views Cryptology» more  WEWORC 2007»
13 years 8 months ago
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
Léonard Dallot
MKM
2007
Springer
14 years 1 months ago
Formal Representation of Mathematics in a Dependently Typed Set Theory
Abstract. We have formalized material from an introductory real analysis textbook in the proof assistant Scunak. Scunak is a system based on set theory encoded in a dependent type ...
Feryal Fulya Horozal, Chad E. Brown
LICS
1998
IEEE
13 years 11 months ago
On Proofs about Threshold Circuits and Counting Hierarchies
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
Jan Johannsen, Chris Pollett