36 search results - page 3 / 8 » ccs 2001 |
CCS
2001
ACM
13 years 10 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
CCS
2001
ACM
13 years 10 months ago
2001
ACM
Most people consider frequent software updates a nuisance. However, we show how this common phenomenon can be turned into a feature that protects against software piracy. We defin...
CCS
2001
ACM
13 years 10 months ago
2001
ACM
We describe a software self-checking mechanism designed to improve the tamper resistance of large programs. The mechanism consists of a number of testers that redundantly test for ...
CCS
2006
ACM
13 years 9 months ago
2006
ACM
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the ra...
CCS
2001
ACM
13 years 10 months ago
2001
ACM
Although there is a substantial amount of work on formal requirements for two and three-party key distribution protocols, very little has been done on requirements for group proto...