Open AccessProceedings Article
DIZK: A Distributed Zero Knowledge Proof System.
Howard Wu,Wenting Zheng,Alessandro Chiesa,Raluca Ada Popa,Ion Stoica +4 more
- 01 Jan 2018
pp 675-692
About: This article is published in USENIX Security Symposium. The article was published on 01 Jan 2018. and is currently open access. The article focuses on the topics: Zero-knowledge proof.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
PipeZK: accelerating zero-knowledge proof with a pipelined architecture
Ye Zhang,Shuo Wang,Xian Zhang,Jiangbin Dong,Xingzhong Mao,Fan Long,Cong Wang,Dong Zhou,Mingyu Gao,Guangyu Sun +9 more
- 14 Jun 2021
TL;DR: PipeZK as mentioned in this paper is a pipelined accelerator with two subsystems to handle the aforementioned two intensive compute tasks, respectively, which can achieve 10x speedup on standard cryptographic benchmarks, and 5x on a widely-used cryptocurrency application, Zcash.
48
Fairness, integrity, and privacy in a scalable blockchain-based federated learning system
01 Jan 2022
TL;DR: In this paper , the authors proposed a federated machine learning (FL) system that incorporates blockchain technology, local differential privacy, and zero-knowledge proofs to achieve fairness, integrity, and privacy preservation.
•Journal Article
Transparency Logs via Append-only Authenticated Dictionaries.
Alin Tomescu,Vivek Bhupatiraju,Dimitrios Papadopoulos,Charalampos Papamanthou,Nikos Triandopoulos,Srinivas Devadas +5 more
TL;DR: This paper addresses the gap in bandwidth-efficient transparency logs with a new primitive called an append-only authenticated dictionary (AAD), and is the first to achieve (poly)logarithmic size for both proof types and helps reduce bandwidth consumption in transparency logs.
40
Proving the correct execution of concurrent services in zero-knowledge
Srinath Setty,Sebastian Angel,Trinabh Gupta,Jonathan Lee +3 more
- 08 Oct 2018
TL;DR: Spice is introduced, a system for building verifiable state machines (VSMs) that produces proofs establishing that requests were executed correctly according to a specification and is the first system that can succinctly prove the correct execution of concurrent services.
•Proceedings Article
{MIRAGE}: Succinct Arguments for Randomized Algorithms with Applications to Universal {zk-SNARKs}
Ahmed E. Kosba,Dimitrios Papadopoulos,Charalampos Papamanthou,Dawn Song +3 more
- 01 Jan 2020
TL;DR: A new zk-SNARK system that is well-suited for randomized algorithms and a universal circuit that takes as input any arithmetic circuit of a bounded number of operations as well as a possible value assignment, and performs randomized checks to verify consistency are presented.
References
Pattern Recognition and Machine Learning
TL;DR: This book covers a broad range of topics for regular factorial designs and presents all of the material in very mathematical fashion and will surely become an invaluable resource for researchers and graduate students doing research in the design of factorial experiments.
30.8K
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
- 06 Dec 2004
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Dryad: distributed data-parallel programs from sequential building blocks
Michael Isard,Mihai Budiu,Yuan Yu,Andrew Birrell,Dennis Fetterly +4 more
- 21 Mar 2007
TL;DR: The Dryad execution engine handles all the difficult problems of creating a large distributed, concurrent application: scheduling the use of computers and their CPUs, recovering from communication or computer failures, and transporting data between vertices.
Modern computer algebra
TL;DR: This highly successful textbook, widely regarded as the “bible of computer algebra”, gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems.
1.8K