Next: About this document ...
Up: Privacy-Preserving Sharing and Correlation
Previous: Conclusions
- 1
-
R. Agrawal, A. Evfimievski, and R. Srikant.
Information sharing across private databases.
In Proc. ACM SIGMOD '03, pages 86-97, 2003.
- 2
-
R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu.
Hippocratic databases.
In Proc. VLDB '02, pages 143-154, 2002.
- 3
-
M. Bellare, R. Canetti, and H. Krawczyk.
Keying hash functions for message authentication.
In Proc. CRYPTO '96, volume 1109 of LNCS, pages 1-15.
Springer-Verlag, 1996.
- 4
-
M. Bellare, R. Canetti, and H. Krawczyk.
HMAC: Keyed-hashing for message authentication.
Internet RFC 2104, February 1997.
- 5
-
D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano.
Public key encryption with keyword search.
In Proc. EUROCRYPT '04, volume 3027 of LNCS, pages
506-522. Springer-Verlag, 2004.
- 6
-
R. Canetti, R. Gennaro, A. Herzberg, and D. Naor.
Proactive security: long-term protection against break-ins.
Cryptobytes, 3(1):1-8, 1997.
- 7
-
K. Carr and D. Duffy.
Taking the Internet by storm.
CSOonline.com, April 2003.
- 8
-
C. Clifton, M. Kantarcioglou, J. Vaidya, X. Lin, and M. Zhu.
Tools for privacy preserving distributed data mining.
ACM SIGKDD Explorations, 4(2):28-34, 2002.
- 9
-
E. Damiani, S. D. C. di Vimercati, S. Paraboschi, P. Samarati, and F. Violante.
A reputation-based approach to choosing reliable resources in
peer-to-peer networks.
In Proc. ACM CCS '02, pages 207-216, 2002.
- 10
-
H. Debar and A. Wespi.
Aggregation and correlation of intrusion-detection alerts.
In Proc. RAID '01, pages 85-103, 2001.
- 11
-
Y. Desmedt and Y. Frankel.
Threshold cryptosystems.
In Proc. CRYPTO '89, volume 435 of LNCS, pages
307-315. Springer-Verlag, 1989.
- 12
-
R. Dingledine, N. Mathewson, and P. Syverson.
Reputation in P2P anonymity systems.
In Proc. Workshop on Economics of Peer-to-Peer Systems, 2003.
- 13
-
J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. Wright.
Secure multiparty computation of approximations.
In Proc. ICALP '01, volume 2076 of LNCS, pages
927-938. Springer-Verlag, 2001.
- 14
-
P. Gemmell.
An introduction to threshold cryptography.
Cryptobytes, 2(3):7-12, 1997.
- 15
-
A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung.
Proactive secret sharing, or how to cope with perpetual leakage.
In Proc. CRYPTO '95, volume 963 of LNCS, pages
339-352. Springer-Verlag, 1995.
- 16
-
Internet Security Systems.
Xbackdoor-kuang2v (4074).
ISS X-Force Advisory, April 2003.
- 17
-
J. Jegon.
Security firm: MyDoom worm fastest yet.
CNN.com, January 2004.
- 18
-
J. Leyden.
Blaster rewrites Windows worm rules.
The Register, August 2003.
https://www.securityfocus.com/news/6725.
- 19
-
Y. Lindell and B. Pinkas.
Privacy preserving data mining.
In Proc. CRYPTO '00, volume 1880 of LNCS, pages
36-54. Springer-Verlag, 2000.
- 20
-
D. Moore, V. Paxson, S. Savage, S. Staniford, and N. Weaver.
Inside the Slammer worm.
IEEE Security and Privacy, 1(4), 2003.
- 21
-
D. Moore, C. Shannon, and K. Claffy.
Code-Red: a case study on the spread and victims of an Internet
worm.
In Proc. ACM Internet Measurement Workshop '03, pages
273-284, 2003.
- 22
-
D. Moore, G. Voelker, and S. Savage.
Inferring Internet denial-of-service activity.
In Proc. USENIX Security Symposium, pages 9-22, 2001.
- 23
-
NIST.
Secure hash standard.
FIPS PUB 180-1, April 1995.
- 24
-
R. Pang and V. Paxson.
A high-level programming environment for packet trace anonymization
and transformation.
In Proc. ACM SIGCOMM '03, pages 339-351, 2003.
- 25
-
M. Peuhkuri.
A method to compress and anonymize packet traces.
In Proc. ACM Internet Measurement Workshop '01, pages
257-261, 2001.
- 26
-
M. Rabin.
How to exchange secrets by oblivious transfer.
Aiken Computation Laboratory Technical Memo TR-81, 1981.
- 27
-
M. Reiter and A. Rubin.
Crowds: anonymity for web transactions.
ACM Transactions on Information and System Security,
1(1):66-92, 1998.
- 28
-
Snort.
https://www.snort.org, 2004.
- 29
-
D. Song, D. Wagner, and A. Perrig.
Practical techniques for searches on encrypted data.
In Proc. IEEE Symposium on Security and Privacy, pages
44-55, 2000.
- 30
-
S. Staniford, V. Paxson, and N. Weaver.
How to own the Internet in your spare time.
In Proc. USENIX Security Symposium, pages 149-167, 2002.
- 31
-
Symantec.
Symantec Internet security threat report.
Technical report, Symantec Managed Security Services,
February 2003.
- 32
-
Symantec.
DeepSight threat management system home page.
https://tms.symantec.com, 2004.
- 33
-
P. Syverson, D. Goldschlag, and M. Reed.
Anonymous connections and onion routing.
In Proc. IEEE Symposium on Security and Privacy, pages 44-54,
1997.
- 34
-
J. Ullrich.
DShield home page.
https://www.dshield.org, 2004.
- 35
-
A. Valdes and K. Skinner.
Probabilistic alert correlation.
In Proc. RAID '01, pages 54-68, 2001.
- 36
-
J. Xu, J. Fan, M. Ammar, and S. Moon.
On the design and performance of prefix-preserving IP traffic trace
anonymization.
In Proc. ACM Internet Measurement Workshop '01, pages
263-266, 2001.
- 37
-
A. Yao.
Protocols for secure computation.
In Proc. IEEE FOCS '82, pages 160-164, 1982.
- 38
-
V. Yegneswaran, P. Barford, and S. Jha.
Global intrusion detection in the DOMINO overlay system.
In Proc. NDSS '04, 2004.
- 39
-
V. Yegneswaran, P. Barford, and J. Ullrich.
Internet intrusions: global characteristics and prevalence.
In Proc. ACM SIGMETRICS '03, pages 138-147, 2003.
- 40
-
C. Zou, W. Gong, and D. Towsley.
Code Red worm propagation modeling and analysis.
In Proc. ACM CCS '02, pages 138-147, 2002.
Vitaly Shmatikov
2004-05-18