Provably secure lattice based identity based unidirectional PRE and PRE<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.svg"><mml:msup><mml:mrow/><mml:mo>+</mml:mo></mml:msup></mml:math> schemes

Singh, Kunwar; Rangan, C. Pandu; Agrawal, Richa; Sheshank, Samir

doi:10.1016/j.jisa.2020.102569

Cited by 4 publications

(10 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it is required to use the secret key of both delegator and delegatee to generate a re-encryption key, which lacks one of the fundamental properties of PRE. Further, they proposed unidirectional identity-based PRE [32,30], termed as IB-uPRE, secure in the random oracle model. However, the size of the re-encrypted ciphertext blows up than the original encrypted one.…”

Section: Introductionmentioning

confidence: 99%

“…However, the size of the re-encrypted ciphertext blows up than the original encrypted one. Thus, [32,30] lack the property called Proxy transparency. Recently, Dutta et al [14] proposed IB-uPRE secure in standard model.…”

Section: Introductionmentioning

confidence: 99%

“…In [32,30], two matrices, of different order, A and X are constructed in public parameters. A is used for encryption and X is used for re-encryption.…”

Section: Introductionmentioning

confidence: 99%

“…A is used for encryption and X is used for re-encryption. In a simplified way, we can say that two different encryption schemes are used to construct IB-uPRE of [32,30]. Similar kind of technique is also used in [26].…”

Section: Introductionmentioning

confidence: 99%

“…Unfortunately, such technique causes different sizes for original ciphertext and re-encrypted ciphertext. Hence, property of proxy transparency is missing in [32,30,26].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Collusion-Resistant Identity-based Proxy Re-Encryption: Lattice-based Constructions in Standard Model

Dutta¹,

Susilo²,

Duong³

et al. 2020

Preprint

View full text Add to dashboard Cite

The concept of proxy re-encryption (PRE) dates back to the work of Blaze, Bleumer, and Strauss in 1998. PRE offers delegation of decryption rights, i.e., it securely enables the re-encryption of ciphertexts from one key to another, without relying on trusted parties. PRE allows a semi-trusted third party termed as a "proxy" to securely divert encrypted files of user A (delegator) to user B (delegatee) without revealing any information about the underlying files to the proxy. To eliminate the necessity of having a costly certificate verification process, Green and Ateniese introduced an identity-based PRE (IB-PRE). The potential applicability of IB-PRE sprung up a long line of intensive research from its first instantiation. Unfortunately, till today, there is no collusion-Resistant unidirectional IB-PRE secure in the standard model, which can withstand quantum attack. In this paper, we present the first concrete constructions of collusion-Resistant unidirectional IB-PRE, for both selective and adaptive identity, which are secure in standard model based on the hardness of learning with error problem.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…In [32,30], two matrices, of different order, A and X are constructed in public parameters. A is used for encryption and X is used for re-encryption.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Unfortunately, such technique causes different sizes for original ciphertext and re-encrypted ciphertext. Hence, property of proxy transparency is missing in [32,30,26].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Collusion-Resistant Identity-based Proxy Re-Encryption: Lattice-based Constructions in Standard Model

Dutta¹,

Susilo²,

Duong³

et al. 2020

Preprint

View full text Add to dashboard Cite

show abstract

Oblivious stable sorting protocol and oblivious binary search protocol for secure multi-party computation

Rao

Singh

Kumar

2021

JHS

View full text Add to dashboard Cite

Multi-party computation (MPC) sorting and searching protocols are frequently used in different databases with varied applications, as in cooperative intrusion detection systems, private computation of set intersection and oblivious RAM. Ivan Damgard et al. have proposed two techniques i.e., bit-decomposition protocol and bit-wise less than protocol for MPC. These two protocols are used as building blocks and have proposed two oblivious MPC protocols. The proposed protocols are based on data-dependent algorithms such as insertion sort and binary search. The proposed multi-party sorting protocol takes the shares of the elements as input and outputs the shares of the elements in sorted order. The proposed protocol exhibits O ( 1 ) constant round complexity and O ( n log n ) communication complexity. The proposed multi-party binary search protocol takes two inputs. One is the shares of the elements in sorted order and the other one is the shares of the element to be searched. If the position of the search element exists, the protocol returns the corresponding shares, otherwise it returns shares of zero. The proposed multi-party binary search protocol exhibits O ( 1 ) round complexity and O ( n log n ) communication complexity. The proposed multi-party sorting protocol works better than the existing quicksort protocol when the input is in almost sorted order. The proposed multi-party searching protocol gives almost the same results, when compared to the general binary search algorithm.

show abstract

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

Provably secure lattice based identity based unidirectional PRE and PRE+ schemes

Cited by 4 publications

References 4 publications

Collusion-Resistant Identity-based Proxy Re-Encryption: Lattice-based Constructions in Standard Model

Collusion-Resistant Identity-based Proxy Re-Encryption: Lattice-based Constructions in Standard Model

Oblivious stable sorting protocol and oblivious binary search protocol for secure multi-party computation

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

Contact Info

Product

Resources

About