Performance of Graph-based Zero-knowledge Proofs Çizge Bazli Sifir Bilgi Ispati Yöntemlerinin Başarimi

Gercel D., Kayabas H., EKMEKCİ K., Onur C. B., ONUR E.

30th Signal Processing and Communications Applications Conference, SIU 2022, Safranbolu, Türkiye, 15 - 18 Mayıs 2022 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/siu55565.2022.9864952
  • Basıldığı Şehir: Safranbolu
  • Basıldığı Ülke: Türkiye
  • Anahtar Kelimeler: difficult graph problems, zero-knowledge proof
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.