Secure System Composition and Type Checking using Cryptographic Proofs [Slides]
By using zkSNARKs to prove that values have specific dependent types, it is possible to provably assure compatibility and correctness without revealing sensitive information and extend our trusted computing base well beyond our own system. The approach we developed expands the scope of what non-interactive zero-knowledge proofs can capture to include properties about both the execution and correctness of programs.
97 MATHEMATICS AND COMPUTING↗