A note on ramp secret sharing schemes from error-correcting codes

DOI10.1016/J.MCM.2011.07.024zbMath1286.94093OpenAlexW1985226244MaRDI QIDQ2450506

Pei Dingyi, Qi Chen, Tongkai Ji, Qiang Yue, Chun-Ming Tang

Publication date: 14 May 2014

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2011.07.024

zbMATH Keywords

error-correcting codessecret sharing schemesalgebraic geometric codes(strong) multiplication

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Ramp secret image sharing ⋮ Ideal access structures based on a class of minimal linear codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• On the asymptotic behaviour of some towers of function fields over finite fields
• How to share a secret
• Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Computation from Random Error Correcting Codes
• Atomic Secure Multi-party Multiplication with Low Communication
• Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
• Isolated Proofs of Knowledge and Isolated Zero Knowledge

This page was built for publication: A note on ramp secret sharing schemes from error-correcting codes