Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (148)
- Software Engineering (105)
- Artificial Intelligence and Robotics (40)
- Business (37)
- Engineering (33)
-
- Computer Engineering (29)
- Medicine and Health Sciences (27)
- OS and Networks (24)
- Data Storage Systems (22)
- Social and Behavioral Sciences (20)
- Numerical Analysis and Scientific Computing (19)
- Theory and Algorithms (16)
- Graphics and Human Computer Interfaces (13)
- Health Information Technology (13)
- Finance and Financial Management (11)
- E-Commerce (10)
- Law (9)
- Public Affairs, Public Policy and Public Administration (9)
- Management Information Systems (7)
- Programming Languages and Compilers (7)
- Transportation (7)
- Asian Studies (5)
- International and Area Studies (5)
- Science and Technology Law (5)
- Systems Architecture (5)
- Technology and Innovation (5)
- Communication (4)
- Keyword
-
- Privacy (49)
- Cloud computing (41)
- Access control (39)
- Security (36)
- Authentication (34)
-
- Blockchain (28)
- Encryption (28)
- Privacy-preserving (28)
- Searchable encryption (24)
- Attribute-based encryption (21)
- Data privacy (21)
- Servers (19)
- Cloud storage (18)
- Cryptography (18)
- Anonymity (16)
- RFID (16)
- Revocation (15)
- Cybersecurity (14)
- Homomorphic encryption (14)
- Android (13)
- Protocols (13)
- Machine learning (12)
- Keyword search (11)
- Digital signature (10)
- Information security (10)
- Proxy re-encryption (10)
- Bitcoin (9)
- Cloud Computing (9)
- Data outsourcing (9)
- Data sharing (9)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (1051)
- Dissertations and Theses Collection (Open Access) (16)
- Research Collection Yong Pung How School Of Law (7)
- Perspectives@SMU (6)
- Research Collection School Of Accountancy (4)
-
- Dissertations and Theses Collection (2)
- LARC Research Publications (2)
- Research Collection Lee Kong Chian School Of Business (2)
- Research Collection School Of Economics (2)
- Research@SMU: Connecting the Dots (2)
- Asian Management Insights (1)
- Centre for AI & Data Governance (2019-2025) (1)
- MITB Thought Leadership Series (1)
- PhD Student’s Publications Collection (1)
- Research Collection College of Integrative Studies (1)
- Research Collection Library (1)
- Research Collection School of Computing and Information Systems (1)
- SMU Press Releases and News (1)
- Publication Type
Articles 1021 - 1050 of 1102
Full-Text Articles in Information Security
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 …
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 …
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 …
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 …
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 …
Privacy And Ownership Preserving Of Outsourced Medical Data, Elisa Bertino, Beng Chin Ooi, Yanjiang Yang, Robert H. Deng
Privacy And Ownership Preserving Of Outsourced Medical Data, Elisa Bertino, Beng Chin Ooi, Yanjiang Yang, Robert H. Deng
Research Collection School Of Computing and Information Systems
The demand for the secondary use of medical data is increasing steadily to allow for the provision of better quality health care. Two important issues pertaining to this sharing of data have to be addressed: one is the privacy protection for individuals referred to in the data; the other is copyright protection over the data. In this paper, we present a unified framework that seamlessly combines techniques of binning and digital watermarking to attain the dual goals of privacy and copyright protection. Our binning method is built upon an earlier approach of generalization and suppression by allowing a broader concept …
Fingerprinting Relational Databases: Schemes And Specialities, Yingjiu Li, Vipin Swarup, Sushil Jajodia
Fingerprinting Relational Databases: Schemes And Specialities, Yingjiu Li, Vipin Swarup, Sushil Jajodia
Research Collection School Of Computing and Information Systems
In this paper, we present a technique for fingerprinting relational data by extending Agrawal et al.'s watermarking scheme. The primary new capability provided by our scheme is that, under reasonable assumptions, it can embed and detect arbitrary bit-string marks in relations. This capability, which is not provided by prior techniques, permits our scheme to be used as a fingerprinting scheme. We then present quantitative models of the robustness properties of our scheme. These models demonstrate that fingerprints embedded by our scheme are detectable and robust against a wide variety of attacks including collusion attacks.
Security Of An Ill-Posed Operator Based Scheme For Image Authentication, Yongdong Wu, Robert H. Deng
Security Of An Ill-Posed Operator Based Scheme For Image Authentication, Yongdong Wu, Robert H. Deng
Research Collection School Of Computing and Information Systems
This letter analyzes the security of an image authentication scheme which exploits the instability of an ill-posed operator. Since the ill-posed operator produces only a limited number of authentic images regardless of the number of watermarks, an attacker can impersonate an image owner to generate authentic images at a high probability. Our experiments demonstrate that our attack is both practical and effective.
Technology Competition And Optimal Investment Timing: A Real Options Perspective, Robert J. Kauffman, X. Li
Technology Competition And Optimal Investment Timing: A Real Options Perspective, Robert J. Kauffman, X. Li
Research Collection School Of Computing and Information Systems
Companies often choose to defer irreversible investments to maintain valuable managerial flexibility in an uncertain world. For some technology-intensive projects, technology uncertainty plays a dominant role in affecting investment timing. This article analyzes the investment timing strategy for a firm that is deciding about whether to adopt one or the other of two incompatible and competing technologies.We develop a continuous-time stochastic model that aids in the determination of optimal timing for managerial adoption within the framework of real options theory. The model captures the elements of the decision-making process in such a way so as to provide managerial guidance in …
Ontology-Assisted Mining Of Rdf Documents, Tao Jiang, Ah-Hwee Tan
Ontology-Assisted Mining Of Rdf Documents, Tao Jiang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Resource description framework (RDF) is becoming a popular encoding language for describing and interchanging metadata of web resources. In this paper, we propose an Apriori-based algorithm for mining association rules (AR) from RDF documents. We treat relations (RDF statements) as items in traditional AR mining to mine associations among relations. The algorithm further makes use of a domain ontology to provide generalization of relations. To obtain compact rule sets, we present a generalized pruning method for removing uninteresting rules. We illustrate a potential usage of AR mining on RDF documents for detecting patterns of terrorist activities. Experiments conducted based on …
On Security Notions For Steganalysis, Kisik Chang, Robert H. Deng, Feng Bao, Sangjin Lee, Hyungjun Kim, Jongin Lim
On Security Notions For Steganalysis, Kisik Chang, Robert H. Deng, Feng Bao, Sangjin Lee, Hyungjun Kim, Jongin Lim
Research Collection School Of Computing and Information Systems
There have been some achievements in steganalysis recently. Many people have been making strides in steganalysis. They have approached steganalysis from different angles; from information theory to complexity theory. Anderson gave a possibility that there is a provable secure steganographic system, but there had not been complexity theoretical approaches for years. In 2002, Katzenbeisser and Petitcolas defined the conditional security of steganography and gave a possibility for a practical, provable secure steganography for the first time, and Hopper et al. introduced a provable secure steganographic algorithm in the sense of complexity theory. Chang et al. also tried to define the …
Vertical Sensitivity For The Information Security Health Rating Of Enterprises, Arcot Desai Narasimhalu, Nagarajan Dayasindhu, Raghavan Subramanian
Vertical Sensitivity For The Information Security Health Rating Of Enterprises, Arcot Desai Narasimhalu, Nagarajan Dayasindhu, Raghavan Subramanian
Research Collection School Of Computing and Information Systems
INFOSeMM Maturity model was developed jointly by SMU and Infosys. It is recognized that different industry verticals will have different levels of recommended maturity levels. This paper articulates the need for developing the industry vertical benchmarks.
Anonymous Secure Routing In Mobile Ad-Hoc Networks, Bo Zhu, Zhiguo Wan, Mohan S. Kankanhalli, Feng Bao, Robert H. Deng
Anonymous Secure Routing In Mobile Ad-Hoc Networks, Bo Zhu, Zhiguo Wan, Mohan S. Kankanhalli, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Although there are a large number of papers on secure routing in mobile ad-hoc networks, only a few consider the anonymity issue. In this paper, we define more strict requirements on the anonymity and security properties of the routing protocol, and notice that previous research works only provide Weak Location Privacy and Route Anonymity, and are vulnerable to specific attacks. Therefore, we propose the Anonymous Secure Routing (ASR) protocol that can provide additional properties on anonymity, i.e. Identity Anonymity and Strong Location Privacy, and at the same time ensure the security of discovered routes against various passive and active attacks. …
Flexible Verification Of Mpeg-4 Stream In Peer-To-Peer Cdn, Tieyan Li, Yongdong Wu, Di Ma, Robert H. Deng
Flexible Verification Of Mpeg-4 Stream In Peer-To-Peer Cdn, Tieyan Li, Yongdong Wu, Di Ma, Robert H. Deng
Research Collection School Of Computing and Information Systems
The current packet based stream authentication schemes provide effective and efficient authentication over a group of packets transmitted on erasure channels. However, by fixing the packets in transmission, any packet manipulation will cause authentication failure. In p2p content delivery network where a proxy-in-the-middle is able to store, forward, transcode and transform the stream, previous schemes are simply unapplicable. To address the problem, we propose a flexible verification scheme that relies on special stream formats (i.e. Unequal Loss Protection ULP scheme [7]). We apply the so called Unequal Loss Verification ULV scheme into MPEG-4 framework. The encoding, packing, amortizing and verifying …
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 …