default search action
Muhammed F. Esgin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c22]Xinyu Zhang, Ron Steinfeld, Joseph K. Liu, Muhammed F. Esgin, Dongxi Liu, Sushmita Ruj:
DualRing-PRF: Post-quantum (Linkable) Ring Signatures from Legendre and Power Residue PRFs. ACISP (2) 2024: 124-143 - [c21]Ron Steinfeld, Amin Sakzad, Muhammed F. Esgin, Veronika Kuchta, Mert Yassi, Raymond K. Zhao:
LUNA: Quasi-Optimally Succinct Designated-Verifier Zero-Knowledge Arguments from Lattices. CCS 2024: 3167-3181 - [c20]Xinyu Zhang
, Ron Steinfeld
Loquat: A SNARK-Friendly Post-quantum Signature Based on the Legendre PRF with Applications in Ring and Aggregate Signatures. CRYPTO (1) 2024: 3-38 - [c19]Muhammed F. Esgin, Thomas Espitau, Guilhem Niot
Plover: Masking-Friendly Hash-and-Sign Lattice Signatures. EUROCRYPT (6) 2024: 316-345 - [i24]Muhammed F. Esgin, Thomas Espitau, Guilhem Niot
Plover: Masking-Friendly Hash-and-Sign Lattice Signatures. IACR Cryptol. ePrint Arch. 2024: 401 (2024) - [i23]Xinyu Zhang, Ron Steinfeld, Muhammed F. Esgin, Joseph K. Liu, Dongxi Liu, Sushmita Ruj:
Loquat: A SNARK-Friendly Post-Quantum Signature based on the Legendre PRF with Applications in Ring and Aggregate Signatures. IACR Cryptol. ePrint Arch. 2024: 868 (2024) - [i22]Xinyu Zhang, Ron Steinfeld, Joseph K. Liu, Muhammed F. Esgin, Dongxi Liu, Sushmita Ruj:
DualRing-PRF: Post-Quantum (Linkable) Ring Signatures from Legendre and Power Residue PRFs. IACR Cryptol. ePrint Arch. 2024: 985 (2024) - [i21]Muhammed F. Esgin, Ron Steinfeld, Erkan Tairi, Jie Xu:
LeOPaRd: Towards Practical Post-Quantum Oblivious PRFs via Interactive Lattice Problems. IACR Cryptol. ePrint Arch. 2024: 1615 (2024) - 2023
- [j2]Maxime Buser
A Survey on Exotic Signatures for Post-quantum Blockchain: Challenges and Research Directions. ACM Comput. Surv. 55(12): 251:1-251:32 (2023) - [c18]Muhammed F. Esgin
A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum. AsiaCCS 2023: 623-637 - [c17]Muhammed F. Esgin, Ron Steinfeld, Dongxi Liu, Sushmita Ruj:
Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs. CRYPTO (5) 2023: 484-517 - [c16]Xianrui Qin, Shimin Pan
BlindHub: Bitcoin-Compatible Privacy-Preserving Payment Channel Hubs Supporting Variable Amounts. SP 2023: 2462-2480 - 2022
- [c15]Xiaohui Ding, Muhammed F. Esgin, Amin Sakzad, Ron Steinfeld:
An Injectivity Analysis of Crystals-Kyber and Implications on Quantum Security. ACISP 2022: 332-351 - [c14]Maxime Buser, Rafael Dowsley, Muhammed F. Esgin, Shabnam Kasra Kermanshahi
Post-Quantum Verifiable Random Function from Symmetric Primitives in PoS Blockchain. ESORICS (1) 2022: 25-45 - [c13]Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao
Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications. Public Key Cryptography (1) 2022: 317-348 - [c12]Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao
MatRiCT+: More Efficient Post-Quantum Private Blockchain Payments. SP 2022: 1281-1298 - [i20]Muhammed F. Esgin, Ron Steinfeld, Dongxi Liu, Sushmita Ruj:
Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs. IACR Cryptol. ePrint Arch. 2022: 141 (2022) - [i19]Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao:
Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications. IACR Cryptol. ePrint Arch. 2022: 142 (2022) - [i18]Muhammed F. Esgin, Oguzhan Ersoy, Veronika Kuchta
A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum. IACR Cryptol. ePrint Arch. 2022: 993 (2022) - [i17]Maxime Buser, Rafael Dowsley, Muhammed F. Esgin, Clémentine Gritti, Shabnam Kasra Kermanshahi, Veronika Kuchta
A Survey on Exotic Signatures for Post-Quantum Blockchain: Challenges & Research Directions. IACR Cryptol. ePrint Arch. 2022: 1151 (2022) - [i16]Ron Steinfeld, Amin Sakzad, Muhammed F. Esgin, Veronika Kuchta
Private Re-Randomization for Module LWE and Applications to Quasi-Optimal ZK-SNARKs. IACR Cryptol. ePrint Arch. 2022: 1690 (2022) - [i15]Xianrui Qin, Shimin Pan, Arash Mirzaei, Zhimei Sui, Oguzhan Ersoy, Amin Sakzad, Muhammed F. Esgin, Joseph K. Liu, Jiangshan Yu, Tsz Hon Yuen:
BlindHub: Bitcoin-Compatible Privacy-Preserving Payment Channel Hubs Supporting Variable Amounts. IACR Cryptol. ePrint Arch. 2022: 1735 (2022) - [i14]Xiaohui Ding, Muhammed F. Esgin, Amin Sakzad, Ron Steinfeld:
An Injectivity Analysis of CRYSTALS-Kyber and Implications on Quantum Security. IACR Cryptol. ePrint Arch. 2022: 1757 (2022) - 2021
- [c11]Tsz Hon Yuen
DualRing: Generic Construction of Ring Signatures with Efficient Instantiations. CRYPTO (1) 2021: 251-281 - [c10]Muhammed F. Esgin, Veronika Kuchta
Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand. Financial Cryptography (2) 2021: 560-578 - [i13]Maxime Buser, Rafael Dowsley, Muhammed F. Esgin, Shabnam Kasra Kermanshahi
Post-Quantum Verifiable Random Function from Symmetric Primitives in PoS Blockchain. IACR Cryptol. ePrint Arch. 2021: 302 (2021) - [i12]Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao:
MatRiCT+: More Efficient Post-Quantum Private Blockchain Payments. IACR Cryptol. ePrint Arch. 2021: 545 (2021) - [i11]Tsz Hon Yuen, Muhammed F. Esgin, Joseph K. Liu, Man Ho Au, Zhimin Ding:
DualRing: Generic Construction of Ring Signatures with Efficient Instantiations. IACR Cryptol. ePrint Arch. 2021: 1213 (2021) - 2020
- [b1]Muhammed F. Esgin:
Practice-Oriented Techniques in Lattice-Based Cryptography. Monash University, Australia, 2020 - [c9]Muhammed F. Esgin, Ngoc Khanh Nguyen, Gregor Seiler:
Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. ASIACRYPT (2) 2020: 259-288 - [c8]Muhammed F. Esgin, Oguzhan Ersoy, Zekeriya Erkin
Post-Quantum Adaptor Signatures and Payment Channel Networks. ESORICS (2) 2020: 378-397 - [c7]Tsz Hon Yuen
RingCT 3.0 for Blockchain Confidential Transaction: Shorter Size and Stronger Security. Financial Cryptography 2020: 464-483 - [i10]Orhun Kara, Muhammed F. Esgin:
On Analysis of Lightweight Stream Ciphers with Keyed Update. IACR Cryptol. ePrint Arch. 2020: 46 (2020) - [i9]Muhammed F. Esgin, Ngoc Khanh Nguyen
Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. IACR Cryptol. ePrint Arch. 2020: 518 (2020) - [i8]Muhammed F. Esgin, Oguzhan Ersoy, Zekeriya Erkin:
Post-Quantum Adaptor Signatures and Payment Channel Networks. IACR Cryptol. ePrint Arch. 2020: 845 (2020) - [i7]Muhammed F. Esgin, Veronika Kuchta
Practical Post-Quantum Few-Time Verifiable Random Function with Applications to Algorand. IACR Cryptol. ePrint Arch. 2020: 1222 (2020)
2010 – 2019
- 2019
- [j1]Orhun Kara
On Analysis of Lightweight Stream Ciphers with Keyed Update. IEEE Trans. Computers 68(1): 99-110 (2019) - [c6]Muhammed F. Esgin, Ron Steinfeld, Amin Sakzad
Short Lattice-Based One-out-of-Many Proofs and Applications to Ring Signatures. ACNS 2019: 67-88 - [c5]Muhammed F. Esgin, Raymond K. Zhao
MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol. CCS 2019: 567-584 - [c4]Muhammed F. Esgin, Ron Steinfeld, Joseph K. Liu, Dongxi Liu:
Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications. CRYPTO (1) 2019: 115-146 - [i6]Muhammed F. Esgin, Ron Steinfeld, Joseph K. Liu, Dongxi Liu:
Lattice-based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications. IACR Cryptol. ePrint Arch. 2019: 445 (2019) - [i5]Tsz Hon Yuen, Shifeng Sun, Joseph K. Liu, Man Ho Au, Muhammed F. Esgin, Qingzhao Zhang, Dawu Gu:
RingCT 3.0 for Blockchain Confidential Transaction: Shorter Size and Stronger Security. IACR Cryptol. ePrint Arch. 2019: 508 (2019) - [i4]Muhammed F. Esgin, Raymond K. Zhao, Ron Steinfeld, Joseph K. Liu, Dongxi Liu:
MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol. IACR Cryptol. ePrint Arch. 2019: 1287 (2019) - 2018
- [i3]Muhammed F. Esgin, Ron Steinfeld, Amin Sakzad, Joseph K. Liu, Dongxi Liu:
Short Lattice-based One-out-of-Many Proofs and Applications to Ring Signatures. IACR Cryptol. ePrint Arch. 2018: 773 (2018) - 2015
- [c3]Muhammed F. Esgin, Mehmet Sabir Kiraz
A New Partial Key Exposure Attack on Multi-power RSA. CAI 2015: 103-114 - [c2]Muhammed F. Esgin, Orhun Kara
Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks. SAC 2015: 67-85 - [i2]Muhammed F. Esgin, Orhun Kara:
Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks. IACR Cryptol. ePrint Arch. 2015: 289 (2015) - [i1]Muhammed F. Esgin, Mehmet S. Kiraz, Osmanbey Uzunkol:
A New Partial Key Exposure Attack on Multi-power RSA. IACR Cryptol. ePrint Arch. 2015: 642 (2015) - 2014
- [c1]Naciye Çelenli, Kamile N. Sevis, Muhammed F. Esgin, Kemal Altundag, Umut Uludag:
An unconstrained Activity Recognition Method using Smart Phones. BIOSIG 2014: 219-226
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-12-11 20:46 CET 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: