A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols

61 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.

Geppetto: Versatile Verifiable Computation (2015, methodology): “Zero Knowledge Several systems compile high-level functions to zero-knowledge (ZK) proofs [1, 4, 42].”
Pinocchio: Nearly Practical Verifiable Computation (2013, methodology): “Several systems provide compilers for zero-knowledge (ZK) proofs [62–64].”
A Survey of Verifiable Computation (2017, background): “Other concurrent work [12, 62, 71] tried to solve this open problem of balancing the requirement of confidentiality and efficiency with other techniques and had a better performance than [46].”
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.”
Charm: a framework for rapidly prototyping cryptosystems (2013, methodology): “There have been several elegant implementations of a small number of new primitives [52, 43, 11] as well as some tools for protocol development [45, 5, 44, 32, 37, 39].”