Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Information Security

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 4591 - 4620 of 4669

Full-Text Articles in Computer Sciences

Cyberstalking, Personal Privacy, And Moral Responsibility, Herman T. Tavani, Frances Grodzinsky Jun 2002

Cyberstalking, Personal Privacy, And Moral Responsibility, Herman T. Tavani, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

This essay examines some ethical aspects of stalking incidents in cyberspace. Particular attention is focused on the Amy Boyer/Liam Youens case of cyberstalking, which has raised a number of controversial ethical questions. We limit our analysis to three issues involving this particular case. First, we suggest that the privacy of stalking victims is threatened because of the unrestricted access to on-line personal information, including on-line public records, currently available to stalkers. Second, we consider issues involving moral responsibility and legal liability for Internet service providers (ISPs) when stalking crimes occur in their `space' on the Internet. Finally, we examine issues …


Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert H. Deng Jun 2002

Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash functions are secure: 2(d-1)m/2 encryptions are necessary to find a collision, where d and m are the minimal distance of the code and the block size of block cipher, respectively. However, we show in this paper that a collision could be found with about alpha*2m encryptions, where alpha is a small number.


Using An Inductive Learning Algorithm To Improve Antibody Generation In A Single Packet Computer Defense Immune System, Russell J. Aycock Mar 2002

Using An Inductive Learning Algorithm To Improve Antibody Generation In A Single Packet Computer Defense Immune System, Russell J. Aycock

Theses and Dissertations

Coherent optical sources in the mid-infrared region (mid-IR) are important fundamental tools for infrared countermeasures and battlefield remote sensing. Nonlinear optical effects can be applied to convert existing near-IR laser sources to radiate in the mid-IR. This research focused on achieving such a conversion with a quasi-phase matched optical parametric oscillators using orientation-patterned gallium arsenide (OPGaAs), a material that can be quasi-phased matched by periodically reversing the crystal structure during the epitaxial growth process. Although non-linear optical conversion was not ultimately achieved during this research, many valuable lessons were learned from working with this material. This thesis reviews the theory …


Categorizing Network Attacks Using Pattern Classification Algorithms, George E. Noel Iii Mar 2002

Categorizing Network Attacks Using Pattern Classification Algorithms, George E. Noel Iii

Theses and Dissertations

The United States Air Force relies heavily on computer networks for many day-to-day activities. Many of these networks are affected by various types of attacks that can be launched from anywhere on the globe. The rising prominence of organizations such as the AFCERT and the MAJCOM NOSCs is evidence of an increasing realization among the Air Force leadership that protecting our computer networks is vitally important. A critical requirement for protecting our networks is the ability to detect attacks and intrusion attempts. This research is an effort to refine a portion of an AFIT-developed intrusion detection system known as the …


Using Relational Schemata In A Computer Immune System To Detect Multiple-Packet Network Intrusions, John L. Bebo Mar 2002

Using Relational Schemata In A Computer Immune System To Detect Multiple-Packet Network Intrusions, John L. Bebo

Theses and Dissertations

Given the increasingly prominent cyber-based threat, there are substantial research and development efforts underway in network and host-based intrusion detection using single-packet traffic analysis. However, there is a noticeable lack of research and development in the intrusion detection realm with regard to attacks that span multiple packets. This leaves a conspicuous gap in intrusion detection capability because not all attacks can be found by examining single packets alone. Some attacks may only be detected by examining multiple network packets collectively, considering how they relate to the "big picture," not how they are represented as individual packets. This research demonstrates a …


Experimenting With Server-Aided Signatures, Xuhua Ding, D. Mozzacchi, Gene Tsudik Feb 2002

Experimenting With Server-Aided Signatures, Xuhua Ding, D. Mozzacchi, Gene Tsudik

Research Collection School Of Computing and Information Systems

This paper explores practical and conceptual implications of using Server-Aided Signatures (SAS). SAS is a signature method that relies on partiallytrusted servers for generating public key signatures for regular users. Besides its two primary goals of 1) aiding small, resource-limited devices in computing heavy-weight (normally expensive) digital signatures and 2) fast certificate revocation, SAS also o#ers signature causality and has some interesting features such as built-in attack detection for users and DoS resistance for servers.


An Analysis Of A Private-Key Cryptosystem, Wei-Wey Tan Jan 2002

An Analysis Of A Private-Key Cryptosystem, Wei-Wey Tan

Student Works (2000-2009)

In this dissertation, we have presented a new block cipher. The proposed block cipher is a Substitution-Permutation network cryptosystem with a block length of 128 bits and key length of 256 bits. With the increased key length and block size, the proposed block cipher has greater security over DES. A modular design approach was applied. The cipher has three major building blocks and their interaction has been carefully chosen to achieve better security and performance. Algorithmic S­-Boxes are used to provide confusion and nonlinearity in the cipher. The proposed cipher uses a highly diffusive diffusion layer, which is a combination …


Internet Information Server Scanner : Scanning On Url Vulnerabilities, Yu Jin Tan Jan 2002

Internet Information Server Scanner : Scanning On Url Vulnerabilities, Yu Jin Tan

Student Works (2000-2009)

This dissertation analyzes weaknesses on web servers, focusing on Microsoft's Internet Information Server (HS). As part of the research, an HS scanner (HS-SCAN) has been implemented to probe only on URL vulnerabilities. The need for a vulnerability scanner stems from the alarming number of successful attacks on computer systems that are connected to the Internet. The security flaws threatening e-businesses and the Internet community has prompted bona fide defense measures. Internet firewalls - gateways controlling access between one network and all the others - became a must-have for any organization connecting to the Net. If the firewall is considered the …


Enhancing Profiles For Anomaly Detection Using Time Granularities, Yingjiu Li, Ningning Wu, X. Sean Wang, Sushil Jajodia Jan 2002

Enhancing Profiles For Anomaly Detection Using Time Granularities, Yingjiu Li, Ningning Wu, X. Sean Wang, Sushil Jajodia

Research Collection School Of Computing and Information Systems

Recently, association rules have been used to generate profiles of normal behavior for anomaly detection. However, the time factor (especially in terms of multiple time granularities) has not been utilized extensively in generation of these profiles. In reality, user behavior during different time intervals may be very different. For example, the normal number and duration of FTP connections may vary from working hours to midnight, from business day to weekend or holiday. Furthermore, these variations may depend on the day of the month or the week. This paper proposes to build profiles using temporal association rules in terms of multiple …


Protecting The Infrastructure: 3rd Australian Information Warfare & Security Conference 2002, William Hutchinson (Ed.) Jan 2002

Protecting The Infrastructure: 3rd Australian Information Warfare & Security Conference 2002, William Hutchinson (Ed.)

Research outputs pre 2011

The conference is hosted by the We-B Centre (working with a-business) in the School of Management Information System, the School of Computer & Information Sciences at Edith Cowan University. This year's conference is being held at the Sheraton Perth Hotel in Adelaide Terrace, Perth. Papers for this conference have been written by a wide range of academics and industry specialists. We have attracted participation from both national and international authors and organisations.

The papers cover many topics, all within the field of information warfare and its applications, now and into the future.

The papers have been grouped into six streams: …


Slowstart Congestion Control For Fine-Grained Layered Multicast, Khalid Shaheen Dec 2001

Slowstart Congestion Control For Fine-Grained Layered Multicast, Khalid Shaheen

Archived Theses and Dissertations

No abstract provided.


Privacy Protection For Transactions Of Digital Goods, Feng Bao, Robert H. Deng Nov 2001

Privacy Protection For Transactions Of Digital Goods, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper we study the problem of how to protect users’ privacy in web transactions of digital goods. In particular, we introduce a system which allows a user to disclose his/her identity information (such as user account or credit card number) to a web site in exchange for a digital item, but prevents the web site from learning which specific item the user intends to obtain. The problem concerned here is orthogonal to the problem of anonymous transactions [RSG98], [RR98] but commensurate with the general problem of PIR (private information retrieval) [CGK95]


A Method For Fast Revocation Of Public Key Certificates And Security Capabilities, D. Boneh, Xuhua Ding, Gene Tsudik, Chi Ming Wong Aug 2001

A Method For Fast Revocation Of Public Key Certificates And Security Capabilities, D. Boneh, Xuhua Ding, Gene Tsudik, Chi Ming Wong

Research Collection School Of Computing and Information Systems

We present a new approach to fast certificate revocation centered around the concept of an on-line semi-trusted mediator (SEM). The use of a SEM in conjunction with a simple threshold variant of the RSA cryptosystem (mediated RSA) offers a number of practical advantages over current revocation techniques. Our approach simplifies validation of digital signatures and enables certificate revocation within legacy systems. It also provides immediate revocation of all security capabilities. This paper discusses both the architecture and implementation of our approach as well as performance and compatibility with the existing infrastructure. Our results show that threshold cryptography is practical for …


Generating Market Basket Data With Temporal Information, Yingjiu Li, Peng Ning, X. Sean Wang, Sushil Jajodia Aug 2001

Generating Market Basket Data With Temporal Information, Yingjiu Li, Peng Ning, X. Sean Wang, Sushil Jajodia

Research Collection School Of Computing and Information Systems

This paper presents a synthetic data generator that outputs timestamped transactional data with embedded temporal patterns controlled by a set of input parameters. In particular, calendar schema, which is determined by a hierarchy of input time granularities, is used as a framework of possible temporal patterns. An example of calendar schema is (year, month, day), which provides a framework for calendar-based temporal patterns of the form -38352 , where each is either an integer or the symbol . For example, is such a pattern, which corresponds to the time intervals consisting of all the 16th days of all months in …


Secure And Private Distribution Of Online Video And Some Related Cryptographic Issues, Feng Bao, Robert H. Deng, Peirong Bao, Yan Guo, Hongjun Wu Jul 2001

Secure And Private Distribution Of Online Video And Some Related Cryptographic Issues, Feng Bao, Robert H. Deng, Peirong Bao, Yan Guo, Hongjun Wu

Research Collection School Of Computing and Information Systems

With the rapid growth of broadband infrastructure, it is thought that the bottleneck for video-on-demand service through Internet is being cleared. However, digital video content protection and consumers privacy protection emerge as new major obstacles. In this paper we propose an online video distribution system with strong content security and privacy protection. We mainly focus on the study of security and privacy problems related to the system. Besides presenting the new system, we intensively discuss some relevant cryptographic issues, such as content protection, private information retrieval, super-speed encryption/decryption for video, and PKC with fast decryption etc. The paper can be …


An Analysis Of The Computer And Network Attack Taxonomy, Richard C. Daigle Mar 2001

An Analysis Of The Computer And Network Attack Taxonomy, Richard C. Daigle

Theses and Dissertations

The Air Force's dependence on the Internet continues to increase daily. However, this increased dependence comes with risks. The popularity and potential of the Internet attracts users with illegal as well as legal intentions. Since the Air Force considers the Internet an integral component of its information Operations strategy, the Air Force must be confident that it can trust the security of this component. Therefore, reliable methods and information that helps the Air Force classify the risks associated with the Internet can help the Air Force determine the best processes to assure the security of its use of this resource. …


The Effect Of Contextual-Based Training On Artifact-Based Deception Detection, Elizabeth A. Autrey Mar 2001

The Effect Of Contextual-Based Training On Artifact-Based Deception Detection, Elizabeth A. Autrey

Theses and Dissertations

Air Force dependence on information technology (IT) creates vulnerabilities that it cannot ignore. With global availability of commercial IT and the Internet, the Air Force does not necessarily have the high technological advantage over potential adversaries that it once had. Furthermore, it is possible to directly and covertly manipulate information within information systems, or artifacts, without notice. This directly affects decision makers since the availability and integrity of information is critical. Air Force physical and network security measures taken to protect its information do not guarantee detection of direct information manipulation. This leaves it to information artifact users to detect …


A Process For Vectoring Offensive Information Warfare As A Primary Weapon Option Within The United States Air Force, Sheila G. Bennett Mar 2001

A Process For Vectoring Offensive Information Warfare As A Primary Weapon Option Within The United States Air Force, Sheila G. Bennett

Theses and Dissertations

Consistently and comprehensively using Information Operations (IO) capabilities as primary weapon option within the Air Force is the next step to operationalizing IO within the Air Force. Doctrine and official guidance has set the variables of mission and concepts of operations, organizational structure, and IW players in place. The missing variable to operationalizing IO and probably the most difficult is the 'how' or process of the equation. This research will introduce a useable process that can be incorporated within the Air Force for integrating offensive IW activities into the current and given environment. The process is the basis for further …


Malicious Hackers: A Framework For Analysis And Case Study, Laura J. Kleen Mar 2001

Malicious Hackers: A Framework For Analysis And Case Study, Laura J. Kleen

Theses and Dissertations

Recent years have seen an increase in the number and severity of Information Operations (IO) attacks upon DoD resources. At a higher level, the US as a whole has come under cyber attack by individuals and groups seeking thrills, monetary gain, publicity for their causes, and myriad other goals. This effort develops a first cut model of individual hacker mentality that can be utilized to improve threat assessment, mitigate Information Assurance (IA) vulnerabilities, and improve risk assessment. Further, it is a first step toward automated characterization of Information Warfare (IW) attacks based upon hacker types. All hackers are not the …


Modeling Information Assurance, Joseph E. Beauregard Mar 2001

Modeling Information Assurance, Joseph E. Beauregard

Theses and Dissertations

The ever-increasing speed of information systems allows decision-makers around the world to gather, process, and disseminate information almost instantaneously. However, with this benefit there comes a price. Information is valuable and therefore a target to those who do not have it or wish to destroy it. The Internet has allowed information to flow freely, but it has also made information vulnerable to many forms of corruption. The U. S. military controls much of the world's most sensitive information, and since it cannot sacrifice losing the speed at which this information is currently processed and disseminated, it must find a way …


Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng Feb 2001

Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete logarithm problem is hard to solve. Two schemes (the ID-type and the random-type schemes) based on the linear scheme for the Key Predistribution Systems (KPS) and the discrete logarithm problem (DLP) were given. In this paper we show that those two schemes fail to meet the nonrepudiation requirement: with negligible amount of computation, a signature could be forged. For the ID-type signature scheme, any verifier could forge a signature to raise repudiation between that …


Cryptanalysis Of Two Sparse Polynomial Based Public Key Cryptosystems, Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu Feb 2001

Cryptanalysis Of Two Sparse Polynomial Based Public Key Cryptosystems, Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu

Research Collection School Of Computing and Information Systems

The application of sparse polynomials in cryptography has been studied recently. A public key encryption scheme EnRoot [4] and an identification scheme SPIFI [1] based on sparse polynomials were proposed. In this paper, we show that both of them are insecure. The designers of SPIFI proposed the modified SPIFI [2] after Schnorr pointed out some weakness in its initial version. Unfortunately, the modified SPIFI is still insecure. The same holds for the generalization of EnRoot proposed in [2].


Legal Deposit Of Electronic Publications : Perpustakaan Negara Malaysia's Experience, Shahrozat Ibrahim Jan 2001

Legal Deposit Of Electronic Publications : Perpustakaan Negara Malaysia's Experience, Shahrozat Ibrahim

Student Works (2000-2009)

The main purpose of this study is to analyse the statistical data of non-print/ electronic publications received and registered by the National Depository Centre, Perpustakaan Negara Malaysia since the enforcement of the Deposit of Library Material Act, 1986. Statistical data of non-print/electronic publications received from the years 1988-2000 were obtained from the National Depository Centre, Perpustakaan Negara Malaysia. The study revealed that out of the 7,926 titles of non-print publications received and registered from the year 1988-2000, only 165 titles (2.08%) are electronic publications, of which CD-ROMs constitute 1.87%, while diskettes and computer software constitute 0.19% and 0.03% respectively. The …


E-Mail Filter With Attachment Scanning Prototype, Losini Goval Hema Jan 2001

E-Mail Filter With Attachment Scanning Prototype, Losini Goval Hema

Student Works (2000-2009)

The E-mail Filter is a mail client that retrieves mails from the Ms Outlook Express, which retrieves mails from POP3 server and categorizes them into different a category that has different level of priorities. Attachments in the incoming mails are scanned and sent to respective folders. These attachments will be stored in the personal computer for easy reference. Meanwhile, the automatic response system automatically replies the mails classified in the Appointments category using automatic response, which runs even when the e-mails are closed. The E-mail Filter with Attachment Scanning Prototype is a stand-alone system. It has a user-friendly concept and …


Electronic Questionnaire, Lip Yee Por Jan 2001

Electronic Questionnaire, Lip Yee Por

Student Works (2000-2009)

This project aims to develop an E-Questionnaire for users through the web. Besides that, it will create awareness among users on the proper way of using password and more. E-Questionnaire System provides users information for example information about password usage. Moreover, this system provides an example for users as a guideline to answer questionnaire on web. Those questions inside EQuestionnaire's questionnaire are in both open ended and dosed format. Users can answer in Malay and English languages. E-Questionnaire does provide online submitting facility. After accumulating, reports can be generated by users. This application will be developed using the prototype model. …


Working For Excellence In The E-Conomy: 2nd International We-B Conference, Sue Stoney (Ed.) Jan 2001

Working For Excellence In The E-Conomy: 2nd International We-B Conference, Sue Stoney (Ed.)

Research outputs pre 2011

Welcome to Perth, Western Australia, and to the 2nd International We-B Conference 2001 "working for excellence in the e-conomy" hosted by the We-B Centre, School of Management Information Systems at Edith Cowan University.

This is an international conference for academics and industry specialists in e-business, e-government and related fields. The conference has drawn participants from national and international organisations.

All submitted papers were subjected to an anonymous peer review process managed by the Conference Committee.


Mpls Vpn Simulation Using Mp-Ibgp, Tan Fong Ang Jan 2001

Mpls Vpn Simulation Using Mp-Ibgp, Tan Fong Ang

Student Works (2000-2009)

As Internet traffic continues to increase, companies are demanding greater speeds and better services to disseminate information to their customers, partners and employees. In order to provide reliable services and to support a variety of secure communications among a wide range of locations, Multiprotocol Label Switching Virtual Private Network (MPLS VPN) has been introduced. MPLS is an emerging technology that aims to address many of the existing issues associated with packet forwarding in today's internetworking environment. Whereas, VPN provides secure private connections through public infrastructure amongst multiple locations. MPLS­ based VPN provides isolation. security, simplified routing, easier provisioning as well …


An Efficient And Practical Scheme For Privacy Protection In E-Commerce Of Digital Goods, Feng Bao, Robert H. Deng, Peirong Feng Dec 2000

An Efficient And Practical Scheme For Privacy Protection In E-Commerce Of Digital Goods, Feng Bao, Robert H. Deng, Peirong Feng

Research Collection School Of Computing and Information Systems

It is commonly acknowledged that customers’ privacy in electronic commerce should be well protected. The solutions may come not only from the ethics education and legislation, but also from cryptographic technologies. In this paper we propose and analyze a privacy protection scheme for e-commerce of digital goods. The scheme takes cryptography as its technical means to realize privacy protection for online customers. It is efficient in both computational cost and communication cost. It is very practical for real e-commerce systems compared with previous solutions. The cryptographic technique presented in this paper is rather simple. But the scheme has great application …


The Cracker Patch Choice: An Analysis Of Post Hoc Security Techniques, Crispin Cowan, Heather Hinton, Calton Pu, Jonathan Walpole Oct 2000

The Cracker Patch Choice: An Analysis Of Post Hoc Security Techniques, Crispin Cowan, Heather Hinton, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

It has long been known that security is easiest to achieve when it is designed in from the start. Unfortunately, it has also become evident that systems built with security as a priority are rarely selected for wide spread deployment, because most consumers choose features, convenience, and performance over security. Thus security officers are often denied the option of choosing a truly secure solution, and instead must choose among a variety of post hoc security adaptations. We classify security enhancing methods, and compare and contrast these methods in terms of their effectiveness vs. cost of deployment. Our analysis provides practitioners …


Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng Jul 2000

Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng

Research Collection School Of Computing and Information Systems

Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP ’98, Fung and Gray proposed an m-permutation protection scheme against the EEPROM modification attack. At ACISP ’99, Fung and Gray pointed out that in their original scheme, a secret key with too small or too large Hamming weight could be recovered easily. Then they proposed a revised m- permutation protection scheme and claimed that their revised scheme does not leak any information of the secret key. In this paper, we break completely both the original and the revised …