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

Nengyu He

dblp:430/2351 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0000-0002-9790-5847ORCID · reported

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

Security and privacy · 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.

Network and information security
1 paper
Privacy and data protection · 50% Cryptographic protocols and secure computation · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Energy systems and smart grids · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection › data aggregation › privacy-preserving data aggregation
multi-dimensional data aggregation
1.012026
MDA-SMuSha: An Efficient and Flexible Multi-Dimensional Data Aggregation Scheme for Privacy-Preservation in Smart Grids · IEEE Trans. Dependable Secur. Comput. 2026
Privacy and data protection › data aggregation
privacy-preserving data aggregation
1.012026
MDA-SMuSha: An Efficient and Flexible Multi-Dimensional Data Aggregation Scheme for Privacy-Preservation in Smart Grids · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic protocols and secure computation
secret sharing
1.012026
MDA-SMuSha: An Efficient and Flexible Multi-Dimensional Data Aggregation Scheme for Privacy-Preservation in Smart Grids · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic protocols and secure computation
secure multiparty computation
1.012026
MDA-SMuSha: An Efficient and Flexible Multi-Dimensional Data Aggregation Scheme for Privacy-Preservation in Smart Grids · IEEE Trans. Dependable Secur. Comput. 2026
Energy systems and smart grids › smart metering
smart meter privacy
0.312026
MDA-SMuSha: An Efficient and Flexible Multi-Dimensional Data Aggregation Scheme for Privacy-Preservation in Smart Grids · IEEE Trans. Dependable Secur. Comput. 2026

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

shamir's multi-secret sharing · 2.0paillier encryption · 2.0
YearPublicationVenuePosition
2026 MDA-SMuSha: An Efficient and Flexible Multi-Dimensional Data Aggregation Scheme for Privacy-Preservation in Smart Grids
abstract
In smart grids, smart meters periodically collect users' fine-grained multi-dimensional energy data, which poses great concerns on users' privacy and security. Existing privacy preserving multi-dimensional aggregation schemes suffer from heavy computational burdens, especially for smart meters with limited computational resources. To address these limitations, in this paper we propose an efficient and flexible multi-dimensional data aggregation scheme called MDA-SMuSha, by which smart meters employ the Shamir's multi-secret sharing to generate a set of shared secrets, with the first one kept locally, while the remained ones are packaged and then uploaded to a control center via an aggregator. By the MDA-SMuSha scheme, aggregation results of smart meters' multi-dimensional energy data during multiple periods can be obtained, with only one time of Paillier encryption conducted on the smart meters. In addition, it allows the control center to send query requests flexibly, i.e., at a pre-specified frequency or whenever it wants to obtain statistical data of interests. Rigorous security analyses show that the MDA-SMuSha scheme satisfies security requirements of privacy-preservation, authenticity and data integrity as well as fault-tolerance. Both theoretical analyses and experiment results show that the MDA-SMuSha scheme outperforms state-of-the art methods in terms of computation costs, with comparable communication costs.
Nengyu He, Xiaofang Xia, Xiangru Zhan, Jiangtao Cui, Jiwei Tian, Chi Xu 0001, Wei Liang 0001
IEEE Trans. Dependable Secur. Comput.1