An efficient homomorphic aggregate signature scheme based on lattice
type: Item
instance of: scholarly article
title: An efficient homomorphic aggregate signature scheme based on lattice
zbMATH Open document ID: 1407.94172
DOI: 10.1155/2014/536527
author: Zhengjun Jing
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: Homomorphic aggregate signature (HAS) is a linearly homomorphic signature (LHS) for multiple users, which can be applied for a variety of purposes, such as multi-source network coding and sensor data aggregation. In order to design an efficient postquantum secure HAS scheme, we borrow the idea of the lattice-based LHS scheme over binary field in the single-user case, and develop it into a new lattice-based HAS scheme in this paper. The security of the proposed scheme is proved by showing a reduction to the single-user case and the signature length remains invariant. Compared with the existing lattice-based homomorphic aggregate signature scheme, our new scheme enjoys shorter signature length and high efficiency.
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7016684
Wikidata QID: Q59068323
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/536527
OpenAlex ID: W2003115354
cites work: Q4472078
cites work: Signing a Linear Subspace: Signature Schemes for Network Coding
cites work: Secure Network Coding over the Integers
cites work: Improved Security for Linearly Homomorphic Signatures: A Generic Framework
cites work: Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
cites work: Homomorphic Signatures for Polynomial Functions
cites work: Lattice-based linearly homomorphic signature scheme over binary field
cites work: Computing on Authenticated Data
cites work: Computing on Authenticated Data: New Privacy Definitions and Constructions
cites work: Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
cites work: Q3499280
cites work: Preventing Pollution Attacks in Multi-source Network Coding
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Generating Shorter Bases for Hard Random Lattices
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Asymptotically Efficient Lattice-Based Digital Signatures
description: scientific article; zbMATH DE number 7016684