Randomness in distribution protocols

DOI10.1007/3-540-58201-0_99zbMath1418.68079OpenAlexW1688411920MaRDI QIDQ4632457

Alfredo De Santis, Carlo Blundo, Ugo Vaccaro

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_99

zbMATH Keywords

broadcast encryptionthreshold schemeaccess structuresecret-sharing schemerandomness coefficient

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Fully dynamic secret sharing schemes ⋮ On the information rate of secret sharing schemes ⋮ On the number of random bits in totally private computation ⋮ Linear broadcast encryption schemes

Cites Work

• On the classification of ideal secret sharing schemes
• An explication of secret sharing schemes
• On the size of shares for secret sharing schemes
• How to share a secret
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Decomposition constructions for secret-sharing schemes
• On secret sharing systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Randomness in distribution protocols