ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash

By Sarah Meiklejohn, C. Christopher Erway, Alptekin Küpçü, Theodora Hinkle, Anna Lysyanskaya. 2010

65 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Srinath T. V. Setty
2. Riad S. Wahby
3. Eli Ben-Sasson
4. Michael Walfish
5. Dan Boneh
6. Bryan Parno
7. Andrew Justin Blumberg
8. Justin Thaler

Citations in the corpus

• Geppetto: Versatile Verifiable Computation (2015, methodology): “Zero Knowledge Several systems compile high-level functions to zero-knowledge (ZK) proofs [1, 5, 46].”
• Pinocchio: Nearly Practical Verifiable Computation (2013, methodology): “[63] adopt an approach based on Σprotocols [65].”
• A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols (2010, methodology): “Further, formal verification is left as an “interesting area of study” in [26].”
• Automated Synthesis of Privacy-Preserving Distributed Applications (2011, methodology): “We proved that the implementations output by the compiler enforce the intended authorization policies and we conducted an experimental evaluation to demonstrate the feasibility of our approach.”
• Full Accounting for Verifiable Outsourcing (2017, background): “Perhaps most similar to our slicing protocol are the various compilers for zero knowledge proofs of knowledge [7, 16, 61], most notably ZQL and ZØ [43, 45].”