![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Kaushik Chakraborty 0001
Person information
- affiliation: TU Delft, The Netherlands
- affiliation (former): INRIA, Paris, France
- affiliation (PhD 2017): Pierre and Marie Curie University, Paris, France
Other persons with the same name
- Kaushik Chakraborty — disambiguation page
- Kaushik Chakraborty 0002 — Qualcomm Inc., San Diego, CA, USA (and 2 more)
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c3]Jyotirmoy Basak
, Kaushik Chakraborty, Arpita Maitra, Subhamoy Maitra:
A Proposal for Device Independent Probabilistic Quantum Oblivious Transfer. INDOCRYPT 2022: 541-565
2010 – 2019
- 2017
- [b1]Kaushik Chakraborty:
Cryptography with Spacetime Constraints. (Cryptographie avec des contraintes spatio-temporelles). Pierre and Marie Curie University, Paris, France, 2017 - [j3]Kaushik Chakraborty
, Sumanta Sarkar, Subhamoy Maitra, Bodhisatwa Mazumdar, Debdeep Mukhopadhyay, Emmanuel Prouff:
Redefining the transparency order. Des. Codes Cryptogr. 82(1-2): 95-115 (2017) - 2016
- [j2]Kaushik Chakraborty, Subhamoy Maitra:
Application of Grover's algorithm to check non-resiliency of a Boolean function. Cryptogr. Commun. 8(3): 401-413 (2016) - [i5]Kaushik Chakraborty, André Chailloux, Anthony Leverrier:
Robust Relativistic Bit Commitment. CoRR abs/1608.03398 (2016) - 2015
- [i4]Kaushik Chakraborty, André Chailloux, Anthony Leverrier:
Arbitrarily long relativistic bit commitment. CoRR abs/1507.00239 (2015) - 2014
- [j1]Kaushik Chakraborty, Byung-Soo Choi, Arpita Maitra, Subhamoy Maitra:
Efficient quantum algorithms to construct arbitrary Dicke states. Quantum Inf. Process. 13(9): 2049-2069 (2014) - [c2]Sumanta Sarkar, Subhamoy Maitra, Kaushik Chakraborty:
Differential Power Analysis in Hamming Weight Model: How to Choose among (Extended) Affine Equivalent S-boxes. INDOCRYPT 2014: 360-373 - [i3]Kaushik Chakraborty, Subhamoy Maitra, Sumanta Sarkar, Bodhisatwa Mazumdar, Debdeep Mukhopadhyay:
Redefining the Transparency Order. IACR Cryptol. ePrint Arch. 2014: 367 (2014) - 2013
- [i2]Kaushik Chakraborty, Subhamoy Maitra:
Quantum algorithm to check Resiliency of a Boolean function. IACR Cryptol. ePrint Arch. 2013: 232 (2013) - 2012
- [c1]Kaushik Chakraborty, Dipanwita Roy Chowdhury:
CSHR: Selection of Cryptographically Suitable Hybrid Cellular Automata Rule. ACRI 2012: 591-600 - [i1]Kaushik Chakraborty, Byung-Soo Choi, Arpita Maitra, Subhamoy Maitra:
Efficient quantum algorithm to construct arbitrary Dicke states. CoRR abs/1209.5932 (2012)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-14 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint