719 search results - page 77 / 144 » Proving Security Protocols Correct |
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption p...
TCC
2005
Springer
15 years 3 months ago
2005
Springer
The existing unconditional security definitions of quantum key distribution (QKD) do not apply to joint attacks over QKD and the subsequent use of the resulting key. In this paper...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
103
click to vote
ACNS
2007
Springer
15 years 4 months ago
2007
Springer
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...