default search action
Poulami Das 0003
Person information
- affiliation: Technische Universität Darmstadt, Germany
- affiliation (former): Indian Institute of Technology Kharagpur, India
Other persons with the same name
- Poulami Das 0001 — Heritage Institute of Technology, Kolkata, India
- Poulami Das 0002 — JIS College of Engineering, Kalyani, West Bengal, India
- Poulami Das 0004 — Jadavpur University, Department of Computer Science and Engineering, India
- Poulami Das 0005
— Georgia Institute of Technology, Atlanta, GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Poulami Das
Efficient Post-Quantum Secure Deterministic Threshold Wallets from Isogenies. AsiaCCS 2024 - [c12]Poulami Das, Lisa Eckey, Sebastian Faust, Julian Loss, Monosij Maitra:
Round Efficient Byzantine Agreement from VDFs. SCN (1) 2024: 139-160 - [c11]Poulami Das, Andreas Erwig, Sebastian Faust:
Shared-Custodial Password-Authenticated Deterministic Wallets. SCN (2) 2024: 338-359 - [i11]Poulami Das, Andreas Erwig, Sebastian Faust:
Shared-Custodial Password-Authenticated Deterministic Wallets. IACR Cryptol. ePrint Arch. 2024: 1118 (2024) - 2023
- [b1]Poulami Das:
Secure Infrastructures in the Realm of Decentralization. Technical University of Darmstadt, Germany, 2023 - [i10]Poulami Das, Andreas Erwig, Sebastian Faust, Julian Loss, Siavash Riahi:
BIP32-Compatible Threshold Wallets. IACR Cryptol. ePrint Arch. 2023: 312 (2023) - [i9]Poulami Das, Andreas Erwig, Michael Meyer, Patrick Struck:
Efficient Post-Quantum Secure Deterministic Threshold Wallets from Isogenies. IACR Cryptol. ePrint Arch. 2023: 1915 (2023) - 2022
- [c10]Poulami Das, Julia Hesse
DPaSE: Distributed Password-Authenticated Symmetric-Key Encryption, or How to Get Many Keys from One Password. AsiaCCS 2022: 682-696 - [i8]Poulami Das, Lisa Eckey, Sebastian Faust, Julian Loss, Monosij Maitra:
Round Efficient Byzantine Agreement from VDFs. IACR Cryptol. ePrint Arch. 2022: 823 (2022) - 2021
- [c9]Poulami Das, Andreas Erwig, Sebastian Faust, Julian Loss, Siavash Riahi:
The Exact Security of BIP32 Wallets. CCS 2021: 1020-1042 - [i7]Poulami Das, Andreas Erwig, Sebastian Faust, Julian Loss, Siavash Riahi:
The Exact Security of BIP32 Wallets. IACR Cryptol. ePrint Arch. 2021: 1287 (2021) - 2020
- [c8]Nabil Alkeilani Alkadri
Deterministic Wallets in a Quantum World. CCS 2020: 1017-1031 - [i6]Nabil Alkeilani Alkadri, Poulami Das, Andreas Erwig, Sebastian Faust, Juliane Krämer, Siavash Riahi, Patrick Struck:
Deterministic Wallets in a Quantum World. IACR Cryptol. ePrint Arch. 2020: 1149 (2020) - [i5]Poulami Das, Julia Hesse, Anja Lehmann:
DPaSE: Distributed Password-Authenticated Symmetric Encryption. IACR Cryptol. ePrint Arch. 2020: 1443 (2020)
2010 – 2019
- 2019
- [j1]Poulami Das
Automatic generation of HCCA-resistant scalar multiplication algorithm by proper sequencing of field multiplier operands. J. Cryptogr. Eng. 9(3): 263-275 (2019) - [c7]Poulami Das, Sebastian Faust, Julian Loss:
A Formal Treatment of Deterministic Wallets. CCS 2019: 651-668 - [c6]Poulami Das, Lisa Eckey, Tommaso Frassetto, David Gens, Kristina Hostáková, Patrick Jauernig, Sebastian Faust, Ahmad-Reza Sadeghi:
FastKitten: Practical Smart Contracts on Bitcoin. USENIX Security Symposium 2019: 801-818 - [i4]Poulami Das, Lisa Eckey, Tommaso Frassetto, David Gens, Kristina Hostáková, Patrick Jauernig, Sebastian Faust, Ahmad-Reza Sadeghi:
FastKitten: Practical Smart Contracts on Bitcoin. IACR Cryptol. ePrint Arch. 2019: 154 (2019) - [i3]Poulami Das, Sebastian Faust, Julian Loss:
A Formal Treatment of Deterministic Wallets. IACR Cryptol. ePrint Arch. 2019: 698 (2019) - 2017
- [c5]Poulami Das, Debapriya Basu Roy, Debdeep Mukhopadhyay:
Automatic Generation of HCCA Resistant Scalar Multiplication Algorithm by Proper Sequencing of Field Multiplier Operands. PROOFS 2017: 33-49 - 2016
- [c4]Poulami Das, Debapriya Basu Roy, Debdeep Mukhopadhyay:
Improved Atomicity to Prevent HCCA on NIST Curves. AsiaPKC@AsiaCCS 2016: 21-30 - [c3]Poulami Das, Debapriya Basu Roy, Harishma Boyapally, Debdeep Mukhopadhyay:
Inner collisions in ECC: Vulnerabilities of complete addition formulas for NIST curves. AsianHOST 2016: 1-6 - [c2]Poulami Das, Debapriya Basu Roy, Debdeep Mukhopadhyay:
Secure public key hardware for IoT applications. MWSCAS 2016: 1-4 - 2015
- [c1]Debapriya Basu Roy, Poulami Das, Debdeep Mukhopadhyay:
ECC on Your Fingertips: A Single Instruction Approach for Lightweight ECC Design in GF(p). SAC 2015: 161-177 - [i2]Poulami Das, Debapriya Basu Roy, Debdeep Mukhopadhyay:
Exploiting the Order of Multiplier Operands: A Low Cost Approach for HCCA Resistance. IACR Cryptol. ePrint Arch. 2015: 925 (2015) - [i1]Debapriya Basu Roy, Poulami Das, Debdeep Mukhopadhyay:
ECC on Your Fingertips: A Single Instruction Approach for Lightweight ECC Design in GF (p). IACR Cryptol. ePrint Arch. 2015: 1225 (2015)
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-10-07 21:23 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: