Sciweavers

335 search results - page 45 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
CCS
2008
ACM
13 years 9 months ago
Minimal backups of cryptographic protocol runs
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
Jay A. McCarthy, Shriram Krishnamurthi
CCS
2007
ACM
14 years 1 months ago
A calculus of challenges and responses
er presents a novel approach for concisely abstracting authentication s and for subsequently analyzing those abstractions in a sound manner, i.e., deriving authentication guarante...
Michael Backes, Agostino Cortesi, Riccardo Focardi...
WORM
2003
13 years 9 months ago
Worm anatomy and model
We present a general framework for reasoning about network worms and analyzing the potency of worms within a specific network. First, we present a discussion of the life cycle of ...
Dan Ellis
WETICE
2003
IEEE
14 years 28 days ago
Attack-Resistance of Computational Trust Models
The World Wide Web encourages widely-distributed, open, decentralised systems that span multiple administrative domains. Recent research has turned to trust management [4] as a fr...
Andrew Twigg, Nathan Dimmock
ICS
2003
Tsinghua U.
14 years 26 days ago
AEGIS: architecture for tamper-evident and tamper-resistant processing
We describe the architecture for a single-chip aegis processor which can be used to build computing systems secure against both physical and software attacks. Our architecture ass...
G. Edward Suh, Dwaine E. Clarke, Blaise Gassend, M...