Lattice-Based Proxy Signature

Those existing proxy signature schemes are mainly based on the assumed hardness of Big Integer Factoring problem and Discrete Logarithm problem. So they can't resist quantum attacks. This proxy signature scheme is based on the assumed hardness of some lattice problem, which can resist quantum a...

Full description

Saved in:
Bibliographic Details
Published in2010 International Conference on Computational Intelligence and Security pp. 382 - 385
Main Authors Yali Jiang, Fanyu Kong, Xiuling Ju
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
Approximation methods
Cryptography
lattice
lattice basis delegation
Lattices
preimage sampling trapdoor function
proxy signature
Resistance
Resists
Vectors
Online AccessGet full text
ISBN9781424491148
1424491142
DOI10.1109/CIS.2010.88

Cover

More Information
Summary:Those existing proxy signature schemes are mainly based on the assumed hardness of Big Integer Factoring problem and Discrete Logarithm problem. So they can't resist quantum attacks. This proxy signature scheme is based on the assumed hardness of some lattice problem, which can resist quantum attack. The key pair of proxy signer was generated using basis delegation technology. Combined with GPV basic signature scheme, the proxy signature scheme was constructed. This scheme is satisfied with all the security property of proxy signature schemes. Based on this scheme, variant lattice-based proxy signature schemes will be designed, such as blind proxy signature, multi-grade proxy signature, and identity-based proxy signature etc.
ISBN:9781424491148
1424491142
DOI:10.1109/CIS.2010.88