User:XDanielx/Joe Kilian

Joe Kilian is a professor of computer science.

Research

In a 1992 paper, Kilian showed that any probabilistically checkable proof can be transformed into a succinct four-message argument for NP. The construction involved using a Merkle tree to commit to the proof.^[1]^[2]

References

^ Kilian, Joe (1 July 1992). A note on efficient zero-knowledge proofs and arguments. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing.
^ Thaler, Justin. Proofs, Arguments, and Zero-Knowledge.

[1] Kilian, Joe (1 July 1992). A note on efficient zero-knowledge proofs and arguments. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing.

[2] Thaler, Justin. Proofs, Arguments, and Zero-Knowledge.

[1]

[2]