Name
Abstract | ||
|---|---|---|
AbstractAs a novel cryptographic primitive, signcryption realizes the function of digital signature and public-key encryption simultaneously, at a cost significantly lower than that of the traditional sign-then-encrypt approach. To the best of the authors' knowledge, there is little works focusing on attribute-based signcryption ABSC, especially in the setting of lattice-based cryptography. In this paper, we show that it is possible to construct hidden ABSC schemes based on lattice problems by presenting an ABSC scheme. In the random oracle model, the proposed scheme is proved to be indistinguishable against adaptively chosen ciphertext attacks under the learning with errors assumption and existentially unforgeable against adaptively chosen message attacks under the short integer solution assumption, respectively. Copyright © 2013 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1002/sec.875 | Periodicals |
Keywords | Field | DocType |
signcryption,lattice-based cryptography,LWE,short integer solution problem | Computer security,Computer science,Random oracle,Theoretical computer science,Signcryption,Encryption,Cryptographic primitive,Digital signature,Lattice-based cryptography,Ciphertext,Learning with errors | Journal |
Volume | Issue | ISSN |
7 | 11 | 1939-0114 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinyin Xiang | 1 | 1 | 0.69 |
| Hui Li | 2 | 814 | 92.33 |
| Mingyu Wang | 3 | 135 | 24.90 |
| Zhenhua Liu | 4 | 498 | 45.19 |