Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing

DOI10.1007/978-3-030-31578-8_16zbMath1444.94062OpenAlexW2979892477MaRDI QIDQ3297627

Sabyasachi Dutta, Kirill Morozov, Yvo G. Desmedt

Publication date: 20 July 2020

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-31578-8_16

zbMATH Keywords

perfect hash familysecret sharingcombinatorial objectevolvingperpetual

Mathematics Subject Classification ID

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

Cites Work

• Multiple assignment scheme for sharing secret
• Evolving secret sharing: dynamic thresholds and robustness
• Graph coloring applied to secure computation in non-abelian groups
• How to share a function securely
• Efficient Multiparty Protocols via Log-Depth Threshold Formulae
• Efficient Multiplicative Sharing Schemes
• On the Size of Separating Systems and Families of Perfect Hash Functions
• How to share a secret
• How to Share a Secret, Infinitely
• On Secure Multi-party Computation in Black-Box Groups
• The Knowledge Complexity of Interactive Proof Systems
• Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
• Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing