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.

Jingjiang Yang

dblp:420/8353 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0009-2592-4481ORCID · reported

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

Security and privacy · 1 · 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
Database system architecture and tuning · 50% Query processing and optimization · 50%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning › database security
encrypted database
0.912025
Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data Management · IEEE Trans. Dependable Secur. Comput. 2025
Query processing and optimization
join processing
0.912025
Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data Management · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis
structured encryption
0.912025
Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data Management · IEEE Trans. Dependable Secur. Comput. 2025

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

tag-based join · 1.7global counter · 1.7encrypted multi-map · 1.7
YearPublicationVenuePosition
2025 Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data Management
abstract
The widespread adoption of cloud storage has raised considerable data privacy concerns for outsourced databases. In recent years, Structured Encryption (STE) has emerged as a promising solution to build encrypted databases that efficiently handle queries while preserving privacy through underlying structures called Encrypted Multi-Maps (EMMs). However, current STE-based schemes primarily focus on static settings, and their direct extensions to dynamic settings introduce significant challenges in client storage overhead and update efficiency with join condition. In this paper, we present an efficient dynamic encrypted database scheme supporting large-scale data. To address the challenges in dynamic settings, we first propose a novel dynamic EMM design with constant client storage that utilizes a global counter to reduce client storage overhead. We then introduce an algorithm for dynamically handling join queries based on tags generated from values of the join attribute, significantly reducing update overhead. We implement our scheme and conduct comparative analyses with existing dynamic STE schemes. The experimental results demonstrate that our scheme offers significant advantages in terms of client storage overhead and update performance.
Kaiping Xue, Yutao Guo, Jingjiang Yang, Feng Liu 0059, Chunyi Zhang, Qibin Sun, Jun Lu 0001
IEEE Trans. Dependable Secur. Comput.3