Sciweavers

2043 search results - page 100 / 409
» Reasoning About Security Models
Sort
View
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
15 years 10 months ago
Pairing-Based Cryptography at High Security Levels
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
Neal Koblitz, Alfred Menezes
CSFW
2010
IEEE
15 years 8 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
JCS
2010
112views more  JCS 2010»
15 years 3 months ago
Inductive trace properties for computational security
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
CLIMA
2009
15 years 2 months ago
Argumentation-Based Preference Modelling with Incomplete Information
Abstract. No intelligent decision support system functions even remotely without knowing the preferences of the user. A major problem is that the way average users think about and ...
Wietske Visser, Koen V. Hindriks, Catholijn M. Jon...
ICS
2010
Tsinghua U.
16 years 2 months ago
Game Theory with Costly Computation: Formulation and Application to Protocol Security
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
Joseph Y. Halpern, Rafael Pass