Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
From MaRDI portal
Publication:3084337
DOI10.1007/978-3-642-19379-8_1zbMath1291.94181OpenAlexW2101444129MaRDI QIDQ3084337
Publication date: 15 March 2011
Published in: Public Key Cryptography – PKC 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19379-8_1
Related Items
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Lattice-based linearly homomorphic signatures in the standard model ⋮ Lattice-based certificateless encryption scheme ⋮ Linearly Homomorphic Signatures with Designated Entities ⋮ Trapdoors for Ideal Lattices with Applications ⋮ Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ A new definition of homomorphic signature for identity management in mobile cloud computing ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Structure-preserving linearly homomorphic signature with designated combiner for subspace ⋮ Another round of breaking and making quantum money: how to not build it from lattices, and more ⋮ CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case ⋮ Identity-based key-exposure resilient cloud storage public auditing scheme from lattices ⋮ Linearly homomorphic signatures with designated combiner ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ An efficient homomorphic aggregate signature scheme based on lattice ⋮ Secure multi-source network coding scheme with lattice signature ⋮ A compiler for multi-key homomorphic signatures for Turing machines ⋮ Algebraic (trapdoor) one-way functions: constructions and applications ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Identity-based quotable ring signature ⋮ Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures ⋮ Efficient digital signatures from RSA without random oracles ⋮ Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability ⋮ Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ The Geometry of Lattice Cryptography ⋮ On the integer polynomial learning with errors problem ⋮ Verifiable Pattern Matching on Outsourced Texts ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Progressive and efficient verification for digital signatures ⋮ Computing on authenticated data ⋮ Worst-case to average-case reductions for module lattices ⋮ Lattice-based linearly homomorphic signature scheme over binary field
This page was built for publication: Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
