default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDipayan Das 0001
Person information
- affiliation: NTT Corporation, Tokyo, Japan
- affiliation (former): CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
- affiliation (former): National Institute of Technology, Department of Mathematics, Durgapur, India
Other persons with the same name
- Dipayan Das 0002 — University of Oxford, UK
- Dipayan Das 0003 — University of Tulsa, OK, USA
- Dipayan Das 0004
![[0000-0001-8593-8759]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-8593-8759")
— National Institute of Technology, Department of Electronics and Communication Engineering, Durgapur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Dipayan Das, Antoine Joux:
Key Recovery Attack on the Partial Vandermonde Knapsack Problem. EUROCRYPT (6) 2024: 205-225- [i6]Dipayan Das, Antoine Joux:
Key Recovery Attack on the Partial Vandermonde Knapsack Problem. IACR Cryptol. ePrint Arch. 2024: 366 (2024) - 2023
- [c7]Dipayan Das, Antoine Joux:
On the Hardness of the Finite Field Isomorphism Problem. EUROCRYPT (5) 2023: 343-359 - 2022
- [i5]Dipayan Das, Antoine Joux, Anand Kumar Narayanan:
Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions. IACR Cryptol. ePrint Arch. 2022: 205 (2022) - [i4]Dipayan Das, Antoine Joux:
On the Hardness of the Finite Field Isomorphism Problem. IACR Cryptol. ePrint Arch. 2022: 998 (2022) - 2020
- [j2]Dipayan Das, Jeffrey Hoffstein, Jill Pipher, William Whyte, Zhenfei Zhang:
Modular lattice signatures, revisited. Des. Codes Cryptogr. 88(3): 505-532 (2020) - [j1]Dipayan Das, Vishal Saraswat, Kajla Basu:
Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems. IET Inf. Secur. 14(5): 496-504 (2020) - [c6]Shi Bai, Dipayan Das, Ryo Hiromasa, Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Zhenfei Zhang:
MPSign: A Signature from Small-Secret Middle-Product Learning with Errors. Public Key Cryptography (2) 2020: 66-93 - [c5]Dipayan Das:
Fiat-Shamir with Aborts: From Identification Schemes to Linkable Ring Signatures. SPACE 2020: 167-187 - [i3]Shi Bai, Dipayan Das, Ryo Hiromasa, Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Zhenfei Zhang:
MPSign: A Signature from Small-Secret Middle-Product Learning with Errors. IACR Cryptol. ePrint Arch. 2020: 198 (2020)
2010 – 2019
- 2019
- [c4]Dipayan Das, Man Ho Au, Zhenfei Zhang:
Ring Signatures Based on Middle-Product Learning with Errors Problems. AFRICACRYPT 2019: 139-156 - [c3]Shi Bai, Katharina Boudgoust, Dipayan Das, Adeline Roux-Langlois, Weiqiang Wen, Zhenfei Zhang:
Middle-Product Learning with Rounding Problem and Its Applications. ASIACRYPT (1) 2019: 55-81 - [i2]Shi Bai, Katharina Boudgoust, Dipayan Das, Adeline Roux-Langlois, Weiqiang Wen, Zhenfei Zhang:
Middle-Product Learning with Rounding Problem and its Applications. IACR Cryptol. ePrint Arch. 2019: 1001 (2019) - [i1]Dipayan Das, Jeffrey Hoffstein, Jill Pipher, William Whyte, Zhenfei Zhang:
Modular lattice signatures, revisited. IACR Cryptol. ePrint Arch. 2019: 1301 (2019) - 2018
- [c2]Dipayan Das, Vishal Saraswat:
Compact Lattice Signatures. ICETE (2) 2018: 656-661 - [c1]Dipayan Das, Vishal Saraswat:
A Novel Lattice Reduction Algorithm. ICETE (2) 2018: 662-667
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-05-19 01:01 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:
