Abstract: The most common forensic activity is searching a hard
disk for string of data. Nowadays, investigators and analysts are
increasingly experiencing large, even terabyte sized data sets when
conducting digital investigations. Therefore consecutive searching can
take weeks to complete successfully. There are two primary search
methods: index-based search and bitwise search. Index-based
searching is very fast after the initial indexing but initial indexing
takes a long time. In this paper, we discuss a high speed bitwise search
model for large-scale digital forensic investigations. We used pattern
matching board, which is generally used for network security, to
search for string and complex regular expressions. Our results indicate
that in many cases, the use of pattern matching board can substantially
increase the performance of digital forensic search tools.
Abstract: Electronic voting (E-voting) using an internet has been
recently performed in some nations and regions. There is no spatial
restriction which a voter directly has to visit the polling place, but an
e-voting using an internet has to go together the computer in which the
internet connection is possible. Also, this voting requires an access
code for the e-voting through the beforehand report of a voter. To
minimize these disadvantages, we propose a method in which a voter,
who has the wireless certificate issued in advance, uses its own cellular
phone for an e-voting without the special registration for a vote. Our
proposal allows a voter to cast his vote in a simple and convenient way
without the limit of time and location, thereby increasing the voting
rate, and also ensuring confidentiality and anonymity.
Abstract: Cell phone forensics to acquire and analyze data in the
cellular phone is nowadays being used in a national investigation
organization and a private company. In order to collect cellular phone
flash memory data, we have two methods. Firstly, it is a logical
method which acquires files and directories from the file system of the
cell phone flash memory. Secondly, we can get all data from bit-by-bit
copy of entire physical memory using a low level access method. In
this paper, we describe a forensic tool to acquire cell phone flash
memory data using a logical level approach. By our tool, we can get
EFS file system and peek memory data with an arbitrary region from
Korea CDMA cell phone.
Abstract: Since communications between tag and reader in RFID
system are by radio, anyone can access the tag and obtain its any
information. And a tag always replies with the same ID so that it is
hard to distinguish between a real and a fake tag. Thus, there are many
security problems in today-s RFID System. Firstly, unauthorized
reader can easily read the ID information of any Tag. Secondly,
Adversary can easily cheat the legitimate reader using the collected
Tag ID information, such as the any legitimate Tag. These security
problems can be typically solved by encryption of messages
transmitted between Tag and Reader and by authentication for Tag.
In this paper, to solve these security problems on RFID system, we
propose the Tag Authentication Scheme based on self shrinking
generator (SSG). SSG Algorithm using in our scheme is proposed by
W.Meier and O.Staffelbach in EUROCRYPT-94. This Algorithm is
organized that only one LFSR and selection logic in order to generate
random stream. Thus it is optimized to implement the hardware logic
on devices with extremely limited resource, and the output generating
from SSG at each time do role as random stream so that it is allow our
to design the light-weight authentication scheme with security against
some network attacks. Therefore, we propose the novel tag
authentication scheme which use SSG to encrypt the Tag-ID
transmitted from tag to reader and achieve authentication of tag.
Abstract: This paper proposes the authentication method using
ESA algorithm instead of using CAVE algorithm in the CDMA
mobile communication systems including IS-95 and CDMA2000 1x.
And, we analyze to apply ESA mechanism on behalf of CAVE
mechanism without the change of message format and air interface in
the existing CDMA systems. If ESA algorithm can be used as the
substitution of CAVE algorithm, security strength of authentication
algorithm is intensified without protocol change. An algorithm
replacement proposed in this paper is not to change an authentication
mechanism, but to configure input of ESA algorithm and to produce
output. Therefore, our proposal can be the compatible to the existing
systems.