default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvijit Dutta
Person information
- affiliation: Institute for Advancing Intelligence, TCG-CREST, Kolkata, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Nilanjan Datta
, Avijit Dutta, Eik List, Sougata Mandal:
FEDT: Forkcipher-based Leakage-resilient Beyond-birthday-secure AE. IACR Commun. Cryptol. 1(2): 21 (2024)- [j16]Arghya Bhattacharjee, Ritam Bhaumik, Avijit Dutta, Mridul Nandi, Anik Raychaudhuri:
BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers. Des. Codes Cryptogr. 92(1): 13-49 (2024) - [c27]Ritam Bhaumik, Bishwajit Chakraborty, Wonseok Choi, Avijit Dutta, Jérôme Govinden, Yaobin Shen:
The Committing Security of MACs with Applications to Generic Composition. CRYPTO (4) 2024: 425-462 - [i31]Nilanjan Datta, Shreya Dey, Avijit Dutta, Devdutto Kanungo:
Multi User Security of LightMAC and LightMAC_Plus. IACR Cryptol. ePrint Arch. 2024: 725 (2024) - [i30]Ritam Bhaumik, Bishwajit Chakraborty, Wonseok Choi, Avijit Dutta, Jérôme Govinden, Yaobin Shen:
The Committing Security of MACs with Applications to Generic Composition. IACR Cryptol. ePrint Arch. 2024: 928 (2024) - [i29]Ritam Bhaumik, Wonseok Choi, Avijit Dutta, Cuauhtemoc Mancillas López, Hrithik Nandi, Yaobin Shen:
Efficient Variants of TNT with BBB Security. IACR Cryptol. ePrint Arch. 2024: 1237 (2024) - [i28]Avijit Dutta, Eik List:
Proving the Security of the Extended Summation-Truncation Hybrid. IACR Cryptol. ePrint Arch. 2024: 1723 (2024) - 2023
- [j15]Debrup Chakraborty, Avijit Dutta, Samir Kundu:
Designing tweakable enciphering schemes using public permutations. Adv. Math. Commun. 17(4): 771-798 (2023) - [j14]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Tight Multi-User Security Bound of DbHtS. IACR Trans. Symmetric Cryptol. 2023(1): 192-223 (2023) - [j13]Nilanjan Datta, Shreya Dey, Avijit Dutta, Sougata Mandal:
Cascading Four Round LRW1 is Beyond Birthday Bound Secure. IACR Trans. Symmetric Cryptol. 2023(4): 365-390 (2023) - [c26]Benoît Cogliati, Avijit Dutta, Mridul Nandi, Jacques Patarin, Abishanka Saha:
Proof of Mirror Theory for a Wide Range of $\xi _{\max }$. EUROCRYPT (4) 2023: 470-501 - [c25]Arghya Bhattacharjee, Ritam Bhaumik, Avijit Dutta, Eik List:
PAE: Towards More Efficient and BBB-Secure AE from a Single Public Permutation. ICICS 2023: 69-87 - [c24]Nilanjan Datta, Avijit Dutta, Eik List, Sougata Mandal:
On the Security of Triplex- and Multiplex-Type Constructions with Smaller Tweaks. INDOCRYPT (1) 2023: 25-47 - [c23]Nilanjan Datta, Avijit Dutta, Samir Kundu:
Tight Security Bound of $\textsf {2k{\text {-}}LightMAC\_Plus}$. INDOCRYPT (1) 2023: 68-88 - [i27]Arghya Bhattacharjee, Ritam Bhaumik, Avijit Dutta, Eik List:
sfPAE: Towards More Efficient and BBB-secure AE From a Single Public Permutation. IACR Cryptol. ePrint Arch. 2023: 978 (2023) - [i26]Nilanjan Datta, Shreya Dey, Avijit Dutta, Sougata Mandal:
Cascading Four Round LRW1 is Beyond Birthday Bound Secure. IACR Cryptol. ePrint Arch. 2023: 1242 (2023) - [i25]Nilanjan Datta, Avijit Dutta, Samir Kundu:
Tight Security Bound of 2k-LightMAC Plus. IACR Cryptol. ePrint Arch. 2023: 1422 (2023) - [i24]Nilanjan Datta, Avijit Dutta, Eik List, Sougata Mandal:
On the Security of Triplex- and Multiplex-type Constructions with Smaller Tweaks. IACR Cryptol. ePrint Arch. 2023: 1658 (2023) - 2022
- [j12]Yu Long Chen, Avijit Dutta, Mridul Nandi:
Multi-user BBB security of public permutations based MAC. Cryptogr. Commun. 14(5): 1145-1177 (2022) - [j11]Arghya Bhattacharjee, Avijit Dutta, Eik List, Mridul Nandi:
CENCPP*: beyond-birthday-secure encryption from public permutations. Des. Codes Cryptogr. 90(6): 1381-1425 (2022) - [j10]Avijit Dutta, Mridul Nandi, Abishanka Saha:
Proof of Mirror Theory for ξmax = 2. IEEE Trans. Inf. Theory 68(9): 6218-6232 (2022) - [c22]Nilanjan Datta, Avijit Dutta, Shibam Ghosh:
INT-RUP Security of SAEB and TinyJAMBU. INDOCRYPT 2022: 146-170 - [i23]Yu Long Chen, Avijit Dutta, Mridul Nandi:
Multi-User BBB Security of Public Permutations Based MAC. IACR Cryptol. ePrint Arch. 2022: 304 (2022) - [i22]Benoît Cogliati, Avijit Dutta, Mridul Nandi, Jacques Patarin, Abishanka Saha:
Proof of Mirror Theory for any $\xi_{\max}$. IACR Cryptol. ePrint Arch. 2022: 686 (2022) - [i21]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Tight Multi-User Security Bound of sfDbHtS. IACR Cryptol. ePrint Arch. 2022: 689 (2022) - [i20]Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Tight Security Analysis of the Public Permutation-Based PMAC_Plus. IACR Cryptol. ePrint Arch. 2022: 905 (2022) - [i19]Nilanjan Datta, Avijit Dutta, Shibam Ghosh:
INT-RUP Security of SAEB and TinyJAMBU. IACR Cryptol. ePrint Arch. 2022: 1414 (2022) - [i18]Avijit Dutta, Jian Guo, Eik List:
Forking Sums of Permutations for Optimally Secure and Highly Efficient PRFs. IACR Cryptol. ePrint Arch. 2022: 1609 (2022) - 2021
- [j9]Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Permutation Based EDM: An Inverse Free BBB Secure PRF. IACR Trans. Symmetric Cryptol. 2021(2): 31-70 (2021) - [j8]Nilanjan Datta, Avijit Dutta, Kushankur Dutta:
Improved Security Bound of (E/D)WCDM. IACR Trans. Symmetric Cryptol. 2021(4): 138-176 (2021) - [i17]Debrup Chakraborty, Avijit Dutta, Samir Kundu:
Designing Tweakable Enciphering Schemes Using Public Permutations. IACR Cryptol. ePrint Arch. 2021: 128 (2021) - [i16]Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Permutation Based EDM: An Inverse Free BBB Secure PRF. IACR Cryptol. ePrint Arch. 2021: 679 (2021) - [i15]Nilanjan Datta, Avijit Dutta, Kushankur Dutta:
Improved Security Bound of \textsf{(E/D)WCDM}. IACR Cryptol. ePrint Arch. 2021: 1573 (2021) - 2020
- [j7]Jay Dave, Avijit Dutta, Parvez Faruki, Vijay Laxmi, Manoj Singh Gaur:
Secure Proof of Ownership Using Merkle Tree for Deduplicated Storage. Autom. Control. Comput. Sci. 54(4): 358-370 (2020) - [c21]Avijit Dutta, Mridul Nandi:
BBB Secure Nonce Based MAC Using Public Permutations. AFRICACRYPT 2020: 172-191 - [c20]Avijit Dutta:
Minimizing the Two-Round Tweakable Even-Mansour Cipher. ASIACRYPT (1) 2020: 601-629 - [i14]Avijit Dutta, Mridul Nandi:
BBB Secure Nonce Based MAC Using Public Permutations. IACR Cryptol. ePrint Arch. 2020: 509 (2020) - [i13]Arghya Bhattacharjee, Avijit Dutta, Eik List, Mridul Nandi:
CENCPP - Beyond-birthday-secure Encryption from Public Permutations. IACR Cryptol. ePrint Arch. 2020: 602 (2020) - [i12]Avijit Dutta, Mridul Nandi, Abishanka Saha:
Proof of Mirror Theory for $\xi_{\max}=2$. IACR Cryptol. ePrint Arch. 2020: 669 (2020) - [i11]Avijit Dutta:
Minimizing the Two-Round Tweakable Even-Mansour Cipher. IACR Cryptol. ePrint Arch. 2020: 1076 (2020)
2010 – 2019
- 2019
- [j6]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Kan Yasuda:
sfDWCDM+: A BBB secure nonce based MAC. Adv. Math. Commun. 13(4): 705-732 (2019) - [j5]Donghoon Chang, Nilanjan Datta, Avijit Dutta, Bart Mennink, Mridul Nandi, Somitra Sanadhya, Ferdinand Sibleyras:
Release of Unverified Plaintext: Tight Unified Model and Application to ANYDAE. IACR Trans. Symmetric Cryptol. 2019(4): 119-146 (2019) - [c19]Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Beyond Birthday Bound Secure MAC in Faulty Nonce Model. EUROCRYPT (1) 2019: 437-466 - [i10]Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Beyond Birthday Bound Secure MAC in Faulty Nonce Model. IACR Cryptol. ePrint Arch. 2019: 127 (2019) - [i9]Avijit Dutta, Mridul Nandi:
Tweakable HCTR: A BBB Secure Tweakable Enciphering Scheme. IACR Cryptol. ePrint Arch. 2019: 1324 (2019) - [i8]Donghoon Chang, Nilanjan Datta, Avijit Dutta, Bart Mennink, Mridul Nandi, Somitra Sanadhya, Ferdinand Sibleyras:
Release of Unverified Plaintext: Tight Unified Model and Application to ANYDAE. IACR Cryptol. ePrint Arch. 2019: 1326 (2019) - 2018
- [j4]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Goutam Paul:
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF. IACR Trans. Symmetric Cryptol. 2018(3): 36-92 (2018) - [c18]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Kan Yasuda:
Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC. CRYPTO (1) 2018: 631-661 - [c17]Avijit Dutta, Mridul Nandi:
Tweakable HCTR: A BBB Secure Tweakable Enciphering Scheme. INDOCRYPT 2018: 47-69 - [i7]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Kan Yasuda:
Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC. IACR Cryptol. ePrint Arch. 2018: 500 (2018) - [i6]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Goutam Paul:
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF. IACR Cryptol. ePrint Arch. 2018: 804 (2018) - 2017
- [j3]Avijit Dutta, Ashwin Jha, Mridul Nandi:
A New Look at Counters: Don't Run Like Marathon in a Hundred Meter Race. IEEE Trans. Computers 66(11): 1851-1864 (2017) - [j2]Avijit Dutta, Ashwin Jha, Mridul Nandi:
Tight Security Analysis of EHtM MAC. IACR Trans. Symmetric Cryptol. 2017(3): 130-150 (2017) - [j1]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Goutam Paul, Liting Zhang:
Single Key Variant of PMAC_Plus. IACR Trans. Symmetric Cryptol. 2017(4): 268-305 (2017) - [c16]Ritam Bhaumik, Nilanjan Datta, Avijit Dutta, Nicky Mouha, Mridul Nandi:
The Iterated Random Function Problem. ASIACRYPT (2) 2017: 667-697 - [i5]Avijit Dutta, Ashwin Jha, Mridul Nandi:
Tight Security Analysis of EHtM MAC. IACR Cryptol. ePrint Arch. 2017: 837 (2017) - [i4]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Goutam Paul, Liting Zhang:
Single Key Variant of PMAC_Plus. IACR Cryptol. ePrint Arch. 2017: 848 (2017) - [i3]Ritam Bhaumik, Nilanjan Datta, Avijit Dutta, Nicky Mouha, Mridul Nandi:
The Iterated Random Function Problem. IACR Cryptol. ePrint Arch. 2017: 892 (2017) - 2016
- [c15]Avijit Dutta, Mridul Nandi, Goutam Paul:
One-Key Compression Function Based MAC with Security Beyond Birthday Bound. ACISP (1) 2016: 343-358 - [i2]Avijit Dutta, Ashwin Jha, Mridul Nandi:
Exact Security Analysis of Hash-then-Mask Type Probabilistic MAC Constructions. IACR Cryptol. ePrint Arch. 2016: 983 (2016) - 2015
- [i1]Avijit Dutta, Goutam Paul:
Lifting the Security of NI-MAC Beyond Birthday Bound. IACR Cryptol. ePrint Arch. 2015: 1016 (2015) - 2014
- [c14]Avijit Dutta, Goutam Paul:
Deterministic Hard Fault Attack on Trivium. IWSEC 2014: 134-145 - 2013
- [c13]Avijit Dutta, Neil Tuttle, Krishnan Anandh:
Canonical ordering of instances to immunize the FPGA place and route flow from ECO-induced variance. ISQED 2013: 359-363 - 2012
- [c12]Avijit Dutta:
Low cost adjacent double error correcting code with complete elimination of miscorrection within a dispersion window for Multiple Bit Upset tolerant memory. VLSI-SoC 2012: 287-290 - 2011
- [c11]Jakub Janicki, Jerzy Tyszer, Avijit Dutta, Mark Kassab, Grzegorz Mrugalski, Nilanjan Mukherjee, Janusz Rajski:
EDT channel bandwidth management in SoC designs with pattern-independent test access mechanism. ITC 2011: 1-9 - [c10]Manish Sharma, Avijit Dutta, Wu-Tung Cheng, Brady Benware, Mark Kassab:
A novel Test Access Mechanism for failure diagnosis of multiple isolated identical cores. ITC 2011: 1-9
2000 – 2009
- 2008
- [c9]Avijit Dutta, Abhijit Jas:
Combinational Logic Circuit Protection Using Customized Error Detecting and Correcting Codes. ISQED 2008: 68-73 - 2007
- [c8]Avijit Dutta, Nur A. Touba:
Reliable Network-on-Chip Using a Low Cost Unequal Error Protection Code. DFT 2007: 3-11 - [c7]Avijit Dutta, Nur A. Touba:
Multiple Bit Upset Tolerant Memory Using a Selective Cycle Avoidance Based SEC-DED-DAEC Code. VTS 2007: 349-354 - 2006
- [c6]Avijit Dutta, Nur A. Touba:
Synthesis of Efficient Linear Test Pattern Generators. DFT 2006: 206-214 - [c5]Avijit Dutta, David Z. Pan:
Partial Functional Manipulation Based Wirelength Minimization. ICCD 2006: 344-349 - [c4]Avijit Dutta, Nur A. Touba:
Using Limited Dependence Sequential Expansion for Decompressing Test Vectors. ITC 2006: 1-9 - [c3]Avijit Dutta, Nur A. Touba:
Iterative OPDD Based Signal Probability Calculation. VTS 2006: 72-77 - 2005
- [c2]Avijit Dutta, Terence Rodrigues, Nur A. Touba:
Low Cost Test Vector Compression/Decompression Scheme for Circuits with a Reconfigurable Serial Multiplier. ISVLSI 2005: 200-205 - [c1]Avijit Dutta, Nur A. Touba:
Synthesis of nonintrusive concurrent error detection using an even error detecting function. ITC 2005: 8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
