Incomplete Hypercube-based Algorithms for Privacy-Preserving Data Aggregation Using Zero-Knowledge Proofs
6th International Conference on Blockchain Computing and Applications, BCCA 2024, Dubai, Birleşik Arap Emirlikleri, 26 - 29 Kasım 2024, ss.519-524, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Doi Numarası: 10.1109/bcca62388.2024.10844390
- Basıldığı Şehir: Dubai
- Basıldığı Ülke: Birleşik Arap Emirlikleri
- Sayfa Sayıları: ss.519-524
- Anahtar Kelimeler: blockchain, privacy, hypercube, secure multi-party computation, zero-knowledge proof
- Boğaziçi Üniversitesi Adresli: Evet
Özet
The privacy-preserving data aggregation is a challenging task in decentralized networks (e.g. blockchain) where multiple distinct contributors need to collaborate in order to perform a shared task (e.g. arithmetic operations) by preserving the privacy of each individual data. The existing protocols for the privacy-preserving data aggregation in the literature may require the fully-complete hypercubes over the Ethereum blockchain where it supports limited number of contributors at a certain time (i.e. exactly 2k nodes in k-dimension). Therefore, we theoretically analyze the security of such protocols from the perspective of underdetermined systems and identify the potential root problem so that any arbitrary number of nodes could be supported. For this problem, we propose three novel decentralized techniques (i.e. node multiplexing, topological recursing and data splitting) by comparing their relative advantages and disadvantages.