Nearly optimal robust secret sharing

DOI10.1007/s10623-018-0578-yzbMath1425.94053OpenAlexW2898633823WikidataQ129006427 ScholiaQ129006427MaRDI QIDQ1999899

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

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

Related Items (1)

Nearly optimal robust secret sharing against rushing adversaries

Cites Work

• Unnamed Item
• Unnamed Item
• An explication of secret sharing schemes
• Robust Secret Sharing Schemes Against Local Adversaries
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Identifying Cheaters without an Honest Majority
• Unconditionally-Secure Robust Secret Sharing with Compact Shares
• Semantic Security for the Wiretap Channel
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• How to share a secret
• Error-correcting codes for list decoding
• Algebraic Function Fields and Codes
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• The Wire-Tap Channel
• On a special class of wiretap channels (Corresp.)
• Broadcast channels with confidential messages
• Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
• Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Secure Multiparty Computation and Secret Sharing
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Introduction to Coding Theory
• Algorithmic Results in List Decoding

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