Lattice-based linearly homomorphic signatures in the standard model

At present, there are some linearly homomorphic signatures in the standard model, whose security is based on the RSA assumption and Diffie–Hellman assumption. But there are still no lattice-based linearly homomorphic signature in the standard model. How to construct it? It is proposed as a open prob...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 634; pp. 47 - 54
Main Authors Chen, Wenbin, Lei, Hao, Qi, Ke
Format Journal Article
LanguageEnglish
Published Elsevier B.V 27.06.2016
Subjects
Computer information security
Computer simulation
Construction
Lattice
Linearly homomorphic signature
Mathematical models
Signatures
Linearly homomorphic signature
Lattice
Online AccessGet full text

Cover

More Information
Summary:At present, there are some linearly homomorphic signatures in the standard model, whose security is based on the RSA assumption and Diffie–Hellman assumption. But there are still no lattice-based linearly homomorphic signature in the standard model. How to construct it? It is proposed as a open problem by Freeman [12]. In this paper, we propose the first lattice-based linearly homomorphic signature in the standard model, which settle this open problem.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2016.04.009