Dipayan Das

Orcid: 0000-0002-7681-1868

Affiliations:
  • NTT Corporation, Tokyo, Japan
  • CISPA Helmholtz Center for Information Security, Saarbrücken, Germany (former)
  • National Institute of Technology, Department of Mathematics, Durgapur, India (former)


According to our database1, Dipayan Das authored at least 11 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Key Recovery Attack on the Partial Vandermonde Knapsack Problem.
IACR Cryptol. ePrint Arch., 2024

2022
Fiat-Shamir signatures without aborts using Ring-and-Noise assumptions.
IACR Cryptol. ePrint Arch., 2022

On the Hardness of the Finite Field Isomorphism Problem.
IACR Cryptol. ePrint Arch., 2022

2020
Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems.
IET Inf. Secur., 2020

MPSign: A Signature from Small-Secret Middle-Product Learning with Errors.
IACR Cryptol. ePrint Arch., 2020

Modular lattice signatures, revisited.
Des. Codes Cryptogr., 2020

Fiat-Shamir with Aborts: From Identification Schemes to Linkable Ring Signatures.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2020

2019
Middle-Product Learning with Rounding Problem and its Applications.
IACR Cryptol. ePrint Arch., 2019

Ring Signatures Based on Middle-Product Learning with Errors Problems.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2019, 2019

2018
A Novel Lattice Reduction Algorithm.
Proceedings of the 15th International Joint Conference on e-Business and Telecommunications, 2018

Compact Lattice Signatures.
Proceedings of the 15th International Joint Conference on e-Business and Telecommunications, 2018


  Loading...