Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields

DOI10.1007/11535218_21zbMath1145.94463OpenAlexW1570884583MaRDI QIDQ5451035

Martijn Stam, Serge Fehr, Ronald Cramer

Publication date: 17 March 2008

Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11535218_21

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Related Items

Threshold Secret Sharing Requires a Linear Size Alphabet, How to recover a secret with \(O(n)\) additions, Efficient integer span program for hierarchical threshold access structure, Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing, On abelian and homomorphic secret sharing schemes, Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes