Guofeng Lin

Dr. Guofeng Lin

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
23 May 2017 in IEEE Access
Verified
Journal Article
Open access
GLGuofeng Lin
Guofeng Lin
HHHanshu Hong
Hanshu Hong
ZSZhixin Sun
Zhixin Sun
Ciphertext policy attribute-based encryption (CP-ABE) is a promising cryptographic technique for fine-grained access control of outsourced data in the cloud. However, some drawbacks of key management hinder the popularity of its application. One drawback in urgent need of solution is the key escrow problem. We indicate that front-end devices of clients like smart phones generally have limited privacy protection, so if private keys are entirely held by them, clients risk key exposure that is hardly noticed but inherently existed in previous research. Furthermore, enormous client decryption overhead limits the practical use of ABE. In this paper, we propose a collaborative key management protocol in CP-ABE. Our construction realizes distributed generation, issue and storage of private keys without adding any extra infrastructure. A fine-grained and immediate attribute revocation is provided for key update. The proposed collaborative mechanism effectively solves not only key escrow problem but also key exposure. Meanwhile, it helps markedly reduce client decryption overhead. A comparison with other representative CP-ABE schemes demonstrates that our scheme has somewhat better performance in terms of cloud-based outsourced data sharing on mobile devices. Finally, we provide proof of security for the proposed protocol.

19 December 2019 in Security and Communication Networks
Verified
Journal Article
Open access
GLGuofeng Lin
Guofeng Lin
YXYunhao Xia
Yunhao Xia
CYChun Ying
Chun Ying
ZSZhixin Sun
Zhixin Sun
Attribute-based signature (ABS) is a promising cryptographic primitive. It allows the signer to generate a signature with attributes satisfying the predicate without leaking more information, so as to provide message authenticity in an anonymous manner. However, drawbacks concerning security and efficiency hinder its applications for authentication in mobile platforms. Here, we present F2P-ABS, an escrow-free and pairing-free attribute-based signature supporting perfect signer privacy for mobile anonymous authentication. To enhance its adaptiveness to mobile platforms, a novel key extraction is proposed so that the key escrow problem is mitigated over the single authority setting. It also helps to remarkably reduce the size of the signing key. Different from existing schemes, F2P-ABS is free from pairing operations. It performs no pairing operation for verification. Without the loss of security, we prove that F2P-ABS achieves signer privacy in perfect sense. It is also proven to guarantee existential unforgeability under corrupted and adaptive chosen predicate and message attack, which is securer than existing schemes.

1 August 2018
Verified
Conference Paper
Closed access
GLGuofeng Lin
Guofeng Lin
CYChun Ying
Chun Ying
STShuhua Tan
Shuhua Tan
YXYunhao Xia
Yunhao Xia
ZSZhixin Sun
Zhixin Sun
Personal health record (PHR) systems contain a large amount of private and sensitive data so that an access control paradigm is required to guarantee security and flexibility. Ciphertext-policy attribute-based encryption (CP-ABE) supports access control on encrypted data, which is a promising technique for PHR systems. However, current CP-ABE schemes consume much computing resources for encryption, decryption, and revocation. Furthermore, since there is much value behind mass health records it is often to see unauthorized access to these data by private keys obtained from illegal trade, which is called key abuse problem. Worse still, existing CP-ABE schemes are short of an effective mechanism to keep away from key abuse. In this paper, we propose an accountable, revocable, and pairing-free ciphertext-policy attribute-based encryption (ARP-CP-ABE). Each private key is inserted by a unique identity so that key abuse can be detected in decryption. Meanwhile, the traitor can also be immediately locked. Then we construct a fine-grained and immediate revocation mechanism based on attribute group and optimize its computational efficiency. In addition, no pairing computation is needed in ARP-CP-ABE, which reduces computation overhead and make it more suitable for mobile applications of PHR systems.

17 April 2019 in IEEE Access
Verified
Journal Article
Open access
YXYunhao Xia
Yunhao Xia
CYChun Ying
Chun Ying
GLGuofeng Lin
Guofeng Lin
ZSZhixin Sun
Zhixin Sun
Mobile devices now serve to pay for goods and services by means of the transmission of data, a system known as mobile payments. Mobile payment is receiving growing attention globally, from consumers to merchants, as an alternative to using cash, check, or credit cards. Most encryption techniques applied in mobile payment are based on traditional public key infrastructure. However, the traditional public key encryption algorithm has higher requirements for hardware which is not suitable for mobile terminals of limited computing resources. In addition, these public key encryption algorithms are vulnerable to quantum computing attacks and the availability of practical quantum computer is approaching faster than previously believed. Since mobile payment is facing with more and more security issues, how to complete the payment process effectively and securely become a problem urgently to be solved. In this paper, we firstly analyze the problem of signature scheme for mobile payment and propose an improved signature scheme based on Number Theory Research Unit (NTRU). The results of the experiment show that the proposed signature scheme is secure and efficient which can raise the speed and probability of generating reasonable signature value. Secondly, we introduce a new public key infrastructure NTRU-WPKI and design a third-party mobile payment model based on NTRU-WPKI to increase the efficiency and security. Finally, by doing the overall simulation, we prove that our model is highly effective and secure.

2 January 2018 in IEEE Access
Verified
Journal Article
Open access
JXJingjing Xu
Jingjing Xu
HHHanshu Hong
Hanshu Hong
GLGuofeng Lin
Guofeng Lin
ZSZhixin Sun
Zhixin Sun
With the continuous innovation and development of agent technology, the application of smart technique is gradually changing to intelligent and human-centered technology. Also, intelligent technique is involved in many fields, and Software Defined Network (SDN) is one of them. SDN is one of the most popular and most promising new technologies in the current network area, which has particular advantages over other traditional networks. However, most of the research work focus on the efficiency and function of SDN, while the access control and ciphertext search function in SDN have not been taken into full consideration. In this paper, we propose a new smart system based on SDN. It also equips with the functions of fine-grained access control and searchable encryption function, which combines a novel attribute-based searchable encryption scheme (ABSES) with SDN architecture. Our construction realizes inter-domain information sharing, fine-grained access control and ciphertext searchable function. The proposed ABSES effectively ensures the security of ciphertext stored in data center, and that users cannot obtain unauthorized information or illegal network resources without any certification. It reduces network bandwidth and local resources, while improving the scalability and flexibility of SDN access control at the meantime. Finally, our ABSES is proved to be correct and secure under chosen-keyword attack. The comparison with other representative attribute-based searchable encryption schemes demonstrates that our ABSES has somewhat better performance. The proposed new smart system can be used in human life and add more convenience to our daily life.

1 October 2017 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
GLGuofeng Lin
Guofeng Lin
HHHanshu Hong
Hanshu Hong
YXYunhao Xia
Yunhao Xia
ZSZhixin Sun
Zhixin Sun
Attribute-based encryption (ABE) is an interesting cryptographic technique for flexible cloud data sharing access control. However, some open challenges hinder its practical application. In previous schemes, all attributes are considered as in the same status while they are not in most of practical scenarios. Meanwhile, the size of access policy increases dramatically with the raise of its expressiveness complexity. In addition, current research hardly notices that mobile front-end devices, such as smartphones, are poor in computational performance while too much bilinear pairing computation is needed for ABE. In this paper, we propose a key-policy weighted attribute-based encryption without bilinear pairing computation (KP-WABE-WB) for secure cloud data sharing access control. A simple weighted mechanism is presented to describe different importance of each attribute. We introduce a novel construction of ABE without executing any bilinear pairing computation. Compared to previous schemes, our scheme has a better performance in expressiveness of access policy and computational efficiency.