[Keyword: Lattices] AND [All Categories: Computer Architecture] : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
[Keyword: Homology] AND [All Categories: Pure Mathematics] (20)	27 Mar 2025	Run
[Keyword: Lattices] AND [All Categories: Computer Architecture] (1)	27 Mar 2025	Run
[Keyword: Makespan] AND [All Categories: Pure Mathematics] (3)	27 Mar 2025	Run
[Keyword: Cracking] AND [All Categories: International Relations] (1)	27 Mar 2025	Run
[Keyword: Glycerol] AND [All Categories: Electrical & Electronic Engineering] (1)	27 Mar 2025	Run

articleNo Access
Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting
- Juyan Li,
- Chunguang Ma, and
- Zhen Gu
International Journal of Foundations of Computer Science01 Aug 2020
Preview 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. We also prove that it is PRIV1-INDr secure in the standard model based on the LWR. Finally, an identity-based D-PRE is obtained from the basic construction.

1