A Lattice-based Signcryption Scheme Without Trapdoors

The existing lattice-based signcryption schemes are based on trapdoor generation algorithm and preimage sample algorithm. However, both algorithms are complex, require a lot of time to run, and affect the efficiency of latticed-based signcryption schemes deeply. To solve this problem, the first lattice-based signcryption scheme without trapdoor generation algorithm and preimage sample algorithm is proposed, with the help of the technique of lattice signatures without trapdoors and the associated signature compression technique, as well as the encryption method based on the learning with errors assumption. The scheme achieves indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption. It also achieves existential unforgeability against adaptive chosen message attacks under the small integer solution assumption. The proposed scheme is not only quantum resistant, but also efficient.

[1]  Qiaoyan Wen,et al.  A lattice-based signcryption scheme without random oracles , 2014, Frontiers of Computer Science.

[2]  Vadim Lyubashevsky,et al.  Lattice Signatures Without Trapdoors , 2012, IACR Cryptol. ePrint Arch..

[3]  Yuliang Zheng,et al.  Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.

[4]  Yang Lu,et al.  Efficient Certificate-Based Signcryption Secure against Public Key Replacement Attacks and Insider Attacks , 2014, TheScientificWorldJournal.

[5]  Tatsuaki Okamoto,et al.  Secure Integration of Asymmetric and Symmetric Encryption Schemes , 1999, Journal of Cryptology.

[6]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[7]  Fagen Li,et al.  Secure identity-based signcryption in the standard model , 2013, Math. Comput. Model..

[8]  Wenbo Mao,et al.  Two Birds One Stone: Signcryption Using RSA , 2003, CT-RSA.

[9]  Wenbin Yao,et al.  Efficient Lattice-Based Signcryption in Standard Model , 2013 .

[11]  Mihir Bellare,et al.  Multi-signatures in the plain public-Key model and a general forking lemma , 2006, CCS '06.

[12]  Shi Bai,et al.  An Improved Compression Technique for Signatures Based on Learning with Errors , 2014, CT-RSA.

[13]  Fahad Bin Muhaya,et al.  Lattice‐based signcryption , 2013, Concurr. Comput. Pract. Exp..

[14]  Yupu Hu,et al.  Post-Quantum Secure Hybrid Signcryption from Lattice Assumption , 2012 .