42 search results - page 7 / 9 » A Cryptographically Sound Security Proof of the Needham-Schr... |
CN
2006
13 years 7 months ago
2006
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
IWFM
2003
13 years 9 months ago
2003
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
TCS
2002
13 years 7 months ago
2002
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
EUROPKI
2009
Springer
13 years 5 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
In this paper, we present a framework for achieving anonymity and trust, two seemingly contradictory properties, in distributed systems. Our approach builds on webs of trust, a we...