Lattice-based linearly homomorphic signature scheme over binary field

DOI10.1007/s11432-012-4681-9zbMath1488.94090OpenAlexW2199537764WikidataQ122919946 ScholiaQ122919946MaRDI QIDQ5018301

Fenghe Wang, Yu Pu Hu, Baocang Wang

Publication date: 15 December 2021

Published in: Science China Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-012-4681-9

zbMATH Keywords

post-quantum linearly homomorphic signature schemepre-image sampling function

Mathematics Subject Classification ID

Cryptography (94A60) Sampling theory in information and communication theory (94A20)

Related Items (5)

Gaussian sampling of lattices for cryptographic applications ⋮ Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key ⋮ Identity-based key-exposure resilient cloud storage public auditing scheme from lattices ⋮ Linearly homomorphic signatures with designated combiner ⋮ An efficient homomorphic aggregate signature scheme based on lattice

Cites Work

• Unnamed Item
• Homomorphic Signatures for Polynomial Functions
• A Group Signature Scheme from Lattice Assumptions
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
• Trapdoors for hard lattices and new cryptographic constructions
• Secure Network Coding over the Integers
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Generating Shorter Bases for Hard Random Lattices
• Asymptotically Efficient Lattice-Based Digital Signatures
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

This page was built for publication: Lattice-based linearly homomorphic signature scheme over binary field