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.

Bei Wang 0006

dblp:08/6391-6 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-2891-8521ORCID · verified

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

Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 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.

Theoretical computer science
1 paper
Coding theory · 100%
Network and information security
1 paper
Digital forensics and information hiding · 77% Cryptographic primitives and cryptanalysis · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › boolean functions
bent functions
0.712023
An Open Problem About Monomial Bent Functions · IEEE Trans. Inf. Theory 2023
Coding theory
boolean functions
0.712023
An Open Problem About Monomial Bent Functions · IEEE Trans. Inf. Theory 2023
Coding theory › sequences › pseudorandom sequences
cross correlation
0.712023
An Open Problem About Monomial Bent Functions · IEEE Trans. Inf. Theory 2023
Coding theory › boolean functions › bent functions
monomial bent functions
0.712023
An Open Problem About Monomial Bent Functions · IEEE Trans. Inf. Theory 2023
Coding theory › sequences
sequence design
0.712023
An Open Problem About Monomial Bent Functions · IEEE Trans. Inf. Theory 2023
Digital forensics and information hiding
watermarking
0.612022
Watermarking-Based Secure Plaintext Image Protocols for Storage, Show, Deletion and Retrieval in the Cloud · IEEE Trans. Serv. Comput. 2022
Cloud and datacenter computing › cloud storage
secure cloud storage
0.612022
Watermarking-Based Secure Plaintext Image Protocols for Storage, Show, Deletion and Retrieval in the Cloud · IEEE Trans. Serv. Comput. 2022
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.212022
Watermarking-Based Secure Plaintext Image Protocols for Storage, Show, Deletion and Retrieval in the Cloud · IEEE Trans. Serv. Comput. 2022

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

homomorphic encryption · 1.1digital watermarking · 1.1trace representation · 0.7finite field theory · 0.7
YearPublicationVenuePosition
2023 An Open Problem About Monomial Bent Functions
abstract
In 2018, Pott et al. investigated vectorial functions with maximal number of bent components. They found one class of binomial functions attaining the upper bound. They also proposed an open problem regarding monomial functions that have the maximal number of bent components. In this paper, we solve this open problem. Specifically, we prove that if$k\geq 2$, then$x^{s(2^{k}+1)}$are the only monomial functions over$\mathbb {F}_{2^{2k}}$that have the maximal number of bent components, where$s\in \{1, 2, 2^{2}, \ldots, 2^{k-1}\}$. As a consequence, we also solve an open problem of Ness and Helleseth about the cross-correlation function between two sequences in 2006.
Honggang Hu, Bei Wang 0006, Xianhong Xie 0001, Yiyuan Luo
IEEE Trans. Inf. Theory2
2022 Watermarking-Based Secure Plaintext Image Protocols for Storage, Show, Deletion and Retrieval in the Cloud
abstract
In this article, we propose secure plaintext image storage protocols in the cloud environment for image owners managing and controlling their outsourced images. To solve control and privacy issues, conventional schemes suggest outsourcing images in the encrypted form. However, encrypted images lose their usability and visibility. For example, image owners cannot quickly find their stored images in the cloud. The proposed protocols encourage plaintext image storage in the cloud with copyright protection of images, visible display, lossless retrieval and controlled deletion via techniques of homomorphic encryption and digital watermarking. We allow the image owner to embed and remove the watermark in a privacy-preserving way without compromising the security of the original data and the computed results. Moreover, the image owner can securely detect the cloud's dishonest act of not completely deleting an image as required or leaking an image without permission. Compared with existing works, our work achieves more functions. We prove that the proposed work achieves the controllable management of the outsourced plaintext images without privacy leakage to unauthorized parties and demonstrate the utility and the efficiency of our protocols through experimental evaluation.
Weiming Zhang 0001, Mohsin Shah, Bei Wang 0006, Nenghai Yu
IEEE Trans. Serv. Comput.4