Polynomial Reconstruction Based Cryptography

Authors:
Aggelos Kiayias;Moti Yung
Affiliations:
-;-
Venue:
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Year:
2001

Citing 11
Cited 1

On the hardness of computing the permanent of random matrices (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
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
Password hardening based on keystroke dynamics

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Secure Games with Polynomial Expressions

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Proofs, Codes, and Polynomial-Time Reducibilities

COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Learning polynomials with queries: The highly noisy case

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Noisy polynomial interpolation and noisy chinese remaindering

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
On the hardness of permanent

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Private Interrogation of Devices via Identification Codes

INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cryptography and Coding Theory are closely knitted in many respects. Recently, the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) was suggested as an intractability assumption upon which the security of cryptographic protocols can be based. This has initiated a line of research that exploited the rich algebraic structure of the problem and related subproblems of which in the cryptographic setting. Here we give a short overview of recent works on the subject and the novel applications that were enabled due to this development.