{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T03:13:20Z","timestamp":1772507600118,"version":"3.50.1"},"reference-count":74,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.tcs.2025.115518","type":"journal-article","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T20:44:18Z","timestamp":1755809058000},"page":"115518","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Hybrid encryption in correlated randomness model and KEM combiners"],"prefix":"10.1016","volume":"1054","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5669-3091","authenticated-orcid":false,"given":"Somnath","family":"Panja","sequence":"first","affiliation":[]},{"given":"Setareh","family":"Sharifian","sequence":"additional","affiliation":[]},{"given":"Shaoquan","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2025.115518_br0010","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S0097539702403773","article-title":"Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack","volume":"33","author":"Cramer","year":"2003","journal-title":"SIAM J. Comput."},{"issue":"11","key":"10.1016\/j.tcs.2025.115518_br0020","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1016\/j.ic.2010.07.002","article-title":"Some (in)sufficient conditions for secure hybrid encryption","volume":"208","author":"Herranz","year":"2010","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2025.115518_br0030","series-title":"Theory of Cryptogr. Conf.Springer","first-page":"581","article-title":"Chosen-ciphertext security from tag-based encryption","author":"Kiltz","year":"2006"},{"key":"10.1016\/j.tcs.2025.115518_br0040","series-title":"Annu. Int. Cryptol. Conf.","first-page":"426","article-title":"A new paradigm of hybrid encryption scheme","author":"Kurosawa","year":"2004"},{"key":"10.1016\/j.tcs.2025.115518_br0050","series-title":"The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure","first-page":"207","author":"Herranz","year":"2006"},{"key":"10.1016\/j.tcs.2025.115518_br0060","series-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","first-page":"128","article-title":"Tag-kem\/dem: a new framework for hybrid encryption and a new analysis of kurosawa-desmedt kem","author":"Abe","year":"2005"},{"key":"10.1016\/j.tcs.2025.115518_br0070","author":"Shacham"},{"key":"10.1016\/j.tcs.2025.115518_br0080","series-title":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","first-page":"1461","article-title":"Post-quantum tls without handshake signatures","author":"Schwabe","year":"2020"},{"key":"10.1016\/j.tcs.2025.115518_br0090","series-title":"Proceedings 35th Annual Symposium on Foundations of Computer Science","first-page":"124","article-title":"Algorithms for quantum computation: discrete logarithms and factoring","author":"Shor","year":"1994"},{"key":"10.1016\/j.tcs.2025.115518_br0100","series-title":"IEEE Eur. Symp. Secur. Priv. (EuroS&P)","first-page":"353","article-title":"CRYSTALS - kyber: a CCA-secure module-lattice-based KEM","author":"Bos","year":"2018"},{"key":"10.1016\/j.tcs.2025.115518_br0110","author":"N. I. of Standards and T. group"},{"key":"10.1016\/j.tcs.2025.115518_br0120","series-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","first-page":"212","article-title":"A fast quantum mechanical algorithm for database search","author":"Grover","year":"1996"},{"issue":"3","key":"10.1016\/j.tcs.2025.115518_br0130","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/18.256484","article-title":"Secret key agreement by public discussion from common information","volume":"39","author":"Maurer","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.tcs.2025.115518_br0140","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/18.243431","article-title":"Common randomness in information theory and cryptography. I. Secret sharing","volume":"39","author":"Ahlswede","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.tcs.2025.115518_br0150","series-title":"Annu. Int. Cryptol. Conf.","first-page":"478","article-title":"One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption","author":"Holenstein","year":"2005"},{"key":"10.1016\/j.tcs.2025.115518_br0160","series-title":"Strengthening Key Agreement using Hard-core Sets","author":"Holenstein","year":"2006"},{"key":"10.1016\/j.tcs.2025.115518_br0170","series-title":"Int. Conf. Theory Appl. Cryptol. Inf. Secur","first-page":"194","article-title":"Efficient one-way secret-key agreement and private channel coding via polarization","volume":"vol. 8269","author":"Renes","year":"2013"},{"issue":"11","key":"10.1016\/j.tcs.2025.115518_br0180","doi-asserted-by":"crossref","first-page":"6213","DOI":"10.1109\/TIT.2015.2471179","article-title":"Polar coding for secret-key generation","volume":"61","author":"Chou","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.tcs.2025.115518_br0190","series-title":"Int. Symp. On Inf. Theory and Its Appl.","first-page":"407","article-title":"A capacity-achieving one-way key agreement with improved finite blocklength analysis","author":"Sharifian","year":"2020"},{"key":"10.1016\/j.tcs.2025.115518_br0200","series-title":"Advances in Cryptol. - EUROCRYPT 2004","first-page":"523","article-title":"Fuzzy extractors: how to generate strong keys from biometrics and other noisy data","volume":"vol. 3027","author":"Dodis","year":"2004"},{"issue":"1","key":"10.1016\/j.tcs.2025.115518_br0210","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/060651380","article-title":"Fuzzy extractors: how to generate strong keys from biometrics and other noisy data","volume":"38","author":"Dodis","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2025.115518_br0220","series-title":"Proceedings of the 11th ACM Conf. On Computer and Communications Security","first-page":"82","article-title":"Reusable cryptographic fuzzy extractors","author":"Boyen","year":"2004"},{"key":"10.1016\/j.tcs.2025.115518_br0230","series-title":"Annual Int. Conf. Theory Appl. Cryptographic Techniques","first-page":"147","article-title":"Secure remote authentication using biometric data","author":"Boyen","year":"2005"},{"issue":"9","key":"10.1016\/j.tcs.2025.115518_br0240","doi-asserted-by":"crossref","first-page":"6207","DOI":"10.1109\/TIT.2012.2200290","article-title":"Robust fuzzy extractors and authenticated key agreement from close secrets","volume":"58","author":"Dodis","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.tcs.2025.115518_br0250","series-title":"Annual Int. Conf. Theory Appl. Cryptographic Techniques","first-page":"117","article-title":"Reusable fuzzy extractors for low-entropy distributions","author":"Canetti","year":"2016"},{"key":"10.1016\/j.tcs.2025.115518_br0260","series-title":"Proceedings of IEEE International Conference on Computers, Systems and Signal Processing","first-page":"175","article-title":"Quantum cryptography: public key distribution and coin tossing","author":"Bennett","year":"1984"},{"key":"10.1016\/j.tcs.2025.115518_br0270","series-title":"EUROCRYPT'97","first-page":"209","article-title":"Information-theoretically secure secret-key agreement by not authenticated public discussion","author":"Maurer","year":"1997"},{"issue":"4","key":"10.1016\/j.tcs.2025.115518_br0280","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1109\/TIT.2003.809560","article-title":"Secret-key agreement over unauthenticated public channels-part II: the simulatability condition","volume":"49","author":"Maurer","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.tcs.2025.115518_br0290","series-title":"2023 IEEE International Symposium on Information Theory (ISIT)","first-page":"2314","article-title":"A one-way secret key agreement with security against active adversaries","author":"Panja","year":"2023"},{"key":"10.1016\/j.tcs.2025.115518_br0300","series-title":"IACR Int. Work. Public Key Cryptogr.","first-page":"190","article-title":"KEM combiners","author":"Giacon","year":"2018"},{"key":"10.1016\/j.tcs.2025.115518_br0310","series-title":"Int. Conf. Post-Quantum Cryptogr.","first-page":"206","article-title":"Hybrid key encapsulation mechanisms and authenticated key exchange","author":"Bindel","year":"2019"},{"key":"10.1016\/j.tcs.2025.115518_br0320","series-title":"ASIACRYPT 2018","first-page":"459","article-title":"Robustly reusable fuzzy extractor from standard assumptions","volume":"vol. 11274","author":"Wen","year":"2018"},{"key":"10.1016\/j.tcs.2025.115518_br0330","series-title":"IACR Int. Workshop on Public Key Cryptogr.","first-page":"349","article-title":"Generic constructions of robustly reusable fuzzy extractor","author":"Wen","year":"2019"},{"key":"10.1016\/j.tcs.2025.115518_br0340","series-title":"2021 IEEE Int. Symp. On Inf. Theory (ISIT)","first-page":"2393","article-title":"Information-theoretic key encapsulation and its application to secure communication","author":"Sharifian","year":"2021"},{"key":"10.1016\/j.tcs.2025.115518_br0350","series-title":"IMA Int. Conf. On Cryptogr. And Coding","first-page":"133","article-title":"A designer's guide to KEMs","author":"Dent","year":"2003"},{"issue":"2","key":"10.1016\/j.tcs.2025.115518_br0360","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s00145-007-9000-z","article-title":"Generic constructions of identity-based and certificateless KEMs","volume":"21","author":"Bentahar","year":"2008","journal-title":"J. Cryptol."},{"key":"10.1016\/j.tcs.2025.115518_br0370","series-title":"IACR Int. Work. Public Key Cryptogr.","first-page":"1","article-title":"Simple and efficient public-key encryption from computational Diffie-Hellman in the standard model","author":"Haralambiev","year":"2010"},{"key":"10.1016\/j.tcs.2025.115518_br0380","series-title":"A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem","first-page":"688","author":"Ding","year":"2012"},{"key":"10.1016\/j.tcs.2025.115518_br0390","series-title":"Int. Work. Post-Quantum Cryptogr.","first-page":"197","article-title":"Lattice cryptography for the Internet","author":"Peikert","year":"2014"},{"key":"10.1016\/j.tcs.2025.115518_br0400","author":"Albrecht"},{"key":"10.1016\/j.tcs.2025.115518_br0410","series-title":"2018 Int. Symp. Inf. Theory Its Appl. (ISITA)","first-page":"698","article-title":"A new key encapsulation combiner","author":"Matsuda","year":"2018"},{"key":"10.1016\/j.tcs.2025.115518_br0420","series-title":"Annu. Int. Conf. Theory Appl. Cryptographic Techniques","first-page":"96","article-title":"On robust combiners for oblivious transfer and other primitives","author":"Harnik","year":"2005"},{"issue":"2","key":"10.1016\/j.tcs.2025.115518_br0430","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","article-title":"Privacy amplification by public discussion","volume":"17","author":"Bennett","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2025.115518_br0440","series-title":"2004 IEEE Int. Symp. Inf. Theory (ISIT), IEEE","first-page":"233","article-title":"Smooth Renyi entropy and applications","author":"Renner","year":"2004"},{"issue":"4","key":"10.1016\/j.tcs.2025.115518_br0450","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1109\/TIT.2011.2110230","article-title":"On the randomness of independent experiments","volume":"57","author":"Holenstein","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.tcs.2025.115518_br0460","series-title":"2014 IEEE Int. Symp. On Inf. Theory","first-page":"1469","article-title":"Fundamental finite key limits for information reconciliation in quantum key distribution","author":"Tomamichel","year":"2014"},{"issue":"4","key":"10.1016\/j.tcs.2025.115518_br0470","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1109\/TIT.2003.809563","article-title":"Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness result","volume":"49","author":"Maurer","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.tcs.2025.115518_br0480","series-title":"Adv. Cryptol. - EUROCRYPT 2004","first-page":"109","article-title":"The exact price for unconditionally secure asymmetric cryptography","author":"Renner","year":"2004"},{"key":"10.1016\/j.tcs.2025.115518_br0490","series-title":"Annu. Int. Conf. Theory Appl. Cryptographic Techniques","first-page":"206","article-title":"Key agreement from close secrets over unsecured channels","author":"Kanukurthi","year":"2009"},{"issue":"4","key":"10.1016\/j.tcs.2025.115518_br0500","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems*","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/j.tcs.2025.115518_br0510","first-page":"43","article-title":"On the Power of Cascade Ciphers","volume":"vol. 3","author":"Even","year":"1985"},{"issue":"1","key":"10.1016\/j.tcs.2025.115518_br0520","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02620231","article-title":"Cascade ciphers: the importance of being first","volume":"6","author":"Maurer","year":"1993","journal-title":"J. Cryptol."},{"key":"10.1016\/j.tcs.2025.115518_br0530","series-title":"Advances in Cryptology - CRYPTO 2007","first-page":"224","article-title":"Security-amplifying combiners for collision-resistant hash functions","author":"Fischlin","year":"2007"},{"key":"10.1016\/j.tcs.2025.115518_br0540","author":"Herzberg"},{"key":"10.1016\/j.tcs.2025.115518_br0550","series-title":"Annu. Int. Cryptol. Conf.","first-page":"97","article-title":"Precomputing oblivious transfer","author":"Beaver","year":"1995"},{"key":"10.1016\/j.tcs.2025.115518_br0560","series-title":"Annu. Int. Conf. Theory Appl. Cryptographic Techniques","first-page":"169","article-title":"Semi-homomorphic encryption and multiparty computation","author":"Bendlin","year":"2011"},{"key":"10.1016\/j.tcs.2025.115518_br0570","series-title":"Theory of Cryptogr. Conf.","first-page":"600","article-title":"On the power of correlated randomness in secure computation","author":"Ishai","year":"2013"},{"key":"10.1016\/j.tcs.2025.115518_br0580","series-title":"Theory of Cryptogr. Conf.","first-page":"123","article-title":"Two-round mpc: information-theoretic and black-box","author":"Garg","year":"2018"},{"key":"10.1016\/j.tcs.2025.115518_br0590","series-title":"Proc. 2001 IEEE Symp. Secur. Privacy. S&P 2001","first-page":"184","article-title":"A model for asynchronous reactive systems and its application to secure message transmission","author":"Pfitzmann","year":"2000"},{"key":"10.1016\/j.tcs.2025.115518_br0600","series-title":"Proc. 21st Annu. ACM Symp. Theory Comput. - STOC'89","first-page":"12","article-title":"Pseudo-random generation from one-way functions","author":"Impagliazzo","year":"1989"},{"key":"10.1016\/j.tcs.2025.115518_br0610","series-title":"Int. Conf. Theory Appl. Cryptol. Inf. Secur.","first-page":"502","article-title":"Bounded CCA2-secure encryption","author":"Cramer","year":"2007"},{"key":"10.1016\/j.tcs.2025.115518_br0620","series-title":"Int. Conf. Theory Appl. Cryptol. Inf. Secur.","first-page":"531","article-title":"Authenticated encryption: relations among notions and analysis of the generic composition paradigm","author":"Bellare","year":"2000"},{"issue":"1","key":"10.1016\/j.tcs.2025.115518_br0630","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s00145-005-0310-8","article-title":"Characterization of security notions for probabilistic private-key encryption","volume":"19","author":"Katz","year":"2006","journal-title":"J. Cryptol."},{"issue":"4","key":"10.1016\/j.tcs.2025.115518_br0640","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1109\/TIT.2011.2110230","article-title":"On the randomness of independent experiments","volume":"57","author":"Holenstein","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.tcs.2025.115518_br0650","series-title":"Advances in Cryptol. - EUROCRYPT 2008","first-page":"471","article-title":"Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors","volume":"vol. 4965","author":"Cramer","year":"2008"},{"key":"10.1016\/j.tcs.2025.115518_br0660","series-title":"Advances in Cryptology \u2014 EUROCRYPT'94","first-page":"92","article-title":"Optimal asymmetric encryption","author":"Bellare","year":"1995"},{"key":"10.1016\/j.tcs.2025.115518_br0670","series-title":"Advances in Cryptology - ASIACRYPT 2004","first-page":"48","article-title":"Towards plaintext-aware public-key encryption without random oracles","author":"Bellare","year":"2004"},{"key":"10.1016\/j.tcs.2025.115518_br0680","series-title":"A Treatise on Algebraic Plane Curves","first-page":"10","author":"Coolidge","year":"1959"},{"key":"10.1016\/j.tcs.2025.115518_br0690","author":"Weisstein"},{"key":"10.1016\/j.tcs.2025.115518_br0700","series-title":"Int. Workshop on Cryptographic Hardware and Embedded Systems","first-page":"166","article-title":"True random number generators secure in a changing environment","author":"Barak","year":"2003"},{"key":"10.1016\/j.tcs.2025.115518_br0710","series-title":"Foundations of Cryptography: Basic Applications","author":"Goldreich","year":"2004"},{"key":"10.1016\/j.tcs.2025.115518_br0720","series-title":"Foundations of Cryptography: Basic Tools","author":"Goldreich","year":"2001"},{"key":"10.1016\/j.tcs.2025.115518_br0730","series-title":"IACR Int. Workshop on Selected Areas in Cryptography","first-page":"182","article-title":"About the security of ciphers (semantic security and pseudo-random permutations)","author":"Phan","year":"2004"},{"key":"10.1016\/j.tcs.2025.115518_br0740","author":"Bellare"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525004566?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525004566?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:04:15Z","timestamp":1759968255000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397525004566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":74,"alternative-id":["S0304397525004566"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115518","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hybrid encryption in correlated randomness model and KEM combiners","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115518","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115518"}}