Sciweavers

436 search results - page 57 / 88
» Using trust assumptions with security requirements
Sort
View
CORR
2008
Springer
166views Education» more  CORR 2008»
15 years 3 months ago
Information-Theoretically Secure Voting Without an Honest Majority
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...
Anne Broadbent, Alain Tapp
CCS
2007
ACM
15 years 10 months ago
Detecting relay attacks with timing-based protocols
Distance bounding protocols have been proposed as means of detecting relay attacks, also known as mafia fraud. In this paper we present the first symmetric key based distance bou...
Jason Reid, Juan Manuel González Nieto, Tee...
CCS
2007
ACM
15 years 10 months ago
Non-volatile memory and disks: avenues for policy architectures
As computing models change, so too do the demands on storage. Distributed and virtualized systems introduce new vulnerabilities, assumptions, and performance requirements on disks...
Kevin R. B. Butler, Stephen E. McLaughlin, Patrick...
SAC
2009
ACM
15 years 10 months ago
Remote software protection by orthogonal client replacement
In a typical client-server scenario, a trusted server provides valuable services to a client, which runs remotely on an untrusted platform. Of the many security vulnerabilities th...
Mariano Ceccato, Paolo Tonella, Mila Dalla Preda, ...
IDTRUST
2010
ACM
15 years 10 months ago
Computational techniques for increasing PKI policy comprehension by human analysts
Natural-language policies found in X.509 PKI describe an organization’s stated policy as a set of requirements for trust. The widespread use of X.509 underscores the importance ...
Gabriel A. Weaver, Scott A. Rea, Sean W. Smith