B
Bo Qin
Researcher at Renmin University of China
Publications - 121
Citations - 2859
Bo Qin is an academic researcher from Renmin University of China. The author has contributed to research in topics: Encryption & Public-key cryptography. The author has an hindex of 27, co-authored 112 publications receiving 2242 citations. Previous affiliations of Bo Qin include Shandong University & Xidian University.
Papers
More filters
Journal ArticleDOI
Distributed Aggregate Privacy-Preserving Authentication in VANETs
TL;DR: A vehicular authentication protocol referred to as distributedaggregate privacy-preserving authentication, based on the new multiple trusted authority one-time identity-based aggregate signature technique, which only requires realistic TPDs and is more practical.
Book ChapterDOI
Asymmetric Group Key Agreement
TL;DR: This work proposes a generic construction of one-round ASGKAs based on a new primitive referred to as aggregatable signature-based broadcast (ASBB), in which the public key can be simultaneously used to verify signatures and encrypt messages while any signature can be used to decrypt ciphertexts under this public key.
Journal ArticleDOI
Identity-based remote data possession checking in public clouds
TL;DR: The authors present the first ID-RDPC protocol proven to be secure assuming the hardness of the standard computational Diffie-Hellman problem, which outperforms the existing RDPC protocols in the PKI setting in terms of computation and communication.
Journal ArticleDOI
Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts
Hua Deng,Hua Deng,Qianhong Wu,Bo Qin,Josep Domingo-Ferrer,Lei Zhang,Jianwei Liu,Wenchang Shi +7 more
TL;DR: This paper constructs a CP-HABE scheme with short ciphertexts, which is proven secure in the standard model under non-interactive assumptions and proposes a new versatile cryptosystem referred to as ciphertext-policy hierarchical ABE (CP- HABE).
Journal ArticleDOI
Efficient many-to-one authentication with certificateless aggregate signatures
TL;DR: This paper presents a new efficient certificateless aggregate signature scheme which has the advantages of both aggregate signatures and certificateless cryptography and is proven existentially unforgeable against adaptive chosen-message attacks under the standard computational Diffie-Hellman assumption.