Demo Data from EDBT 2026 / reviewers in the wild / expert
Myung-Hwan Kim
dblp:41/1393
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2008
0000-0003-1946-4799ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2Theory of computation · 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
2 papers |
Cryptographic primitives and cryptanalysis · 71% Cryptographic protocols and secure computation · 29% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
broadcast encryption |
0.1 | 2 | 2008 | Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption · IEEE Trans. Inf. Theory 2008 One-Way Chain Based Broadcast Encryption Schemes · EUROCRYPT 2005 |
Cryptographic protocols and secure computation › key management
key assignment |
0.1 | 1 | 2008 | Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption · IEEE Trans. Inf. Theory 2008 |
Cryptographic primitives and cryptanalysis › provable security › security notions › computational indistinguishability
key indistinguishability |
0.0 | 1 | 2008 | Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption · IEEE Trans. Inf. Theory 2008 |
Cryptographic primitives and cryptanalysis
pseudorandom generators |
0.0 | 1 | 2008 | Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption · IEEE Trans. Inf. Theory 2008 |
Cryptographic primitives and cryptanalysis
one-way functions |
0.0 | 1 | 2005 | One-Way Chain Based Broadcast Encryption Schemes · EUROCRYPT 2005 |
Methods — techniques the papers use, named apart from their topics
skipping chains · 0.1one-way key chains · 0.1cascade chains · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Skipping, Cascade, and Combined Chain Schemes for Broadcast EncryptionabstractWe develop a couple of new methods to reduce transmission overheads in broadcast encryption. The methods are based on the idea of assigning one key per each partition using one-way key chains after partitioning the users. One method adoptsskippingchainson partitions containing up toprevoked users and the other adoptscascadechainson partitions with layer structure. The scheme using the former has the transmission overhead [(r)/(p+1)]+ [(N-r)/(c)], which is less thanr/pifr>p2N/c. The scheme using the latter keeps the same transmission overhead with the subset difference (SD) scheme whenrapproaches 0, whereris the number of revoked users. Combining the two schemes, we propose a new broadcast encryption scheme whose transmission overhead is the same with that of the SD scheme for smallrand becomes smaller than that of the SD asrgrows. The scheme using skipping chains possesses an advantage that any number of new users can join any time at no cost for current users. Finally, we show that the proposed key assignment scheme satisfieskey-indistinguishabilityassuming pseudorandom generators. Jung Hee Cheon, Nam-Su Jho, Myung-Hwan Kim, Eun Sun Yoo |
IEEE Trans. Inf. Theory | 3 |
| 2005 | New broadcast encryption scheme using tree-based circleabstractSince broadcast encryption was first introduced in 1993 by Fiat and Naor, many broadcast encryption schemes have been developed. Among these, schemes based on tree structure and linear structure are notable. The subset difference (SD) scheme and layered subset difference (LSD) scheme based on tree structure have small user-key size and small transmission overhead when the number r of revoked users is very small. The punctured interval (PI) scheme based on linear (or circular) structure has better transmission overhead when r is not too small.In this paper, we propose a new broadcast encryption scheme, called the tree-based circle (TC) scheme, combining tree structure and circular structure. In this scheme, the transmission overhead is proportional to r like in the SD scheme for small r and becomes asymptotically same as that of the PI scheme when r grows, keeping the computation cost and the storage size small. The TC scheme also inherits the flexibility of the PI scheme. We further improve the transmission overhead of the TC scheme, when r is very small, by adopting the notion of cascade arc. Nam-Su Jho, Eun Sun Yoo, Jung Hee Cheon, Myung-Hwan Kim |
Digital Rights Management Workshop | 4 |
| 2005 | One-Way Chain Based Broadcast Encryption Schemes
Nam-Su Jho, Jung Yeon Hwang, Jung Hee Cheon, Myung-Hwan Kim, Dong Hoon Lee 0001, Eun Sun Yoo |
EUROCRYPT | 4 |