Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
- 25 June 2002
- book chapter
- Published by Springer Nature
- p. 232-243
- https://doi.org/10.1007/3-540-45465-9_21
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Learning polynomials with queries: The highly noisy casePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Cryptographic Hardness Based on the Decoding of Reed-Solomon CodesPublished by Springer Nature ,2002
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial InformationPublished by Springer Nature ,2000
- Noisy Polynomial Interpolation and Noisy Chinese RemainderingPublished by Springer Nature ,2000
- Complete characterization of security notions for probabilistic private-key encryptionPublished by Association for Computing Machinery (ACM) ,2000
- Oblivious transfer and polynomial evaluationPublished by Association for Computing Machinery (ACM) ,1999
- The Foundations of Modern CryptographyPublished by Springer Nature ,1999
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- Pseudorandomness and Cryptographic ApplicationsPublished by Walter de Gruyter GmbH ,1996
- Probabilistic encryptionJournal of Computer and System Sciences, 1984