Abstract
Dual projective hashing is an extension of Cramer-Shoup projective hashing, which implies lossy trapdoor functions (LTDFs) and deterministic PKE schemes secure with respect to hard-to-invert auxiliary input. In this paper, we introduce the notion of updatable all-but-one dual projective hashing (UDPH) based on the all-but-one variant of dual projective hashing, which allows us to investigate the continuous leakage of invisible key update in the same context. In particular,
-
we give a general construction of leakage-resilient all-but-one LTDFs via UDPH, which yields high efficiency compared with existed direct leakage-resilient all-but-one LTDFs constructions based on MDDH and SXDH. Concretely, our generic framework can be instantiated with k-LIN, DCR, QR and LWE assumptions in the standard model.
-
we present a modular framework for leakage-resilient deterministic PKEs with hard-to-invert auxiliary input, which is proven secure under the introduced continuous-leakage-resilient strong privacy indistinguishability-based security model of invisible key update. Compared with the known MDDH/SXDH-based schemes, our constructions can be instantiated with more widely-accepted assumptions including k-LIN, DCR, QR and LWE.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Wee, H.: Dual projective hashing and its applications — lossy trapdoor functions and more. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 246–262. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29011-4_16
Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45–64. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-46035-7_4
Zhang, Z., Chen, Yu., Chow, S.S.M., Hanaoka, G., Cao, Z., Zhao, Y.: All-but-one dual projective hashing and its applications. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 181–198. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07536-5_12
Ma, S., Huang, Q.: A new framework of IND-CCA secure public key encryption with keyword search. Comput. J. 63(12), 1849–1858 (2020)
Li, Z., Yang, Z., Szalachowski, P., Zhou, J.: Building low-interactivity multifactor authenticated key exchange for industrial internet of things. IEEE Internet Things J. 8(2), 844–859 (2020)
Yang, R., Xu, Q., Zhou, Y., Zhang, R., Hu, C., Yu, Z.: Updatable hash proof system and its applications. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9326, pp. 266–285. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24174-6_14
Bellare, M., Boldyreva, A., O’Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 535–552. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74143-5_30
Brakerski, Z., Kalai, Y.T., Katz, J., Vaikuntanathan, V.: Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 501–510. IEEE (2010)
Dodis, Y., Haralambiev, K., López-Alt, A., Wichs, D.: Cryptography against continuous memory attacks. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 511–520. IEEE (2010)
Agrawal, S., Dodis, Y., Vaikuntanathan, V., Wichs, D.: On continual leakage of discrete log representations. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 401–420. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-42045-0_21
Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 474–495. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00457-5_28
Koppula, V., Pandey, O., Rouselakis, Y., Waters, B.: Deterministic public-key encryption under continual leakage. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 304–323. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39555-5_17
Huang, M., Yang, B., Zhang, M., Zhang, L., Hou, H.: Updatable lossy trapdoor functions under consecutive leakage. Comput. J. (4), 4 (2019)
Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. SIAM J. Comput. 40(6), 1803–1844 (2011)
Mironov, I., Pandey, O., Reingold, O., Segev, G.: Incremental deterministic public-key encryption. J. Cryptol. 31(1), 134–161 (2018)
Huang, M., Yang, B., Zhao, Y., Wang, X., Zhou, Y., Xia, Z.: A generic construction of CCA-secure deterministic encryption. Inf. Process. Lett. 154, 105865 (2020)
Li, S., Mu, Y., Zhang, M., Zhang, F.: Updatable lossy trapdoor functions and its application in continuous leakage. In: Chen, L., Han, J. (eds.) ProvSec 2016. LNCS, vol. 10005, pp. 309–319. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-47422-9_18
Zhao, Y., Yong, Yu., Yang, B.: Leakage resilient CCA security in stronger model: Branch hidden abo-LTFS and their applications. Comput. J. 62(4), 631–640 (2019)
Brakerski, Z., Segev, G.: Better security for deterministic public-key encryption: the auxiliary-input setting. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 543–560. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22792-9_31
Paterson, K.G., Schuldt, J.C.N., Sibborn, D.L., Wee, H.: Security against related randomness attacks via reconstructive extractors. In: Groth, J. (ed.) IMACC 2015. LNCS, vol. 9496, pp. 23–40. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-27239-9_2
Acknowledgments
We would like to thank Rupeng Yang for invaluable feedback and anonymous reviewers for insightful comments. This work was partially supported by National Natural Science Foundation of China (61802248, U1936213, 62002120), the “Chenguang Program” supported by Shanghai Municipal Education Commission (No.18CG62), NSFC-ISF Joint Scientific Research Program (61961146004) and Innovation Program of Shanghai Municipal Education Commission (2021-01-07-00-08-E00101).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, K., Jiang, Z., Gong, J., Qian, H. (2021). Updatable All-But-One Dual Projective Hashing and Its Applications. In: Gao, D., Li, Q., Guan, X., Liao, X. (eds) Information and Communications Security. ICICS 2021. Lecture Notes in Computer Science(), vol 12919. Springer, Cham. https://doi.org/10.1007/978-3-030-88052-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-88052-1_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-88051-4
Online ISBN: 978-3-030-88052-1
eBook Packages: Computer ScienceComputer Science (R0)