Sciweavers

838 search results - page 34 / 168
» From Natural Language to Formal Proof Goal
Sort
View
CSFW
2010
IEEE
15 years 9 months ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin
CTRSA
2005
Springer
72views Cryptology» more  CTRSA 2005»
15 years 11 months ago
Proofs for Two-Server Password Authentication
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
Michael Szydlo, Burton S. Kaliski Jr.
PTS
2010
138views Hardware» more  PTS 2010»
15 years 4 months ago
Alternating Simulation and IOCO
We propose a symbolic framework called guarded labeled assignment systems or GLASs and show how GLASs can be used as a foundation for symbolic analysis of various aspects of forma...
Margus Veanes, Nikolaj Bjørner
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 6 months ago
Classical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...
James Brotherston, Cristiano Calcagno
CRYPTO
2009
Springer
109views Cryptology» more  CRYPTO 2009»
16 years 19 days ago
Randomizable Proofs and Delegatable Anonymous Credentials
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
Mira Belenkiy, Jan Camenisch, Melissa Chase, Marku...