An efficient homomorphic aggregate signature scheme based on lattice

DOI10.1155/2014/536527zbMath1407.94172OpenAlexW2003115354WikidataQ59068323 ScholiaQ59068323MaRDI QIDQ1718616

Zhengjun Jing

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/536527

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

A quantum aggregate signature scheme based on quantum teleportation using four-qubit cluster state ⋮ Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key

Cites Work

• Unnamed Item
• Unnamed Item
• Computing on Authenticated Data
• Improved Security for Linearly Homomorphic Signatures: A Generic Framework
• Homomorphic Signatures for Polynomial Functions
• 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
• Preventing Pollution Attacks in Multi-source Network Coding
• Bonsai Trees, or How to Delegate a Lattice Basis
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Computing on Authenticated Data: New Privacy Definitions and Constructions
• Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
• Lattice-based linearly homomorphic signature scheme over binary field
• 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: An efficient homomorphic aggregate signature scheme based on lattice