First Page | Document Content | |
---|---|---|
Date: 2001-10-24 10:55:38Cryptography Polynomials Probabilistic complexity theory IP Commitment scheme NP Interactive proof system Zero-knowledge proof Polynomial interpolation Polynomial Random self-reducibility Permutation polynomial | Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995Add to Reading ListSource URL: cs-www.cs.yale.eduDownload Document from Source WebsiteFile Size: 301,51 KBShare Document on Facebook |