Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (11)
- OS and Networks (6)
- Business (4)
- E-Commerce (2)
- Engineering (2)
-
- Management Information Systems (2)
- Numerical Analysis and Scientific Computing (2)
- Other Computer Sciences (2)
- Theory and Algorithms (2)
- Applied Statistics (1)
- Artificial Intelligence and Robotics (1)
- Computer Engineering (1)
- Digital Communications and Networking (1)
- Graphics and Human Computer Interfaces (1)
- Mathematics (1)
- Medical Biomathematics and Biometrics (1)
- Medical Sciences (1)
- Medicine and Health Sciences (1)
- Operations Research, Systems Engineering and Industrial Engineering (1)
- Other Operations Research, Systems Engineering and Industrial Engineering (1)
- Programming Languages and Compilers (1)
- Software Engineering (1)
- Statistics and Probability (1)
- Systems Architecture (1)
- Institution
- Keyword
-
- [aism] (10)
- Computer security (8)
- Information security (5)
- Authentication (3)
- Authenticated Key Exchange (2)
-
- Clustering (2)
- Computer networks (2)
- Computer networks -- Security measures (2)
- Computer networks--Security measures (2)
- Cyberterrorism--Prevention (2)
- Data protection (2)
- Data security (2)
- MDS array codes (2)
- Multiple disk failures (2)
- Public key cryptography (2)
- RAID (2)
- Security (2)
- Security of data (2)
- 802.11 (1)
- Access control (1)
- Active attacks (1)
- Ad hoc networks (1)
- Aggregated signature (1)
- And Mobile Ad Hoc Networks (1)
- Anomaly detection (1)
- Anomaly detection (Computer security) (1)
- Anonymous Roaming (1)
- Availability (1)
- Average user lifetime (1)
- Benchmarking (1)
- Publication
- Publication Type
Articles 1 - 30 of 56
Full-Text Articles in Information Security
Using Prospect Theory To Investigate Decision-Making Bias Within An Information Security Context, Neil J. Schroeder
Using Prospect Theory To Investigate Decision-Making Bias Within An Information Security Context, Neil J. Schroeder
Theses and Dissertations
Information security is an issue that has increased in importance over the past decade. In this time both practitioner and academic circles have researched and developed practices and process to more effectively handle information security. Even with growth in these areas there has been little research conducted into how decision makers actually behave. This is problematic because decision makers in the Department of Defense have been observed exhibiting risk seeking behavior when making information security decisions that seemingly violate accepted norms. There are presently no models in the literature that provide sufficient insight into this phenomenon. This study used Prospect …
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
A new class of Binary Maximum Distance Separable (MDS) array codes which are based on circular permutation matrices are introduced in this paper. These array codes are used for tolerating multiple (greater than or equal to 4) disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is m \times n, where n is the number of information disks and (m+1) is a prime integer; the size of the parity-check part is m \times r, the minimum distance is r+1, and the number of parity-check disks is r. In practical applications, m can be …
Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou
Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou
Research Collection School Of Computing and Information Systems
We propose a communication-efficient authentication scheme to authenticate query results disseminated by untrusted data publishing servers. In our scheme, signatures of multiple tuples in the result set are aggregated into one and thus the communication overhead incurred by the signature keeps constant. Next attr-MHTs (tuple based Merkle Hash Tree) are built to further reduce the communication overhead incurred by auxiliary authentication information (AAI). Besides the property of communication-efficiency, our scheme also supports dynamic SET operations (UNION, INTERSECTION) and dynamic JOIN with immunity to reordering attack.
Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang
Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang
Research Collection School Of Computing and Information Systems
It is accepted that digital watermarking is quite relevant in medical imaging. However, due to the special nature of clinical practice, it is often required that watermarking not introduce irreversible distortions to medical images. The electronic clinical atlas has such a need of "lossless" watermarking. We present two tailored reversible watermarking schemes for the clinical atlas by exploiting its inherent characteristics. We have implemented the schemes and our experimental results look very promising.
A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao
A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao
Research Collection School Of Computing and Information Systems
The need for protecting rights over relational data is of ever increasing concern. There have recently been some pioneering works in this area. In this paper, we propose an effective fingerprinting scheme based on the idea of block method in the area of multimedia fingerprinting. The scheme ensures that certain bit positions of the data contain specific values. The bit positions are determined by the keys known only to the owner of the data and different buyers of the database have different bit positions and different specific values for those bit positions. The detection of the fingerprint can be completed …
Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng
Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
A forward secure blind signature scheme was proposed by Duc, Cheon and Kim, in ICICS 2003. The security of the scheme was proved to be equivalent to the strong RSA assumption in the random oracle model. In this paper we present an attack to the scheme by forging valid signatures with public keys only. The attack is so efficient that forging a valid signature needs less computation than legally generating a signature, even considering only the user side. Our result implies that the security proof of the scheme must be invalid. Furthermore we point out the fault of the proof …
Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng
Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
The contribution of this paper has two folds. In the first fold, we propose a generic construction of sequential aggregate signatures from families of certificated trapdoor one-way permutations. We show that our construction is provably secure in the random oracle model assuming that the underlying homomorphic permutations are trapdoor one-way. Compared to Lysyanskaya et al’s generic construction that is constructed from a trapdoor one-way permutation family working over the same domain [16], our scheme works over independent trapdoor one-way permutation domains. The flexible choice of the underlying permutation domains benefits our scheme to its applications in the real world where …
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, …
On Security Notions Of Steganographic Systems, Kisik Chang, Robert H. Deng, Feng Bao, Sangjin Lee, Hyungjun Kim
On Security Notions Of Steganographic Systems, Kisik Chang, Robert H. Deng, Feng Bao, Sangjin Lee, Hyungjun Kim
Research Collection School Of Computing and Information Systems
We define the notion of pseudoprocessingness to formulate chosen-input-attack, chosen-stego-attack, and key-recovery. We then construct a efficient, provable secure steganographic algorithm against chosen-input-attack and key-recovery. So far as we know, this is the first paper dealing with those security notions.
Anonymous Dos-Resistant Access Control Protocol Using Passwords For Wireless Networks, Zhiguo Wan, Robert H. Deng, Feng Bao, Akkihebbal L. Ananda
Anonymous Dos-Resistant Access Control Protocol Using Passwords For Wireless Networks, Zhiguo Wan, Robert H. Deng, Feng Bao, Akkihebbal L. Ananda
Research Collection School Of Computing and Information Systems
Wireless networks have gained overwhelming popularity over their wired counterpart due to their great flexibility and convenience, but access control of wireless networks has been a serious problem because of the open medium. Passwords remain the most popular way for access control as well as authentication and key exchange. But existing password-based access control protocols are not satisfactory in that they do not provide DoS-resistance or anonymity. In this paper we analyze the weaknesses of an access control protocol using passwords for wireless networks in IEEE LCN 2001, and propose a different access control protocol using passwords for wireless networks. …
Early Warning And Prediction Of Internet Attacks And Exploits, Brian P. Zeitz
Early Warning And Prediction Of Internet Attacks And Exploits, Brian P. Zeitz
Theses and Dissertations
A safe, secure, and functional information network is vital in today’s Air Force net centric environment. Information is more critical today than it has ever been. As more operational functions are placed in cyber space and greater computing power becomes available to everyone, keeping these networks safe and secure is an almost unattainable task. Network security entails Intrusion Detection Security, but another form of security or “insecurity” is quickly gaining attention. Honeypots allow the black hat community to attack and penetrate non-production systems. By monitoring and studying these attacks, network defenders can develop better Information Assurance tactics, techniques and procedures …
Security Analysis And Improvement Of Return Routability Protocol, Ying Qiu, Jianying Zhou, Robert H. Deng
Security Analysis And Improvement Of Return Routability Protocol, Ying Qiu, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
Mobile communication plays a more and more important role in computer networks. How to authenticate a new connecting address belonging to a said mobile node is one of the key issues in mobile networks. This paper analyzes the Return Routability (RR) protocol and proposes an improved security solution for the RR protocol without changing its architecture. With the improvement, three types of redirect attacks can be prevented.
New Efficient Mds Array Codes For Raid Part I: Reed-Solomon-Like Codes For Tolerating Three Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao, Jia-Chen Shen
New Efficient Mds Array Codes For Raid Part I: Reed-Solomon-Like Codes For Tolerating Three Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao, Jia-Chen Shen
Research Collection School Of Computing and Information Systems
This paper presents a class of binary maximum distance separable (MDS) array codes for tolerating disk failures in redundant arrays of inexpensive disks (RAID) architecture based on circular permutation matrices. The size of the information part is m×n, the size of the parity-check part is m×3, and the minimum distance is 4, where n is the number of information disks, the number of parity-check disks is 3, and (m+1) is a prime integer. In practical applications, m can be very large and n is from 20 to 50. The code rate is R=n/(n+3). These codes can be used for tolerating …
Cuhk At Imageclef 2005: Cross-Language And Cross-Media Image Retrieval, Steven C. H. Hoi, J. Zhu, M. Lyu
Cuhk At Imageclef 2005: Cross-Language And Cross-Media Image Retrieval, Steven C. H. Hoi, J. Zhu, M. Lyu
Research Collection School Of Computing and Information Systems
In this paper, we describe our studies of cross-language and cross-media image retrieval at the ImageCLEF 2005. This is the first participation of our CUHK (The Chinese University of Hong Kong) group at ImageCLEF. The task in which we participated is the “bilingual ad hoc retrieval” task. There are three major focuses and contributions in our participation. The first is the empirical evaluation of language models and smoothing strategies for cross-language image retrieval. The second is the evaluation of cross-media image retrieval, i.e., combining text and visual contents for image retrieval. The last is the evaluation of bilingual image retrieval …
Secured Network Model For Management Information System Based On Ip Security (Ipsec) Encryption Using Multilayered Approach Of Network Security, Dr. Amir Hassan Pathan, Muniza Irshad
Secured Network Model For Management Information System Based On Ip Security (Ipsec) Encryption Using Multilayered Approach Of Network Security, Dr. Amir Hassan Pathan, Muniza Irshad
International Conference on Information and Communication Technologies
Secured flow of information through the network and play important role in the management information systems. In this paper I describe Secured Network Model For Corporate & Business Organization In Based On Network Level IP Security (IPSec) Encryption & Its Physical Layout Using Multilayered Approach. I have four important considerations for adoption of secured network model as secured network model for management information system.
A Survey On Intrusion Detection Approaches, A Murali M. Rao
A Survey On Intrusion Detection Approaches, A Murali M. Rao
International Conference on Information and Communication Technologies
Intrusion detection plays one of the key roles in computer security techniques and is one of the prime areas of research. Usages of computer network services are tremendously increasing day by day and at the same time intruders are also playing a major role to deny network services, compromising the crucial services for Email, FTP and Web. Realizing the importance of the problem due to intrusions, many researchers have taken up research in this area and have proposed several solutions. It has come to a stage to take a stock of the research results and project a comprehensive view so …
Study Of Data Provenance And Annotation Model For Information Reliability Suggested For Pathological Laboratory Environment In Pakistan, Naila Aamir, Aslam Pervez
Study Of Data Provenance And Annotation Model For Information Reliability Suggested For Pathological Laboratory Environment In Pakistan, Naila Aamir, Aslam Pervez
International Conference on Information and Communication Technologies
Trust and reliability of information is a very critical issue of today's information age. Keeping provenance of data not only ensures us about its origination but it also keeps track of all the changes that happen to the data through out its life cycle. In this paper we have discussed the importance of data provenance, difference between Where & Why Provenance and different models for keeping such information. The objective of this study is to select a provenance model which can be implemented in scientific environment of our country. For this purpose we have taken the annotation model and have …
A Comparison Of Generalizability For Anomaly Detection, Gilbert L. Peterson, Robert F. Mills, Brent T. Mcbride, Wesley T. Allred
A Comparison Of Generalizability For Anomaly Detection, Gilbert L. Peterson, Robert F. Mills, Brent T. Mcbride, Wesley T. Allred
Faculty Publications
In security-related areas there is concern over the novel “zeroday” attack that penetrates system defenses and wreaks havoc. The best methods for countering these threats are recognizing “non-self” as in an Artificial Immune System or recognizing “self” through clustering. For either case, the concern remains that something that looks similar to self could be missed. Given this situation one could logically assume that a tighter fit to self rather than generalizability is important for false positive reduction in this type of learning problem. This article shows that a tight fit, although important, does not supersede having some model generality. This …
Wmxml: A System For Watermarking Xml Data, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan, Dhruv Mangla
Wmxml: A System For Watermarking Xml Data, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan, Dhruv Mangla
Research Collection School Of Computing and Information Systems
As increasing amount of data is published in the form of XML, copyright protection of XML data is becoming an important requirement for many applications. While digital watermarking is a widely used measure to protect digital data from copyright offences, the complex and flexible construction of XML data poses a number of challenges to digital watermarking, such as re-organization and alteration attacks. To overcome these challenges, the watermarking scheme has to be based on the usability of data and the underlying semantics like key attributes and functional dependencies. In this paper, we describe WmXML, a system for watermarking XML documents. …
Privacy Issues In The Era Of Ubiquitous Commerce, Holtjona Galanxhi, Fiona Fui-Hoon Nah
Privacy Issues In The Era Of Ubiquitous Commerce, Holtjona Galanxhi, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
The vision of ubiquitous commerce (u-commerce) is realized through the convergence of electronic, mobile, television, voice and silent commerce applications. The ubiquity, universality, uniqueness, and unison of u-commerce will provide two principal benefits for individual users and companies: increased convenience as well as more personalized and customized services. However, u-commerce will also bring new issues such as a greater degree of privacy concerns that will impact individual users, companies, and the society at large. This paper proposes and elaborates on a conceptual framework for privacy in the u-commerce era. It combines Lessig’s macro-level perspective – the four-factor model of privacy …
Valuations Of Possible States (Vps): A Unifying Quantitative Framework For Evaluating Privacy In Collaboration, Rajiv T. Maheswaran, Jonathan Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe
Valuations Of Possible States (Vps): A Unifying Quantitative Framework For Evaluating Privacy In Collaboration, Rajiv T. Maheswaran, Jonathan Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe
Research Collection School Of Computing and Information Systems
For agents deployed in real-world settings, such as businesses, universities and research laboratories, it is critical that agents protect their individual users’ privacy when interacting with others entities. Indeed, privacy is recognized as a key motivating factor in design of several multiagent algorithms, such as distributed constraint optimization (DCOP) algorithms. Unfortunately, rigorous and general quantitative metrics for analysis and comparison of such multiagent algorithms with respect to privacy loss are lacking. This paper takes a key step towards developing a general quantitative model from which one can analyze and generate metrics of privacy loss by introducing the VPS (Valuations of …
How Much You Watch, How Much You Pay, Yongdong Wu, Hwee Hwa Pang, Robert H. Deng
How Much You Watch, How Much You Pay, Yongdong Wu, Hwee Hwa Pang, Robert H. Deng
Research Collection School Of Computing and Information Systems
This paper presents a pay-video scheme that manages video stream, key stream and payment stream efficiently. In our scheme, the owner segments a video into fragments and encrypts them with independent keys. The keys are generated with a novel concept called as hash interval, where each hash interval discloses a range of numbers without disclosing any information on numbers outside of the range. The video fragments are then broadcast on one or more channels. A buyer can purchase the keys to decrypt any fragments and, within each fragment, any desired quality level. The accompanying payment protocol is integrated with the …
Deposit-Case Attack Against Secure Roaming, Guomin Yang, Duncan S. Wong, Xiaotie Deng
Deposit-Case Attack Against Secure Roaming, Guomin Yang, Duncan S. Wong, Xiaotie Deng
Research Collection School Of Computing and Information Systems
A secure roaming protocol involves three parties: a roaming user, a visiting foreign server and the user’s home server. The protocol allows the user and the foreign server to establish a session key and carry out mutual authentication with the help of the home server. In the mutual authentication, user authentication is generally done in two steps. First, the user claims that a particular server is his home server. Second, that particular server is called in by the foreign server for providing a ‘credential’ which testifies the user’s claim. We present a new attacking technique which allows a malicious server …
Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao
Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao
Computer Science Faculty Publications
Clustering is well-suited for Web mining by automatically organizing Web pages into categories, each of which contains Web pages having similar contents. However, one problem in clustering is the lack of general methods to automatically determine the number of categories or clusters. For the Web domain in particular, currently there is no such method suitable for Web page clustering. In an attempt to address this problem, we discover a constant factor that characterizes the Web domain, based on which we propose a new method for automatically determining the number of clusters in Web page data sets. We discover that the …
Efficient Anonymous Roaming And Its Security Analysis, Guomin Yang, Duncan S. Wong, Xiaotie Deng
Efficient Anonymous Roaming And Its Security Analysis, Guomin Yang, Duncan S. Wong, Xiaotie Deng
Research Collection School Of Computing and Information Systems
The Canetti-Krawczyk (CK) model uses resuable modular components to construct indistinguishability-based key exchange protocols. The reusability of modular protocol components makes it easier to construct and prove new protocols when compared with other provably secure approaches. In this paper, we build an efficient anonymous and authenticated key exchange protocol for roaming by using the modular approach under the CK-model. Our protocol requires only four message flows and uses only standard cryptographic primitives. We also propose a one-pass counter based MT-authenticator and show its security under the assumption that there exists a MAC which is secure against chosen message attack.
Breaking Public Key Cryptosystems On Tamper Resistant Devices In The Presence Of Transient Faults, Feng Bao, Robert H. Deng, Y. Han, A. Jeng, Arcot Desai Narasimhalu, T. Ngair
Breaking Public Key Cryptosystems On Tamper Resistant Devices In The Presence Of Transient Faults, Feng Bao, Robert H. Deng, Y. Han, A. Jeng, Arcot Desai Narasimhalu, T. Ngair
Research Collection School Of Computing and Information Systems
In this paper we present a method of attacking public-key cryptosystems (PKCs) on tamper resistant devices. The attack makes use of transient faults and seems applicable to many types of PKCs. In particular, we show how to attack the RSA, the E1Gamal signature scheme, the Schnorr signature scheme, and the DSA. We also present some possible methods to counter the attack.
Protecting Group Dynamic Information In Large Scale Multicast Groups, Yongdong Wu, Tieyan Li, Robert H. Deng
Protecting Group Dynamic Information In Large Scale Multicast Groups, Yongdong Wu, Tieyan Li, Robert H. Deng
Research Collection School Of Computing and Information Systems
Existing key management schemes can secure group communication efficiently, but are failed on protecting the Group Dynamic Information (GDI) that may undermine group privacy. Recently, Sun et al. proposed a scheme to hide the GDI with batch updating and phantom members inserting so that an adversary is not able to estimate the number of group members. In this paper, we first point out that their scheme is only applicable in departure-only group communication instead of the common conference groups. Secondly, we introduce our method of estimating the group size at a higher confidence level given a prior departure probability. Further, …
A New Architecture For User Authentication And Key Exchange Using Password For Federated Enterprises, Yanjiang Yang, Feng Bao, Robert H. Deng
A New Architecture For User Authentication And Key Exchange Using Password For Federated Enterprises, Yanjiang Yang, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
The rapid rise of federated enterprises entails a new way of trust management by the fact that an enterprise can account for partial trust of its affiliating organizations. On the other hand, password has historically been used as a main means for user authentication because of operational simplicity. We are thus motivated to explore the use of short password for user authentication and key exchange in the context of federated enterprises. Exploiting the special structure of a federated enterprise, our proposed new architecture comprises an external server managed by each affiliating organization and a central server managed by the enterprise …
Secure Human Communications Based On Biometrics Signals, Yongdong Wu, Feng Bao, Robert H. Deng
Secure Human Communications Based On Biometrics Signals, Yongdong Wu, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
User authentication is the first and probably the most challenging step in achieving secure person-to-person communications. Most of the existing authentication schemes require communicating parties either share a secret/password or know each other's public key. In this paper we suggest a novel user authentication scheme that is easy to use and overcomes the requirements of sharing password or public keys. Our scheme allows two human users to perform mutual authentication and have secure communications over an open channel by exchanging biometrics signals (e. g., voice or video signals). In addition to user authentication, our scheme establishes a secret session key …
Providing Efficient Certification Services Against Active Attacks In Ad Hoc Networks, Bo Zhu, Guilin Wang, Zhiguo Wan, Mohan S. Kankanhalli, Feng Bao, Robert H. Deng
Providing Efficient Certification Services Against Active Attacks In Ad Hoc Networks, Bo Zhu, Guilin Wang, Zhiguo Wan, Mohan S. Kankanhalli, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Most of previous research work in key management can only resist passive attacks, such as dropping the certificate request, and are vulnerable under active attacks, such as returning a fake reply to the node requesting the certification service. In this paper, we propose two algorithms to address both security and efficiency issues of certification services in ad hoc networks. Both of the algorithms can resist active attacks. In addition, simulation results show that, compared to the previous works, our second algorithm is not only much faster in a friendly environment, but it also works well in a hostile environment in …