{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T23:17:07Z","timestamp":1773011827013,"version":"3.50.1"},"reference-count":31,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T00:00:00Z","timestamp":1641254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006143","name":"Department of Science and Technology","doi-asserted-by":"publisher","award":["none"],"award-info":[{"award-number":["none"]}],"id":[{"id":"10.13039\/501100006143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>In recent years, several new notions of security have begun receiving consideration for public-key cryptosystems, beyond the standard of security against adaptive chosen ciphertext attack (CCA2). Among these are security against randomness reset attacks, in which the randomness used in encryption is forcibly set to some previous value, and against constant secret-key leakage attacks, wherein the constant factor of a secret key\u2019s bits is leaked. In terms of formal security definitions, cast as attack games between a challenger and an adversary, a joint combination of these attacks means that the adversary has access to additional encryption queries under a randomness of his own choosing along with secret-key leakage queries. This implies that both the encryption and decryption processes of a cryptosystem are being tampered under this security notion. In this paper, we attempt to address this problem of a joint combination of randomness and secret-key leakage attacks through two cryptosystems that incorporate hash proof system and randomness extractor primitives. The first cryptosystem relies on the random oracle model and is secure against a class of adversaries, called non-reversing adversaries. We remove the random oracle oracle assumption and the non-reversing adversary requirement in our second cryptosystem, which is a standard model that relies on a proposed primitive called LM lossy functions. These functions allow up to M lossy branches in the collection to substantially lose information, allowing the cryptosystem to use this loss of information for several encryption and challenge queries. For each cryptosystem, we present detailed security proofs using the game-hopping procedure. In addition, we present a concrete instantation of LM lossy functions in the end of the paper\u2014which relies on the DDH assumption.<\/jats:p>","DOI":"10.3390\/cryptography6010002","type":"journal-article","created":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T20:42:16Z","timestamp":1641415336000},"page":"2","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A CCA-PKE Secure-Cryptosystem Resilient to Randomness Reset and Secret-Key Leakage"],"prefix":"10.3390","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5321-377X","authenticated-orcid":false,"given":"Alfonso","family":"Labao","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of the Philippines Diliman, Quezon City 1101, Philippines"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5513-4039","authenticated-orcid":false,"given":"Henry","family":"Adorna","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of the Philippines Diliman, Quezon City 1101, Philippines"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Ko\u00e7, \u00c7.K., \u00d6zdemir, F., and \u00d6demi\u015f \u00d6zger, Z. (2021). Rivest-Shamir-Adleman Algorithm. Partially Homomorphic Encryption, Springer.","DOI":"10.1007\/978-3-030-87629-6"},{"key":"ref_2","unstructured":"Boneh, D., and Shoup, V. (2021, December 23). A graduate Course in Applied Cryptography. Available online: https:\/\/toc.cryptobook.us\/book.pdf."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Cramer, R., and Shoup, V. (1998). A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. Annual International Cryptology Conference, Springer.","DOI":"10.1007\/BFb0055717"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Bellare, M., and Rogaway, P. (1993, January 3\u20135). Random oracles are practical: A paradigm for designing efficient protocols. Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, VA, USA.","DOI":"10.1145\/168588.168596"},{"key":"ref_5","unstructured":"Cramer, R., and Shoup, V. (May, January 28). Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Lucks, S. A variant of the Cramer-Shoup cryptosystem for groups of unknown order. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, 1\u20135 December 2002.","DOI":"10.1007\/3-540-36178-2_2"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Lafourcade, P., Robert, L., and Sow, D. (2021, January 6\u20138). Fast Cramer-Shoup Cryptosystem. Proceedings of the 18th International Conference on Security and Cryptography SECRYPT 2021, Paris, France.","DOI":"10.5220\/0010580607660771"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1137\/080733954","article-title":"Lossy trapdoor functions and their applications","volume":"40","author":"Peikert","year":"2011","journal-title":"SIAM J. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Naor, M., and Segev, G. Public-key cryptosystems resilient to key leakage. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA, 16\u201320 August 2009.","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Bellare, M., Brakerski, Z., Naor, M., Ristenpart, T., Segev, G., Shacham, H., and Yilek, S. Hedged public-key encryption: How to protect against bad randomness. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, 6\u201310 December 2009.","DOI":"10.1007\/978-3-642-10366-7_14"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Paterson, K.G., Schuldt, J.C., and Sibborn, D.L. Related randomness attacks for public key encryption. Proceedings of the International Workshop on Public Key Cryptography, Buenos Aires, Argentina, 26\u201328 March 2014.","DOI":"10.1007\/978-3-642-54631-0_27"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Faonio, A., and Venturi, D. Efficient public-key cryptography with bounded leakage and tamper resilience. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, 4\u20138 December 2016.","DOI":"10.1007\/978-3-662-53887-6_32"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Qin, B., and Liu, S. Leakage-resilient chosen-ciphertext secure public-key encryption from hash proof system and one-time lossy filter. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, 1\u20135 December 2013.","DOI":"10.1007\/978-3-642-42045-0_20"},{"key":"ref_14","first-page":"219","article-title":"Randomness in digital cryptography: A survey","volume":"13","author":"Marton","year":"2010","journal-title":"Rom. J. Inf. Sci. Technol."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Yuen, T.H., Zhang, C., Chow, S.S., and Yiu, S.M. (2015, January 14\u201317). Related randomness attacks for public key cryptosystems. Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, Singapore.","DOI":"10.1145\/2714576.2714622"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Yilek, S. Resettable public-key encryption: How to encrypt on a virtual machine. Proceedings of the Cryptographers\u2019 Track at the RSA Conference, San Francisco, CA, USA, 1\u20135 March 2010.","DOI":"10.1007\/978-3-642-11925-5_4"},{"key":"ref_17","unstructured":"Garfinkel, T., and Rosenblum, M. (2005). When Virtual Is Harder than Real: Security Challenges in Virtual Machine Based Computing Environments. HotOS, USENIX."},{"key":"ref_18","unstructured":"Ristenpart, T., and Yilek, S. (2010). When Good Randomness Goes Bad: Virtual Machine Reset Vulnerabilities and Hedging Deployed Cryptography. NDSS, Internet Society."},{"key":"ref_19","first-page":"331","article-title":"Code-Based Game-Playing Proofs and the Security of Triple Encryption","volume":"2004","author":"Bellare","year":"2004","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1007\/s00453-016-0219-7","article-title":"On the impossibility of cryptography with tamperable randomness","volume":"79","author":"Austrin","year":"2017","journal-title":"Algorithmica"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Tiri, K. (2007, January 4\u20138). Side-channel attack pitfalls. Proceedings of the 2007 44th ACM\/IEEE Design Automation Conference, San Diego, CA, USA.","DOI":"10.1109\/DAC.2007.375044"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1006\/jcss.1997.1546","article-title":"Extracting randomness: A survey and new constructions","volume":"58","author":"Nisan","year":"1999","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Vaikuntanathan, V., and Wichs, D. (2021, December 23). Extracting Randomness from Extractor-Dependent Sources, Advances in Cryptology\u2013EUROCRYPT 2020, Available online: https:\/\/par.nsf.gov\/servlets\/purl\/10165162.","DOI":"10.1007\/978-3-030-45721-1_12"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Reyzin, L., and Smith, A. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, 2\u20136 May 2004.","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","article-title":"A pseudorandom generator from any one-way function","volume":"28","author":"Impagliazzo","year":"1999","journal-title":"SIAM J. Comput."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Hemenway, B., Libert, B., Ostrovsky, R., and Vergnaud, D. Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Seoul, Korea, 4\u20138 December 2011.","DOI":"10.1007\/978-3-642-25385-0_4"},{"key":"ref_27","unstructured":"Hofheinz, D. All-but-many lossy trapdoor functions. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, 15\u201319 April 2012."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Canetti, R., and Goldwasser, S. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Prague, Czech Republic, 2\u20136 May 1999.","DOI":"10.1007\/3-540-48910-X_7"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Wee, H. Public key encryption against related key attacks. Proceedings of the International Workshop on Public Key Cryptography, Darmstadt, Germany, 21\u201323 May 2012.","DOI":"10.1007\/978-3-642-30057-8_16"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Paterson, K.G., Schuldt, J.C., Sibborn, D.L., and Wee, H. Security against related randomness attacks via reconstructive extractors. Proceedings of the IMA International Conference on Cryptography and Coding, Oxford, UK, 15\u201317 December 2015.","DOI":"10.1007\/978-3-319-27239-9_2"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X., and Shacham, H. Short group signatures. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA, 15\u201319 August 2004.","DOI":"10.1007\/978-3-540-28628-8_3"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/6\/1\/2\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:00:08Z","timestamp":1760364008000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/6\/1\/2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,4]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["cryptography6010002"],"URL":"https:\/\/doi.org\/10.3390\/cryptography6010002","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,4]]}}}