A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
From MaRDI portal
Publication:2004727
DOI10.1016/J.INS.2018.12.025zbMath1443.94072OpenAlexW2905504827WikidataQ123308232 ScholiaQ123308232MaRDI QIDQ2004727
Fucai Luo, Fuqun Wang, Ke-Fei Chen, Kun-Peng Wang
Publication date: 7 October 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.12.025
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lattice-based linearly homomorphic signatures in the standard model
- Identity-based chameleon hashing and signatures without key exposure
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Leveled strongly-unforgeable identity-based fully homomorphic signatures
- Faster Bootstrapping with Polynomial Error
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Computing on Authenticated Data
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Multi-key Homomorphic Authenticators
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Lattice-based FHE as secure as PKE
- Homomorphic Signatures for Polynomial Functions
- Homomorphic Signature Schemes
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Efficient Lattice (H)IBE in the Standard Model
- Security of Sanitizable Signatures Revisited
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Proofs of Storage from Homomorphic Identification Protocols
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- Fully homomorphic encryption using ideal lattices
- On Homomorphic Signatures for Network Coding
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Attribute-based encryption for circuits
This page was built for publication: A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
