Abstract
Verifiably encrypted signature schemes can convince a verifier that a given ciphertext is an encryption of an ordinary signature on a given message and the ordinary signature can be recovered by the third party, called adjudicator. In 2010, Rückert et al. proposed a general construction for the verifiably encrypted signatures, and then, they also showed that there exist the lattice-based verifiably encrypted signature schemes. Their constructions are very insightful, but their schemes need an extra adjudication setup phase and Merkle trees, so they have large parameters and keys, that is, they are inefficient. Also, their schemes provide only the limited signature capacity because the signing keys should be reissued after generating \(k\)th verifiably encrypted signatures. To overcome the weaknesses of Rückert et al.’s scheme, we construct a verifiably encrypted signature scheme based on the hard lattice problems. Our scheme provides the full functionality, i.e., the signatures can be generated without any limitations and does not need any extra adjudication setup phases. Moreover, the size of the secret keys in our scheme is constant. Our scheme provides unforgeability, opacity, extractability, and abuse-freeness in the random oracle model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agrawal, S., Boneh, D., Boyen, X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Advanced in Cryptology—CRYPTO 2010 LNCS, vol. 6223, pp. 98–115 (2010)
Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: EUROCRYPT’10, vol. 6110 of LNCS, pp. 553–572 (2010)
Ajtai, M.: Generating hard instance of lattice problems. In: STOC, pp. 99–108 (1996)
Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. STACS 09001, 75–86 (2009)
Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures (Extended Abstract). EUROCRYPT’ 98. LNCS, vol. 1403, pp. 591–606. Springer, Heidelberg (1998)
Bao, F., Deng, R.H., Mao, W.: Efficient and practical fair exchange protocols with off-line TTP. In: IEEE Symposium on Security and Privacy, pp. 77–85. IEEE Computer Society (1998)
Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: EUROCRYPT 2003, LNCS 2656, pp. 416–432 (2003)
Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Proceedings of the Eurocrypt 2010 (2010)
Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Advances in Cryptology—Crypto ’86, volume 263 of LNCS, pp. 186–194 (1987)
Gordon, S.D., Katz, J., Vaikuntanathan, V.: A group signature scheme from lattice assumptions. In: ASIACRYPT’ 10, pp. 395–412 (2010)
Gentry, C., Peikert, C.V.: Vaikuntanathan trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197–206 (2008)
Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential aggregate signatures and multisignatures without random oracles. Adv. Eurocrypt 2006, 465–485 (2006)
Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective, vol. 671. Kluwer Academic Publishers, Boston (2002)
Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. (SICOMP) 37(1), 267–302 (2007)
Micciancio, D., Vadhan, S.P.: Statistical zero-knowledge proofs with efficient provers: lattice problems and more. In: Advances in Cryptology—Crypto 2003, volume 2729 of LNCS, pp. 282–298 (2003)
Nishimaki, R., Xagawa, K.: Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES, Public-Key Cryptography—PKC 2013, Lecture Notes in Computer Science, volume 7778, pp. 405–422 (2013)
Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: STOC’09, pp. 333–342 (2009)
Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Journal of the ACM 56, Article 34 (2009)
Rückert, M., Schröder, D.: Security of verifiably encrypted signatures and a construction without random oracles. In: Shacham, H., Waters, B. (eds.) Proceedings of Pairing 2009, volume 5671 of LNCS, pp. 17–34. Springer-Verlag (2009)
Rückert, M., Schneider, M., Schröder, D.: Generic constructions for verifiably encrypted signatures without random oracles or nizks. In: ACNS, pp. 69–86 (2010)
Rückert, M.: Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles. In: PQCrypto’10, vol. 6061 of LNCS, pp. 182–200 (2010)
Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)
Zhang, F., Safavi-Naini, R., Susilo, W.: Eficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings, Progress in Indocrypt 2003, pp. 191–204 (2003)
Acknowledgments
This research was partly supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (NRF-2013R1A2A2A01068200), the IT R&D program of MOTIE/KEIT [KI002113, Development of Security Technology for Car-Healthcare], and the MKE (The Ministry of Knowledge Economy), Korea, under the ITRC (Information Technology Research Center) support program (NIPA-2013-H0301-13-3007) supervised by the NIPA (National IT Industry Promotion Agency).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kim, K.S., Jeong, I.R. Efficient verifiably encrypted signatures from lattices. Int. J. Inf. Secur. 13, 305–314 (2014). https://doi.org/10.1007/s10207-014-0226-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10207-014-0226-0