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 |
Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995DocID: 1raDV - View Document | |
ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWzDocID: 1qYTn - View Document | |
RANDOM SELF-REDUCIBILITY PROPERTIES OF LEARNING PROBLEMS OVER BURNSIDE GROUPS OF EXPONENT 3 Nelly Fazio∗ Computer Science Department The City College of CUNY e-mail:DocID: 1lh5O - View Document | |
Cryptography from Post-Quantum Assumptions Raza Ali Kazmi Doctor of PhilosophyDocID: 17YuK - View Document | |
Oblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem Claude Cr´epeau ? , Raza Ali Kazmi ?DocID: 17AYc - View Document |