Attribute-Based Conditional Proxy Re-encryption in the Standard Model Under LWE

Liang, Xiaojian; Weng, Jian; Yang, Anjia; Yao, Lisha; Jiang, Zike; Wu, Zhenghao

doi:10.1007/978-3-030-88428-4_8

Cited by 11 publications

(11 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• AB-CPRE with Re-encryption Simulatability. We apply the methods above to AB-CPRE scheme presented at ESORICS'21 [14]. We first formalize the HRA security model for AB-CPRE in this work and obtain a modified AB-CPRE scheme, scheme III.…”

Section: Methodsmentioning

confidence: 99%

“…AB-CPRE was initially introduced by Liang et al in [14] at ESORICS'21. They provided a comprehensive definition of AB-CPRE, elaborated on its CPA model, meticulously constructed the corresponding scheme utilizing LWE, and presented rigorous proof of its selective CPA security.…”

Section: Construction Of Ab-cpre With Re-encryption Simulatabilitymentioning

confidence: 99%

“…They provided a comprehensive definition of AB-CPRE, elaborated on its CPA model, meticulously constructed the corresponding scheme utilizing LWE, and presented rigorous proof of its selective CPA security. In this section, we use the construction idea in scheme I to improve the ReKeyGen and ReEnc of [14], enabling the modified scheme to have the property of re-encryption simulatability. The modified AB-CPRE scheme enhances the security from selective CPA to selective HRA.…”

Section: Construction Of Ab-cpre With Re-encryption Simulatabilitymentioning

confidence: 99%

See 2 more Smart Citations

HRA-Secure Proxy Re-encryption with Re-encryption Simulatability under Lwe in Standard Model

Wang,

Hou,

Yao

et al. 2023

Preprint

View full text Add to dashboard Cite

Proxy re-encryption (PRE) is a momentous and widely used cryptographic technique. It enables a proxy to forward ciphertext without the need of decryption. PRE has received significant interest in applications like cloud computing, blockchain, and the Internet of Things. Despite its wide range of uses, PRE has also been subject to new security and privacy regulations. In PKC’19, Cohen $et~al.$~first drew attention to the weakness in PRE's security against chosen-plaintext attacks (CPA) and put up a more stringent security concept known as security against honest re-encryption attacks (HRA). Notably, Cohen provides a beneficial conclusion as well. It is proveded that PRE schemes with re-encryption simulatability property can be elevated from CPA to HRA security. It is also proved that CPA-secure PRE schemes with re-encryption simulatability property can be directly elevated to those satisfying HRA security. However, those PRE schemes with re-encryption simulatability are almost always based on pairings. In this study, to the best of our knowledge, we directly construct HRA-secure PRE with re-encryption simulatability for the first time based on the learning with errors (LWE) assumption, which was widely believed to be quantum-resistant. Based on the re-encryption key generation algorithm and the re-encryption algorithm construction method of the above scheme, we can modify attribute-based conditional proxy re-encryption (AB-CPRE) as well as the corresponding attribute-based proxy re-encryption (AB-PRE) algorithm to make them have re-encryption simulatability properties. Finally, by using this property, We boost the security of AB-CPRE scheme of ESORICS'21 from CPA to HRA and simplify the HRA-security proof for the AB-PRE of ESORICS'21.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Construction Of Ab-cpre With Re-encryption Simulatabilitymentioning

confidence: 99%

Section: Construction Of Ab-cpre With Re-encryption Simulatabilitymentioning

confidence: 99%

See 1 more Smart Citation

HRA-Secure Proxy Re-encryption with Re-encryption Simulatability under Lwe in Standard Model

Wang,

Hou,

Yao

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Their scheme only supported the access structure of the AND gate, and the access policy's expressiveness was relatively weak. To be able to control the proxy's ability to re-encrypt the original ciphertext, Liang et al [18] constructed the conditional ABPRE from lattice firstly, which met the requirements of more fine-grained data sharing. However, the schemes of [17] and [18] only satisfied the nature of single-use.…”

Section: Figure 1: Schematic Of Multi-use Prementioning

confidence: 99%

“…To be able to control the proxy's ability to re-encrypt the original ciphertext, Liang et al [18] constructed the conditional ABPRE from lattice firstly, which met the requirements of more fine-grained data sharing. However, the schemes of [17] and [18] only satisfied the nature of single-use. This limited the practicality of the scheme.…”

Section: Figure 1: Schematic Of Multi-use Prementioning

confidence: 99%

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

Hou,

Peng,

Tan

et al. 2024

Computer Modeling in Engineering &Amp; Sciences

View full text Add to dashboard Cite

Cloud-based services have powerful storage functions and can provide accurate computation. However, the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight. Although the attribute-based proxy re-encryption (ABPRE) schemes based on number theory can solve this problem, it is still difficult to resist quantum attacks and have limited expression capabilities. To address these issues, we present a novel linear secret sharing schemes (LSSS) matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research. Additionally, to detect the activities of illegal proxies, homomorphic signature (HS) technology is introduced to realize the verifiability of re-encryption. Moreover, the non-interactivity, unidirectionality, proxy transparency, multi-use, and anti-quantum attack characteristics of our system are all advantageous. Besides, it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud. Furthermore, under the standard model, the proposed learning with errors (LWE)-based scheme was proven to be IND-sCPA secure.

show abstract