30 search results - page 2 / 6 » A Calculus for Game-Based Security Proofs |
LOPSTR
2001
Springer
13 years 10 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
POPL
1999
ACM
13 years 10 months ago
1999
ACM
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency commo...
FOSSACS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
CCS
2009
ACM
14 years 12 days ago
2009
ACM
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...