Paper 2024/163

On Tweakable Correlation Robust Hashing against Key Leakages

Chun Guo, Shandong University
Xiao Wang, Northwestern University
Kang Yang, State Key Laboratory of Cryptology
Yu Yu, Shanghai Jiao Tong University
Abstract

We continue the study of blockcipher-based (tweakable) correlation robust hash functions, which are central building blocks of circuit garbling and oblivious-transfer extension schemes. Motivated by Roy (CRYPTO 2022), we first enhance the multi-user tweakable correlation robust notion of Guo et al. (CRYPTO 2020) with a {\it key leaking oracle} that tells the adversary whether a certain user key satisfies the adversarially-chosen predicate. We then investigate the state-of-the-art hash construction of Guo et al. with respect to our new security definition, providing security proof as well as matching attacks. As an application, we exhibit an OT extension protocol with non-trivial multi-user security.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
Keywords
Correlation robust hashingkey leakageoblivious-transfer extension
Contact author(s)
chun guo sc @ gmail com
wangxiao @ northwestern edu
yangk @ sklc org
yuyu @ yuyu hk
History
2024-03-18: revised
2024-02-05: received
See all versions
Short URL
https://ia.cr/2024/163
License
No rights reserved
CC0

BibTeX

@misc{cryptoeprint:2024/163,
      author = {Chun Guo and Xiao Wang and Kang Yang and Yu Yu},
      title = {On Tweakable Correlation Robust Hashing against Key Leakages},
      howpublished = {Cryptology ePrint Archive, Paper 2024/163},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/163}},
      url = {https://eprint.iacr.org/2024/163}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.