2020
DOI: 10.1142/s0129054120500252
|View full text |Cite
|
Sign up to set email alerts
|

Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting

Abstract: Proxy Re-Encryption (PRE) is a cryptographic primitive that allows a proxy to turn an Alice’s ciphertext into a Bob’s ciphertext on the same plaintext. All of the PRE schemes are public key encryption and semantic security. Deterministic Public Key Encryption (D-PKE) provides an alternative to randomized public key encryption in various scenarios where the latter exhibits inherent drawbacks. In this paper, we construct the first multi-use unidirectional D-PRE scheme from Lattices in the auxiliary-input setting… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 31 publications
0
3
0
Order By: Relevance
“…In this section, we will use the above homomorphic encryption (HE) scheme to construct the HPRE-SAC scheme by using Trapdoor Sampling [ 27 , 48 ].…”
Section: The Hpre-sac Schemementioning
confidence: 99%
See 2 more Smart Citations
“…In this section, we will use the above homomorphic encryption (HE) scheme to construct the HPRE-SAC scheme by using Trapdoor Sampling [ 27 , 48 ].…”
Section: The Hpre-sac Schemementioning
confidence: 99%
“…In addition, although our HPRE-SAC scheme is single bit encryption, we can use homomorphic ciphertext packing technology [ 51 ] and trapdoor based multi bit proxy re-encryption scheme [ 27 ] to construct a multi bit homomorphic proxy re-encryption scheme against strong collusion attack.…”
Section: The Hpre-sac Schemementioning
confidence: 99%
See 1 more Smart Citation