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

Ningyu Chen

dblp:155/5022 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0001-6359-1176ORCID · corroborated

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

Systems, architecture and hardware · 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
Cryptographic primitives and cryptanalysis · 67% Cryptographic protocols and secure computation · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
0.612022
Efficient CP-ABE Scheme With Shared Decryption in Cloud Storage · IEEE Trans. Computers 2022
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
ciphertext-policy attribute-based encryption
0.612022
Efficient CP-ABE Scheme With Shared Decryption in Cloud Storage · IEEE Trans. Computers 2022
Cloud and datacenter computing
access control
0.212022
Efficient CP-ABE Scheme With Shared Decryption in Cloud Storage · IEEE Trans. Computers 2022
Cloud and datacenter computing
cloud storage
0.212022
Efficient CP-ABE Scheme With Shared Decryption in Cloud Storage · IEEE Trans. Computers 2022

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

access tree · 1.1CPA security proof · 1.1
YearPublicationVenuePosition
2022 Efficient CP-ABE Scheme With Shared Decryption in Cloud Storage
abstract
Attribute-based encryption (ABE) is a preferred technology used to access control the data stored in the cloud servers. However, in many cases, the authorized decryption user may be unable to decrypt the ciphertext in time for some reason. To be on the safe side, several alternate users are delegated to cooperate to decrypt the ciphertext, instead of one user doing that. We provide a ciphertext-policy ABE scheme with shared decryption in this article. An authorized user can recover the messages independently. At the same time, these alternate users (semi-authorized users) can work together to get the messages. We also improve the basic scheme to ensure that the semi-authorized users perform the decryption tasks honestly. An integrated access tree is used to improve the efficiency for our scheme. The new scheme is proved CPA-secure in the standard model. The experimental result shows that our scheme is very efficient on both computational overhead and storage cost.
Ningyu Chen, Jiguo Li 0001, Yichen Zhang 0003, Yuyan Guo
IEEE Trans. Computers1
2014 Achievable energy efficiency resource allocation in OFDM system with mixed traffic
abstract
Energy efficiency is becoming more and more important to the development of wireless communication. In this paper, we study energy-efficient resource allocation in an Orthogonal Frequency Division Multiplexing (OFDM) system with mixed traffic. Considering both the energy efficiency and spectral efficiency, we model the allocation of sub-carriers and power as a mixed integer nonlinear programming (MINLP) problem maximizing the utility per Watt. The formulated problem is non-convex and is computationally forbidden. To simplify the solution of the problem, a two-step resource allocation (TSRA) algorithm is proposed. In the first step, we simplify the problem to a convex one and obtain the sub-carrier allocation using Karush-Kuhn-Tucker (KKT) conditions. On this basis, we solve the power allocation problem in the second step by transforming it into a parametric programming problem and applying Dinkelbach's theory. Simulation results show that our algorithm can provide 28% energy efficiency improvement compared to conventional algorithms.
Ningyu Chen, Pengxiang Hu, Xiaofeng Tao 0001, Qimei Cui, Yujing Shang
PIMRC1
2014 Cooperative strategies combination for uplink multi-cell networks under limited backhaul
abstract
In cellular wireless networks, base station (BS) cooperation is a promising technique to realize high spectral efficiency, whose potential gain, however, is restricted by the backhaul network. In this paper, we consider combining different decentralized cooperative strategies to fully utilize the limited backhaul. Firstly, the impact of limited backhaul capacity on different cooperative strategies is modeled. Then, we develop a analytical framework that gives a mathematical expression for the combination idea. Afterwards, we consider the establishment of the combination to fully exploit the backhaul capacity as well as the wireless channel realizations, which is a scheduling problem consisting of strategy selection and backhaul capacity allocation. A heuristic algorithm with polynomial time complexity is proposed. Finally, the validity of the combination idea and the proposed algorithm are confirmed by Monte Carlo simulations.
Pengxiang Hu, Yinxiang Zhang, Ningyu Chen, Xiaofeng Tao 0001, Qimei Cui, Yujing Shang
PIMRC3
2014 Utility Based Energy-Efficient Resource Allocation Algorithm in OFDM System
abstract
Resource allocation in Orthogonal Frequency Division Multiplexing (OFDM) system with mixed traffic is studied in this paper. The sub-carriers and power of a base station (BS) are allocated to users to maximize energy efficiency, which is measured by utility per Watt. We model the allocation of sub- carriers and power as a mixed integer nonlinear programming (MINLP) problem, which is computationally forbidden due to its non-concave objective function, non-convex feasible region and integer variables. To simplify the solution of the problem, a two-step resource allocation (TSRA) algorithm is proposed. In the first step, the integer variables are transformed into continuous variables and uniform power allocation is assumed. On this basis, sub-carrier allocation is obtained using KKT condition. Knowing the allocation of sub- carrier, the optimal power allocation is solved by an iterative sub-gradient method in the second step. Simulation results show that our algorithm can provide 25% energy efficiency improvement compared to conventional algorithms.
Ningyu Chen, Pengxiang Hu, Xiaofeng Tao 0001, Qimei Cui
VTC Fall1