Solving low-density subset sum problems
Journal of the ACM (JACM)
A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
Improved low-density subset sum algorithms
Computational Complexity
Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Reconstructing Algebraic Functions from Mixed Data
SIAM Journal on 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
Password hardening based on keystroke dynamics
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Finding smooth integers in short intervals using CRT decoding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Protecting secret keys with personal entropy
Future Generation Computer Systems - Special issue on security on the Web
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Attacking the Chor-Rivest cryptosystem by improved lattice reduction
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Counting the number of points on elliptic curves over finite fields: strategies and performances
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Finding smooth integers in short intervals using CRT decoding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Error-tolerant password recovery
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
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
Oblivious Polynomial Evaluation and Oblivious Neural Learning
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Toward Speech-Generated Cryptographic Keys on Resource-Constrained Devices
Proceedings of the 11th USENIX Security Symposium
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Efficient Asymmetric Self-Enforcement Scheme with Public Traceability
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Segment LLL-Reduction of Lattice Bases
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Efficient Asymmetric Public-Key Traitor Tracing without Trusted Agents
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
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
Linear time encodable and list decodable codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Secure smartcardbased fingerprint authentication
WBMA '03 Proceedings of the 2003 ACM SIGMM workshop on Biometrics methods and applications
Journal of Complexity - Special issue on coding and cryptography
Oblivious polynomial evaluation
Journal of Computer Science and Technology
Designs, Codes and Cryptography
Fast LLL-type lattice reduction
Information and Computation
Oblivious polynomial evaluation and oblivious neural learning
Theoretical Computer Science
A new two-server approach for authentication with short secrets
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
A Highly Scalable RFID Authentication Protocol
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Client-Server Password Recovery
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
Fast LLL-type lattice reduction
Information and Computation
Biometrics-based identifiers for digital identity management
Proceedings of the 9th Symposium on Identity and Trust on the Internet
Dynamic threshold and cheater resistance for shamir secret sharing scheme
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
Adapting density attacks to low-weight knapsacks
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Augmented oblivious polynomial evaluation protocol and its applications
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
| Hi-index | 0.00 |
The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in password identification schemes, due to its connection with secret sharing schemes based on Lagrange's polynomial interpolation. This paper presents new algorithms to solve the noisy polynomial interpolation problem. In particular, we prove a reduction from noisy polynomial interpolation to the lattice shortest vector problem, when the parameters satisfy a certain condition that we make explicit. Standard lattice reduction techniques appear to solve many instances of the problem. It follows that noisy polynomial interpolation is much easier than expected. We therefore suggest simple modifications to several cryptographic schemes recently proposed, in order to change the intractability assumption. We also discuss analogous methods for the related noisy Chinese remaindering problem arising from the well-known analogy between polynomials and integers.