First Page | Document Content | |
---|---|---|
Date: 2016-08-12 13:45:25Cryptography Computational complexity theory Randomized algorithms Zero-knowledge proof IP Proof of knowledge Non-interactive zero-knowledge proof Secure multi-party computation Soundness Commitment scheme Probabilistically checkable proof NP | ZKBoo: Faster Zero-Knowledge for Boolean Circuits Irene Giacomelli Jesper Madsen Claudio OrlandiAdd to Reading ListSource URL: eprint.iacr.orgDownload Document from Source WebsiteFile Size: 488,45 KBShare Document on Facebook |
Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.DocID: 1rgOi - View Document | |
SelectNet_Manual_v2_April_2012.pdfDocID: 1qMoc - View Document | |
WV Public Employees Insurance Agency Frequently Asked Questions on Picking a Primary Care Provider Q. Why is PEIA making me pick a physician?DocID: 1qjEP - View Document | |
Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.DocID: 1oP1q - View Document | |
Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004DocID: 1mroB - View Document |