Muhammed F. Esgin
Orcid: 0000-0003-1650-3748
According to our database1,
Muhammed F. Esgin
authored at least 30 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
4
1
7
3
3
4
1
2
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
DualRing-PRF: Post-Quantum (Linkable) Ring Signatures from Legendre and Power Residue PRFs.
IACR Cryptol. ePrint Arch., 2024
Loquat: A SNARK-Friendly Post-Quantum Signature based on the Legendre PRF with Applications in Ring and Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2024
LeOPaRd: Towards Practical Post-Quantum Oblivious PRFs via Interactive Lattice Problems.
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
LUNA: Quasi-Optimally Succinct Designated-Verifier Zero-Knowledge Arguments from Lattices.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 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
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
IACR Cryptol. ePrint Arch., 2022
A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum.
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
A Survey on Exotic Signatures for Post-Quantum Blockchain: Challenges & Research Directions.
IACR Cryptol. ePrint Arch., 2022
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022
2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
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
IACR Cryptol. ePrint Arch., 2020
2019
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
IACR Cryptol. ePrint Arch., 2018
2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
2014
Proceedings of the BIOSIG 2014, 2014