Demo Data from EDBT 2026 / reviewers in the wild / expert
Guoyue Xiong
dblp:17/636
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0003-1892-4367ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Security and privacy · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 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 primitives and cryptanalysis · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › searchable encryption
public key encryption with keyword search |
1.0 | 1 | 2026 | HIBPEKS: Hierarchical Identity-Based Puncturable Encryption With Keyword Search Over Outsourced Encrypted Data · IEEE Trans. Inf. Forensics Secur. 2026 |
Cryptographic primitives and cryptanalysis › encryption
puncturable encryption |
1.0 | 1 | 2026 | HIBPEKS: Hierarchical Identity-Based Puncturable Encryption With Keyword Search Over Outsourced Encrypted Data · IEEE Trans. Inf. Forensics Secur. 2026 |
Methods — techniques the papers use, named apart from their topics
random oracle model · 2.0lattice-based cryptography · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | HIBPEKS: Hierarchical Identity-Based Puncturable Encryption With Keyword Search Over Outsourced Encrypted DataabstractWith the rapid advancement of cloud computing and the exponential growth of data, the demand for secure data querying and sharing has become increasingly prominent. Identity-Based Encryption with Keyword Search (IBEKS) and Hierarchical IBEKS (HIBEKS) address the issue of secure data querying, as it enables resource-constrained clients to effectively search for encrypted data stored in the cloud. However, existing HIBEKS schemes lack flexible data-query mechanisms among users in the same level, are highly vulnerable to attacks launched by quantum computers and Keyword Guessing Attacks (KGA), and lead to relatively high end-to-end latency. To meet more complex and diverse application requirements and address these vulnerabilities, we introduce a novel primitive called Hierarchical Identity-Based Puncturable Encryption with Keyword Search (HIBPEKS). The decryption keys held by higher-level users are capable of generating decryption keys for lower-level users, thereby enhancing the ability to perform multi-level encrypted data queries within the user group. In addition, to control the query of encrypted data, higher-level users can use specific tags to puncture decryption keys (for lower-level users), so that lower-level users will no longer be able to query the parts of the data associated with the punctured tags. Technically, we have improved the previous lattice-based IBEKS schemes and implemented an efficient and flexible data query mechanism in a hierarchical setting by exploiting Puncturable Encryption (PE) techniques. Moreover, we formalize the security model of HIBPEKS and prove its security within the framework of the random oracle model. Finally, we experimentally evaluate HIBPEKS and show that HIBPEKS is computationally efficient and practical. Guoyue Xiong, Minyu Teng, Yang Shi 0002 |
IEEE Trans. Inf. Forensics Secur. | 3 |
| 2018 | Intrusion-Resilient Undetachable Digital Signature for Mobile-Agent-Based Collaborative Business SystemsabstractMobile agents are useful in collaborative business systems due to their mobility and autonomy, which can roam over the Internet to purchase goods and services on behalf of their owners. However, given attacks from a malicious host, it is a challenge to securely sign a contract on behalf of the owner (the original signer). In this paper, we propose an intrusion-resilient undetachable digital signature (IR-UDS) approach to mitigate the security risk of signing key leakage on the signer's host, base device, and potentially malicious remote hosts, as well as the risk of misusing the signing algorithm on remote hosts. An attacker will be unable to forge the past and future signatures as long as the base device is secure, even if the current signing key of the original signer has been gained. When the base device is compromised, although the future signatures could be forged, all past signatures remain secure. Furthermore, the encrypted signing function has been combined with the original signer's requirement to prevent the misuse of signing algorithm and the exposure of original signing key on malicious hosts. Security analysis has indicated that our scheme can defeat a variety of attacks, and experimental evaluations have demonstrated the good performance of the scheme. Yang Shi 0002, Jingwen Liang, Jingxuan Han, Jiayao Gao, Guoyue Xiong, Hongfei Fan |
CSCWD | 5 |
| 2018 | Identity-based undetachable digital signature for mobile agents in electronic commerce
Yang Shi 0002, Jingxuan Han, Guoyue Xiong, Qinpei Zhao |
Soft Comput. | 4 |