Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
The First Experimental Cryptanalysis of the Data Encryption Standard Read chapter Read first chapter

1994 | OriginalPaper | Chapter

Multi-Secret Sharing Schemes

Extended Abstract

Authors : Carlo Blundo, Alfredo De Santis, Giovanni Di Crescenzo, Antonio Giorgio Gaggia, Ugo Vaccaro

Published in: Advances in Cryptology — CRYPTO ’94

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s1, ..., sm among a set of participants $$ \mathcal{P} $$. In this paper we put forward a general theory of multi-secret sharing schemes by using an information theoretical framework. We prove lower bounds on the size of information held by each participant for various access structures. Finally, we prove the optimality of the bounds by providing protocols.

previous chapter New Bound on Authentication Code with Arbitration
next chapter Designing Identification Schemes with Keys of Short Size
Metadata
Title
Multi-Secret Sharing Schemes
Authors
Carlo Blundo
Alfredo De Santis
Giovanni Di Crescenzo
Antonio Giorgio Gaggia
Ugo Vaccaro
Copyright Year
1994
Publisher
Springer Berlin Heidelberg
Book
Advances in Cryptology — CRYPTO ’94

Print ISBN: 978-3-540-58333-2

Electronic ISBN: 978-3-540-48658-9

Copyright Year: 1994

DOI
https://doi.org/10.1007/3-540-48658-5_17

Premium Partner

    Image Credits