Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes

DOI10.1109/TIT.2008.921876MaRDI QIDQ3604595zbMATH OpenFDO

Authors Aggelos Kiayias, Moti Yung

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2008.921876

Mathematics Subject Classification ID

Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited in

(4)

• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Highly efficient OT-based multiplication protocols
• A Highly Scalable RFID Authentication Protocol
• E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation

This page was built for publication: Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604595)