Lattice-based linearly homomorphic signatures in the standard model

DOI10.1016/j.tcs.2016.04.009zbMath1403.94048OpenAlexW2328751355WikidataQ122603069 ScholiaQ122603069MaRDI QIDQ284579

Hao Lei, Wenbin Chen, Ke Qi

Publication date: 18 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.009

zbMATH Keywords

latticelinearly homomorphic signature

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Linearly Homomorphic Signatures with Designated Entities ⋮ Positive influence maximization in signed social networks under independent cascade model ⋮ A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes ⋮ Secure multi-label data classification in cloud by additionally homomorphic encryption ⋮ Identity-based key-exposure resilient cloud storage public auditing scheme from lattices ⋮ A new threshold changeable secret sharing scheme based on the Chinese remainder theorem ⋮ Linearly homomorphic signatures with designated combiner ⋮ Practical public key encryption with selective opening security for receivers ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ A strong designated verifier proxy re-signature scheme for IoT environments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Public key cryptography -- PKC 2012. 15th international conference on practice and theory in public key cryptography, Darmstadt, Germany, May 21--23, 2012. Proceedings
• Efficient Network Coding Signatures in the Standard Model
• Improved Security for Linearly Homomorphic Signatures: A Generic Framework
• Homomorphic Signatures for Polynomial Functions
• Adaptive Pseudo-free Groups and Applications
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
• Homomorphic Network Coding Signatures in the Standard Model
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• Trapdoors for hard lattices and new cryptographic constructions
• Secure Network Coding over the Integers
• Bonsai Trees, or How to Delegate a Lattice Basis
• Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Generating Shorter Bases for Hard Random Lattices