211
click to vote
CCS
2008
ACM
15 years 9 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
200
click to vote
CCS
2008
ACM
15 years 9 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
215
click to vote
CCS
2008
ACM
15 years 9 months ago
2008
ACM
The specifications of an application's security configuration are crucial for understanding its security policies, which can be very helpful in security-related contexts such...