A lattice-based pseudorandom function with key and partial-input homomorphism and variable input length is introduced, and it is used to propose a claimed unidirectional updatable encryption scheme.
Fast Cryptographic Primitives and Circular-Secure En- cryption Based on Hard Learning Problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
A lattice-based pseudorandom function with key and partial-input homomorphism and variable input length is introduced, and it is used to propose a claimed unidirectional updatable encryption scheme.