![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Miraz Uz Zaman"
@inproceedings{DBLP:conf/globecom/ZamanM23, author = {Miraz Uz Zaman and Manki Min}, title = {Supersingular Isogeny-Based Single Compression Cryptographic Hash Function}, booktitle = {{IEEE} Global Communications Conference, {GLOBECOM} 2023, Kuala Lumpur, Malaysia, December 4-8, 2023}, pages = {4479--4484}, publisher = {{IEEE}}, year = {2023}, url = {https://doi.org/10.1109/GLOBECOM54140.2023.10437751}, doi = {10.1109/GLOBECOM54140.2023.10437751}, timestamp = {Sun, 10 Mar 2024 10:39:12 +0100}, biburl = {https://dblp.org/rec/conf/globecom/ZamanM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wicon/ZamanHM22, author = {Miraz Uz Zaman and Aaron Hutchinson and Manki Min}, editor = {Zygmunt J. Haas and Ravi Prakash and Habib M. Ammari and Weili Wu}, title = {Implementation Aspects of Supersingular Isogeny-Based Cryptographic Hash Function}, booktitle = {Wireless Internet - 15th {EAI} International Conference, WiCON 2022, Virtual Event, November 2022, Proceedings}, series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering}, volume = {464}, pages = {14--27}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-27041-3\_2}, doi = {10.1007/978-3-031-27041-3\_2}, timestamp = {Tue, 25 Jul 2023 08:39:12 +0200}, biburl = {https://dblp.org/rec/conf/wicon/ZamanHM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isncc/ZamanM20, author = {Miraz Uz Zaman and Manki Min}, title = {Decentrally-Consented-Server-Based Blockchain System for Universal Types of Data}, booktitle = {2020 International Symposium on Networks, Computers and Communications, {ISNCC} 2020, Montreal, QC, Canada, October 20-22, 2020}, pages = {1--6}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ISNCC49221.2020.9297229}, doi = {10.1109/ISNCC49221.2020.9297229}, timestamp = {Fri, 15 Jan 2021 09:21:28 +0100}, biburl = {https://dblp.org/rec/conf/isncc/ZamanM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ccnc/ZamanSM19, author = {Miraz Uz Zaman and Tong Shen and Manki Min}, title = {Proof of Sincerity: {A} New Lightweight Consensus Approach for Mobile Blockchains}, booktitle = {16th {IEEE} Annual Consumer Communications {\&} Networking Conference, {CCNC} 2019, Las Vegas, NV, USA, January 11-14, 2019}, pages = {1--4}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/CCNC.2019.8651742}, doi = {10.1109/CCNC.2019.8651742}, timestamp = {Wed, 16 Oct 2019 14:14:49 +0200}, biburl = {https://dblp.org/rec/conf/ccnc/ZamanSM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/syscon/ZamanSM19, author = {Miraz Uz Zaman and Tong Shen and Manki Min}, title = {Hash Vine: {A} New Hash Structure for Scalable Generation of Hierarchical Hash Codes}, booktitle = {2019 {IEEE} International Systems Conference, SysCon 2019, Orlando, FL, USA, April 8-11, 2019}, pages = {1--6}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/SYSCON.2019.8836921}, doi = {10.1109/SYSCON.2019.8836921}, timestamp = {Wed, 16 Oct 2019 14:14:52 +0200}, biburl = {https://dblp.org/rec/conf/syscon/ZamanSM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.org/img/cog.dark.24x24.png)
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.