dblp.uni-trier.dewww.uni-trier.de

Alfredo De Santis Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
126EEAniello Castiglione, Roberto De Prisco, Alfredo De Santis: Do You Trust Your Phone? EC-Web 2009: 50-61
125EEPaolo D'Arco, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants. MFCS 2009: 247-257
124EECarlo Blundo, Stelvio Cimato, Sabrina De Capitani di Vimercati, Alfredo De Santis, Sara Foresti, Stefano Paraboschi, Pierangela Samarati: Efficient Key Management for Enforcing Access Control in Outsourced Scenarios. SEC 2009: 364-375
2008
123EEPaolo D'Arco, Alfredo De Santis: Weaknesses in a Recent Ultra-Lightweight RFID Authentication Protocol. AFRICACRYPT 2008: 27-39
122EELuigi Catuogno, Alfredo De Santis: An internet role-game for the laboratory of network security course. ITiCSE 2008: 240-244
121EEAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: An attack on a payment scheme. Inf. Sci. 178(5): 1418-1421 (2008)
120EEAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung: On Monotone Formula Composition of Perfect Zero-Knowledge Languages. SIAM J. Comput. 38(4): 1300-1329 (2008)
119EEAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: New constructions for provably-secure time-bound hierarchical key assignment schemes. Theor. Comput. Sci. 407(1-3): 213-230 (2008)
2007
118EEAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: Efficient Provably-Secure Hierarchical Key Assignment Schemes. MFCS 2007: 371-382
117EEAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: New constructions for provably-secure time-bound hierarchical key assignment schemes. SACMAT 2007: 133-138
116EECarlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson: On Unconditionally Secure Distributed Oblivious Transfer. J. Cryptology 20(3): 323-373 (2007)
115EEAlfredo De Santis, Barbara Masucci: New results on non-perfect sharing of multiple secrets. Journal of Systems and Software 80(2): 216-223 (2007)
114EEAniello Castiglione, Alfredo De Santis, Claudio Soriente: Taking advantages of a disadvantage: Digital forensics and steganography using document metadata. Journal of Systems and Software 80(5): 750-764 (2007)
113EEStelvio Cimato, Roberto De Prisco, Alfredo De Santis: Colored visual cryptography without color darkening. Theor. Comput. Sci. 374(1-3): 261-276 (2007)
2006
112EEGiuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: Provably-secure time-bound hierarchical key assignment schemes. ACM Conference on Computer and Communications Security 2006: 288-297
111EERoberto De Prisco, Alfredo De Santis: Cheating Immune (2, n)-Threshold Visual Secret Sharing. SCN 2006: 216-228
110EEStelvio Cimato, Roberto De Prisco, Alfredo De Santis: Probabilistic Visual Cryptography Schemes. Comput. J. 49(1): 97-107 (2006)
109EEAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: Unconditionally secure key assignment schemes. Discrete Applied Mathematics 154(2): 234-252 (2006)
108EEAngelo Ciaramella, Paolo D'Arco, Alfredo De Santis, Clemente Galdi, Roberto Tagliaferri: Neural Network Techniques for Proactive Password Checking. IEEE Trans. Dependable Sec. Comput. 3(4): 327-339 (2006)
107EECarlo Blundo, Paolo D'Arco, Alfredo De Santis: On Self-Healing Key Distribution Schemes. IEEE Transactions on Information Theory 52(12): 5455-5467 (2006)
106EEAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: Enforcing the security of a time-bound hierarchical key assignment scheme. Inf. Sci. 176(12): 1684-1694 (2006)
105EECarlo Blundo, Stelvio Cimato, Alfredo De Santis: Visual cryptography schemes with optimal pixel expansion. Theor. Comput. Sci. 369(1-3): 169-182 (2006)
2005
104EEAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: A New Key Assignment Scheme for Access Control in a Complete Tree Hierarchy. WCC 2005: 202-217
103EEStelvio Cimato, Roberto De Prisco, Alfredo De Santis: Optimal Colored Threshold Visual Cryptography Schemes. Des. Codes Cryptography 35(3): 311-335 (2005)
102EEStelvio Cimato, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: Ideal contrast visual cryptography schemes with reversing. Inf. Process. Lett. 93(4): 199-206 (2005)
101EEStelvio Cimato, Alfredo De Santis, Umberto Ferraro Petrillo: Overcoming the obfuscation of Java programs by identifier renaming. Journal of Systems and Software 78(1): 60-72 (2005)
2004
100EECarlo Blundo, Paolo D'Arco, Alfredo De Santis: Definitions and Bounds for Self-Healing Key Distribution Schemes. ICALP 2004: 234-245
99EEAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge. MFCS 2004: 356-367
98EEStelvio Cimato, Roberto De Prisco, Alfredo De Santis: Colored Visual Cryptography Without Color Darkening. SCN 2004: 235-248
97EEPina Bergamo, Paolo D'Arco, Alfredo De Santis, Ljupco Kocarev: Security of public key cryptosystems based on Chebyshev Polynomials CoRR cs.CR/0411030: (2004)
96EEAlfredo De Santis, Barbara Masucci: Anonymous Membership Broadcast Schemes. Des. Codes Cryptography 32(1-3): 135-151 (2004)
95EECarlo Blundo, Paolo D'Arco, Alfredo De Santis, Massimiliano Listo: Design of Self-Healing Key Distribution Schemes. Des. Codes Cryptography 32(1-3): 15-44 (2004)
94EEFrancis Y. L. Chin, Alfredo De Santis, Anna Lisa Ferrara, N. L. Ho, S. K. Kim: A simple algorithm for the constrained sequence problems. Inf. Process. Lett. 90(4): 175-179 (2004)
93EEAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci: Cryptographic key assignment schemes for any access control policy. Inf. Process. Lett. 92(4): 199-205 (2004)
92EECarlo Blundo, Paolo D'Arco, Alfredo De Santis, Clemente Galdi: HYPPOCRATES: a new proactive password checker. Journal of Systems and Software 71(1-2): 163-175 (2004)
91EEAnnalisa De Bonis, Alfredo De Santis: Randomness in secret sharing and visual cryptography schemes. Theor. Comput. Sci. 314(3): 351-374 (2004)
2003
90EECarlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson: Contrast Optimal Threshold Visual Cryptography Schemes. SIAM J. Discrete Math. 16(2): 224-261 (2003)
2002
89EECarlo Blundo, Paolo D'Arco, Alfredo De Santis, Clemente Galdi: A Novel Approach to Proactive Password Checking. InfraSec 2002: 30-39
88EEAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: Randomness-Optimal Characterization of Two NP Proof Systems. RANDOM 2002: 179-193
87EECarlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson: New Results on Unconditionally Secure Distributed Oblivious Transfer. Selected Areas in Cryptography 2002: 291-309
2001
86EEAlfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai: Robust Non-interactive Zero Knowledge. CRYPTO 2001: 566-598
85EECarlo Blundo, Paolo D'Arco, Alfredo De Santis, Clemente Galdi: Hyppocrates. ISC 2001: 63-80
84 Annalisa De Bonis, Alfredo De Santis: Secret Sharing and Visual Cryptography Schemes. SEC 2001: 123-138
83 Carlo Blundo, Annalisa De Bonis, Alfredo De Santis: Improved Schemes for Visual Cryptography. Des. Codes Cryptography 24(3): 255-278 (2001)
82 Alfredo De Santis, Antonio Giorgio Gaggia, Ugo Vaccaro: Bounds on entropy in a guessing game. IEEE Transactions on Information Theory 47(1): 468-473 (2001)
81EECarlo Blundo, Paolo D'Arco, Alfredo De Santis: A t-private k-database information retrieval scheme. Int. J. Inf. Sec. 1(1): 64-68 (2001)
80EEGiuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson: Extended capabilities for visual cryptography. Theor. Comput. Sci. 250(1-2): 143-161 (2001)
2000
79EEAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations. ICALP 2000: 451-462
78EEAnnalisa De Bonis, Alfredo De Santis: Randomness in Visual Cryptography. STACS 2000: 626-638
77EEAlfredo De Santis, Barbara Masucci: On secret set schemes. Inf. Process. Lett. 74(5-6): 243-251 (2000)
76EECarlo Blundo, Alfredo De Santis, Moni Naor: Visual cryptography for grey level images. Inf. Process. Lett. 75(6): 255-259 (2000)
1999
75EEAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP. ICALP 1999: 271-280
74 Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro: Randomness Complexity of Private Computation. Computational Complexity 8(2): 145-168 (1999)
73 Alfredo De Santis, Barbara Masucci: Multiple ramp schemes. IEEE Transactions on Information Theory 45(5): 1720-1728 (1999)
72EEAlfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano: The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. Inf. Process. Lett. 69(4): 201-206 (1999)
71EECarlo Blundo, Alfredo De Santis, Antonio Giorgio Gaggia: Probability of Shares in Secret Sharing Schemes. Inf. Process. Lett. 72(5-6): 169-175 (1999)
70 Alfredo De Santis, Barbara Masucci: A Lower Bound on the Encoding Length in Lossy Transmission. Inf. Sci. 116(2-4): 129-146 (1999)
69EECarlo Blundo, Alfredo De Santis, Kaoru Kurosawa, Wakaha Ogata: On a Fallacious Bound for Authentication Codes. J. Cryptology 12(3): 155-159 (1999)
68EECarlo Blundo, Alfredo De Santis, Douglas R. Stinson: On the Contrast in Visual Cryptography Schemes. J. Cryptology 12(4): 261-289 (1999)
1998
67EEAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: Communication-Efficient Anonymous Group Identification. ACM Conference on Computer and Communications Security 1998: 73-82
66EEAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung: Image Density is Complete for Non-Interactive-SZK (Extended Abstract). ICALP 1998: 784-795
65 Roberto De Prisco, Alfredo De Santis: On the Data Expansion of the Huffman Compression Algorithm. Comput. J. 41(3): 137-144 (1998)
64EECarlo Blundo, Alfredo De Santis: Visual cryptography schemes with perfect reconstruction of black pixels. Computers & Graphics 22(4): 449-455 (1998)
63 Roberto De Prisco, Alfredo De Santis: On Lower Bounds for the Redundancy of Optimal Codes. Des. Codes Cryptography 15(1): 29-45 (1998)
62EEAlfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano: The Graph Clustering Problem has a Perfect Zero-Knowledge Proof Electronic Colloquium on Computational Complexity (ECCC) 5(6): (1998)
61 Carlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung: Perfectly Secure Key Distribution for Dynamic Conferences. Inf. Comput. 146(1): 1-23 (1998)
60EECarlo Blundo, Alfredo De Santis, Ugo Vaccaro: On Secret Sharing Schemes. Inf. Process. Lett. 65(1): 25-32 (1998)
1997
59EEAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract). ICALP 1997: 716-726
58EECarlo Blundo, Alfredo De Santis, Roberto De Simone, Ugo Vaccaro: Tight Bounds on the Information Rate of Secret Sharing Schemes. Des. Codes Cryptography 11(2): 107-122 (1997)
57EERoberto De Prisco, Alfredo De Santis: Catastrophic Faults in Reconfigurable Systolic Linear Arrays. Discrete Applied Mathematics 75(2): 105-123 (1997)
56 Roberto De Prisco, Alfredo De Santis: A new bound for the data expansion of Huffman codes. IEEE Transactions on Information Theory 43(6): 2028-2032 (1997)
55EECarlo Blundo, Alfredo De Santis: Lower Bounds for Robust Secret Sharing Schemes. Inf. Process. Lett. 63(6): 317-321 (1997)
1996
54EEGiuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson: Constructions and Bounds for Visual Cryptography. ICALP 1996: 416-428
53EEGiuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson: Visual Cryptography for General Access Structures Electronic Colloquium on Computational Complexity (ECCC) 3(12): (1996)
52 Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson: Visual Cryptography for General Access Structures. Inf. Comput. 129(2): 86-106 (1996)
51 Carlo Blundo, Alfredo De Santis, Ugo Vaccaro: Randomness in Distribution Protocols. Inf. Comput. 131(2): 111-139 (1996)
50 Roberto De Prisco, Alfredo De Santis: On the Redundancy Achieved by Huffman Codes. Inf. Sci. 88(1-4): 131-148 (1996)
49 Alfredo De Santis, Giuseppe Persiano: The Power of Preprocessing in Zero-Knowledge Proofs of Knowledge. J. Cryptology 9(3): 129-148 (1996)
48EECarlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro: On the Information Rate of Secret Sharing Schemes. Theor. Comput. Sci. 154(2): 283-306 (1996)
47EERoberto De Prisco, Alfredo De Santis: New Lower Bounds on the Cost of Binary Search Trees. Theor. Comput. Sci. 156(1&2): 315-325 (1996)
46EECarlo Blundo, Antonella Cresti, Alfredo De Santis, Ugo Vaccaro: Fully Dynamic Secret Sharing Schemes. Theor. Comput. Sci. 165(2): 407-440 (1996)
1995
45 Alfredo De Santis: Advances in Cryptology - EUROCRYPT '94, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994, Proceedings Springer 1995
44EECarlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro: On the Number of Random Bits in Totally Private Computation. ICALP 1995: 171-182
43 Carlo Blundo, Alfredo De Santis, Antonio Giorgio Gaggia, Ugo Vaccaro: New bounds on the information rate of secret sharing schemes. IEEE Transactions on Information Theory 41(2): 549-554 (1995)
42 Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: Zero-Knowledge Arguments and Public-Key Cryptography Inf. Comput. 121(1): 23-40 (1995)
41 Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro: Graph Decompositions and Secret Sharing Schemes. J. Cryptology 8(1): 39-64 (1995)
1994
40EEAlfredo De Santis, Tatsuaki Okamoto, Giuseppe Persiano: Zero-Knowledge Proofs af Computational Power in the Shared String Model. ASIACRYPT 1994: 182-192
39EECarlo Blundo, Alfredo De Santis, Giovanni Di Crescenzo, Antonio Giorgio Gaggia, Ugo Vaccaro: Multi-Secret Sharing Schemes. CRYPTO 1994: 150-163
38 Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung: On Monotone Formula Closure of SZK FOCS 1994: 454-465
37EECarlo Blundo, Alfredo De Santis, Ugo Vaccaro: Randomness in Distributed Protocols. ICALP 1994: 568-579
36EEAlfredo De Santis, Yvo Desmedt, Yair Frankel, Moti Yung: How to share a function securely. STOC 1994: 522-533
35 Renato M. Capocelli, Alfredo De Santis, Giuseppe Persiano: Binary prefix codes ending in a "1". IEEE Transactions on Information Theory 40(4): 1296- (1994)
34 Alfredo De Santis, Giuseppe Persiano: Tight Upper and Lower Bounds on the Path Length of Binary Trees. SIAM J. Comput. 23(1): 12-23 (1994)
33 Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: The Knowledge Complexity of Quadratic Residuosity Languages. Theor. Comput. Sci. 132(2): 291-317 (1994)
1993
32EECarlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro: Secret Sharing Schemes with Veto Capabilities. Algebraic Coding 1993: 82-89
31EECarlo Blundo, Antonella Cresti, Alfredo De Santis, Ugo Vaccaro: Fully Dynamic Secret Sharing Schemes. CRYPTO 1993: 110-125
30EEAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano: Secret Sharing and Perfect Zero Knowledge. CRYPTO 1993: 73-84
29EEMarco Carpentieri, Alfredo De Santis, Ugo Vaccaro: Size of Shares and Probability of Cheating in Threshold Schemes. EUROCRYPT 1993: 118-125
28EECarlo Blundo, Alfredo De Santis, Ugo Vaccaro: Efficient Sharing of Many Secrets. STACS 1993: 692-703
27 Roberto De Prisco, Alfredo De Santis: On Binary Search Trees. Inf. Process. Lett. 45(5): 249-253 (1993)
26 Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro: On the Size of Shares for Secret Sharing Schemes. J. Cryptology 6(3): 157-167 (1993)
1992
25EECarlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro: On the Information Rate of Secret Sharing Schemes (Extended Abstract). CRYPTO 1992: 148-167
24EECarlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung: Perfectly-Secure Key Distribution for Dynamic Conferences. CRYPTO 1992: 471-486
23EECarlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro: Graph Decompositions and Secret Sharing Schemes. EUROCRYPT 1992: 1-24
22 Alfredo De Santis, Giuseppe Persiano: Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract) FOCS 1992: 427-436
21EEAlfredo De Santis, Giuseppe Persiano, Moti Yung: One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier. ICALP 1992: 28-40
20EEAlfredo De Santis, Giuseppe Persiano: Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash). STACS 1992: 449-460
19 Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro: On the construction of statistically synchronizable codes. IEEE Transactions on Information Theory 38(2): 407-414 (1992)
18 Renato M. Capocelli, Alfredo De Santis: On the redundancy of optimal codes with limited word length. IEEE Transactions on Information Theory 38(2): 439- (1992)
1991
17EERenato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro: On the Size of Shares for Secret Sharing Schemes. CRYPTO 1991: 101-113
16 Alfredo De Santis, Giuseppe Persiano: An Optimal Algorithm for the Construction of Optimal Prefix Codes with Given Fringe. Data Compression Conference 1991: 297-306
15EEAlfredo De Santis, Giuseppe Persiano: Tight Bounds on the Path Length of Binary Trees. STACS 1991: 478-487
14 Renato M. Capocelli, Alfredo De Santis: A note on D-ary Huffman codes. IEEE Transactions on Information Theory 37(1): 174- (1991)
13 Renato M. Capocelli, Alfredo De Santis: New bounds on the redundancy of Huffman codes. IEEE Transactions on Information Theory 37(4): 1095-1104 (1991)
12 Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano: Noninteractive Zero-Knowledge. SIAM J. Comput. 20(6): 1084-1118 (1991)
1990
11EEAlfredo De Santis, Moti Yung: Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems. CRYPTO 1990: 366-377
10EERenato M. Capocelli, Alfredo De Santis: Minimum codeword length and redundancy of Huffman codes. EUROCODE 1990: 309-317
9EEAlfredo De Santis, Moti Yung: On the Design of Provably Secure Cryptographic Hash Functions. EUROCRYPT 1990: 412-431
8EEAlfredo De Santis, Giuseppe Persiano: Public-Randomness in Public Key Cryptography. EUROCRYPT 1990: 46-62
1989
7 Renato M. Capocelli, Alfredo De Santis: Tight upper bounds on the redundancy of Huffman codes. IEEE Transactions on Information Theory 35(5): 1084- (1989)
1988
6EEAlfredo De Santis, George Markowsky, Mark N. Wegman: Learning Probabilistic Prediction Functions. COLT 1988: 312-328
5EEAlfredo De Santis, Silvio Micali, Giuseppe Persiano: Non-Interactive Zero-Knowledge with Preprocessing. CRYPTO 1988: 269-282
4 Alfredo De Santis, George Markowsky, Mark N. Wegman: Learning Probabilistic Prediction Functions (Extended Abstract) FOCS 1988: 110-119
3 Renato M. Capocelli, Alfredo De Santis, Indeer Jeet Taneja: Bounds on the entropy series. IEEE Transactions on Information Theory 34(1): 134- (1988)
1987
2EEAlfredo De Santis, Silvio Micali, Giuseppe Persiano: Non-Interactive Zero-Knowledge Proof Systems. CRYPTO 1987: 52-72
1986
1 Renato M. Capocelli, Alfredo De Santis: Regular universal codeword sets. IEEE Transactions on Information Theory 32(1): 129- (1986)

Coauthor Index

1Giuseppe Ateniese [52] [53] [54] [80] [112]
2Pina Bergamo [97]
3Manuel Blum [12]
4Carlo Blundo [23] [24] [25] [28] [31] [32] [37] [39] [41] [43] [44] [46] [48] [51] [52] [53] [54] [55] [58] [60] [61] [64] [68] [69] [71] [74] [76] [80] [81] [83] [85] [87] [89] [90] [92] [95] [100] [105] [107] [116] [124]
5Annalisa De Bonis [78] [83] [84] [91]
6Renato M. Capocelli [1] [3] [7] [10] [13] [14] [17] [18] [19] [26] [35]
7Marco Carpentieri [29]
8Aniello Castiglione [114] [126]
9Luigi Catuogno [122]
10Francis Y. L. Chin (Francis Yuk-Lun Chin) [94]
11Angelo Ciaramella [108]
12Stelvio Cimato [98] [101] [102] [103] [105] [110] [113] [124]
13Giovanni Di Crescenzo [30] [33] [38] [39] [42] [59] [62] [66] [67] [72] [75] [79] [86] [88] [99] [120]
14Antonella Cresti [31] [46]
15Paolo D'Arco [81] [85] [87] [89] [90] [92] [95] [97] [100] [107] [108] [116] [123] [125]
16Yvo Desmedt [36]
17Anna Lisa Ferrara [93] [94] [102] [104] [106] [109] [112] [117] [118] [119] [121] [125]
18Sara Foresti [124]
19Yair Frankel [36]
20Antonio Giorgio Gaggia [39] [43] [71] [82]
21Clemente Galdi [85] [89] [92] [108]
22Luisa Gargano [17] [19] [25] [26] [32] [48]
23Oded Goldreich [62] [72]
24Amir Herzberg [24] [61]
25N. L. Ho [94]
26S. K. Kim [94]
27Ljupco Kocarev [97]
28Kaoru Kurosawa [69]
29Shay Kutten [24] [61]
30Massimiliano Listo [95]
31George Markowsky [4] [6]
32Barbara Masucci [70] [73] [77] [93] [96] [102] [104] [106] [109] [112] [115] [117] [118] [119] [121] [125]
33Silvio Micali [2] [5] [12]
34Moni Naor [76]
35Wakaha Ogata [69]
36Tatsuaki Okamoto [40]
37Rafail Ostrovsky [86]
38Stefano Paraboschi [124]
39Giuseppe Persiano (Pino Persiano) [2] [5] [8] [12] [15] [16] [20] [21] [22] [30] [33] [34] [35] [38] [40] [42] [44] [49] [59] [62] [66] [67] [72] [74] [75] [79] [86] [88] [99] [120]
40Umberto Ferraro Petrillo [101]
41Roberto De Prisco [27] [47] [50] [56] [57] [63] [65] [98] [103] [110] [111] [113] [126]
42Amit Sahai [86]
43Pierangela Samarati [124]
44Roberto De Simone [58]
45Claudio Soriente [114]
46Douglas R. Stinson [23] [41] [52] [53] [54] [68] [80] [87] [90] [116]
47Roberto Tagliaferri [108]
48Indeer Jeet Taneja [3]
49Ugo Vaccaro [17] [19] [23] [24] [25] [26] [28] [29] [31] [32] [37] [39] [41] [43] [44] [46] [48] [51] [58] [60] [61] [74] [82]
50Sabrina De Capitani di Vimercati [124]
51Mark N. Wegman [4] [6]
52Moti Yung (Mordechai M. Yung) [9] [11] [21] [24] [36] [38] [61] [66] [120]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)