Study and implementation of attacker detection system by extending honeyd (Record no. 4999)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01705nam a22001817a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20220107122809.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 160317b xxu||||| |||| 00| 0 eng d |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Anju G S(93613004) |
| 9 (RLIN) | 8544 |
| 245 ## - TITLE STATEMENT | |
| Title | Study and implementation of attacker detection system by extending honeyd |
| 502 ## - DISSERTATION NOTE | |
| Degree type | Master of Science in Computer Science and Information security |
| Name of granting institution | 2013-2015 |
| Year degree granted | EXT |
| -- | K Pradeep Kumar |
| -- | Vivek |
| Miscellaneous information | "Mirox Cyber Security & Technology" |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Honeypots are closely monitored network decoys serving several purposes: they can distract adversaries from more valuable machines on a network, they can provide early warning about new attack and exploitation trends and they allow in-depth examination of adversaries during and after exploitation of a honeypot. Deploying physical honeypot is often time intensive and expensive as different operating systems require specialized hardware and every honeypot requires its own physical system. This paper presents Honeyd, a framework for virtual honeypot that simulates virtual computer systems at the network level. The simulated computer systems appear to run on unallocated network addresses. To fool network fingerprinting tools, Honeyd simulates the networking stack of different operating systems and can provide arbitrary services for an arbitrary number of virtual systems. Furthermore, the system supports virtual routing topologies that allow the creation of large virtual networks including characteristics like latency and packet loss. We discuss Honeyd’s design and implementation. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | INFORMATION SECURITY |
| 9 (RLIN) | 8545 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | COMPUTER SECURITY |
| 9 (RLIN) | 8546 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | HONEYPOT |
| 9 (RLIN) | 8547 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Home library | Current library | Date acquired | Total Checkouts | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | IIITM-K | Kerala University of Digital Sciences, Innovation and Technology Knowledge Centre | 17/03/2016 | R-703 | 17/03/2016 | 17/03/2016 | Project Reports | |||||
| Dewey Decimal Classification | IIITM-K | Kerala University of Digital Sciences, Innovation and Technology Knowledge Centre | 08/02/2017 | R-923 | 08/02/2017 | 08/02/2017 | Project Reports |