Burong Kang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Burong Kang has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Lei Zhang
Engineering Research Center of Software/Hardware Co-design Technology and Application, Ministry of Education, East China Normal University, Shanghai, China
3 shared publications - Dingkai Ni
Engineering Research Center of Software/Hardware Co-design Technology and Application, Ministry of Education, East China Normal University, Shanghai, China
1 shared publication - Kim-Kwang Raymond Choo
Department of Information Systems and Cybersecurity, The University of Texas at San Antonio, San Antonio, USA
1 shared publication - Xinyu Meng
School of Information Engineering, Shanghai Maritime University, Shanghai, China
1 shared publication - Yafang Yang
School of Computer Science, Fudan University, Shanghai, China
1 shared publication - Yan Zhang
Engineering Research Center of Software/Hardware Co-design Technology and Application, Ministry of Education, East China Normal University, Shanghai, China
1 shared publication
Latest Publications
- 11 January 2023
- Published by Springer Nature
- p. 192-213
CRFs for Digital Signature and NIZK Proof System in Web Services
- 11 January 2023
- Published by Springer Nature
- p. 192-213
CRFs for Digital Signature and NIZK Proof System in Web Services
- Open Access
- 23 October 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-16
Selective-Opening Security for Public-Key Encryption in the Presence of Parameter Subversion
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.
- 23 October 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-16
Open AccessSelective-Opening Security for Public-Key Encryption in the Presence of Parameter Subversion
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.
- Open Access
- 30 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 5199-5211
Secure, Robust and Flexible Cooperative Downloading Scheme for Highway VANETs
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).
- 30 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 5199-5211
Open AccessSecure, Robust and Flexible Cooperative Downloading Scheme for Highway VANETs
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).