scientific article; zbMATH DE number 7559096
From MaRDI portal
Publication:5090431
DOI10.4230/LIPIcs.ITCS.2019.53MaRDI QIDQ5090431
Fuchun Lin, Mahdi Cheraghchi, Huaxiong Wang, Reihaneh Safavi-Naini, Venkatesan Guruswami
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1808.02974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Short leakage resilient and non-malleable secret sharing schemes ⋮ Full threshold change range of threshold changeable secret sharing ⋮ Cryptography from one-way communication: on completeness of finite channels ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Affine extractors over prime fields
- On the construction of affine extractors
- An explication of secret sharing schemes
- Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\)
- Bounded Indistinguishability and the Complexity of Recovering Secrets
- Semantic Security for the Wiretap Channel
- How to share a secret
- Optimal Rate Code Constructions for Computationally Simple Channels
- Threshold Secret Sharing Requires a Linear Size Alphabet
- List decoding from erasures: bounds and code constructions
- The Wire-Tap Channel
- Broadcast channels with confidential messages
- Invertible Extractors and Wiretap Protocols
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- Extractors and pseudorandom generators
- Secure Multiparty Computation and Secret Sharing
- Wire-Tap Channel II
- Extracting all the randomness and reducing the error in Trevisan's extractors
This page was built for publication:
