DSCS: Towards an Extensible Secure Decentralised Distributed Computation Protocol

This paper documents DSCS, a privacy preserving distributed computation protocol with native support for homomorphic encryption. The protocol is easily extensible with advanced cryptographic constructions due to a program encoding with a bijective map to arithmetic circuits. Arithmetic circuits are...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2024 IEEE International Conference on Cyber Security and Resilience (CSR) s. 658 - 663
Hlavní autoři: Dalton, Alexander, Thomas, David, Cheung, Peter
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 02.09.2024
Témata:
Circuits
Cryptography
Encoding
Homomorphic encryption
Performance evaluation
Privacy
Protocols
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper documents DSCS, a privacy preserving distributed computation protocol with native support for homomorphic encryption. The protocol is easily extensible with advanced cryptographic constructions due to a program encoding with a bijective map to arithmetic circuits. Arithmetic circuits are a common mechanism for abstract computation, and are widely used by advanced cryptographic constructions, such as homomorphic encryption and verifiable computation. This paper documents foundational work exploring the validity of an arithmetic circuit based approach to distributed computation. Ultimately, the direct use of arithmetic circuits as a computational substrate for distributed computation is shown to carry an untenable bandwidth cost, even under ideal network conditions. Importantly, this paper highlights a slew of low hanging fruit for further research in this domain, as well as guidance to avoid easy pitfalls.
DOI:10.1109/CSR61664.2024.10679478