Abstract
Signcryption has been extensively studied based on bilinear pairings, but rarely on lattices. This paper constructed a new lattice-based signcryption scheme in the random oracle model by skillfully combining a learning with errors over ring (R-LWE) based signature scheme (using the Fiat-Shamir with aborts technique) and a R-LWE based key exchange scheme, and then given a tight security reduction of strong unforgeability against adaptive chosen messages attacks (SUF-CMA) and indistinguishability against adaptive chosen ciphertext attacks (IND-CCA2) from the R-LWE problem to proposed scheme. This construction removed trapdoor by using the Fiat-Shamir with aborts technique, thus has a high efficiency. It needn’t decrypt random coins for unsigncryption which may be used to construct multi-receiver signcryption.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Zheng, Y.: Digital signcryption or how to achieve cost (signature & encryption) ≪ cost (signature) + cost(encryption). In: Kaliski, B.S. (ed.) Advances in Cryptology — CRYPTO 1997. LNCS, vol. 1294, pp. 165–179. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0052234
Zheng, Y., Imai, H.: How to construct efficient signcryption schemes on elliptic curves. Inf. Process. Lett. 68(5), 227–233 (1998)
Steinfeld, R., Zheng, Y.: A signcryption scheme based on integer factorization. In: Goos, G., Hartmanis, J., van Leeuwen, J., Pieprzyk, J., Seberry, J., Okamoto, E. (eds.) ISW 2000. LNCS, vol. 1975, pp. 308–322. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44456-4_23
Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein D.J., Buchmann J., Dahmen E. (eds.) Post-Quantum Cryptography, pp. 147–191. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-88702-7_5
Wang, F., Hu, Y., Wang, C.: Post-quantum secure hybrid signcryption from lattice assumption. Appl. Math. Inf. Sci. 6(1), 23–28 (2012)
Li, F., Bin Muhaya, F.T., Khan, M.K., et al.: Lattice-based signcryption. Concur. Comput.: Pract. Exp. 25(14), 2112–2122 (2013)
Yan, J., Wang, L., Wang, L., et al.: Efficient lattice-based signcryption in standard model. Math. Probl. Eng. 2013, 18 (2013)
Lu, X., Wen, Q., Jin, Z.: A lattice-based signcryption scheme without random oracles. Front. Comput. Sci. 8(4), 667–675 (2014)
Bellare, M., Boldyreva, A., Staddon, J.: Randomness re-use in multi-recipient encryption schemeas. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 85–99. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36288-6_7
Lu, X., Wen, Q., Wang, L.: A lattice-based signcryption scheme without trapdoors. J. Electron. Inf. 38(9), 2287–2293 (2016)
Akleylek, S., Bindel, N., Buchmann, J., Krämer, J., Marson, G.A.: An efficient lattice-based signature scheme with provably secure instantiation. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 44–60. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-31517-1_3
Gérard, F., Merckx, K.: SETLA: signature and encryption from lattices. In: Camenisch, J., Papadimitratos, P. (eds.) CANS 2018. LNCS, vol. 11124, pp. 299–320. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00434-7_15
Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738–755. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29011-4_43
Tian, M., Huang, L.: Identity-based signatures from lattices: simpler, faster, shorter. Fundamenta Informaticae 145(2), 171–187 (2016)
Wang, X., Zhang, Y., Gupta, B.B., et al.: An identity-based signcryption on lattice without trapdoor. J. UCS 25(3), 282–293 (2019)
Alkim, E., Ducas, L., Pöppelmann, T., et al.: Post-quantum key exchange—a new hope. In: 25th {USENIX} Security Symposium ({USENIX} Security 16), pp. 327–343 (2016)
Güneysu, T., Lyubashevsky, V., Pöppelmann, T.: Practical lattice-based cryptography: a signature scheme for embedded systems. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 530–547. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33027-8_31
Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595–618. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03356-8_35
An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 83–107. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-46035-7_6
Acknowledgement
This work was supported by National Natural Science Foundation of China (Grant Nos. 61572521, U1636114, 61772550), National Key R&D Program of China (Grant No. 2017YFB0802000), National Cryptography Development Fund of China (Grant No. MMJJ20170112), State Key Laboratory of Information Security (2017-MS-18).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Liu, Z., Han, YL., Yang, XY. (2019). A Signcryption Scheme Based Learning with Errors over Rings Without Trapdoor. In: Sun, X., He, K., Chen, X. (eds) Theoretical Computer Science. NCTCS 2019. Communications in Computer and Information Science, vol 1069. Springer, Singapore. https://doi.org/10.1007/978-981-15-0105-0_11
Download citation
DOI: https://doi.org/10.1007/978-981-15-0105-0_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-0104-3
Online ISBN: 978-981-15-0105-0
eBook Packages: Computer ScienceComputer Science (R0)
