Efficient Multiplicative Sharing Schemes

DOI10.1007/3-540-68339-9_10MaRDI QIDQ2876891zbMATH OpenOpenAlexFDO

Authors Simon R. Blackburn, Peter R. Wild, M. V. D. Burmester, Yvo 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

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1612523
• Verifiably multiplicative secret sharing
• Verifiably Multiplicative Secret Sharing
• Efficient distributed computation modulo a shared secret
• Progress in Cryptology - INDOCRYPT 2003
• scientific article; zbMATH DE number 512874
• Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
• Efficient explicit constructions of multipartite secret sharing schemes
• New efficient and practical verifiable multi-secret sharing schemes
• Public Key Cryptography - PKC 2006

Cited in

(23)

• 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
• Perfect hash families: Probabilistic methods and explicit constructions
• Distributing hash families with few rows
• A sequence approach to linear perfect hash families
• Threshold cryptography based on Asmuth-Bloom secret sharing
• Geometric constructions of optimal linear perfect hash families
• scientific article; zbMATH DE number 1612523 (Why is no real title available?)
• scientific article; zbMATH DE number 1612532 (Why is no real title available?)
• Linear Time Constructions of Some d-Restriction Problems
• Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing
• scientific article; zbMATH DE number 1305506 (Why is no real title available?)
• Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
• scientific article; zbMATH DE number 1024082 (Why is no real title available?)
• 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
• The combinatorics of generalised cumulative arrays
• Explicit constructions of perfect hash families from algebraic curves over finite fields
• Broadcast authentication for group communication
• Perfect hash families of strength three with three rows from varieties on finite projective geometries

This page was built for publication: Efficient Multiplicative Sharing Schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876891)