L
Liming Fang
Researcher at Nanjing University of Aeronautics and Astronautics
Publications - 69
Citations - 1723
Liming Fang is an academic researcher from Nanjing University of Aeronautics and Astronautics. The author has contributed to research in topics: Encryption & Ciphertext. The author has an hindex of 17, co-authored 57 publications receiving 1102 citations. Previous affiliations of Liming Fang include Nanjing University & City University of Hong Kong.
Papers
More filters
Proceedings ArticleDOI
A Ciphertext-Policy Attribute-Based Proxy Re-encryption with Chosen-Ciphertext Security
TL;DR: Li et al. as discussed by the authors proposed CP-ABPRE with attribute-based re-encryption with any monotonic access structure, which is proved CCA secure under the decisional q-parallel bilinear Diffie-Hellman exponent assumption.
Journal ArticleDOI
Public key encryption with keyword search secure against keyword guessing attacks without random oracle
TL;DR: This paper defines the strongest model of PEKS which is secure channel free and secure against chosen keyword attack, chosen ciphertext attack, and keyword guessing attack and presents two important security notions namely IND-SCF-CKCA and IND-KGA.
Journal ArticleDOI
Revocable Identity-Based Broadcast Proxy Re-Encryption for Data Sharing in Clouds
TL;DR: A novel security notion named revocable identity-based broadcast proxy re-encryption (RIB-BPRE) is presented to address the issue of key revocation and the performance evaluation reveals that the proposed scheme is efficient and practical.
Journal ArticleDOI
Provably Secure Dynamic ID-Based Anonymous Two-Factor Authenticated Key Exchange Protocol With Extended Security Model
TL;DR: This paper proposes a novel dynamic ID-based anonymous two-factor AKE protocol, which extends the security model of AKE to support user anonymity and resist lost-smart-card attack, and the proposed scheme is provably secure in extended security model.
Book ChapterDOI
A Secure Channel Free Public Key Encryption with Keyword Search Scheme without Random Oracle
TL;DR: This paper adopts Baek et al.'s model and proposes a new and efficient scheme that does not require any secure channels, and furthermore, its security does not use random oracles.