Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Decoding algebraic-geometric codes beyond the error-correction bound
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Reconstructing randomly sampled multivariate polynomials from highly noisy data
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Finding smooth integers in short intervals using CRT decoding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Limits to list decodability of linear codes
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Scalable secure storage when half the system is faulty
Information and Computation
Unconditional proof of tightness of Johnson bound
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Scalable Secure Storage when Half the System Is Faulty
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Hidden Number Problem in Extension Fields and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Fast Correlation Attacks through Reconstruction of Linear Polynomials
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Secure Games with Polynomial Expressions
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Polynomial Reconstruction Based Cryptography
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Finding smooth integers in short intervals using CRT decoding
Journal of Computer and System Sciences - Special issue on STOC 2000
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
An improved list decoding algorithm for the second order Reed---Muller codes and its applications
Designs, Codes and Cryptography
QUAD: A multivariate stream cipher with provable security
Journal of Symbolic Computation
Higher order correlation attacks, XL algorithm and cryptanalysis of Toyocrypt
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Public-Key cryptography from new multivariate quadratic assumptions
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
A survey on fast correlation attacks
Cryptography and Communications
| Hi-index | 0.00 |
Given a function f mappping n-variate inputs from a finite field F into F, we consider the task of reconstructing a list of all n-variate degree d polynomials which agree with f on a tiny but non-negligible fraction, /spl delta/, of the input space. We give a randomized algorithm for solving this task which accesses f as a black box and runs in time polynomial in 1//spl delta/, n and exponential in d, provided /spl delta/ is /spl Omega/(/spl radic/(d.