14 search results - page 2 / 3 » Attacks on privacy and deFinetti's theorem |
CSFW
2005
IEEE
13 years 10 months ago
2005
IEEE
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
PROVSEC
2007
Springer
13 years 11 months ago
2007
Springer
Security of a modern block cipher is commonly measured in terms of its resistance to known attacks. While the provable security approach to block ciphers dates back to the first C...
CCS
2008
ACM
13 years 6 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...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
CSFW
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract. Interactive programs allow users to engage in input and output throughout execution. The ubiquity of such programs motivates the development of models for reasoning about...