Jiangshan Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiangshan Chen has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
Yupu Hu
State Key Laboratory of Integrated Services Networks Xidian University Xi'an 710071 People's Republic of China
2 shared publications- Yupu Hu
Xidian University
2 shared publications Baocang Wang
State Key Laboratory of Integrated Services Networks Xidian University Xi'an 710071 People's Republic of China
1 shared publication- Baocang Wang
The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
1 shared publication Hong-Mei Liang
School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, 363000, China
1 shared publicationHongmei Liang
Minnan Normal Univ, Sch Math & Stat, Zhangzhou 363000, Fujian, Peoples R China
1 shared publication
Latest Publications
- 31 December 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 36 (06) , 867-883
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio
Indistinguishable Obfuscation (IO) is a very critical cryptography primitive. It can be used to construct almost any other cryptography schemes. AB15 indistinguishability obfuscation scheme is the first practical scheme. In order to avoid the ideal generator can be searched, authors of AB15 IO scheme set it to a relatively large size (In fact, such ideal generator should be a “small prime”). It causes the ratio of the standard deviation of Gaussian sampling and the size of ideal generator smaller. We call the ratio as “deviation ratio”. In this paper, we point that direct sampling and smaller deviation ratio makes the scheme insecure. A searching attack can reveal hidden coefficients of original boolean circuit from its obfuscator. Firstly, the attacker searches those level-0 encodings of 0, hoping that the code value is 0. Such event happens with probability [ ] or [ ], where [ ] as the deviation ratio. By a series of searching, a weak obfuscator with prime module can be obtained. Then, the attacker can obtain all hidden coefficients of original boolean circuit. Take n as the dimension of independent variable, m as the dimension of coefficient of original boolean circuit. For Simple Obfuscator, searching time is [ ], and the probability that one successfully reveals hidden coefficients of original boolean circuit is about [ ]. For Robust Obfuscator, searching time and success probability are respectively [ ] and [ ]. At last, we present a revised scheme with “conditionally accepted sampling” and smaller deviation ratio. The new scheme avoids above mentioned attack and greatly reduce the size complexity.
- 31 December 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 36 (06) , 867-883
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio
Indistinguishable Obfuscation (IO) is a very critical cryptography primitive. It can be used to construct almost any other cryptography schemes. AB15 indistinguishability obfuscation scheme is the first practical scheme. In order to avoid the ideal generator can be searched, authors of AB15 IO scheme set it to a relatively large size (In fact, such ideal generator should be a “small prime”). It causes the ratio of the standard deviation of Gaussian sampling and the size of ideal generator smaller. We call the ratio as “deviation ratio”. In this paper, we point that direct sampling and smaller deviation ratio makes the scheme insecure. A searching attack can reveal hidden coefficients of original boolean circuit from its obfuscator. Firstly, the attacker searches those level-0 encodings of 0, hoping that the code value is 0. Such event happens with probability [ ] or [ ], where [ ] as the deviation ratio. By a series of searching, a weak obfuscator with prime module can be obtained. Then, the attacker can obtain all hidden coefficients of original boolean circuit. Take n as the dimension of independent variable, m as the dimension of coefficient of original boolean circuit. For Simple Obfuscator, searching time is [ ], and the probability that one successfully reveals hidden coefficients of original boolean circuit is about [ ]. For Robust Obfuscator, searching time and success probability are respectively [ ] and [ ]. At last, we present a revised scheme with “conditionally accepted sampling” and smaller deviation ratio. The new scheme avoids above mentioned attack and greatly reduce the size complexity.
- 2 July 2020
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 22 (2) , 244-250
Novel efficient identity-based signature on lattices
With the rapid development of electronic information technology, digital signature has become an indispensable part of our lives. Traditional public key ce
- 2 July 2020
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 22 (2) , 244-250
Novel efficient identity-based signature on lattices
With the rapid development of electronic information technology, digital signature has become an indispensable part of our lives. Traditional public key ce
- Open Access
- 12 February 2020
- Published by Wiley in Security and Communication Networks
- Vol. 2020, 1-13
Server-Aided Revocable Attribute-Based Encryption from Lattices
Attribute-based encryption (ABE) can support a fine-grained access control to encrypted data. When the user’s secret-key is compromised, the ABE system has to revoke its decryption privileges to prevent the leakage of encrypted data. Although there are many constructions about revocable ABE from bilinear maps, the situation with lattice-based constructions is less satisfactory, and a few efforts were made to close this gap. In this work, we propose the first lattice-based server-aided revocable attribute-based encryption (SR-ABE) scheme and thus the first such construction that is believed to be quantum resistant. In the standard model, our scheme is proved to be secure based on the hardness of the Learning With Errors (LWE) problem.
- 12 February 2020
- Published by Wiley in Security and Communication Networks
- Vol. 2020, 1-13
Open AccessServer-Aided Revocable Attribute-Based Encryption from Lattices
Attribute-based encryption (ABE) can support a fine-grained access control to encrypted data. When the user’s secret-key is compromised, the ABE system has to revoke its decryption privileges to prevent the leakage of encrypted data. Although there are many constructions about revocable ABE from bilinear maps, the situation with lattice-based constructions is less satisfactory, and a few efforts were made to close this gap. In this work, we propose the first lattice-based server-aided revocable attribute-based encryption (SR-ABE) scheme and thus the first such construction that is believed to be quantum resistant. In the standard model, our scheme is proved to be secure based on the hardness of the Learning With Errors (LWE) problem.
- Open Access
- 1 November 2019
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 13 (6) , 685-691
Revisiting BGG + 14 ABE with weakness analysis
Attribute‐based encryption (ABE) supports fine‐grained sharing of encrypted data so that it can be used in a plenty of application scenarios, and many constructions of ABE scheme have been presented. The first arithmetic circuit ABE system was proposed by Boneh, Gentry, Gorbunov et al . (BGG + 14) in Eurocrypt 2014. It is one of the major candidates for ABE, whose security is based on the learning with errors assumption. In this work, the authorsanalyse three different versions of BGG + 14 ABE with weak attributes, weak variants, and weak modulus. First, they discuss weak attributes of BGG + 14 ABE. A weak attribute is generated with corresponding decryption key, such that whenever a ciphertext is labelled with this weak attribute, 1 bit of the plaintext can be revealed. Second, they discuss the security of three variants of BGG + 14 ABE with simplified pre‐sampled matrices, and show that all of them are not secure under collusion attack. Third, they consider the composite modulus rather than prime modulus in BGG + 14 ABE scheme. They show that, if a small factor of the modulus is known, the set of users able to decrypt is clearly expanded. These analyses give different perspectives on the security of BGG + 14 ABE under different conditions.
- 1 November 2019
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 13 (6) , 685-691
Open AccessRevisiting BGG + 14 ABE with weakness analysis
Attribute‐based encryption (ABE) supports fine‐grained sharing of encrypted data so that it can be used in a plenty of application scenarios, and many constructions of ABE scheme have been presented. The first arithmetic circuit ABE system was proposed by Boneh, Gentry, Gorbunov et al . (BGG + 14) in Eurocrypt 2014. It is one of the major candidates for ABE, whose security is based on the learning with errors assumption. In this work, the authorsanalyse three different versions of BGG + 14 ABE with weak attributes, weak variants, and weak modulus. First, they discuss weak attributes of BGG + 14 ABE. A weak attribute is generated with corresponding decryption key, such that whenever a ciphertext is labelled with this weak attribute, 1 bit of the plaintext can be revealed. Second, they discuss the security of three variants of BGG + 14 ABE with simplified pre‐sampled matrices, and show that all of them are not secure under collusion attack. Third, they consider the composite modulus rather than prime modulus in BGG + 14 ABE scheme. They show that, if a small factor of the modulus is known, the set of users able to decrypt is clearly expanded. These analyses give different perspectives on the security of BGG + 14 ABE under different conditions.
- Open Access
- 13 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 36334-36339
Collusion Trap Against GVW’13 ABE
- 13 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 36334-36339
Open AccessCollusion Trap Against GVW’13 ABE
- 28 February 2019
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 13 (2) , 1003-1019
Lattice-based Threshold Ring Signature with Message Block Sharing
- 28 February 2019
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 13 (2) , 1003-1019
Lattice-based Threshold Ring Signature with Message Block Sharing