The scientist’s investigation covers issues in Secret sharing, Upper and lower bounds, Combinatorics, Discrete mathematics and Verifiable secret sharing. His Secret sharing study frequently draws connections to adjacent fields such as Theoretical computer science. His Theoretical computer science study integrates concerns from other disciplines, such as Network topology and Protocol.
His Upper and lower bounds research incorporates elements of Group testing, Algorithm, Connectivity and Type. The Discrete mathematics study combines topics in areas such as Code rate, Information transmission and Set theory. His Verifiable secret sharing study combines topics in areas such as Secure multi-party computation and Conditional entropy.
Ugo Vaccaro spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Algorithm and Theoretical computer science. Combinatorics and Entropy are commonly linked in his work. His Discrete mathematics study combines topics from a wide range of disciplines, such as Simple and Verifiable secret sharing.
His studies examine the connections between Upper and lower bounds and genetics, as well as such issues in Randomized algorithm, with regards to Asymptotically optimal algorithm. His biological study spans a wide range of topics, including Secure multi-party computation, Homomorphic secret sharing, Secret sharing and Parameterized complexity. His Secret sharing research is multidisciplinary, relying on both Code rate and Protocol.
Ugo Vaccaro mainly investigates Combinatorics, Time complexity, Bounded function, Cardinality and Discrete mathematics. His Combinatorics research is multidisciplinary, incorporating elements of Entropy, Upper and lower bounds and Optimization problem. His Upper and lower bounds research includes elements of Asymptotically optimal algorithm and Randomized algorithm.
His Bounded function research incorporates themes from Small set and Graph. His work deals with themes such as Simple and Series, which intersect with Discrete mathematics. The concepts of his Theoretical computer science study are interwoven with issues in Wireless, Probabilistic logic and Secret sharing.
His primary scientific interests are in Combinatorics, Time complexity, Majorization, Discrete mathematics and Upper and lower bounds. He has researched Combinatorics in several fields, including Optimization problem, Cardinality and Order. His research investigates the connection between Time complexity and topics such as Bounded function that intersect with issues in Small set, Series, Simple and Directed graph.
His study in Graph and Vertex falls within the category of Discrete mathematics. His Graph study frequently intersects with other fields, such as Algorithm. His research in Upper and lower bounds intersects with topics in Combinatorial design, Matching, Heuristic, Asymptotically optimal algorithm and Randomized algorithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Perfectly-Secure Key Distribution for Dynamic Conferences
Carlo Blundo;Alfredo De Santis;Amir Herzberg;Shay Kutten.
international cryptology conference (1992)
On the size of shares for secret sharing schemes
R. M. Capocelli;A. Santis;L. Gargano;U. Vaccaro.
Journal of Cryptology (1993)
Perfectly secure key distribution for dynamic conferences
Carlo Blundo;Alfredo De Santis;Ugo Vaccaro;Amir Herzberg.
Information & Computation (1998)
Graph decompositions and secret sharing schemes
C. Blundo;A. Santis;D. R. Stinson;U. Vaccaro.
Journal of Cryptology (1995)
Graph Problems Arising from Wavelength-Routing in All-Optical Networks
Bruno Beauquier;Jean-Claude Bermond;Luisa Gargano;Pavol Hell.
Efficient collective communication in optical networks
Jean-Claude Bermond;Luisa Gargano;Stephan Perennes;Adele A. Rescigno.
Theoretical Computer Science (2000)
Optimal Two-Stage Algorithms for Group Testing Problems
Annalisa De Bonis;Leszek Gasieniec;Ugo Vaccaro.
SIAM Journal on Computing (2005)
Asynchronous deterministic rendezvous in graphs
Gianluca De Marco;Luisa Gargano;Evangelos Kranakis;Danny Krizanc.
Theoretical Computer Science (2006)
Fully dynamic secret sharing schemes
Carlo Blundo;Antonella Cresti;Alfredo De Santis;Ugo Vaccaro.
Theoretical Computer Science (1996)
Tight Bounds on the Information Rate of Secret SharingSchemes
Carlo Blundo;Alfredo De Santis;Roberto De Simone;Ugo Vaccaro.
Designs, Codes and Cryptography (1997)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: