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

Information Security Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 961 - 990 of 1102

Full-Text Articles in Information Security

Rsa-Based Certificateless Public Key Encryption, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou Apr 2009

Rsa-Based Certificateless Public Key Encryption, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou

Research Collection School Of Computing and Information Systems

Certificateless Public Key Cryptography was first introduced by Al-Riyami and Paterson in order to eliminate the inherent key-escrow problem of Identity-Based Cryptography. In this paper, we present a new practical construction of certificateless public key encryption scheme without paring. Our scheme is, in the random oracle model, provably secure under the assumption that the RSA problem is intractable.

Go to article

Achieving Better Privacy Protection In Wireless Sensor Networks Using Trusted Computing, Yanjiang Yang, Robert H. Deng, Jianying Zhou, Ying Qiu Apr 2009

Achieving Better Privacy Protection In Wireless Sensor Networks Using Trusted Computing, Yanjiang Yang, Robert H. Deng, Jianying Zhou, Ying Qiu

Research Collection School Of Computing and Information Systems

A wireless sensor network (WSN) is an ad-hoc wireless network composed of small sensor nodes deployed in large numbers. Sensor nodes are usually severely resource limited and power constrained. Security enforcement in WSNs is thus a challenging task. In this paper we propose a clustered heterogeneous architecture for WSNs, where high-end cluster heads are incorporated, and they are further equipped with trusted computing technology (TC). As such, the cluster heads act as trusted parties, and are expected to help effectively address privacy issues in WSNs. As concrete examples, we discuss in details how user query privacy and source location privacy …

Go to article

Multiuser Private Queries Over Encrypted Databases, Yanjiang Yang, Feng Bao, Xuhua Ding, Robert H. Deng Jan 2009

Multiuser Private Queries Over Encrypted Databases, Yanjiang Yang, Feng Bao, Xuhua Ding, Robert H. Deng

Research Collection School Of Computing and Information Systems

Searchable encryption schemes allow users to perform keyword-based searches on an encrypted database. Almost all existing such schemes only consider the scenario where a single user acts as both the data owner and the querier. However, most databases in practice do not just serve one user; instead, they support search and write operations by multiple users. In this paper, we systematically study searchable encryption in a practical multiuser setting. Our results include a set of security notions for multiuser searchable encryption as well as a construction which is provably secure under the newly introduced security notions. We also discuss how …

Go to article

A Comprehensive Study For Rfid Malwares On Mobile Devices, Qiang Yan, Yingjiu Li, Tieyan Li, Robert Huijie Deng Jan 2009

A Comprehensive Study For Rfid Malwares On Mobile Devices, Qiang Yan, Yingjiu Li, Tieyan Li, Robert Huijie Deng

Research Collection School Of Computing and Information Systems

Radio Frequency Identification (RFID) technique has been widely accepted as wireless identification standard in the business world. While RFID technique enables efficient collection of identification information, it also introduces new security risk due to the emerging of RFID malwares. This risk becomes increasingly severe due to the adoption of internet in RFID applications (e.g., track and trace in EPCglobal network) and the use of mobile devices as RFID readers. The prior work to defend the threat of RFID malwares has mainly focused on the protection of front-end tag-reader communications and back-end database systems. Less work has been conducted to defend …

Go to article

Efficient Client-To-Client Password Authenticated Key Exchange, Yanjiang Yang, Feng Bao, Robert H. Deng Dec 2008

Efficient Client-To-Client Password Authenticated Key Exchange, Yanjiang Yang, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

With the rapid proliferation of client-to-client applications, PAKE (password authenticated key exchange) protocols in the client-to-client setting become increasingly important. In this paper, we propose an efficient client-to client PAKE protocol, which has much better performance than existing generic constructions. We also show that the proposed protocol is secure under a formal security model.

Go to article

Chosen-Ciphertext Secure Proxy Re-Encryption Without Pairing, Robert H. Deng, Jian Weng, Shengli Liu, Kefei Chen Dec 2008

Chosen-Ciphertext Secure Proxy Re-Encryption Without Pairing, Robert H. Deng, Jian Weng, Shengli Liu, Kefei Chen

Research Collection School Of Computing and Information Systems

In a proxy re-encryption system, a semi-trusted proxy can convert a ciphertext originally intended for Alice into a ciphertext intended for Bob, without learning the underlying plaintext. Proxy re-encryption has found many practical applications, such as encrypted email forwarding, secure distributed file systems, and outsourced filtering of encrypted spam. In ACM CCS'07, Canetti and Hohenberger presented a proxy re-encryption scheme with chosen-ciphertext security, and left an important open problem to construct a chosen-ciphertext secure proxy re-encryption scheme without pairings. In this paper, we solve this open problem by proposing a new proxy re-encryption scheme without resort to bilinear pairings. Based …

Go to article

Ambiguous Optimistic Fair Exchange, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo Dec 2008

Ambiguous Optimistic Fair Exchange, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo

Research Collection School Of Computing and Information Systems

Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help of an arbitrator which is called in only when a dispute happens between the two parties. In almost all the previous work on OFE, after obtaining a partial signature from the signer, the verifier can present it to others and show that the signer has indeed committed itself to something corresponding to the partial signature even prior to the completion of the transaction. In some scenarios, this capability given …

Go to article

Model-Driven Remote Attestation: Attesting Remote System From Behavioral Aspect, Liang Gu, Xuhua Ding, Robert H. Deng, Yanzhen Zou, Bing Xie, Weizhong Shao, Hong Mei Nov 2008

Model-Driven Remote Attestation: Attesting Remote System From Behavioral Aspect, Liang Gu, Xuhua Ding, Robert H. Deng, Yanzhen Zou, Bing Xie, Weizhong Shao, Hong Mei

Research Collection School Of Computing and Information Systems

Remote attestation was introduced in TCG specifications to determine whether a remote system is trusted to behave in a particular manner for a specific purpose; however, most of the existing approaches attest only the integrity state of a remote system and hence have a long way to go in achieving the above attestation objective. Behavior-based attestation and semantic attestation were recently introduced as solutions to approach the TCG attestation objective. In this paper, we extend behavior-based attestation to a model-driven remote attestation to prove that a remote system is trusted as defined by TCG. Our model-driven remote attestation verifies two …

Go to article

A New Framework For The Design And Analysis Of Identity-Based Identification Schemes, Guomin Yang, Jing Chen, Duncan S. Wong, Xiaotie Deng, Dongsheng Wang Nov 2008

A New Framework For The Design And Analysis Of Identity-Based Identification Schemes, Guomin Yang, Jing Chen, Duncan S. Wong, Xiaotie Deng, Dongsheng Wang

Research Collection School Of Computing and Information Systems

Constructing an identification scheme is one of the fundamental problems in cryptography, and is very useful in practice. An identity-based identification (IBI) scheme allows a prover to identify himself to a public verifier who knows only the claimed identity of the prover and some public information. In this paper, we propose a new framework for both the design and analysis of IBI schemes. Our approach works in an engineering way. We first identify an IBI scheme as the composition of two building blocks, and then show that, with different security properties of these building blocks, the corresponding IBI schemes can …

Go to article

Two-Factor Mutual Authentication Based On Smart Cards And Passwords, Guomin Yang, Duncan S. Wong, Huaxiong Wang, Xiaotie Deng Nov 2008

Two-Factor Mutual Authentication Based On Smart Cards And Passwords, Guomin Yang, Duncan S. Wong, Huaxiong Wang, Xiaotie Deng

Research Collection School Of Computing and Information Systems

One of the most commonly used two-factor user authentication mechanisms nowadays is based on smart-card and password. A scheme of this type is called a smart-card-based password authentication scheme. The core feature of such a scheme is to enforce two-factor authentication in the sense that the client must have the smart-card and know the password in order to gain access to the server. In this paper, we scrutinize the security requirements of this kind of schemes, and propose a new scheme and a generic construction framework for smart-card-based password authentication. We show that a secure password based key exchange protocol …

Go to article

Remote Attestation On Program Execution, Liang Gu, Xuhua Ding, Robert H. Deng, Bing Xie, Hong Mei Oct 2008

Remote Attestation On Program Execution, Liang Gu, Xuhua Ding, Robert H. Deng, Bing Xie, Hong Mei

Research Collection School Of Computing and Information Systems

Remote attestation provides the basis for one platform to establish trusts on another. In this paper, we consider the problem of attesting the correctness of program executions. We propose to measure the target program and all the objects it depends on, with an assumption that the Secure Kernel and the Trusted Platform Module provide a secure execution environment through process separation. The attestation of the target program begins with a program analysis on the source code or the binary code in order to find out the relevant executables and data objects. Whenever such a data object is accessed or a …

Go to article

Using Trusted Computing Technology To Facilitate Security Enforcement In Wireless Sensor Networks, Yanjiang Yang, Robert H. Deng, Feng Bao, Jianying Zhou Oct 2008

Using Trusted Computing Technology To Facilitate Security Enforcement In Wireless Sensor Networks, Yanjiang Yang, Robert H. Deng, Feng Bao, Jianying Zhou

Research Collection School Of Computing and Information Systems

Security enforcement in wireless sensor networks is by no means an easy task, due to the inherent resource-constrained nature of sensor nodes. To facilitate security enforcement, we propose to incorporate more powerful high-end Security Enforcement Facilitators (SEFs) into wireless sensor networks. In particular, the SEFs are equipped with TCG-compliant Trusted Platform Modules (TPMs) to protect cryptographic secrets, perform authenticated booting and attest their platform state to a remote base station.As such, the SEFs act as online trusted third parties toeffectively monitor the states of sensor nodes, help in keymanagement, simplify secure routing, and facilitate accesscontrol.

Go to article

Distinguishing Between Fe And Ddos Using Randomness Check, Hyundo Park, Peng Li, Debin Gao, Heejo Lee, Robert H. Deng Sep 2008

Distinguishing Between Fe And Ddos Using Randomness Check, Hyundo Park, Peng Li, Debin Gao, Heejo Lee, Robert H. Deng

Research Collection School Of Computing and Information Systems

Threads posed by Distributed Denial of Service (DDoS) attacks are becoming more serious day by day. Accurately detecting DDoS becomes an important and necessary step in securing a computer network. However, Flash Event (FE), which is created by legitimate requests, shares very similar characteristics with DDoS in many aspects and makes it hard to be distinguished from DDoS attacks. In this paper, we propose a simple yet effective mechanism called FDD (FE and DDoS Distinguisher) to distinguish FE and DDoS. To the best of our knowledge, this is the first effective and practical mechanism that distinguishes FE and DDoS attacks. …

Go to article

An Efficient Pir Construction Using Trusted Hardware, Yanjiang Yang, Xuhua Ding, Robert H. Deng, Feng Bao Sep 2008

An Efficient Pir Construction Using Trusted Hardware, Yanjiang Yang, Xuhua Ding, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

For a private information retrieval (PIR) scheme to be deployed in practice, low communication complexity and low computation complexity are two fundamental requirements it must meet. Most existing PIR schemes only focus on the communication complexity. The reduction on the computational complexity did not receive the due treatment mainly because of its O(n) lower bound. By using the trusted hardware based model, we design a novel scheme which breaks this barrier. With constant storage, the computation complexity of our scheme, including offline computation, is linear to the number of queries and is bounded by after optimization.

Go to article

Empirical Analysis Of Certificate Revocation Lists, Daryl Walleck, Yingjiu Li, Shouhuai Xu Jul 2008

Empirical Analysis Of Certificate Revocation Lists, Daryl Walleck, Yingjiu Li, Shouhuai Xu

Research Collection School Of Computing and Information Systems

Managing public key certificates revocation has long been a central issue in public key infrastructures. Though various certificate revocation mechanisms have been proposed to address this issue, little effort has been devoted to the empirical analysis of real-world certificate revocation data. In this paper, we conduct such an empirical analysis based on a large amount of data collected from VeriSign. Our study enables us to understand how long a revoked certificate lives and what the difference is in the lifetime of revoked certificates by certificate types, geographic locations, and organizations. Our study also provides a solid foundation for future research …

Go to article

Traceable And Retrievable Identity-Based Encryption, Man Ho Au, Qiong Huang, Joseph K. Liu, Willy Susilo, Duncan S. Wong, Guomin Yang Jun 2008

Traceable And Retrievable Identity-Based Encryption, Man Ho Au, Qiong Huang, Joseph K. Liu, Willy Susilo, Duncan S. Wong, Guomin Yang

Research Collection School Of Computing and Information Systems

Very recently, the concept of Traceable Identity-based Encryption (IBE) scheme (or Accountable Authority Identity based Encryption scheme) was introduced in Crypto 2007. This concept enables some mechanisms to reduce the trust of a private key generator (PKG) in an IBE system. The aim of this paper is threefold. First, we discuss some subtleties in the first traceable IBE scheme in the Crypto 2007 paper. Second, we present an extension to this work by having the PKG’s master secret key retrieved automatically if more than one user secret key are released. This way, the user can produce a concrete proof of …

Go to article

A Dynamic Trust Management Scheme To Mitigate Malware Proliferation In P2p Networks, Xuhua Ding, Wei Yu, Ying Pan May 2008

A Dynamic Trust Management Scheme To Mitigate Malware Proliferation In P2p Networks, Xuhua Ding, Wei Yu, Ying Pan

Research Collection School Of Computing and Information Systems

The surge of peer-to-peer (P2P) networks consisting of thousands of of hosts makes them a breeding ground for malware proliferation. Although some existing studies have shown that malware proliferation can pose significant threats to P2P networks, defending against such an attack is largely an open problem. This paper aims to develop the countermeasure that can effectively mitigate the malware proliferation while preserving P2P networks' performance. To this end, we propose a dynamic trust management scheme based upon localized trust evaluation and alert propagation which prevents innocent peers from downloading files from infected peers. Our analysis and experimental results show that …

Go to article

Efficient Optimistic Fair Exchange Secure In The Multi-User Setting And Chosen-Key Model Without Random Oracles, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo Apr 2008

Efficient Optimistic Fair Exchange Secure In The Multi-User Setting And Chosen-Key Model Without Random Oracles, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo

Research Collection School Of Computing and Information Systems

Optimistic fair exchange is a kind of protocols to solve the problem of fair exchange between two parties. Almost all the previous work on this topic are provably secure only in the random oracle model. In PKC 2007, Dodis et al. considered optimistic fair exchange in a multi-user setting, and showed that the security of an optimistic fair exchange in a single-user setting may no longer be secure in a multi-user setting. Besides, they also proposed one and reviewed several previous construction paradigms and showed that they are secure in the multi-user setting. However, their proofs are either in the …

Go to article

Private Query On Encrypted Data In Multi-User Setting, Feng Bao, Robert H. Deng, Xuhua Ding, Yanjiang Yang Jan 2008

Private Query On Encrypted Data In Multi-User Setting, Feng Bao, Robert H. Deng, Xuhua Ding, Yanjiang Yang

Research Collection School Of Computing and Information Systems

Searchable encryption schemes allow users to perform keyword based searches on an encrypted database. Almost all existing such schemes only consider the scenario where a single user acts as both the data owner and the querier. However, most databases in practice do not just serve one user; instead, they support search and write operations by multiple users. In this paper, we systematically study searchable encryption in a practical multi-user setting. Our results include a set of security notions for multi-user searchable encryption as well as a construction which is provably secure under the newly introduced security notions.

Go to article

Light-Weight Encryption Schemes For Multimedia Data, Feng Bao, Robert H. Deng Nov 2007

Light-Weight Encryption Schemes For Multimedia Data, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Due to the pervasiveness of high-speed networks and multimedia communications and storage, the demand for highspeed cryptosystems is ever increasing. It is widely believed that there is a tradeoff between speed and security in cryptosystem design. No existing encryption algorithms are both fast enough for high-speed operation and sufficiently secure to withstand powerful cryptanalysis. In this paper, we propose and analyze a generic construction of high-speed encryption schemes. Our solution is based on the fact that there exist secure but relatively slow block ciphers, e. g. AES, and super-fast but relatively weaker stream ciphers. We then combine a secure block …

Go to article

An Information-Sharing Based Anti-Phishing System, Yueqing Cheng, Zhen Yuan, Lei Ma, Robert H. Deng Nov 2007

An Information-Sharing Based Anti-Phishing System, Yueqing Cheng, Zhen Yuan, Lei Ma, Robert H. Deng

Research Collection School Of Computing and Information Systems

This paper presents the design of an informationsharing based or server-assisted anti-phishing system. The system follows a client-server architecture and makes decision based on not only client side heuristics but also collective information from multiple clients. When visiting a web site, a client side proxy, installed as a plug-in to a browser, decides on the legitimacy of the web site based on a combination of white list, black list and heuristics. In case the client side proxy does not have sufficient information to make a clear judgment, it reports the suspicious site to a central server which has access to …

Go to article

Npake+: A Hierarchical Group Password-Authenticated Key Exchange Protocol Using Different Passwords, Zhiguo Wan, Robert H. Deng, Feng Bao, Bart Preneel Oct 2007

Npake+: A Hierarchical Group Password-Authenticated Key Exchange Protocol Using Different Passwords, Zhiguo Wan, Robert H. Deng, Feng Bao, Bart Preneel

Research Collection School Of Computing and Information Systems

Although two-party password-authenticated key exchange (PAKE) protocols have been intensively studied in recent years, group PAKE protocols have received little attention. In this paper, we propose a hierarchical group PAKE protocol nPAKE+ protocol under the setting where each party shares an independent password with a trusted server. The nPAKE+ protocol is a novel combination of the hierarchical key tree structure and the password-based Diffie-Hellman exchange, and hence it achieves substantial gain in computation efficiency. In particular, the computation cost for each client in our protocol is only O(logn). Additionally, the hierarchical feature of nPAKE+ enables every subgroup obtains their own …

Go to article

Flexible Access Control To Jpeg 2000 Image Code-Streams, Yongdong Wu, Di Ma, Robert H. Deng Oct 2007

Flexible Access Control To Jpeg 2000 Image Code-Streams, Yongdong Wu, Di Ma, Robert H. Deng

Research Collection School Of Computing and Information Systems

JPEG 2000 is an international standard for still image compression in the 21st century. Part 8 of the standard, named JPSEC, is concerned with all the security aspects, in particular to access control and authentication. This paper presents a novel access control scheme for JPEG 2000 image code-streams. The proposed scheme is secure against collusion attacks and highly efficient. The scheme is also very flexible, allowing access control to JPEG 2000 image code-streams according to any combination of resolution, quality layer and region of interest. The "encrypt once, decrypt many ways" property of our scheme is designed to work seamlessly …

Go to article

Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng Sep 2007

Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng

Research Collection School Of Computing and Information Systems

User privacy is a notable security issue in wireless communications. It concerns about user identities from being exposed and user movements and whereabouts from being tracked. The concern of user privacy is particularly signified in systems which support roaming when users are able to hop across networks administered by different operators. In this paper, we propose a novel construction approach of anonymous and authenticated key exchange protocols for a roaming user and a visiting server to establish a random session key in such a way that the visiting server authenticates the user's home server without knowing exactly who the user …

Go to article

Enhanced Security By Os-Oriented Encapsulation In Tpm-Enabled Drm, Yongdong Wu, Feng Bao, Robert H. Deng, Marc Mouffron, Frederic Rousseau Aug 2007

Enhanced Security By Os-Oriented Encapsulation In Tpm-Enabled Drm, Yongdong Wu, Feng Bao, Robert H. Deng, Marc Mouffron, Frederic Rousseau

Research Collection School Of Computing and Information Systems

The Trusted Computing Group (TCG) defines the specifications for the Trusted Platform Module (TPM) and corresponding trust mechanisms that allow a TPM-enabled platform to run only authenticated software. For example, the operating system (OS) can use the facilities provided by the TPM to authenticate a Digital Rights Management (DRM) application before allowing it to run. However TCG does not provide any clear specification on what kind of software can be regarded as trusted and hence be authenticated. In fact it is unlikely that there will be a clear line between the software that should be authenticated and those should not, …

Go to article

A More Natural Way To Construct Identity-Based Identification Schemes, Guomin Yang, Jing Chen, Duncan S. Wong, Xiaotie Deng, Dongsheng Wang Jun 2007

A More Natural Way To Construct Identity-Based Identification Schemes, Guomin Yang, Jing Chen, Duncan S. Wong, Xiaotie Deng, Dongsheng Wang

Research Collection School Of Computing and Information Systems

Constructing identification schemes is one of the fundamental problems in cryptography, and is very useful in practice. An identity-based identification (IBI) scheme allows a prover to identify itself to a public verifier who knows only the claimed identity of the prover and some common information. In this paper, we propose a simple and efficient framework for constructing IBI schemes. Unlike some related framework which constructs IBI schemes from some standard identification schemes, our framework is based on some more fundamental assumptions on intractable problems. Depending on the features of the underlying intractable problems presumed in our framework, we can derive …

Go to article

An Efficient Identity-Based Key Exchange Protocol With Kgs Forward Secrecy For Low-Power Devices, Robert W. Zhu, Guomin Yang, Duncan S. Wong Jun 2007

An Efficient Identity-Based Key Exchange Protocol With Kgs Forward Secrecy For Low-Power Devices, Robert W. Zhu, Guomin Yang, Duncan S. Wong

Research Collection School Of Computing and Information Systems

For an ID-based key exchange (KE) protocol, KGS forward secrecy is about the protection of previously established session keys after the master secret key of the Key Generation Server (KGS) is compromised. This is the strongest notion of forward secrecy that one can provide for an ID-based KE protocol. Among all the comparable protocols, there are only a few of them that provide this level of forward secrecy, and all of these protocols require expensive bilinear pairing operations and map-to-point hash operations that may not be suitable for implementation on low-power devices such as sensors. In this paper, we propose …

Go to article

Time Capsule Signature: Efficient And Provably Secure Constructions, Bessie C. Hu, Duncan S. Wong, Qiong Huang, Guomin Yang, Xiaotie Deng Jun 2007

Time Capsule Signature: Efficient And Provably Secure Constructions, Bessie C. Hu, Duncan S. Wong, Qiong Huang, Guomin Yang, Xiaotie Deng

Research Collection School Of Computing and Information Systems

Time Capsule Signature, first formalized by Dodis and Yum in Financial Cryptography 2005, is a digital signature scheme which allows a signature to bear a (future) time t so that the signature will only be valid at time t or later, when a trusted third party called time server releases time-dependent information for checking the validity of a time capsule signature. Also, the actual signer of a time capsule signature has the privilege to make the signature valid before time t.In this paper, we provide a new security model of time capsule signature such that time server is not required …

Go to article

Achieving End-To-End Authentication In Intermediary-Enabled Multimedia Delivery Systems, Robert H. Deng, Yanjiang Yang May 2007

Achieving End-To-End Authentication In Intermediary-Enabled Multimedia Delivery Systems, Robert H. Deng, Yanjiang Yang

Research Collection School Of Computing and Information Systems

Considerable research and experiment results in recent years have shown that the server-proxy-user architecture represents an efficient and scalable new paradigm for multimedia content delivery. However, not much effort has been spent on the security issues in such systems. In this paper, we study data authentication in multimedia content delivery, and in particular, we focus on achieving end-to-end authentication from the multimedia server to end users in the server-proxy-user architecture where intermediary proxies transcode multimedia content dynamically. We present a formal model for the end-to-end authentication problem, and propose a basic construction for generic data modality and prove its security. …

Go to article

Forgery Attack To An Asymptotically Optimal Traitor Tracing Scheme, Yongdong Wu, Feng Bao, Robert H. Deng May 2007

Forgery Attack To An Asymptotically Optimal Traitor Tracing Scheme, Yongdong Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper, we present a forgery attack to a black-box traitor tracing scheme [2] called as CPP scheme. CPP scheme has efficient transmission rate and allows the tracer to identify a traitor with just one invalid ciphertext. Since the original CPP scheme is vulnerable to the multi-key attack, we improved CPP to thwart the attack. However, CPP is vulnerable to a fatal forgery attack. In the forgery attack, two traitors can collude to forge all valid decryption keys. The forged keys appear as perfect genuine keys, can decrypt all protected content, but are untraceable by the tracer. Fortunately, we …

Go to article

First Prev Next Last