Multi-use deterministic public key proxy re-encryption from lattices in the auxiliary-input setting
From MaRDI portal
Publication:5859633
Recommendations
Cites work
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- A homomorphic proxy re-encryption from lattices
- A simple BGN-type cryptosystem from LWE
- Advances in Cryptology - EUROCRYPT 2004
- Better security for deterministic public-key encryption: the auxiliary-input setting
- Deterministic and Efficiently Searchable Encryption
- Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
- Efficient lattice (H)IBE in the standard model
- Generating shorter bases for hard random lattices
- Identity-Based Proxy Re-encryption
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Key-Private Proxy Re-encryption
- Key-private proxy re-encryption under LWE
- Lattice-based identity-based homomorphic conditional proxy re-encryption for secure big data computing in cloud environment
- Multi-use unidirectional identity-based proxy re-encryption from hierarchical identity-based encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Probabilistic encryption
- Proxy re-encryption from lattices
- Pseudorandom functions and lattices
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(4)
This page was built for publication: Multi-use deterministic public key proxy re-encryption from lattices in the auxiliary-input setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859633)