Avik Chakraborti
Research Subjects
Avik Chakraborti has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Mridul Nandi
Indian Statistical Institute
4 shared publications - Anupam Chattopadhyay
Nanyang Technological University, Singapore, Singapore, Singapore
2 shared publications - Nilanjan Datta
Institute for Advancing Intelligence (IAI), TCG CREST
2 shared publications - Takanori Isobe
Osaka University
2 shared publications - Alamgir Alam
Institute for Advancing Intelligence (IAI), TCG CREST
1 shared publication - Arghya Bhattacharjee
Indian Statistical Institute, Kolkata, India
1 shared publication
Latest Publications
- Open Access
- 26 October 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
One-pass AE Modes with White-box Incompressibility
At ASIACRYPT 2022, Hosoyamada et al. introduced a rigorous white-box incompressibility framework for symmetric-key primitives, formalizing notions such as wh-PRP, wh-SPRP, and wh-PRI, and establishing reductions that weak public indifferentiability implies white-box reduction in their framework. As a concrete example, they demonstrated that counter mode with SIV construction achieves white-box incompressibility. Extending these results to one-pass constructions appears to be considerably challenging. In particular, any construction that is vulnerable under nonce repetitions with respect to the AE security is incompatible in their white-box setting, thereby posing a fundamental obstacle to achieving white-box incompressibility for such schemes. We address this by considering a weaker notion of AE security and introducing the notion of delayed on-line AE (dOAE), a natural and strictly more expressive extension of on-line AEAD supported by many efficient designs. Within this framework, we analyze the authenticated cipher SAEB, introduced by Naito et al. at TCHES'18, that achieves dOAE security under nonce misuse. We prove that SAEB achieves a white-box delayed on-line PRI (wh-dOPRI), assuming the underlying block-cipher to be wh-PRP. To the best of our knowledge, this is the first result providing a mode-level white-box guarantee for an efficient single-pass AEAD construction.
- 26 October 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
Open AccessOne-pass AE Modes with White-box Incompressibility
At ASIACRYPT 2022, Hosoyamada et al. introduced a rigorous white-box incompressibility framework for symmetric-key primitives, formalizing notions such as wh-PRP, wh-SPRP, and wh-PRI, and establishing reductions that weak public indifferentiability implies white-box reduction in their framework. As a concrete example, they demonstrated that counter mode with SIV construction achieves white-box incompressibility. Extending these results to one-pass constructions appears to be considerably challenging. In particular, any construction that is vulnerable under nonce repetitions with respect to the AE security is incompatible in their white-box setting, thereby posing a fundamental obstacle to achieving white-box incompressibility for such schemes. We address this by considering a weaker notion of AE security and introducing the notion of delayed on-line AE (dOAE), a natural and strictly more expressive extension of on-line AEAD supported by many efficient designs. Within this framework, we analyze the authenticated cipher SAEB, introduced by Naito et al. at TCHES'18, that achieves dOAE security under nonce misuse. We prove that SAEB achieves a white-box delayed on-line PRI (wh-dOPRI), assuming the underlying block-cipher to be wh-PRP. To the best of our knowledge, this is the first result providing a mode-level white-box guarantee for an efficient single-pass AEAD construction.
- Open Access
- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
EWEMrl: A White-Box Secure Cipher with Longevity
We propose the first updatable white-box secure cipher, EWEMrl, and its natural extension EWEMxl, both achieving longevity against non-adaptive read-only malware. The notion of longevity, introduced by Koike et al., addresses continuous code leakage and is stronger than incompressibility. While Yoroi claimed longevity, but was broken by Isobe and Todo. Given the prevalence of continuous leakage, developing such ciphers is crucial in white-box cryptography. Precisely, we have the following. We first present EWEMr (Extended WEM against non-adaptive read-only adversaries), a generalization of WEM (White-box Even-Mansour). WEM is the first (and possibly only) white-box cipher based on EM, replacing its key addition layer with a secret Sbox. EWEMr achieves a high space-hardness bound in the non-adaptive model, with a new generic proof strategy, but does not provide longevity. Instead, it serves as the base for EWEMrl. We also present EWEMx, which uses EWEMr as subroutines and achieves a high space-hardness bound in the stronger adaptive model. While EWEMx does not achieve longevity, it is the base design for EWEMxl. We next propose EWEMrl, that achieves longevity against non-adaptive read-only malware. None of the existing ciphers, such as SPNbox and SPACE, is designed for longevity. We show that EWEMrl ensures (against non-adaptive read-only adversaries) (1) longevity, (2) high space-hardness in both known-space and chosen-space settings, and (3) security against hybrid code-lifting attacks. Finally, we introduce EWEMxl, a natural extension of EWEMrl with a structure similar to EWEMx. EWEMxl achieves (2) and (3) in the stronger adaptive model while maintaining (1) in the same non-adaptive and read-only setting. In summary, our proposals EWEMrl and EWEMxl provide longevity against non-adaptive read-only malware while ensuring security confidence in the black-box setting.
- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
Open AccessEWEMrl: A White-Box Secure Cipher with Longevity
We propose the first updatable white-box secure cipher, EWEMrl, and its natural extension EWEMxl, both achieving longevity against non-adaptive read-only malware. The notion of longevity, introduced by Koike et al., addresses continuous code leakage and is stronger than incompressibility. While Yoroi claimed longevity, but was broken by Isobe and Todo. Given the prevalence of continuous leakage, developing such ciphers is crucial in white-box cryptography. Precisely, we have the following. We first present EWEMr (Extended WEM against non-adaptive read-only adversaries), a generalization of WEM (White-box Even-Mansour). WEM is the first (and possibly only) white-box cipher based on EM, replacing its key addition layer with a secret Sbox. EWEMr achieves a high space-hardness bound in the non-adaptive model, with a new generic proof strategy, but does not provide longevity. Instead, it serves as the base for EWEMrl. We also present EWEMx, which uses EWEMr as subroutines and achieves a high space-hardness bound in the stronger adaptive model. While EWEMx does not achieve longevity, it is the base design for EWEMxl. We next propose EWEMrl, that achieves longevity against non-adaptive read-only malware. None of the existing ciphers, such as SPNbox and SPACE, is designed for longevity. We show that EWEMrl ensures (against non-adaptive read-only adversaries) (1) longevity, (2) high space-hardness in both known-space and chosen-space settings, and (3) security against hybrid code-lifting attacks. Finally, we introduce EWEMxl, a natural extension of EWEMrl with a structure similar to EWEMx. EWEMxl achieves (2) and (3) in the stronger adaptive model while maintaining (1) in the same non-adaptive and read-only setting. In summary, our proposals EWEMrl and EWEMxl provide longevity against non-adaptive read-only malware while ensuring security confidence in the black-box setting.
- 1 January 2022
- Published by Springer Nature
- p. 195-219
${\textsf {ISAP}{+}}$: $\textsf {ISAP} $ with Fast Authentication- 1 January 2022
- Published by Springer Nature
- p. 195-219
${\textsf {ISAP}{+}}$: $\textsf {ISAP} $ with Fast Authentication- 9 September 2016
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 8 (1) , 29-48
TriviA and uTriviA: two fast and secure authenticated encryption schemes
- 9 September 2016
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 8 (1) , 29-48
TriviA and uTriviA: two fast and secure authenticated encryption schemes
- 2 February 2016
- Published by Springer Nature
- p. 39-54
INT-RUP Analysis of Block-cipher Based Authenticated Encryption Schemes
- 2 February 2016
- Published by Springer Nature
- p. 39-54
INT-RUP Analysis of Block-cipher Based Authenticated Encryption Schemes
- 1 September 2015
- Published by Springer Nature
- p. 330-353
TriviA: A Fast and Secure Authenticated Encryption Scheme
- 1 September 2015
- Published by Springer Nature
- p. 330-353
TriviA: A Fast and Secure Authenticated Encryption Scheme