Demo Data from EDBT 2026 / reviewers in the wild / expert
Guang-Yan Zheng
dblp:81/2942
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Security 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% | |
| Theoretical computer science
1 paper |
Distributed computing theory · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › consensus
byzantine agreement |
0.1 | 1 | 2008 | Reaching Agreement among Virtual Subnets in Hybrid Failure Mode · IEEE Trans. Parallel Distributed Syst. 2008 |
Distributed systems
consensus |
0.1 | 1 | 2008 | Reaching Agreement among Virtual Subnets in Hybrid Failure Mode · IEEE Trans. Parallel Distributed Syst. 2008 |
Distributed systems
fault tolerance |
0.1 | 1 | 2008 | Reaching Agreement among Virtual Subnets in Hybrid Failure Mode · IEEE Trans. Parallel Distributed Syst. 2008 |
Distributed systems › dynamic network
mobile ad hoc network |
0.1 | 1 | 2008 | Reaching Agreement among Virtual Subnets in Hybrid Failure Mode · IEEE Trans. Parallel Distributed Syst. 2008 |
Methods — techniques the papers use, named apart from their topics
message exchange rounds · 0.2hybrid agreement protocol · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Open Stack Secure Enterprise File Sync and Share Turnkey SolutionabstractThe Enterprise File Sync and Share (EFSS) is one of the most important services to provide enterprises' employees with cloud file sync, share, and collaboration services. To take enterprises' concerns into account, such as security, privacy, compliance, and regulation, the existing EFSS solutions are either using private (on-premise) or hybrid cloud service model to provide their services. They usually emphasize that files stored in the solutions are encrypted on transfer and at rest and events occurred in the service are logged as the audit trail. However, support of data encryption and audit trail are not capable of protecting enterprise sensitive data from not well addressed security issues of the EFSS service. The security issues, including employee privacy protection, management of share links and synchronized cloud files, and the secure enterprise directory integration, are pointed out in this article. To address these issues, this work proposes and develops a scalable Secure EFSS service which can be deployed on the on-premise Open Stack cloud infrastructure to securely provide employees with EFSS service. Designs of an integrated security approach are introduced in this article, including data and metadata isolations, Distinct Share Link utility, encryption key management for personal and shared files, sandbox-based cloud file synchronization, and out-of-band authentication method. Yen-Hung Kuo, Tzu-Wei Yeh, Guang-Yan Zheng, Jyun-Kai Wu, Chao-Chin Yang, Jia-Ming Lin |
CloudCom | 3 |
| 2008 | Reaching Agreement among Virtual Subnets in Hybrid Failure ModeabstractFault-tolerance is an important research topic in the study of distributed systems. To cope with the influence of faulty components, reaching a common agreement in the presence of faults before performing certain tasks is essential. However, the Byzantine Agreement (BA) problem is a fundamental problem in fault-tolerant distributed systems. In previous studies, protocols dealing with the BA problem focused on static networks; however, these do not perform well in dynamically changing mobile networks. The most well known mobile network is the Mobile Ad-hoc Network (MANET). To enhance fault-tolerance and MANET reliability, the BA problem in virtual subnets of MANET is revisited in this paper. The proposed protocol is called the Hybrid Agreement Protocol (HAP). It achieves agreement on a common value among all functional mobile processors in a minimal number of message exchange rounds, and can tolerate a maximal number of allowable faulty components in the virtual subnet of MANET. Shu-Chin Wang, Kuo-Qin Yan, Shun-Sheng Wang, Guang-Yan Zheng |
IEEE Trans. Parallel Distributed Syst. | 4 |
| 2007 | Efficient Malicious Agreement in a Virtual Subnet NetworkabstractThe fault-tolerance is an important research topic in the study of distributed systems. To cope with the influence from faulty processors, reaching a common agreement in the presence of faults before performing certain special tasks is essential. Therefore, the Byzantine Agreement (BA) problem has drawn more researcher attention as they explore deeper into the world of distributed systems. Traditionally, the BA problem is solved in a wired network. However, the mobile computers have become increasingly popular. This environment encourages distributed system design and practices that support mobile processors. A mobile ad-hoc network (MANET) is different from a wired network. The processors have high mobility. Therefore, to enhance fault-tolerance and MANET reliability, the BA problem in virtual subnet of MANET is revised in this paper. The proposed protocol uses a minimum number of message exchange rounds and can tolerate the maximum number of allowable faulty components and make each fault-free processor reach a common agreement in the virtual subnet of MANET Shu-Chin Wang, Shyi-Ching Liang, Kuo-Qin Yan, Guang-Yan Zheng |
ARES | 4 |