Abstract | ||
---|---|---|
Driven by the increased consciousness in data ownership and privacy, zero-knowledge proofs (ZKPs) have become a popular tool to convince a third party of the truthfulness of a statement without disclosing any further information. As ZKPs are rather complex to design, frameworks that transform high-level languages into ZKPs have been proposed. We propose Circuitree, a Datalog reasoner in zero-knowledge. Datalog is a high-level declarative logic language that is generally used for querying. Furthermore, as a logic language, it can also be used to solve logic problems. An application using Circuitree can efficiently generate ZKPs, based on Datalog rules and encrypted data, to prove that a certain conclusion follows from a Datalog ruleset and encrypted input data. Compared to existing frameworks, which generally use their own limited imperative languages, Circuitree uses an existing high-level declarative language. We point out several applications for Circuitree, including EU Digital COVID Certificates and privacy-preserving access control for peer-to-peer (p2p) networks. Circuitree's performance is evaluated for access control in a p2p network. First results show that our approach allows for fast proofs and proof verification for this application. |
Year | DOI | Venue |
---|---|---|
2022 | 10.1109/ACCESS.2022.3153366 | IEEE ACCESS |
Keywords | DocType | Volume |
Blockchains, Computer languages, COVID-19, Arithmetic, Logic gates, Licenses, High level languages, Access control, bulletproofs, datalog, privacy, zero-knowledge proof, security, identity management, verifiable computation, blockchain, privacy-enhancing technologies | Journal | 10 |
ISSN | Citations | PageRank |
2169-3536 | 0 | 0.34 |
References | Authors | |
0 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tom Godden | 1 | 0 | 0.34 |
Ruben de Smet | 2 | 2 | 1.71 |
Christophe Debruyne | 3 | 0 | 0.34 |
Thibaut Vandervelden | 4 | 2 | 1.71 |
Kris Steenhaut | 5 | 0 | 0.34 |
An Braeken | 6 | 468 | 53.66 |