Sciweavers

2812 search results - page 5 / 563
» Secrecy in Multiagent Systems
Sort
View
POPL
2000
ACM
13 years 12 months ago
Verifying Secrets and Relative Secrecy
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
Dennis M. Volpano, Geoffrey Smith
FSTTCS
2003
Springer
14 years 1 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
CONCUR
2005
Springer
14 years 1 months ago
Timed Spi-Calculus with Types for Secrecy and Authenticity
Abstract. We present a discretely timed spi-calculus. A primitive for key compromise allows us to model key compromise attacks, thus going beyond the standard Dolev–Yao attacker ...
Christian Haack, Alan Jeffrey
CSCW
2012
ACM
12 years 4 months ago
Practices of information and secrecy in a punk rock subculture
By examining the information practices of a punk-rock subculture, we investigate the limits of social media systems, particularly limits exposed by practices of secrecy. Looking a...
Jessica Lingel, Aaron Trammell, Joe Sanchez, Mor N...
CCS
2008
ACM
13 years 10 months ago
Reconsidering physical key secrecy: teleduplication via optical decoding
The access control provided by a physical lock is based on the assumption that the information content of the corresponding key is private -- that duplication should require eithe...
Benjamin Laxton, Kai Wang, Stefan Savage