Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Performance of Graph-based Zero-knowledge Proofs Çizge Bazli Sifir Bilgi Ispati Yöntemlerinin Başarimi
Date
2022-01-01
Author
Gercel, Doruk
Kayabas, Helin
Ekmekci, Kadir
Onur, Cansu Betin
Onur, Ertan
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
7
views
0
downloads
Cite This
Zero-knowledge proofs (ZKP) are a widely used technology for privacy protection and data ownership that allows parties to verify the accuracy of a piece of information without sharing the data. In this study, we developed and performance tested two graph-based zero-knowledge proof methods, the Hamilton Cycle Based ZKP Algorithm (ZKPHC) and the Graph Isomorphism Based ZKP Algorithm (ZKPGI), using an open source library. As the graph sizes increased, we measured and compared the running times of these methods. We tested the completeness and robustness of the ZKPHC protocol for different modes. As the graph used grows, the ZKPHC method, which uses encryption at every stage, works much slower than ZKPGI.
Subject Keywords
difficult graph problems
,
zero-knowledge proof
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85138682530&origin=inward
https://hdl.handle.net/11511/107285
DOI
https://doi.org/10.1109/siu55565.2022.9864952
Conference Name
30th Signal Processing and Communications Applications Conference, SIU 2022
Collections
Department of Computer Engineering, Conference / Seminar
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
D. Gercel, H. Kayabas, K. Ekmekci, C. B. Onur, and E. Onur, “Performance of Graph-based Zero-knowledge Proofs Çizge Bazli Sifir Bilgi Ispati Yöntemlerinin Başarimi,” presented at the 30th Signal Processing and Communications Applications Conference, SIU 2022, Safranbolu, Türkiye, 2022, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85138682530&origin=inward.