Efficient Multiplicative Sharing Schemes
From MaRDI portal
Publication:2876891
DOI10.1007/3-540-68339-9_10zbMath1304.94095OpenAlexW1481596910MaRDI QIDQ2876891
Simon R. Blackburn, Peter R. Wild, M. V. D. Burmester, Yvo G. Desmedt
Publication date: 20 August 2014
Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68339-9_10
Related Items (17)
Bounds And Constructions For Threshold Shared Generation Of Authenticators ⋮ Perfect Hash Families: Constructions and Existence ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ A sequence approach to linear perfect hash families ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Perfect hash families of strength three with three rows from varieties on finite projective geometries ⋮ Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing ⋮ Geometric constructions of optimal linear perfect hash families ⋮ Explicit constructions of perfect hash families from algebraic curves over finite fields ⋮ The combinatorics of generalised cumulative arrays ⋮ Broadcast authentication for group communication ⋮ Explicit constructions for perfect hash families ⋮ Linear hash families and forbidden configurations ⋮ Optimal linear perfect hash families ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures ⋮ Distributing hash families with few rows ⋮ Perfect hash families: Probabilistic methods and explicit constructions
This page was built for publication: Efficient Multiplicative Sharing Schemes
