154 search results - page 19 / 31 » Proving Group Protocols Secure Against Eavesdroppers |
CCR
2002
14 years 9 months ago
2002
We present a simple, efficient, and secure multicast protocol with copyright protection in an open and insecure network environment. There is a wide variety of multimedia applicat...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
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...
107
click to vote
ADHOC
2007
14 years 10 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
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...