A
Antonella Cresti
Researcher at Sapienza University of Rome
Publications - 8
Citations - 318
Antonella Cresti is an academic researcher from Sapienza University of Rome. The author has contributed to research in topics: Access structure & Shamir's Secret Sharing. The author has an hindex of 6, co-authored 8 publications receiving 311 citations.
Papers
More filters
Book ChapterDOI
Space requirements for broadcast encryption
Carlo Blundo,Antonella Cresti +1 more
TL;DR: This paper model the problem of unconditionally secure broadcast encryption schemes with an information theoretic framework and obtains tight limitations both on the number of private keys associated with each user and on thenumber of keys generated by the center.
Book ChapterDOI
Fully dynamic secret sharing schemes
TL;DR: This paper establishes a formal setting to study secret sharing schemes in which the dealer has the feature of being able to activate a particular access structure out of a given set and/or to allow the participants to reconstruct different secrets by sending to all participants the same broadcast message.
Journal ArticleDOI
Fully dynamic secret sharing schemes
TL;DR: This paper establishes a formal setting to study secret sharing schemes in which the dealer has the feature of being able to activate a particular access structure out of a given set and/or to allow the participants to reconstruct different secrets by sending to all participants the same broadcast message.
Book ChapterDOI
General short computational secret sharing schemes
Philippe Béguin,Antonella Cresti +1 more
TL;DR: A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret if any non qualified subset has absolutely no information about the secret, then the scheme is called perfect.
Journal ArticleDOI
A unified model for unconditionally secure key distribution
TL;DR: This paper presents a model for unconditionally secure key distribution schemes, i.e., schemes whose security is independent of the power of the adversary, and proves lower bounds on the amount of information the trusted party has to generate and each user has to keep secret in such schemes.