Premium
Lattice‐based signcryption
Author(s) -
Li Fagen,
Bin Muhaya Fahad T.,
Khan Muhammad Khurram,
Takagi Tsuyoshi
Publication year - 2012
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.2826
Subject(s) - signcryption , random oracle , ciphertext , computer science , encryption , digital signature , lattice (music) , theoretical computer science , cryptographic primitive , cryptography , learning with errors , lattice based cryptography , public key cryptography , mathematics , algorithm , computer network , computer security , cryptographic protocol , physics , hash function , acoustics , quantum cryptography , quantum mechanics , quantum , quantum information
SUMMARY Signcryption is a cryptographic primitive that performs simultaneously both the functions of digital signature and public‐key encryption, at a cost significantly lower than that required by the traditional signature‐ then‐encryption approach. In this paper, we provide a positive answer to the question of if it is possible to construct signcryption based on lattice problems. More precisely, we design an efficient signcryption scheme that can send a message of length l one time. We prove that the proposed scheme has the indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption and strong unforgeability against adaptive chosen messages attacks under the inhomogeneous small integer solution assumption in the random oracle model. Copyright © 2012 John Wiley & Sons, Ltd.