Lattice-based linearly homomorphic signature scheme over binary field
From MaRDI portal
Publication:5018301
Recommendations
- An efficient homomorphic aggregate signature scheme based on lattice
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Lattice-based linearly homomorphic signatures in the standard model
- Post-quantum cryptography: lattice signatures
- scientific article; zbMATH DE number 7259165
Cites work
- scientific article; zbMATH DE number 2079932 (Why is no real title available?)
- A Group Signature Scheme from Lattice Assumptions
- Asymptotically Efficient Lattice-Based Digital Signatures
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Generating shorter bases for hard random lattices
- Homomorphic signatures for polynomial functions
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Secure network coding over the integers
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(7)- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Gaussian sampling of lattices for cryptographic applications
- scientific article; zbMATH DE number 6672421 (Why is no real title available?)
- Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key
- Linearly homomorphic signatures with designated combiner
- Identity-based key-exposure resilient cloud storage public auditing scheme from lattices
- An efficient homomorphic aggregate signature scheme based on lattice
This page was built for publication: Lattice-based linearly homomorphic signature scheme over binary field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5018301)