Demo Data from EDBT 2026 / reviewers in the wild / expert
Ping Zhang 0020
dblp:13/4682-20
· DBLP profile ↗
6ranked-venue papers
6as first author
1since 2021 · last 2021
0000-0002-0647-0375ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 3 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
2 papers |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
block cipher |
0.5 | 1 | 2021 | Multi-user security of the tweakable Even-Mansour cipher · Sci. China Inf. Sci. 2021 |
Cryptographic primitives and cryptanalysis › provable security
multi-user security |
0.5 | 1 | 2021 | Multi-user security of the tweakable Even-Mansour cipher · Sci. China Inf. Sci. 2021 |
Cryptographic primitives and cryptanalysis › block cipher › key-alternating ciphers
tweakable even-mansour |
0.5 | 1 | 2021 | Multi-user security of the tweakable Even-Mansour cipher · Sci. China Inf. Sci. 2021 |
Cryptographic primitives and cryptanalysis
authenticated encryption |
0.3 | 1 | 2018 | Efficient beyond-birthday-bound secure authenticated encryption modes · Sci. China Inf. Sci. 2018 |
Cryptographic primitives and cryptanalysis
symmetric cryptography |
0.2 | 2 | 2021 | Multi-user security of the tweakable Even-Mansour cipher · Sci. China Inf. Sci. 2021 Efficient beyond-birthday-bound secure authenticated encryption modes · Sci. China Inf. Sci. 2018 |
Cryptographic primitives and cryptanalysis › block cipher
block cipher modes |
0.1 | 1 | 2018 | Efficient beyond-birthday-bound secure authenticated encryption modes · Sci. China Inf. Sci. 2018 |
Methods — techniques the papers use, named apart from their topics
security proof · 0.5beyond-birthday-bound security proof · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Multi-user security of the tweakable Even-Mansour cipher
Ping Zhang 0020, Honggang Hu, Peng Wang 0009 |
Sci. China Inf. Sci. | 1 |
| 2020 | Minimizing Key Materials: The Even-Mansour Cipher Revisited and Its Application to Lightweight Authenticated EncryptionabstractThe Even–Mansour cipher has been widely used in block ciphers and lightweight symmetric-key ciphers because of its simple structure and strict provable security. Its research has been a hot topic in cryptography. This paper focuses on the problem to minimize the key material of the Even–Mansour cipher while its security bound remains essentially the same. We introduce four structures of the Even–Mansour cipher with a short key and derive their security by Patarin’s H-coefficients technique. These four structures are proven secure up to O˜2k/μ adversarial queries, where k is the bit length of the key material and μ is the maximal multiplicity. Then, we apply them to lightweight authenticated encryption modes and prove their security up to about minb/2,c,k−log μ -bit adversarial queries, where b is the size of the permutation and c is the capacity of the permutation. Finally, we leave it as an open problem to settle the security of the t-round iterated Even–Mansour cipher with short keys. Ping Zhang 0020 |
Secur. Commun. Networks | 1 |
| 2018 | Efficient beyond-birthday-bound secure authenticated encryption modes
Ping Zhang 0020, Honggang Hu, Peng Wang 0024 |
Sci. China Inf. Sci. | 1 |
| 2018 | Generalized Tweakable Even-Mansour Cipher and Its Applications
Ping Zhang 0020, Honggang Hu |
J. Comput. Sci. Technol. | 1 |
| 2018 | Close to Optimally Secure Variants of GCMabstractThe Galois/Counter Mode of operation (GCM) is a widely used nonce-based authenticated encryption with associated data mode which provides the birthday-bound security in the nonce-respecting scenario; that is, it is secure up to about 2n/2 adversarial queries if all nonces used in the encryption oracle are never repeated, where n is the block size. It is an open problem to analyze whether GCM security can be improved by using some simple operations. This paper presents a positive response for this problem. Firstly, we introduce two close to optimally secure pseudorandom functions and derive their security bound by the hybrid technique. Then, we utilize these pseudorandom functions that we design and a universal hash function to construct two improved versions of GCM, called OGCM-1 and OGCM-2. OGCM-1 and OGCM-2 are, respectively, provably secure up to approximately 2n/67(n-1)2 and 2n/67 adversarial queries in the nonce-respecting scenario if the underlying block cipher is a secure pseudorandom permutation. Finally, we discuss the properties of OGCM-1 and OGCM-2 and describe the future works. Ping Zhang 0020, Honggang Hu |
Secur. Commun. Networks | 1 |
| 2017 | INT-RUP Security of Checksum-Based Authenticated Encryption
Ping Zhang 0020, Peng Wang 0009, Honggang Hu, Changsong Cheng, Wenke Kuai |
ProvSec | 1 |