Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
From MaRDI portal
Publication:3084337
Recommendations
Cited in
(49)- Lattice-based certificateless encryption scheme
- Efficient completely context-hiding quotable and linearly homomorphic signatures
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
- A compiler for multi-key homomorphic signatures for Turing machines
- On the integer polynomial learning with errors problem
- Linearly homomorphic signatures with designated combiner
- Trapdoors for ideal lattices with applications
- Identity-based key-exposure resilient cloud storage public auditing scheme from lattices
- Collusion resistant traitor tracing from learning with errors
- Linearly homomorphic structure-preserving signatures and their applications
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Homomorphic signatures for polynomial functions
- Lattice-based linearly homomorphic signatures in the standard model
- The geometry of lattice cryptography
- Hardness of \(k\)-LWE and applications in traitor tracing
- Improved security for linearly homomorphic signatures: a generic framework
- Linearly-homomorphic signatures and scalable mix-nets
- Efficient updatable public-key encryption from lattices
- Computing on authenticated data
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
- Towards tightly secure short linearly homomorphic signatures
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Structure-preserving linearly homomorphic signature with designated combiner for subspace
- Progressive and efficient verification for digital signatures
- An efficient homomorphic aggregate signature scheme based on lattice
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- A new definition of homomorphic signature for identity management in mobile cloud computing
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Linearly Homomorphic Signatures with Designated Entities
- A linearly homomorphic signature scheme from weaker assumptions
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Lattice-based linearly homomorphic signature scheme over binary field
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians
- Verifiable pattern matching on outsourced texts
- Secure multi-source network coding scheme with lattice signature
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Practical homomorphic message authenticators for arithmetic circuits
- Algebraic (trapdoor) one-way functions: constructions and applications
- Multi-theorem preprocessing NIZKs from lattices
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction
- Identity-based quotable ring signature
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Worst-case to average-case reductions for module lattices
- Linearly homomorphic authenticated encryption with provable correctness and public verifiability
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Efficient digital signatures from RSA without random oracles
- Tracing a linear subspace: application to linearly-homomorphic group signatures
- Efficient universally-verifiable electronic voting with everlasting privacy
This page was built for publication: Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084337)
