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

Zikai Ye

dblp:346/1512 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0003-0830-3823ORCID · reported

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

Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

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.

Databases, data mining, and information retrieval
1 paper
Spatial and temporal data management · 100%
Network and information security
1 paper
Privacy and data protection · 62% Hardware security and side channels · 38%

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

TopicWeightPapersLastEvidence papers
Spatial and temporal data management
spatial keyword query
0.912025
OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves · Proc. ACM Manag. Data 2025
Spatial and temporal data management › spatial keyword query
top-k spatial keyword query
0.912025
OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves · Proc. ACM Manag. Data 2025
Privacy and data protection › privacy-preserving query processing
oblivious query processing
0.912025
OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves · Proc. ACM Manag. Data 2025
Hardware security and side channels › trusted execution environments
secure enclaves
0.312025
OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves · Proc. ACM Manag. Data 2025
Hardware security and side channels
trusted execution environments
0.312025
OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves · Proc. ACM Manag. Data 2025

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

oblivious block tree · 1.7PathORAM · 1.7IR-tree · 1.7
YearPublicationVenuePosition
2025 OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves
abstract
In recent years, the widely collected spatial-textual data has given rise to numerous applications centered on spatial keyword queries. However, securely providing spatial keyword query services in an outsourcing environment has been challenging. Existing schemes struggle to enable top- k spatial keyword queries on encrypted data while hiding search, access, and volume patterns, which raises concerns about availability and security. To address the above issue, this paper proposes OBIR-tree, a novel index structure for oblivious (provably hides search, access, and volume patterns) top- k spatial keyword queries on encrypted data. As a tight spatial-textual index tailored from the IR-tree and PathORAM, OBIR-tree can support sublinear search without revealing any useful information. Furthermore, we present extension designs to optimize the query latency of the OBIR-tree: (1) combine the OBIR-tree with hardware secure enclaves ( e.g., Intel SGX) to minimize client-server interactions; (2) build a Real/Dummy block Tree (RDT) to reduce the computational cost of oblivious operations within enclaves. Extensive experimental evaluations on real-world datasets demonstrate that the search efficiency of OBIR-tree outperforms state-of-the-art baselines by 25x ~ 723× and is practical for real-world applications.
Zikai Ye, Xiangyu Wang 0010, Dan Zhu 0001, Jianfeng Ma 0001
Proc. ACM Manag. Data1
2023 A 50-V 50-MHz High-Noise-Immunity Capacitive-Coupled Level Shifter With Digital Noise Blanker for GaN Drivers
abstract
In this paper, a high-noise-immunity capacitive-coupled level shifter with digital noise blanker (DNB) is presented for GaN drivers. During and after$\text{d}V$/dt transitions, the DNB blanks the common mode noise induced by$\text{d}V$/dt and converts the differential mode noise due to mismatch effect to common mode noise. This enables high$\text{d}V$/dt immunity of 200V/ns and high mismatch tolerance not less than 15%. Moreover, a dynamic discharge control (DDC) circuit prevents coupling capacitor from charging the floating power rail within a wide negative$\text{d}V$/dt transition range and achieves fast reset for high frequency operation. High speed, low power consumption and down to −5V negative floating power rail tolerance are also achieved. The proposed level shifter is fabricated in a 0.5-$\mu \text{m}$BCD process and occupies an active chip area of 0.051mm2. Experimental results confirm that the proposed level shifter works at 50V 50MHz, achieving power consumption of 27.3pJ/transition and 1.26ns average delay with a small figure of merit (5.5(pJ$\cdot $ns)/($\mu \text{m}^{3}\cdot \text{V}$)). The effect of the DDC is confirmed within negative$\text{d}V$/dt transition range of −5V/ns$\sim -50\text{V}$/ns.
Xin Ming, Zhiyi Lin 0002, Zikai Ye, Chun-wang Zhuang, Zhaoji Li, Bo Zhang 0027
IEEE Trans. Circuits Syst. I Regul. Pap.4