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

Jinmei Tian

dblp:296/7710 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0009-0008-8418-4164ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 since 2021Security 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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
public key encryption with equality test
0.812024
Lightweight Searchable and Equality-Testable Certificateless Authenticated Encryption for Encrypted Cloud Data · IEEE Trans. Mob. Comput. 2024
Cryptographic primitives and cryptanalysis
searchable encryption
0.812024
Lightweight Searchable and Equality-Testable Certificateless Authenticated Encryption for Encrypted Cloud Data · IEEE Trans. Mob. Comput. 2024
Cloud and datacenter computing › cloud security
encrypted cloud data
0.212024
Lightweight Searchable and Equality-Testable Certificateless Authenticated Encryption for Encrypted Cloud Data · IEEE Trans. Mob. Comput. 2024

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

elliptic curve cryptography · 1.5decisional diffie-hellman · 1.5computational diffie-hellman · 1.5
YearPublicationVenuePosition
2024 Quasi-Linearly Homomorphic Signature for Data Integrity Auditing in Cloud Storage
Futai Zhang, Yichi Huang, Wenjie Yang 0001, Jinmei Tian
Inscrypt (2)4
2024 Lightweight Searchable and Equality-Testable Certificateless Authenticated Encryption for Encrypted Cloud Data
abstract
Public key encryption with equality test (PKE-ET) is a novel cryptosystem to deal with the problem of multi-public-key encrypted data computing. It can be used to verify if different ciphertexts are encryptions of same plaintext under different public keys without decryption. As an extension of PKE-ET, certificateless encryption with equality test (CLE-ET) has the merits of no key escrow and no certificate. However, the existing CLE-ET schemes are vulnerable to the message recovery (MR) attack and suffer from low efficiency due to using the computationally expensive bilinear pairing. In this work, an elliptic-curve-based certificateless authenticated encryption with keyword search and equality test (CLAE-KS&ET) scheme is developed. The scheme not only provides resistance to the MR attack, but also satisfies the lightweight requirement of the resources-restricted environments. Moreover, it supports a ciphertext retrieval function resisting keyword guessing attacks. This function enables a user to seek out the desired ciphertexts on the cloud server firstly before making ciphertext equality test with others. Based on the computational Diffie-Hellman (CDH) and decisional Diffie-Hellman (DDH) problems, we formally prove its security. Compared with the existing CLE-ET schemes, it significantly improves computational efficiency and is more suited to the user terminals with limited resources in cloud.
Jinmei Tian, Yang Lu 0001, Jiguo Li 0001
IEEE Trans. Mob. Comput.1