Demo Data from EDBT 2026 / reviewers in the wild / expert
Cheng-Zong Shieh
dblp:08/9024
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 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 |
Authentication and access control · 67% Cryptographic protocols and secure computation · 33% | |
| Computer networks
1 paper |
Content delivery and video streaming · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Authentication and access control
access control |
0.1 | 1 | 2008 | Flexible-Pay-Per-Channel: A New Model for Content Access Control in Pay-TV Broadcasting Systems · IEEE Trans. Multim. 2008 |
Authentication and access control › access control
conditional access system |
0.1 | 1 | 2008 | Flexible-Pay-Per-Channel: A New Model for Content Access Control in Pay-TV Broadcasting Systems · IEEE Trans. Multim. 2008 |
Cryptographic protocols and secure computation
key management |
0.1 | 1 | 2008 | Flexible-Pay-Per-Channel: A New Model for Content Access Control in Pay-TV Broadcasting Systems · IEEE Trans. Multim. 2008 |
Methods — techniques the papers use, named apart from their topics
binary tree key update · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Flexible-Pay-Per-Channel: A New Model for Content Access Control in Pay-TV Broadcasting SystemsabstractIn the past, two models, pay-per-channel (PPC) and pay-per-view (PPV), for content access control in pay-TV broadcasting systems have been proposed. In PPC, a subscriber subscribes to one or multiple group(s) of channels, prearranged by the service provider, for a fixed period of time. Thus, it is unfair for the subscriber because the subscriber can not subscribe an arbitrary combination of channels according to his/her preference, and can not dynamically unsubscribe/change his/her subscription during the subscription period. On the other hand, PPV specifies that a subscriber can pay for each single program; thus, it provides a fair service. However, compared with PPC, PPV makes the subscriber inconvenient because of the high subscription frequency and low flexibility of channel selection. Moreover, all the existing PPV systems are only suitable for a small-scale Pay-TV system with limited users because of the overhead for transmission and storage. In this paper, we define a new model, flexible-PPC (F-PPC), which combines the properties and the advantages of PPC and PPV. F-PPC is an improved model of PPC for its fairness. It allows a subscriber to subscribe freely to his/her favorite channels, and unsubscribe/change his/her subscription at any time. Furthermore, it eliminates the inconvenience in PPV, and is suitable for a large-scale Pay-TV system with numerous subscribers and channels. In order to fulfill the requirements of F-PPC, we propose a new conditional access system (CAS) with a four-level key hierarchy. The proposed CAS utilizes a structure of a binary tree to update keys rapidly; therefore, the service provider can promptly update necessary keys when the subscribers change their subscriptions or leave the system. Compared with the existing CAS systems, our CAS is more efficient and flexible to support F-PPC. Chien-Ming Chen 0001, Cheng-Zong Shieh |
IEEE Trans. Multim. | 3 |