Searching for authors named "Alfredo De Santis" – sorted by Relevance.
-
Multiple Ramp Schemes
- Multiple Ramp Schemes Alfredo De Santis and Barbara Masucci Abstract A (t; k; n; S) ramp
- Cited by 6 (2 self) – Add To MetaCart
-
Tight Upper And Lower Bounds On The Path Length Of Binary Trees
- TIGHT UPPER AND LOWER BOUNDS ON THE PATH LENGTH OF BINARY TREES ALFREDO DE SANTIS AND GIUSEPPE
- Cited by 2 (1 self) – Add To MetaCart
-
A Note on Authentication Codes
- A Note on Authentication Codes Carlo Blundo 1; , Alfredo De Santis 1; , Kaoru Kurosawa 2
- Add To MetaCart
-
A t-Private k-Database Private Information Retrieval Scheme
- 'Arco, and Alfredo De Santis Dipartimento di Informatica ed Applicazioni Universit`a di Salerno, 84081 Baronissi (SA
- Add To MetaCart
-
Fully Dynamic Secret Sharing Schemes
- Fully Dynamic Secret Sharing Schemes Carlo Blundo, 1 Antonella Cresti, 2 Alfredo De Santis
- Cited by 15 (1 self) – Add To MetaCart
-
The Randomness Complexity of Private Computation
- The Randomness Complexity of Private Computation Carlo Blundo, Alfredo De Santis, Giuseppe
- Cited by 4 (0 self) – Add To MetaCart
-
Contrast Optimal Threshold Visual Cryptography Schemes
- , Alfredo De Santis 1; , and Douglas R. Stinson 2;y 1 Dipartimento di Informatica ed Applicazioni
- Cited by 5 (2 self) – Add To MetaCart
-
On a Fallacious Bound for Authentication Codes
- On a Fallacious Bound for Authentication Codes Carlo Blundo 1;3 , Alfredo De Santis 1
- Cited by 2 (2 self) – Add To MetaCart
-
Randomness in Distribution Protocols
- Randomness in Distribution Protocols 1 Carlo Blundo, Alfredo De Santis, and Ugo Vaccaro
- Cited by 8 (2 self) – Add To MetaCart
-
New Lower Bounds on the Cost of Binary Search Trees
- Prisco y Alfredo De Santis z Abstract In this paper we provide new lower bounds on the cost of binary
- Cited by 3 (0 self) – Add To MetaCart

