First Page | Document Content | |
---|---|---|
Complexity classes Circuit complexity Computational complexity theory Zero-knowledge proof Non-interactive zero-knowledge proof SM-62 Snark XTR NC NP Proof of knowledge Computer ZK | Succinct Non-Interactive Zero Knowledge for a von Neumann ArchitectureAdd to Reading ListSource URL: www.usenix.orgDownload Document from Source WebsiteFile Size: 506,96 KBShare Document on Facebook |
RFCSchnorr Non-interactive Zero-Knowledge ProofDocID: 1uoRK - View Document | |
2015 IEEE Symposium on Security and Privacy ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data Michael BackesDocID: 1pZM7 - View Document | |
Succinct Non-Interactive Zero Knowledge for a von Neumann ArchitectureDocID: 1lBYy - View Document | |
Secure Two-Party Computation with Low Communication Ivan Damg˚ard∗ Sebastian Faust† Carmit Hazay‡DocID: 1g45g - View Document | |
BRICS Basic Research in Computer Science BRICS RSJ. Groth: Extracting Witnesses from Proofs of Knowledge Extracting Witnesses from Proofs ofDocID: 1g0K6 - View Document |