Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families

May 16, 2023 Β· Declared Dead Β· πŸ› Designs, Codes and Cryptography

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shannon Veitch, Douglas R. Stinson arXiv ID 2305.09405 Category cs.CR: Cryptography & Security Cross-listed math.CO Citations 7 Venue Designs, Codes and Cryptography Last Checked 4 months ago
Abstract
Various notions of non-malleable secret sharing schemes have been considered. In this paper, we review the existing work on non-malleable secret sharing and suggest a novel game-based definition. We provide a new construction of an unconditionally secure non-malleable threshold scheme with respect to a specified relation. To do so, we introduce a new type of algebraic manipulation detection (AMD) code and construct examples of new variations of external difference families, which are of independent combinatorial interest.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Cryptography & Security

Died the same way β€” πŸ‘» Ghosted