Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Eric Harder

dblp:92/5831 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 87% Network security · 13%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key management
group key management
0.012000
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast · S&P 2000
Cryptographic protocols and secure computation › key management › group key management
group rekeying
0.012000
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast · S&P 2000
Network security › secure communication › secure group communication
secure multicast
0.012000
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast · S&P 2000

Methods — techniques the papers use, named apart from their topics

simulation · 0.0performance comparison · 0.0
YearPublicationVenuePosition
2000 Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
abstract
The authors describe a novel approach to scalable group re-keying for secure multicast. Our approach, which we call Kronos, is based upon the idea of periodic group re-keying. We first motivate our approach by showing that if a group is re-keyed on each membership change, as the size of the group increases and/or the rate at which members leave and join the group increases, the frequency of rekeying becomes the primary bottle neck for scalable group re-keying. In contrast, Kronos can scale to handle large and dynamic groups because the frequency of re-keying is independent of the size and membership dynamics of the group. Next, we describe how Kronos can be used in conjunction with distributed key management frameworks such as IGKMP (T. Hardjono et al., 1998) that use a single group-wide session key for encrypting communications between members of the group. Using a detailed simulation, we compare the performance tradeoffs between Kronos and other key management protocols.
Sanjeev Setia, Samir Koussih, Sushil Jajodia, Eric Harder
S&P4