Automatic reassembly of document fragments via context based statistical models

Proceedings - Annual Computer Security Applications Conference, ACSAC

Volumn 2003-January, Issue , 2003, Pages 152-159

  Shanmugasundaram, Kulesh ^a   Memon, Nasir ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; SECURITY OF DATA; SECURITY SYSTEMS;

COMPLETE GRAPHS; CONTEXT MODELLING; CONTEXT-BASED; DIGITAL FORENSIC; GENERAL PROCESS MODELS; HAMILTONIAN PATH; OPTIMAL ORDERING; STATISTICAL MODELLING;

DATA COMPRESSION;

EID: 84944746002     PISSN: 10639527     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSAC.2003.1254320     Document Type: Conference Paper

References (18)

1. J. G. Cleary and W. J. Teahan. Unbounded length context for ppm. The Computer Journal, 1997.
2. T. H. Cormen and e. a. Leiserson C. E. Introduction to algorithms. MIT Press, 2001.
3. G. S. I. Encase. http://www.encase.com/.
4. Freenet. http://freenetproject.org/.
5. Gnutella. http://gnutella.wego.com/.
6. I. Hamer and P. Chow. Des cracking on the transmogrifier 2a. Cryptographic Hardware and Embedded Systems, LNCS 1717, Springer-Verlag,, pages 13-24, 1999.
7. T. S. Kit. http://www.sleuthkit.org/.
8. D. E. Knuth and R. W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, pages 293-326, 1975.
9. J. Kubiatowicz and D. e. a. Bindel. Oceanstore: An architecture for global-scale persistent storage. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems, 2000.
10. H. C. G. Leitao and J. Stolfi. A multi-scale mehtod for the re-assembly of fragmented objects. Proc. British Machine Vision Conference - BMVC 2000, 2:705-714, 2000.
11. A. Moffat. Implementing the ppm data compression scheme. IEEE Transactions on Communications, 1990.
12. M. o-o t. http://www.m-o-o-t.org/.
13. J. J. Rissanen. A universal data compression system. IEEE Transactions on Information Theory, 29(5):656-664, 1983.
14. J. J. Rissanen and G. G. Langdon. Arithmetic coding. IBM J. Res. Dev., 23(2):149-162, 1979.
15. J. J. Rissanen and G. G. Langdon. Universal modelling and coding. IEEE Transactions on Information Theory, 1981.
16. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms, pages 329-350, 2001.
17. I. Stoica and R. e. a. Morris. Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM 2001, pages 149-160, 2001.
18. T. C. T. (TCT). http://www.porcupine.org/forensics/tct.html.