default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrimanta Bhattacharya
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Niranjan Balachandran, Srimanta Bhattacharya, Krishn Kher, Rogers Mathew, Brahadeesh Sankarnarayanan:
On Hierarchically Closed Fractional Intersecting Families. Electron. J. Comb. 30(4) (2023)- 2021
- [c4]Srimanta Bhattacharya, Mridul Nandi:
Luby-Rackoff Backwards with More Users and More Security. ASIACRYPT (3) 2021: 345-375
2010 – 2019
- 2019
- [i6]Srimanta Bhattacharya, Mridul Nandi:
Revisiting Variable Output Length XOR Pseudorandom Function. IACR Cryptol. ePrint Arch. 2019: 249 (2019) - [i5]Srimanta Bhattacharya, Mridul Nandi:
A Note on the Chi-square Method : A Tool for Proving Cryptographic Security. IACR Cryptol. ePrint Arch. 2019: 1157 (2019) - 2018
- [j5]Srimanta Bhattacharya, Mridul Nandi
:
A note on the chi-square method: A tool for proving cryptographic security. Cryptogr. Commun. 10(5): 935-957 (2018) - [j4]Srimanta Bhattacharya, Mridul Nandi:
Revisiting Variable Output Length XOR Pseudorandom Function. IACR Trans. Symmetric Cryptol. 2018(1): 314-335 (2018) - [c3]Srimanta Bhattacharya, Mridul Nandi:
Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the \chi ^2 Method. EUROCRYPT (1) 2018: 387-412 - [i4]Srimanta Bhattacharya, Mridul Nandi:
Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the χ2 Method. IACR Cryptol. ePrint Arch. 2018: 169 (2018) - 2017
- [j3]Srimanta Bhattacharya, Sumanta Sarkar:
On some permutation binomials and trinomials over $$\mathbb {F}_{2^n}$$ F 2 n. Des. Codes Cryptogr. 82(1-2): 149-160 (2017) - 2015
- [c2]Srimanta Bhattacharya:
Derandomized Construction of Combinatorial Batch Codes. FCT 2015: 269-282 - [i3]Srimanta Bhattacharya:
Derandomized Construction of Combinatorial Batch Codes. CoRR abs/1502.02472 (2015) - 2014
- [j2]Niranjan Balachandran, Srimanta Bhattacharya:
On an extremal hypergraph problem related to combinatorial batch codes. Discret. Appl. Math. 162: 373-380 (2014) - 2012
- [j1]Srimanta Bhattacharya, Sushmita Ruj, Bimal K. Roy:
Combinatorial batch codes: A lower bound and optimal constructions. Adv. Math. Commun. 6(2): 165-174 (2012) - [c1]Sumanta Sarkar, Srimanta Bhattacharya, Ayça Çesmelioglu:
On Some Permutation Binomials of the Form $x^{\frac{2^n-1}{k}+1} +ax$ over $\mathbb{F}_{2^n}$ : Existence and Count. WAIFI 2012: 236-246 - [i2]Niranjan Balachandran, Srimanta Bhattacharya:
Note on an Extremal Hypergraph Problem Related to Combinatorial Batch Codes. CoRR abs/1206.1996 (2012) - 2011
- [i1]Srimanta Bhattacharya, Sushmita Ruj, Bimal K. Roy:
Combinatorial Batch Codes: A Lower Bound and Optimal Constructions. CoRR abs/1102.4951 (2011)
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-04-24 22:59 CEST 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:
