Nearly optimal robust secret sharing
From MaRDI portal
Publication:1999899
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
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
- How to share a secret
- Algebraic Function Fields and Codes
- Introduction to Coding Theory
- An explication of secret sharing schemes
- Broadcast channels with confidential messages
- Robust secret sharing schemes against local adversaries
- The Wire-Tap Channel
- Error-correcting codes for list decoding
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Identifying cheaters without an honest majority
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Unconditionally-secure robust secret sharing with compact shares
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal algebraic manipulation detection codes in the constant-error model
- Secure multiparty computation and secret sharing
- Semantic security for the wiretap channel
- Algorithmic Results in List Decoding
- On a special class of wiretap channels (Corresp.)
- Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets (extended abstract)
Cited In (12)
- Towards optimal robust secret sharing with security against a rushing adversary
- Unconditionally-secure robust secret sharing with compact shares
- Secure Computation from Random Error Correcting Codes
- Title not available (Why is that?)
- Robust vector space secret sharing schemes
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
- Nearly optimal robust secret sharing against rushing adversaries
- Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\)
- Optimum Secret Sharing Scheme Secure against Cheating
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Efficient robust secret sharing from expander graphs
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)
