zk-Oracle: trusted off-chain compute and storage for decentralized applications
Guardado en:
| Publicado en: | Distributed and Parallel Databases vol. 42, no. 4 (Dec 2024), p. 525 |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Publicado: |
Springer Nature B.V.
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3255419694 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 0926-8782 | ||
| 022 | |a 1573-7578 | ||
| 024 | 7 | |a 10.1007/s10619-024-07444-6 |2 doi | |
| 035 | |a 3255419694 | ||
| 045 | 2 | |b d20241201 |b d20241231 | |
| 100 | 1 | |a Gu, Binbin |u University of California, Department of Computer Science, Irvine, USA (GRID:grid.266093.8) (ISNI:0000 0001 0668 7243) | |
| 245 | 1 | |a zk-Oracle: trusted off-chain compute and storage for decentralized applications | |
| 260 | |b Springer Nature B.V. |c Dec 2024 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a Blockchain and Decentralized Applications (DApps) are increasingly important for creating trust and transparency in data storage and computation. However, on-chain transactions are often costly and slow. To overcome this challenge, off-chain nodes can be used to store and compute data. Unfortunately, this introduces the risk of untrusted nodes. To address this, authenticated data structures have been proposed, however, this ignores the compute of data from the raw data. We tackle this challenge by introducing zk-Oracle, which provides an efficient and trusted compute and storage off-chain. There is a challenge in using zero-knowledge proofs (zk-proof for short), which is the large proof generation time. We aim to overcome it with novel designs in zk-Oracle. zk-Oracle builds on zk-proofs technologies to achieve two goals. First, the computation of data structures from raw data and the corresponding proof generation is improved in terms of performance. Second, the verification on-chain is inexpensive and fast. Our experiments show that we can speed up zk-proof generation by up to 550×<inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="10619_2024_7444_Article_IEq1.gif" /> faster than the baseline method. | |
| 653 | |a Digital currencies | ||
| 653 | |a Supply chains | ||
| 653 | |a Blockchain | ||
| 653 | |a Computation | ||
| 653 | |a Data storage | ||
| 653 | |a Algorithms | ||
| 653 | |a Smart contracts | ||
| 653 | |a Data structures | ||
| 653 | |a Nodes | ||
| 700 | 1 | |a Nawab, Faisal |u University of California, Department of Computer Science, Irvine, USA (GRID:grid.266093.8) (ISNI:0000 0001 0668 7243) | |
| 773 | 0 | |t Distributed and Parallel Databases |g vol. 42, no. 4 (Dec 2024), p. 525 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3255419694/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text |u https://www.proquest.com/docview/3255419694/fulltext/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3255419694/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |