Pages that link to "Item:Q3084337"
From MaRDI portal
The following pages link to Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures (Q3084337):
Displaying 44 items.
- Lattice-based linearly homomorphic signatures in the standard model (Q284579) (← links)
- A new definition of homomorphic signature for identity management in mobile cloud computing (Q389372) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- Linearly homomorphic structure-preserving signatures and their applications (Q887427) (← links)
- Lattice-based certificateless encryption scheme (Q1633051) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions (Q1671634) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- An efficient homomorphic aggregate signature scheme based on lattice (Q1718616) (← links)
- A linearly homomorphic signature scheme from weaker assumptions (Q1744864) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- Identity-based quotable ring signature (Q1750014) (← links)
- Efficient digital signatures from RSA without random oracles (Q1999174) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- Progressive and efficient verification for digital signatures (Q2096619) (← links)
- Identity-based key-exposure resilient cloud storage public auditing scheme from lattices (Q2200702) (← links)
- A compiler for multi-key homomorphic signatures for Turing machines (Q2232614) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Computing on authenticated data (Q2344052) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Linearly homomorphic signatures with designated combiner (Q2697930) (← links)
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures (Q2794502) (← links)
- Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications (Q2849402) (← links)
- Secure multi-source network coding scheme with lattice signature (Q2993817) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Trapdoors for Ideal Lattices with Applications (Q3454588) (← links)
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys (Q3457069) (← links)
- Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures (Q4916021) (← links)
- Lattice-based linearly homomorphic signature scheme over binary field (Q5018301) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Linearly Homomorphic Signatures with Designated Entities (Q5056030) (← links)
- Collusion Resistant Traitor Tracing from Learning with Errors (Q5130846) (← links)
- Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability (Q5739031) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Tracing a linear subspace: application to linearly-homomorphic group signatures (Q6070765) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case (Q6163662) (← links)
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians (Q6595915) (← links)
- Efficient updatable public-key encryption from lattices (Q6604934) (← links)
- Towards tightly secure short linearly homomorphic signatures (Q6613999) (← links)
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions (Q6635746) (← links)
- Efficient universally-verifiable electronic voting with everlasting privacy (Q6660396) (← links)
