Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (142)
- Software Engineering (99)
- Artificial Intelligence and Robotics (37)
- Engineering (33)
- Business (30)
-
- Computer Engineering (29)
- Medicine and Health Sciences (25)
- OS and Networks (23)
- Data Storage Systems (22)
- Numerical Analysis and Scientific Computing (16)
- Theory and Algorithms (16)
- Health Information Technology (13)
- Graphics and Human Computer Interfaces (12)
- Social and Behavioral Sciences (12)
- Finance and Financial Management (11)
- E-Commerce (9)
- Public Affairs, Public Policy and Public Administration (8)
- Transportation (7)
- Programming Languages and Compilers (6)
- Computer and Systems Architecture (4)
- Digital Communications and Networking (4)
- Systems Architecture (4)
- Technology and Innovation (4)
- Management Information Systems (3)
- Communication (2)
- Law (2)
- Rehabilitation and Therapy (2)
- Keyword
-
- Privacy (47)
- Cloud computing (41)
- Access control (37)
- Security (31)
- Authentication (30)
-
- Privacy-preserving (28)
- Blockchain (27)
- Encryption (27)
- Searchable encryption (24)
- Attribute-based encryption (20)
- Data privacy (19)
- Servers (19)
- Cloud storage (18)
- Cryptography (18)
- Anonymity (16)
- RFID (15)
- Revocation (15)
- Homomorphic encryption (14)
- Android (13)
- Protocols (13)
- Machine learning (12)
- Digital signature (10)
- Information security (10)
- Keyword search (10)
- Proxy re-encryption (10)
- Bitcoin (9)
- Cloud Computing (9)
- Cybersecurity (9)
- Data outsourcing (9)
- Deep learning (9)
- Publication Year
Articles 991 - 1020 of 1051
Full-Text Articles in Information Security
Comments On "A Practical (T, N) Threshold Proxy Signature Scheme Based On The Rsa Cryptosystem", Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Comments On "A Practical (T, N) Threshold Proxy Signature Scheme Based On The Rsa Cryptosystem", Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
In a (t, n) threshold proxy signature scheme based on RSA, any t or more proxy signers can cooperatively generate a proxy signature while t-1 or fewer of them can't do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers. In this article, we discuss the implementation and comparison of some threshold proxy signature schemes that are based on the RSA cryptosystem. Comparison is done on the basis of time complexity, space complexity and communication overhead. We compare the performance of four schemes: Hwang et al., Wen et …
Dynamic Access Control For Multi-Privileged Group Communications, Di Ma, Robert H. Deng, Yongdong Wu, Tieyan Li
Dynamic Access Control For Multi-Privileged Group Communications, Di Ma, Robert H. Deng, Yongdong Wu, Tieyan Li
Research Collection School Of Computing and Information Systems
Recently, there is an increase in the number of group communication applications which support multiple service groups of different access privileges. Traditional access control schemes for group applications assume that all the group members have the same access privilege and mostly focus on how to reduce rekeying messages upon user joining and leaving. Relatively little research effort has been spent to address security issues for group communications supporting multiple access privileges. In this paper, we propose a dynamic access control scheme for group communications which support multiple service groups with different access privileges. Our scheme allows dynamic formation of service …
Compliant Encryption Of Jpeg2000 Codestreams, Yongdong Wu, Robert H. Deng
Compliant Encryption Of Jpeg2000 Codestreams, Yongdong Wu, Robert H. Deng
Research Collection School Of Computing and Information Systems
This paper presents a compliant encryption method for JPEG 2000 codestreams such that the encryption process does not introduce superfluous JPEG2000 markers in the protected codestream, i.e., the protected codestream preserves the syntax of the original codestream. The proposed encryption method works with any standard ciphers, incurs no storage overhead, introduces negligible computational cost and maintains all the desirable properties of the original JPEG 2000 codestream such as error resilience and scalability.
Trust Establishment In Large Scale Grid Settings, Bo Zhu, Tieyan Li, Huafei Zhu, Mohan S . Kankanhalli, Feng Bao, Robert H. Deng
Trust Establishment In Large Scale Grid Settings, Bo Zhu, Tieyan Li, Huafei Zhu, Mohan S . Kankanhalli, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Trust establishment is hard in grid architecture by the ad hoc nature. To set up trust in large scale of network is more difficult. In this paper, we propose an automatic key management (AKM) model and corresponding key construction schemes. The hierarchical structure is formed automatically and scale seamlessly in arbitrary network sized. Regions are configured differently according to various levels of risks faced. The novel model provides an integrated solution for self-organized trust establishment, upon which rich appliances are securely supported. It is automatic, flexible, and scalable. Furthermore, simulation results show that computation costs due to the variations are …
Proxy Signature Scheme With Multiple Original Signers For Wireless E-Commerce Applications, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Proxy Signature Scheme With Multiple Original Signers For Wireless E-Commerce Applications, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
In a proxy signature scheme, a user delegates his/her signing capability to another user in such a way that the latter can sign messages on behalf of the former. We propose an efficient and secure proxy signature scheme with multiple original signers. Our scheme is suitable for wireless electronic commerce applications, since the overheads of computation and communication are low. As an example, we present an electronic air ticket booking scheme for wireless customers.
On The Security Of The Lee-Hwang Group-Oriented Undeniable Signature Schemes, Guilin Wang, Jianying Zhou, Robert H. Deng
On The Security Of The Lee-Hwang Group-Oriented Undeniable Signature Schemes, Guilin Wang, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
Undeniable signature is an intriguing concept introduced by Chaum and van Antwerpen at Crypto89. In 1999, Lee and Hwang presented two group-oriented undeniable signature schemes with a trusted center. Their schemes are natural generalizations of Chaums zero knowledge undeniable signature scheme proposed in 1990. However, we find that the Lee-Hwang schemes are insecure. In this paper, we demonstrate five effective attacks on their schemes: four of them are insider universal forgeries, in which one dishonest member (maybe colluding with a verifier) can get a valid signature on any chosen massage, and another attack allows a dishonest member to prevent honest …
Security Analysis Of Two Signcryption Schemes, Guilin Wang, Robert H. Deng, Dongjin Kwak, Sangjae Moon
Security Analysis Of Two Signcryption Schemes, Guilin Wang, Robert H. Deng, Dongjin Kwak, Sangjae Moon
Research Collection School Of Computing and Information Systems
Signcryption is a new cryptographic primitive that performs signing and encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. In this paper, we present a security analysis of two such schemes: the Huang-Chang convertible signcryption scheme, and the Kwak-Moon group signcryption scheme. Our results show that both schemes are insecure. Specifically, the Huang-Chang scheme fails to provide confidentiality, while the Kwak-Moon scheme does not satisfy the properties of unforgeability, coalition-resistance, and traceability.
Rating Information Security Maturity, Arcot Desai Narasimhalu, Nagarajan Dayasindhu
Rating Information Security Maturity, Arcot Desai Narasimhalu, Nagarajan Dayasindhu
Research Collection School Of Computing and Information Systems
Most CEOs have difficulty relating to the information security investments in their companies. This article presents a summary of a the information security maturity model that the CEOs could use to determine the desired level of investments into information security infrastructure, tools and applications.
Packet-Loss Resilient Coding Scheme With Only Xor Operations, Gui Liang Feng, Robert H. Deng, Feng Bao
Packet-Loss Resilient Coding Scheme With Only Xor Operations, Gui Liang Feng, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
Application of forward error correction to recover lost packets in higher layers of communication networks is receiving increasing attention. Most of the previous proposals for packet loss recovery use symbol-oriented Reed-Solomon codes operating in symbol erasure-correction mode. A Reed-Solomon code is optimal in the sense that it is maximal distance separable; however, the decoding speed of a Reed-Solomon code is slow since it involves operations over GF(2m) using lookup tables. A packet-oriented (n, k)/(m, l) packet-loss resilient code based on an (n, k) Reed-Solomon code over GF(2m) is given. The code accepts k-packet information sequences and encodes them into n-packet …
Cryptanalysis Of Two Anonymous Buyer-Seller Watermarking Protocols And An Improvement For True Anonymity, Bok-Min Goi, Raphael C. W. Phan, Yanjiang Yang, Feng Bao, Robert H. Deng, M. U. Siddiqi
Cryptanalysis Of Two Anonymous Buyer-Seller Watermarking Protocols And An Improvement For True Anonymity, Bok-Min Goi, Raphael C. W. Phan, Yanjiang Yang, Feng Bao, Robert H. Deng, M. U. Siddiqi
Research Collection School Of Computing and Information Systems
By combining techniques of watermarking and fingerprinting, a sound buyer-seller watermarking protocol can address the issue of copyright protection in e-commerce. In this paper, we analyze the security of two recent anonymous buyer-seller watermarking protocols proposed by Ju et. al and Choi et. al respectively, and prove that they do not provide the features and security as claimed. In particular, we show that i) the commutative cryptosystem used in Choi et. als protocol fails to prevent the watermark certification authority (WCA) from discovering the watermark (fingerprint) chosen by the buyer; ii) for both protocols, the seller can discover the watermark …
Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
A proxy signature scheme allows an entity to delegate his/her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Such schemes have been suggested for use in a number of applications, particularly in distributed computing where delegation of rights is quite common. Followed by the first schemes introduced by Mambo, Usuda and Okamoto in 1996, a number of new schemes and improvements have been proposed. In this paper, we present a security analysis of four such schemes newly proposed. By successfully identifying several interesting forgery attacks, we show that …
A Smart-Card-Enabled Privacy Preserving E-Prescription System, Yanjiang Yang, Xiaoxi Han, Feng Bao, Robert H. Deng
A Smart-Card-Enabled Privacy Preserving E-Prescription System, Yanjiang Yang, Xiaoxi Han, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Within the overall context of protection of health care information, privacy of prescription data needs special treatment. First, the involvement of diverse parties, especially nonmedical parties in the process of drug prescription complicates the protection of prescription data. Second, both patients and doctors have privacy stakes in prescription, and their privacy should be equally protected. Third, the following facts determine that prescription should not be processed in a truly anonymous manner: certain involved parties conduct useful research on the basis of aggregation of prescription data that are linkable with respect to either the patients or the doctors; prescription data has …
A Secure And Privacy Enhanced Location-Based Service Transaction Protocol In Ubiquitous Computing Environment, Konidala Divyan, Robert H. Deng, Jianying Zhou, Kwanjo Kim
A Secure And Privacy Enhanced Location-Based Service Transaction Protocol In Ubiquitous Computing Environment, Konidala Divyan, Robert H. Deng, Jianying Zhou, Kwanjo Kim
Research Collection School Of Computing and Information Systems
Nowadays mobile phones and PDAs are part and parcel of our lives. By carrying a portable mobile device with us all the time we are already living in partial Pervasive Computing Environment (PCE) that is waiting to be exploited very soon. One of the advantages of pervasive computing is that it strongly supports the deployment of Location-Based Service(s) (LBSs). In PCE, there would be many competitive service providers (SPs) trying to sell different or similar LBSs to users. In order to avail a particular service, it becomes very di#cult for a low-computing and resourcepoor mobile device to handle many such …
Aa Flexible And Scalable Authentication Scheme For Jpeg 2000 Image Codestreams, Cheng Peng, Robert H. Deng, Yongdong Wu, Weizhong Shao
Aa Flexible And Scalable Authentication Scheme For Jpeg 2000 Image Codestreams, Cheng Peng, Robert H. Deng, Yongdong Wu, Weizhong Shao
Research Collection School Of Computing and Information Systems
JPEG2000 is an emerging standard for still image compression and is becoming the solution of choice for many digital imaging fields and applications. An important aspect of JPEG2000 is its "compress once, decompress many ways" property [1], i. e., it allows extraction of various sub-images (e.g., images with various resolutions, pixel fidelities, tiles and components) all from a single compressed image codestream. In this paper, we present a flexible and scalable authentication scheme for JPEG2000 images based on the Merkle hash tree and digital signature. Our scheme is fully compatible with JPEG2000 and possesses a "sign once, verify many ways" …
Content-Aware Authentication Of Motion Jpeg2000 Stream In Lossy Networks, Yongdong Wu, Robert H. Deng
Content-Aware Authentication Of Motion Jpeg2000 Stream In Lossy Networks, Yongdong Wu, Robert H. Deng
Research Collection School Of Computing and Information Systems
Stream authentication schemes (SAS) aim to achieve effective authentication of multicast streams over lossy networks. Almost all the existing SASs is designed for stream data integrity protection only. In this paper, we argue that content integrity protection is more important than data integrity to human users. We present a content-aware SAS in motion JPEG2000 streaming. In our scheme, a chunk of JPEG2000 codestreams is encapsulated into a block of packets using multiple description coding (MDC). Our MDC exploits the inherent structure of motion JPEG2000 codestreams and is used to preserve the semanteme/content of the stream over lossy networks. To achieve …
Making The Key Agreement Protocol In Mobile Ad Hoc Network More Efficient, Gang Yao, Kui Ren, Feng Bao, Robert H. Deng, Dengguo Feng
Making The Key Agreement Protocol In Mobile Ad Hoc Network More Efficient, Gang Yao, Kui Ren, Feng Bao, Robert H. Deng, Dengguo Feng
Research Collection School Of Computing and Information Systems
Mobile ad hoc networks offer convenient infrastructureless communications over the shared wireless channel. However, the nature of mobile ad hoc networks makes them vulnerable to security attacks, such as passive eavesdropping over the wireless channel and denial of service attacks by malicious nodes. To ensure the security, several cryptography protocols are implemented. Due to the resource scarcity in mobile ad hoc networks, the protocols must be communication efficient and need as less computational power as possible. Broadcast communication is an important operation for many application in mobile ad hoc networks. To securely broadcast a message, all the members in the …
Validating Digital Signatures Without Ttp’S Time-Stamping And Certificate Revocation, Jianying Zhou, Feng Bao, Robert H. Deng
Validating Digital Signatures Without Ttp’S Time-Stamping And Certificate Revocation, Jianying Zhou, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
In non-repudiation services where digital signatures usually serve as irrefutable cryptographic evidence for dispute resolution, trusted time-stamping and certificate revocation services, although very costly in practice, must be available, to prevent big loss due to compromising of the signing key. In [12], a new concept called intrusion-resilient signature was proposed to get rid of trusted time-stamping and certificate revocation services and a concrete scheme was presented. In this paper, we put forward a new scheme that can achieve the same effect in a much more efficient way. In our scheme, forward-secure signature serves as a building block that enables signature …
Variations Of Diffie-Hellman Problem, Feng Bao, Robert H. Deng, Huafei Zhu
Variations Of Diffie-Hellman Problem, Feng Bao, Robert H. Deng, Huafei Zhu
Research Collection School Of Computing and Information Systems
This paper studies various computational and decisional Diffie-Hellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational Diffie-Hellman problem: square Diffie-Hellman problem, inverse Diffie-Hellman problem and divisible Diffie-Hellman problem, are equivalent with optimal reduction. Also, we are considering variations of the decisional Diffie-Hellman problem in single sample and polynomial samples settings, and we are able to show that all variations are equivalent except for the argument DDH ⇐ SDDH. We are not able to prove or disprove this statement, thus leave an interesting open problem. Keywords: Diffie-Hellman problem, Square Diffie-Hellman …
An Efficient Known Plaintext Attack On Fea-M, Hongjun Wu, Feng Bao, Robert H. Deng
An Efficient Known Plaintext Attack On Fea-M, Hongjun Wu, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Yi et al. have proposed a cipher called the fast encryption algorithm for multimedia (FEA-M). Recently Mihaljevi and Kohno pointed out that FEA-M is insecure. However, their attacks are not efficient: their chosen plaintext attack and known plaintext attack require 237-bit chosen plaintext and 260-bit known plaintext, respectively. In this paper we give an efficient known plaintext attack against FEA-M. Our attack requires only 228-bit known plaintext and about 233 XOR operations.
Adaptive Collusion Attack To A Block Oriented Watermarking Scheme, Yongdong Wu, Robert H. Deng
Adaptive Collusion Attack To A Block Oriented Watermarking Scheme, Yongdong Wu, Robert H. Deng
Research Collection School Of Computing and Information Systems
In this paper, we propose an adaptive collusion attack to a block oriented watermarking scheme [1]. In this attack, traitors conspire to selectively manipulate watermarked blocks to remove the watermark information. To this end, the traitors compare the watermarked blocks generated from the same original block. If two watermarked block are not equal, they average these two blocks to generate a pirated block. Then, replace the watermarked blocks with the pirated blocks so as to build a pirated image. The pirated image has no watermark but has much higher quality than watermarked images. We also give a theoretical analysis on …
An Efficient Public-Key Framework, Jianying Zhou, Feng Bao, Robert H. Deng
An Efficient Public-Key Framework, Jianying Zhou, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Public-key certificates play an important role in binding the public key with the identity of the owner of the corresponding private key. A certificate might be revoked before its scheduled expiry date by the issuing CA. Efficient and timely distribution of certificate revocation information is a big challenge facing the PKI providers. Existing certificate revocation schemes place a considerable processing, communication, and storage overheads on the CA as well as the relying parties. To improve the current situation, we propose a revocation-free public-key framework, in which the maximum lifetime of a certificate is divided into short periods and the certificate …
Security Remarks On A Group Signature Scheme With Member Deletion, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Security Remarks On A Group Signature Scheme With Member Deletion, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
A group signature scheme allows a group member of a given group to sign messages on behalf of the group in an anonymous and unlinkable fashion. In case of a dispute, however, a designated group manager can reveal the signer of a valid group signature. Based on the Camenisch-Michels group signature scheme, Kim, Lim and Lee proposed the first group signature scheme with a member deletion procedure at ICISC 2000. Their scheme is very efficient in both communication and computation aspects. Unfortunately, their scheme is insecure. In this paper, we first identify an effective way that allows any verifier to …
Secure The Image-Based Simulated Telesurgery System, Yanjiang Yang, Zhenlan Wang, Feng Bao, Robert H. Deng
Secure The Image-Based Simulated Telesurgery System, Yanjiang Yang, Zhenlan Wang, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Telemedicine services involve transmission of patient data over open computer network, and thus confront serious security challenges when the consequences are a matter of life and death. In this paper, we introduce an image-based simulated system for kyphoplasty telesurgery, wherein special attention is given to the fine-grained security implementation issues. Various security requirements are formalized and corresponding solutions are presented. Consequently, we implement the system to work in a secure way, while taking efficiency as a premier consideration.
Stegfs: A Steganographic File System, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou
Stegfs: A Steganographic File System, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou
Research Collection School Of Computing and Information Systems
While user access control and encryption can protect valuable data from passive observers, those techniques leave visible ciphertexts that are likely to alert an active adversary to the existence of the data, who can then compel an authorized user to disclose it. This paper introduces StegFS, a steganographic file system that aims to overcome that weakness by offering plausible deniability to owners of protected files. StegFS securely hides user-selected files in a file system so that, without the corresponding access keys, an attacker would not be able to deduce their existence, even if the attacker is thoroughly familiar with the …
Defending Against Redirect Attacks In Mobile Ip, Robert H. Deng, Jianying Zhou, Feng Bao
Defending Against Redirect Attacks In Mobile Ip, Robert H. Deng, Jianying Zhou, Feng Bao
Research Collection School Of Computing and Information Systems
The route optimization operation in Mobile IP Version 6 (MIPv6) allows direct routing from any correspondent node to any mobile node and thus eliminates the problem of "triangle routing" present in the base Mobile IP Version 4 (MIPv4) protocol. Route optimization, however, requires that a mobile node constantly inform its correspondent nodes about its new care-of addresses by sending them binding update messages. Unauthenticated or malicious binding updates open the door for intruders to perform redirect attacks, i.e., malicious acts which redirect traffic from correspondent nodes to locations chosen by intruders. How to protect binding update messages to defend against …
Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert Huijie Deng
Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert Huijie 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 a.2m encryptions, where a is a small number.
Security Analysis And Improvement Of The Global Key Recovery System, Yanjiang Yang, Feng Bao, Robert H. Deng
Security Analysis And Improvement Of The Global Key Recovery System, Yanjiang Yang, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Key recovery is a technology that allows the owner of encrypted data or a trusted third party to recover encrypted data, mostly by reconstructing lost decryption key. In [HLG99], Harn et al proposed a Global Key Recovery System (GKRS) that combines the functions of the key recovery authorities and the public key certification authorities (CAs). Among other features, user-dominance, i.e., a user is allowed to select his own public-private key pair and especially a public element for verifying the validity of the public-private key pair, is considered extremely important by [HLG99] for wide acceptance of GKRS. In this paper, we …
Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert H. Deng
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.
Experimenting With Server-Aided Signatures, Xuhua Ding, D. Mozzacchi, Gene Tsudik
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.
Enhancing Profiles For Anomaly Detection Using Time Granularities, Yingjiu Li, Ningning Wu, X. Sean Wang, Sushil Jajodia
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 …