| 2008 |
|---|
| 37 | EE | Roberto Paleari,
Davide Marrone,
Danilo Bruschi,
Mattia Monga:
On Race Vulnerabilities in Web Applications.
DIMVA 2008: 126-142 |
| 36 | EE | Emanuele Passerini,
Roberto Paleari,
Lorenzo Martignoni,
Danilo Bruschi:
FluXOR: Detecting and Monitoring Fast-Flux Service Networks.
DIMVA 2008: 186-206 |
| 2007 |
|---|
| 35 | EE | Danilo Bruschi,
Lorenzo Cavallaro,
Andrea Lanzi:
Static Analysis on x86 Executables for Preventing Automatic Mimicry Attacks.
DIMVA 2007: 213-230 |
| 34 | EE | Danilo Bruschi,
Bart De Win,
Seok-Won Lee,
Mattia Monga:
The 3rd International Workshop on Software Engineering for Secure Systems SESS07 - Dependable and Secure.
ICSE Companion 2007: 111-112 |
| 33 | EE | Danilo Bruschi,
Lorenzo Cavallaro,
Andrea Lanzi:
An Efficient Technique for Preventing Mimicry and Impossible Paths Execution Attacks.
IPCCC 2007: 418-425 |
| 32 | EE | Danilo Bruschi,
Lorenzo Cavallaro,
Andrea Lanzi:
Diversified Process Replicæ for Defeating Memory Error Exploits.
IPCCC 2007: 434-441 |
| 2006 |
|---|
| 31 | EE | Danilo Bruschi,
Lorenzo Martignoni,
Mattia Monga:
Detecting Self-mutating Malware Using Control-Flow Graph Matching.
DIMVA 2006: 129-143 |
| 30 | EE | Danilo Bruschi,
Bart De Win,
Mattia Monga:
Software engineering for secure systems.
ICSE 2006: 1007-1008 |
| 2005 |
|---|
| 29 | EE | Danilo Bruschi,
Lorenzo Cavallaro,
Andrea Lanzi,
Mattia Monga:
Replay Attack in TCG Specification and Solution.
ACSAC 2005: 127-137 |
| 28 | EE | Danilo Bruschi,
Bart De Win,
Mattia Monga:
Software engineering for secure systems.
ICSE 2005: 681 |
| 27 | EE | Danilo Bruschi,
Igor Nai Fovino,
Andrea Lanzi:
A Protocol for Anonymous and Accurate E-Polling.
TCGOV 2005: 112-121 |
| 26 | EE | Danilo Bruschi,
Bart De Win,
Mattia Monga:
Software engineering for secure systems.
ACM SIGSOFT Software Engineering Notes 30(4): 1-2 (2005) |
| 2003 |
|---|
| 25 | EE | Danilo Bruschi,
D. Fabris,
V. Glave,
Emilia Rosti:
How to unwittingly sign non-repudiable documents with Java applications.
ACSAC 2003: 192-196 |
| 24 | EE | Danilo Bruschi,
A. Ornaghi,
Emilia Rosti:
S-ARP: a Secure Address Resolution Protocol.
ACSAC 2003: 66-75 |
| 23 | | Danilo Bruschi,
A. Curti,
Emilia Rosti:
A quantitative study of Public Key Infrastructures.
Computers & Security 22(1): 56-67 (2003) |
| 2002 |
|---|
| 22 | EE | Roberto Barbieri,
Danilo Bruschi,
Emilia Rosti:
Voice over IPsec: Analysis and Solutions.
ACSAC 2002: 261-270 |
| 21 | EE | Danilo Bruschi,
Fiorella de Cindio,
D. Ferrazzi,
G. Poletti,
Emilia Rosti:
Internet Voting: Do people accept it? Do they trust it?
DEXA Workshops 2002: 437-440 |
| 20 | | Danilo Bruschi,
Emilia Rosti:
Secure Multicast in Wireless Networks of Mobile Hosts: Protocols and Issues.
MONET 7(6): 503-511 (2002) |
| 2001 |
|---|
| 19 | EE | Stefano Basagni,
Kris Herrin,
Danilo Bruschi,
Emilia Rosti:
Secure pebblenets.
MobiHoc 2001: 156-163 |
| 18 | EE | Danilo Bruschi,
Emilia Rosti:
AngeL: a tool to disarm computer systems.
NSPW 2001: 63-69 |
| 2000 |
|---|
| 17 | EE | Danilo Bruschi,
Lorenzo Cavallaro,
Emilia Rosti:
Less Harm, Less Worry or How to Improve Network Security by Bounding System Offensiveness.
ACSAC 2000: 188-195 |
| 16 | | Stefano Basagni,
Danilo Bruschi:
A logarithmic lower bound for time-spread multiple-access (TSMA) protocols.
Wireless Networks 6(2): 161-163 (2000) |
| 1999 |
|---|
| 15 | EE | Arianna Arona,
Danilo Bruschi,
Emilia Rosti:
Adding Availability to Log Services of Untrusted Machines.
ACSAC 1999: 199- |
| 14 | EE | Stefano Basagni,
Imrich Chlamtac,
Danilo Bruschi:
A mobility-transparent deterministic broadcast mechanism for ad hoc networks.
IEEE/ACM Trans. Netw. 7(6): 799-807 (1999) |
| 1998 |
|---|
| 13 | EE | Danilo Bruschi,
Emilia Rosti,
R. Banfi:
A Tool for Pro-active Defense Against the Buffer Overrun Attack.
ESORICS 1998: 17-31 |
| 1997 |
|---|
| 12 | | Danilo Bruschi,
Massimiliano Del Pinto:
Lower Bounds for the Broadcast Problem in Mobile Radio Networks.
Distributed Computing 10(3): 129-135 (1997) |
| 11 | | Stefano Basagni,
Danilo Bruschi,
F. Ravasio:
On the Difficulty of Finding Walks of Length k.
ITA 31(5): 429-435 (1997) |
| 1995 |
|---|
| 10 | | Danilo Bruschi,
F. Ravasio:
Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings, and Cycles.
Algorithmica 13(4): 346-356 (1995) |
| 1994 |
|---|
| 9 | | Danilo Bruschi,
Giovanni Pighizzini,
Nicoletta Sabadini:
On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages
Inf. Comput. 108(2): 262-285 (1994) |
| 1993 |
|---|
| 8 | | Eric Allender,
Danilo Bruschi,
Giovanni Pighizzini:
The Complexity of Computing Maximal Word Functions.
Computational Complexity 3: 368-391 (1993) |
| 1992 |
|---|
| 7 | | Danilo Bruschi:
Strong Separations of the Polynomial Hierarchy with Oracles: Constructive Separations by Immune and Simple Sets.
Theor. Comput. Sci. 102(2): 215-252 (1992) |
| 1991 |
|---|
| 6 | | Danilo Bruschi,
Giovanni Pighizzini:
The Complexity of Computing Maximal Word Functions.
FCT 1991: 157-167 |
| 5 | | Alberto Bertoni,
Danilo Bruschi,
Massimiliano Goldwurm:
Ranking and Formal Power Series.
Theor. Comput. Sci. 79(1): 25-35 (1991) |
| 1990 |
|---|
| 4 | | Danilo Bruschi,
Deborah Joseph,
Paul Young:
Strong Separations for the Boolean Hierarchy over RP.
Int. J. Found. Comput. Sci. 1(3): 201-218 (1990) |
| 1989 |
|---|
| 3 | | Alberto Bertoni,
Danilo Bruschi,
Deborah Joseph,
Meera Sitharam,
Paul Young:
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
FCT 1989: 35-46 |
| 2 | | Danilo Bruschi,
Deborah Joseph,
Paul Young:
A Structural Overview of NP Optimization Problems.
Optimal Algorithms 1989: 205-231 |
| 1988 |
|---|
| 1 | | Danilo Bruschi,
Giovanni Pighizzini,
Nicoletta Sabadini:
On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages.
STACS 1988: 334-345 |
