Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions

DOI10.1007/978-3-662-46803-6_11zbMath1371.94665OpenAlexW3029698825MaRDI QIDQ2948388

Gabriele Spini, Ronald Cramer, Nico Döttling, Serge Fehr, Ivan B. Damgård

Publication date: 30 September 2015

Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_11

zbMATH Keywords

linear secret sharing schemesrobust secret sharinglinear time sharing

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (15)

Survey of information security ⋮ Recent Advances in Non-perfect Secret Sharing Schemes ⋮ A group identification protocol with leakage resilience of secret sharing scheme ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ A new keyed hash function based on Latin squares and error-correcting codes to authenticate users in smart home environments ⋮ How to recover a secret with \(O(n)\) additions ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Non-committing encryption with constant ciphertext expansion from standard assumptions ⋮ Fuzzy asymmetric password-authenticated key exchange ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Efficient robust secret sharing from expander graphs ⋮ Nearly optimal robust secret sharing ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Non-Malleable Encryption: Simpler, Shorter, Stronger ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets

This page was built for publication: Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions