A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
From MaRDI portal
Publication:380446
DOI10.1007/s12095-013-0082-1zbMath1283.94078OpenAlexW2015875314MaRDI QIDQ380446
Maura B. Paterson, Douglas R. Stinson
Publication date: 14 November 2013
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-013-0082-1
Related Items (4)
Threshold Secret Sharing Requires a Linear Size Alphabet ⋮ Localised multisecret sharing ⋮ Multi-prover proof of retrievability ⋮ Unnamed Item
Cites Work
- An application of ramp schemes to broadcast encryption
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
- Orthogonal arrays. Theory and applications
- Security of Ramp Schemes
- Generalized Reed - Solomon codes from algebraic geometry
- Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
- Four fundamental parameters of a code and their combinatorial significance
- Secure Computation from Random Error Correcting Codes
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
