Nearly optimal robust secret sharing

DOI10.1007/S10623-018-0578-YzbMATH Open1425.94053OpenAlexW2898633823WikidataQ129006427 ScholiaQ129006427MaRDI QIDQ1999899FDOQ1999899

Authors Mahdi Cheraghchi

Publication date 27 June 2019

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-018-0578-y

zbMATH Keywords

cryptographyalgebraic coding theorycoding and information theory

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Unconditionally-secure robust secret sharing with compact shares
• On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection
• Nearly optimal robust secret sharing against rushing adversaries
• Robust secret sharing schemes against local adversaries
• scientific article; zbMATH DE number 467267

Cites work

• scientific article; zbMATH DE number 1842509 (Why is no real title available?)
• scientific article; zbMATH DE number 1390062 (Why is no real title available?)
• Algebraic Function Fields and Codes
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Algorithmic Results in List Decoding
• An explication of secret sharing schemes
• Broadcast channels with confidential messages
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Error-correcting codes for list decoding
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• How to share a secret
• Identifying cheaters without an honest majority
• Introduction to Coding Theory
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• On a special class of wiretap channels (Corresp.)
• Optimal algebraic manipulation detection codes in the constant-error model
• Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets (extended abstract)
• Robust secret sharing schemes against local adversaries
• Secure multiparty computation and secret sharing
• Semantic security for the wiretap channel
• The Wire-Tap Channel
• Unconditionally-secure robust secret sharing with compact shares

Cited in

(12)

• scientific article; zbMATH DE number 467267 (Why is no real title available?)
• Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\)
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Optimum Secret Sharing Scheme Secure against Cheating
• Towards optimal robust secret sharing with security against a rushing adversary
• Efficient robust secret sharing from expander graphs
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Secure Computation from Random Error Correcting Codes
• Unconditionally-secure robust secret sharing with compact shares
• Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
• Nearly optimal robust secret sharing against rushing adversaries
• Robust vector space secret sharing schemes

This page was built for publication: Nearly optimal robust secret sharing

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