Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes

  title={Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes},
  author={Aggelos Kiayias and Moti Yung},
  journal={IEEE Transactions on Information Theory},
In this paper, we investigate the decoding problem of Reed-Solomon (RS) codes, also known as the polynomial reconstruction problem (PR), from a cryptographic hardness perspective. Namely, we deal with samplable PR instances over parameter choices for which decoding is not known to be feasibly solvable and where part of the solution polynomial is the hidden input. We put forth a natural decisional intractability assumption that relates to this decoding problem: distinguishing between a single… CONTINUE READING
Highly Cited
This paper has 75 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 41 extracted citations

A New Approach for Algebraically Homomorphic Encryption

IACR Cryptology ePrint Archive • 2008
View 15 Excerpts
Highly Influenced

Progress in Cryptology — INDOCRYPT 2002

Lecture Notes in Computer Science • 2002
View 10 Excerpts
Highly Influenced

Towards fingerprints as strings: Secure indexing for fingerprint matching

2013 International Conference on Biometrics (ICB) • 2013
View 4 Excerpts
Highly Influenced

Solving ECDLP via List Decoding

IACR Cryptology ePrint Archive • 2018
View 1 Excerpt

Security Considerations in Minutiae-Based Fuzzy Vaults

IEEE Transactions on Information Forensics and Security • 2015
View 1 Excerpt

76 Citations

Citations per Year
Semantic Scholar estimates that this publication has 76 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 26 references

Yung,Directions in Polynomial Reconstruction Based Cryptography

Aggelos Kiayias, Moti
IEICE Transactions, • 2004

Cryptographic Hardness based on the Decoding of Reed Solomon Codes

Aggelos Kiayias, Moti Yung
In the Proceedings of the 29th International Colloquium in Algorithms, Languages and Programming, • 2002

Similar Papers

Loading similar papers…