Burong Kang

Burong Kang

Auto-generated profile, based on publicly available information

Burong Kang

Ministry of Education, East China Normal University

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 December 2020 in IEEE Access
Verified
Journal Article
Open access
YZYan Zhang
Yan Zhang
ZLZhang lei
Zhang lei
DNDingkai Ni
Dingkai Ni
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo
BKBurong Kang
Burong Kang
The increasing popularity of smart vehicles and vehicular ad hoc networks (VANETs) has reinforced the importance of Internet connectivity. However, existing solutions (e.g., those based on cooperative downloading via drive-thru Internet) have a number of limitations, partly due to the challenges in selecting reliable proxy vehicles in a fast moving driving situation, and balancing between flexible data downloading and achieving strong security. Therefore, in this paper we propose a secure, robust and flexible cooperative downloading scheme based on our reputation based selection mechanism and ordered signatures. Using the reputation based selection mechanism, only vehicles with the highest expected downloading capacities will be selected as proxy vehicles. This helps us to avoid selecting less reliable proxy vehicles. The flexible data downloading is achieved by dividing a file into small blocks so that a proxy vehicle can flexibly vary the file / data download, for example based on existing condition. Our scheme also achieves strong security, in the sense that it realizes traditional authentication, privacy preservation and message confidentiality, as well as a newly introduced security requirement (i.e., process authentication: authenticates the order of file blocks and the order of the assisting vehicles using ordered signatures).

11 January 2023
Verified
Book Chapter
Closed access
PDF file
BKBurong Kang
Burong Kang
ZLZhang lei
Zhang lei
YYYafang Yang
Yafang Yang
XMXinyu Meng
Xinyu Meng

23 October 2021 in Security and Communication Networks
Verified
Journal Article
Open access
BKBurong Kang
Burong Kang
ZHZhengan Huang
Zhengan Huang
ZLZhang lei
Zhang lei
In public-key encryption (PKE), ciphertexts received by a receiver may be possibly correlated and the security of a PKE relies on honestly generated system parameters. Security against selective opening attacks (SOA) for PKE guarantees that even when an attacker has broken into a subset of honestly generated ciphertexts and opened them (i.e., seeing plaintexts and random bits), the unopened ciphertexts remain secure. While security against parameter subversion attacks (PSA) for PKE requires that even when the public system parameters are maliciously generated, a PKE scheme should be secure. In this paper, we initiate the study of PKE secure against both SOA and PSA. To capture SOA and PSA simultaneously, we formulate a new security notion called indistinguishability under selective opening attacks and parameter subversion attacks (IND-SO-PSA). Further, we define the lossy trapdoor function and all-but-many lossy trapdoor function in the presence of PSA (LTF-PSA and ABM-LTF-PSA correspondingly) and propose an instantiation with the efficiently-embeddable group (EG). Applying these new primitives, we construct a PKE scheme that is proven to be IND-SO-PSA secure.