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 1051 - 1080 of 1102
Full-Text Articles in Information Security
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 …
Privacy Protection For Transactions Of Digital Goods, Feng Bao, Robert H. Deng
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
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
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
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 …
Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng
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
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].
An Efficient And Practical Scheme For Privacy Protection In E-Commerce Of Digital Goods, Feng Bao, Robert H. Deng, Peirong Feng
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 …
Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng
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 …
Multicast Internet Protocol, X. K. Wang, Robert H. Deng, Feng Bao
Multicast Internet Protocol, X. K. Wang, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
In this paper, we first review the existing IPv4 based multicast protocols and identify their shortcomings. We then proposed a new multicast protocol, called Multicast Internet Protocol (MIP), which is both scalable and flexible. The design principle of MIP is fundamentally different from the existing IPv4 based multicast protocols. The issues related to MIP routing and implementations are also studied in this paper.