Muhammed F. Esgin

Orcid: 0000-0003-1650-3748

According to our database1, Muhammed F. Esgin authored at least 26 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Plover: Masking-Friendly Hash-and-Sign Lattice Signatures.
IACR Cryptol. ePrint Arch., 2024

2023
A Survey on Exotic Signatures for Post-quantum Blockchain: Challenges and Research Directions.
ACM Comput. Surv., December, 2023

A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum.
Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, 2023

2022
Private Re-Randomization for Module LWE and Applications to Quasi-Optimal ZK-SNARKs.
IACR Cryptol. ePrint Arch., 2022

BlindHub: Bitcoin-Compatible Privacy-Preserving Payment Channel Hubs Supporting Variable Amounts.
IACR Cryptol. ePrint Arch., 2022

Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications.
IACR Cryptol. ePrint Arch., 2022

Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs.
IACR Cryptol. ePrint Arch., 2022

A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum.
IACR Cryptol. ePrint Arch., 2022

An Injectivity Analysis of CRYSTALS-Kyber and Implications on Quantum Security.
IACR Cryptol. ePrint Arch., 2022

A Survey on Exotic Signatures for Post-Quantum Blockchain: Challenges & Research Directions.
IACR Cryptol. ePrint Arch., 2022

MatRiCT<sup>+</sup>: More Efficient Post-Quantum Private Blockchain Payments.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

2021
DualRing: Generic Construction of Ring Signatures with Efficient Instantiations.
IACR Cryptol. ePrint Arch., 2021

MatRiCT+: More Efficient Post-Quantum Private Blockchain Payments.
IACR Cryptol. ePrint Arch., 2021

Post-Quantum Verifiable Random Function from Symmetric Primitives in PoS Blockchain.
IACR Cryptol. ePrint Arch., 2021

2020
Practice-Oriented Techniques in Lattice-Based Cryptography.
PhD thesis, 2020

Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings.
IACR Cryptol. ePrint Arch., 2020

Practical Post-Quantum Few-Time Verifiable Random Function with Applications to Algorand.
IACR Cryptol. ePrint Arch., 2020

Post-Quantum Adaptor Signatures and Payment Channel Networks.
IACR Cryptol. ePrint Arch., 2020

2019
On Analysis of Lightweight Stream Ciphers with Keyed Update.
IEEE Trans. Computers, 2019

RingCT 3.0 for Blockchain Confidential Transaction: Shorter Size and Stronger Security.
IACR Cryptol. ePrint Arch., 2019

MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol.
IACR Cryptol. ePrint Arch., 2019

Lattice-based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications.
IACR Cryptol. ePrint Arch., 2019

2018
Short Lattice-based One-out-of-Many Proofs and Applications to Ring Signatures.
IACR Cryptol. ePrint Arch., 2018

2015
A New Partial Key Exposure Attack on Multi-power RSA.
IACR Cryptol. ePrint Arch., 2015

Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks.
IACR Cryptol. ePrint Arch., 2015

2014
An unconstrained Activity Recognition Method using Smart Phones.
Proceedings of the BIOSIG 2014, 2014


  Loading...