Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption

DOI10.1007/978-3-030-31578-8_1zbMath1444.94099arXiv1908.09032OpenAlexW2980100464MaRDI QIDQ3297610

Vipin Singh Sehrawat, Yvo G. Desmedt

Publication date: 20 July 2020

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.09032

zbMATH Keywords

LWEpost-compromise securitylattice-basedupdatable encryptionbi-homomorphic PRFsunidirectional updates

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Unidirectional updatable encryption and proxy re-encryption from DDH ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ A secure cross-chain transaction model based on quantum multi-signature

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Updatable encryption with post-compromise security
• Key rotation for authenticated encryption
• On the Hardness of Learning with Rounding over Small Modulus
• A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems
• Learning with Rounding, Revisited
• Key Homomorphic PRFs and Their Applications
• Constrained Pseudorandom Functions and Their Applications
• New and Improved Key-Homomorphic Pseudorandom Functions
• Subspace LWE
• Pseudorandom Functions and Lattices
• How to share a secret
• Functional Encryption for Inner Product Predicates from Learning with Errors
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Public-key cryptosystems from the worst-case shortest vector problem
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
• Key-Homomorphic Constrained Pseudorandom Functions
• Functional Signatures and Pseudorandom Functions
• Reusable garbled circuits and succinct functional encryption
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption