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 841 - 870 of 1051
Full-Text Articles in Information Security
A Solution With Security Concern For Rfid-Based Track And Trace Services In Epcglobal-Enabled Supply Chains, Wei He, Yingjiu Li, Kevin Chiew, Tieyan Li, Eng Wah Lee
A Solution With Security Concern For Rfid-Based Track And Trace Services In Epcglobal-Enabled Supply Chains, Wei He, Yingjiu Li, Kevin Chiew, Tieyan Li, Eng Wah Lee
Research Collection School Of Computing and Information Systems
A supply chain represents the flow of materials, information, and finance as they move through supply chain partners such as manufacturers, suppliers, distributors, retailers, and consumers. The track & trace services in supply chains can help improve supply chain visibility and efficiency, and prevent counterfeiting and stealing of products thus enhance security. Track & trace services in supply chains require identification of items, capture of events as items move through supply chains, and query of events of items. RFID (radio frequency identification) is a technology that allows to identify objects simultaneously in a fully automated manner via radio waves. This …
Fully Secure Cipertext-Policy Hiding Cp-Abe, Junzuo Lai, Robert H. Deng, Yingjiu Li
Fully Secure Cipertext-Policy Hiding Cp-Abe, Junzuo Lai, Robert H. Deng, Yingjiu Li
Research Collection School Of Computing and Information Systems
In ciphertext-policy attributed-based encryption (CP-ABE), each ciphertext is labeled by the encryptor with an access structure (also called ciphertext policy) and each private key is associated with a set of attributes. A user should be able to decrypt a ciphertext if and only if his private key attributes satisfy the access structure.The traditional security property of CP-ABE is plaintext privacy, which ciphertexts reveal no information about the underlying plaintext. At ACNS’08, Nishide, Yoneyama and Ohta introduced the notion of ciphertext-policy hiding CP-ABE. In addition to protecting the privacy of plaintexts, ciphertext-policy hiding CP-ABE also protects the description of the access …
Hierarchical Identity-Based Chameleon Hash And Its Applications, Feng Bao, Robert H. Deng, Xuhua Ding, Junzuo Lai, Yunlei Zhao
Hierarchical Identity-Based Chameleon Hash And Its Applications, Feng Bao, Robert H. Deng, Xuhua Ding, Junzuo Lai, Yunlei Zhao
Research Collection School Of Computing and Information Systems
At ACNS 2008, Canard et al. introduced the notion of trapdoor sanitizable signature (TSS) based on identity-based chameleon hash (IBCH). Trapdoor sanitizable signatures allow the signer of a message to delegate, at any time, the power of sanitization to possibly several entities who can modify predetermined parts of the message and generate a new signature on the sanitized message without interacting with the original signer. In this paper, we introduce the notion of hierarchical identity-based chameleon hash (HIBCH), which is a hierarchical extension of IBCH. We show that HIBCH can be used to construct other cryptographic primitives, including hierarchical trapdoor …
Heterogeneous Signcryption With Key Privacy, Qiong Huang, Duncan S. Wong, Guomin Yang
Heterogeneous Signcryption With Key Privacy, Qiong Huang, Duncan S. Wong, Guomin Yang
Research Collection School Of Computing and Information Systems
A signcryption scheme allows a sender to produce a ciphertext for a receiver so that both confidentiality and non-repudiation can be ensured. It is built to be more efficient and secure, for example, supporting insider security, when compared with the conventional sign-then-encrypt approach. In this paper, we propose a new notion called heterogeneous signcryption in which the sender has an identity-based secret key while the receiver is holding a certificate-based public key pair. Heterogeneous signcryption is suitable for practical scenarios where an identity-based user, who does not have a personal certificate or a public key, wants to communicate securely with …
Certificateless Public Key Encryption: A New Generic Construction And Two Pairing-Free Schemes, Guomin Yang, Chik How Tan
Certificateless Public Key Encryption: A New Generic Construction And Two Pairing-Free Schemes, Guomin Yang, Chik How Tan
Research Collection School Of Computing and Information Systems
The certificateless encryption (CLE) scheme proposed by Baek, Safavi-Naini and Susilo is computation-friendly since it does not require any pairing operation. Unfortunately, an error was later discovered in their security proof and so far the provable security of the scheme remains unknown. Recently, Fiore, Gennaro and Smart showed a generic way (referred to as the FGS transformation) to transform identity-based key agreement protocols to certificateless key encapsulation mechanisms (CL-KEMs). As a typical example, they showed that the pairing-free CL-KEM underlying Baek et al.’s CLE can be “generated” by applying their transformation to the Fiore–Gennaro (FG) identity-based key agreement (IB-KA) protocol.In …
Strongly Secure Certificateless Key Exchange Without Pairing, Guomin Yang, Chik How Tan
Strongly Secure Certificateless Key Exchange Without Pairing, Guomin Yang, Chik How Tan
Research Collection School Of Computing and Information Systems
In certificateless cryptography, a user secret key is derived from two partial secrets: one is the identity-based secret key (corresponding to the user identity) generated by a Key Generation Center (KGC), and the other is the user selfgenerated secret key (corresponding to a user self-generated and uncertified public key). Two types of adversaries are considered for certificateless cryptography: a Type-I adversary who can replace the user self-generated public key (in transmission or in a public directory), and a Type-II adversary who is an honest-but-curious KGC. In this paper, we present a formal study on certificateless key exchange (CLKE). We show …
Authenticated Key Exchange Under Bad Randomness, Guomin Yang, Shanshan Duan, Duncan S. Wong, Chik How Tan, Huaxiong Wang
Authenticated Key Exchange Under Bad Randomness, Guomin Yang, Shanshan Duan, Duncan S. Wong, Chik How Tan, Huaxiong Wang
Research Collection School Of Computing and Information Systems
We initiate the formal study on authenticated key exchange (AKE) under bad randomness. This could happen when (1) an adversary compromises the randomness source and hence directly controls the randomness of each AKE session; and (2) the randomness repeats in different AKE sessions due to reset attacks. We construct two formal security models, Reset-1 and Reset-2, to capture these two bad randomness situations respectively, and investigate the security of some widely used AKE protocols in these models by showing that they become insecure when the adversary is able to manipulate the randomness. On the positive side, we propose simple but …
Chameleon All-But-One Tdfs And Their Application To Chosen-Ciphertext Security, Junzuo Lai, Robert H. Deng, Shengli Liu
Chameleon All-But-One Tdfs And Their Application To Chosen-Ciphertext Security, Junzuo Lai, Robert H. Deng, Shengli Liu
Research Collection School Of Computing and Information Systems
In STOC’08, Peikert and Waters introduced a new powerful primitive called lossy trapdoor functions (LTDFs) and a richer abstraction called all-but-one trapdoor functions (ABO-TDFs). They also presented a black-box construction of CCA-secure PKE from an LTDF and an ABO-TDF. An important component of their construction is the use of a strongly unforgeable one-time signature scheme for CCA-security.In this paper, we introduce the notion of chameleon ABO-TDFs, which is a special kind of ABO-TDFs. We give a generic as well as a concrete construction of chameleon ABO-TDFs. Based on an LTDF and a chameleon ABO-TDF, we presented a black-box construction, free …
Secure Mobile Subscription Of Sensor-Encrypted Data, Cheng-Kang Chu, Wen-Tao Zhu, Sherman S. M. Chow, Jianying Zhou, Robert H. Deng
Secure Mobile Subscription Of Sensor-Encrypted Data, Cheng-Kang Chu, Wen-Tao Zhu, Sherman S. M. Chow, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
In an end-to-end encryption model for a wireless sensor network (WSN), the network control center preloads encryption and decryption keys to the sensor nodes and the subscribers respectively, such that a subscriber can use a mobile device in the deployment field to decrypt the sensed data encrypted by the more resource-constrained sensor nodes. This paper proposes SMS-SED, a provably secure yet practically efficient key assignment system featuring a discrete time-based access control, to better support a business model where the sensors deployer rents the WSN to customers who desires a higher flexibility beyond subscribing to strictly consecutive periods. In SMS-SED, …
Cryptanalysis Of A Certificateless Signcryption Scheme In The Standard Model, Jian Weng, Guoxiang Yao, Robert H. Deng, Min-Rong Chen, Xianxue Li
Cryptanalysis Of A Certificateless Signcryption Scheme In The Standard Model, Jian Weng, Guoxiang Yao, Robert H. Deng, Min-Rong Chen, Xianxue Li
Research Collection School Of Computing and Information Systems
Certificateless signcryption is a useful primitive which simultaneously provides the functionalities of certificateless encryption and certificateless signature. Recently, Liu et al. [15] proposed a new certificateless signcryption scheme, and claimed that their scheme is provably secure without random oracles in a strengthened security model, where the malicious-but-passive KGC attack is considered. Unfortunately, by giving concrete attacks, we indicate that Liu et al. certificateless signcryption scheme is not secure in this strengthened security model.
Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallabh Sambamurthy
Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallabh Sambamurthy
Research Collection School Of Computing and Information Systems
Increasingly, consumers depend on social information channels, such as user-posted online reviews, to make purchase decisions. These reviews are assumed to be unbiased reflections of other consumers' experiences with the products or services. While extensively assumed, the literature has not tested the existence or non-existence of review manipulation. By using data from Amazon and Barnes & Noble, our study investigates if vendors, publishers, and writers consistently manipulate online consumer reviews. We document the existence of online review manipulation and show that the manipulation strategy of firms seems to be a monotonically decreasing function of the product's true quality or the …
Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallbh Sambamurthy
Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallbh Sambamurthy
Research Collection School Of Computing and Information Systems
Increasingly, consumers depend on social information channels, such as user-posted online reviews, to make purchase decisions. These reviews are assumed to be unbiased reflections of other consumers' experiences with the products or services. While extensively assumed, the literature has not tested the existence or non-existence of review manipulation. By using data from Amazon and Barnes & Noble, our study investigates if vendors, publishers, and writers consistently manipulate online consumer reviews. We document the existence of online review manipulation and show that the manipulation strategy of firms seems to be a monotonically decreasing function of the product's true quality or the …
Database Access Pattern Protection Without Full-Shuffles, Xuhua Ding, Yanjiang Yang, Robert H. Deng
Database Access Pattern Protection Without Full-Shuffles, Xuhua Ding, Yanjiang Yang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Privacy protection is one of the fundamental security requirements for database outsourcing. A major threat is information leakage from database access patterns generated by query executions. The standard private information retrieval (PIR) schemes, which are widely regarded as theoretical solutions, entail O(n) computational overhead per query for a database with items. Recent works propose to protect access patterns by introducing a trusted component with constant storage size. The resulting privacy assurance is as strong as PIR, though with O(1) online computation cost, they still have O(n) amortized cost per query due to periodically full database shuffles. In this paper, we …
Editorial: Special Issue On Ubiquitous Electronic Commerce Systems, Robert H. Deng, Jari Veijalainen, Shiguo Lian, Dimitris Kanellopoulos
Editorial: Special Issue On Ubiquitous Electronic Commerce Systems, Robert H. Deng, Jari Veijalainen, Shiguo Lian, Dimitris Kanellopoulos
Research Collection School Of Computing and Information Systems
Ubiquitous computing is a post-desktop model of human-computer interaction in which information processing has been thoroughly integrated into everyday objects and activities. Emerging ubiquitous electronic commerce systems (UECS) are expected to be available anytime, anywhere, and using different official or personal computing devices. Systems and services such as digital libraries, on-line business transactions, mobile office and mobile TV are widely deployed. Users will be able to access these services anytime, anywhere, while using any computing device in a pervasive way.
Identity-Based Strong Designated Verifier Signature Revisited, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
Identity-Based Strong Designated Verifier Signature Revisited, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
Research Collection School Of Computing and Information Systems
Designated verifier signature (DVS) allows the signer to persuade a verifier the validity of a statement but prevent the verifier from transferring the conviction. Strong designated verifier signature (SDVS) is a variant of DVS, which only allows the verifier to privately check the validity of the signer’s signature. In this work we observe that the unforgeability model considered in the existing identity-based SDVS schemes is not strong enough to capture practical attacks, and propose to consider another model which is shown to be strictly stronger than the old one. We then propose a new efficient construction of identity-based SDVS scheme, …
Efficient Strong Designated Verifier Signature Schemes Without Random Oracle Or With Non-Delegatability, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
Efficient Strong Designated Verifier Signature Schemes Without Random Oracle Or With Non-Delegatability, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
Research Collection School Of Computing and Information Systems
Designated verifier signature (DVS) allows a signer to convince a designated verifier that a signature is generated by the signer without letting the verifier transfer the conviction to others, while the public can still tell that the signature must be generated by one of them. Strong DVS (SDVS) strengthens the latter part by restricting the public from telling whether the signature is generated by one of them or by someone else. In this paper, we propose two new SDVS schemes. Compared with existing SDVS schemes, the first new scheme has almost the same signature size and meanwhile, is proven secure …
Lightweight Delegated Subset Test With Privacy Protection, Xuhua Zhou, Xuhua Ding, Kefei Chen
Lightweight Delegated Subset Test With Privacy Protection, Xuhua Zhou, Xuhua Ding, Kefei Chen
Research Collection School Of Computing and Information Systems
Delegated subset tests are mandatory in many applications, such as content-based networks and outsourced text retrieval, where an untrusted server evaluates the degree of matching between two data sets. We design a novel scheme to protect the privacy of the data sets in comparison against the untrusted server, with half of the computation cost and half of the ciphertext size of existing solutions based on predicate only encryption supporting inner product.
Dynamic Group Key Exchange Revisited, Guomin Yang, Chik How Tan
Dynamic Group Key Exchange Revisited, Guomin Yang, Chik How Tan
Research Collection School Of Computing and Information Systems
In a dynamic group key exchange protocol, besides the basic group setup protocol, there are also a join protocol and a leave protocol, which allow the membership of an existing group to be changed more efficiently than rerunning the group setup protocol. The join and leave protocols should ensure that the session key is updated upon every membership change so that the subsequent sessions are protected from leaving members (backward security) and the previous sessions are protected from joining members (forward security). In this paper, we present a new security model for dynamic group key exchange. Comparing to existing models, …
Revisiting Address Space Randomization, Zhi Wang, Renquan Cheng, Debin Gao
Revisiting Address Space Randomization, Zhi Wang, Renquan Cheng, Debin Gao
Research Collection School Of Computing and Information Systems
Address space randomization is believed to be a strong defense against memory error exploits. Many code and data objects in a potentially vulnerable program and the system could be randomized, including those on the stack and heap, base address of code, order of functions, PLT, GOT, etc. Randomizing these code and data objects is believed to be effective in obfuscating the addresses in memory to obscure locations of code and data objects. However, attacking techniques have advanced since the introduction of address space randomization. In particular, return-oriented programming has made attacks without injected code much more powerful than what they …
Time Cost Evaluation For Executing Rfid Authentication Protocols, Kevin Chiew, Yingjiu Li, Tieyan Li, Robert H. Deng, Manfred Aigner
Time Cost Evaluation For Executing Rfid Authentication Protocols, Kevin Chiew, Yingjiu Li, Tieyan Li, Robert H. Deng, Manfred Aigner
Research Collection School Of Computing and Information Systems
There are various reader/tag authentication protocols proposed for the security of RFID systems. Such a protocol normally contains several rounds of conversations between a tag and a reader and involves cryptographic operations at both reader and tag sides. Currently there is a lack of benchmarks that provide a fair comparison platform for (a) the time cost of cryptographic operations at the tag side and (b) the time cost of data exchange between a reader and a tag, making it impossible to evaluate the total time cost for executing a protocol. Based on our experiments implemented on IAIK UHF tag emulators …
Chosen-Ciphertext Secure Bidirectional Proxy Re-Encryption Schemes Without Pairings, Jian Weng, Huijie, Robert Deng, Shengli Liu, Kefei Chen
Chosen-Ciphertext Secure Bidirectional Proxy Re-Encryption Schemes Without Pairings, Jian Weng, Huijie, Robert Deng, Shengli Liu, Kefei Chen
Research Collection School Of Computing and Information Systems
Proxy re-encryption realizes delegation of decryption rights, enabling a proxy holding a re-encryption key to convert a ciphertext originally intended for Alice into an encryption of the same message for Bob. Proxy re-encryption is a very useful primitive, having many applications in distributed file systems, outsourced filtering of encrypted spam, access control over network storage, and so on. Lately, Weng et al. proposed the first unidirectional proxy re-encryption scheme without using bilinear pairs. However, Weng et al.'s construction does not possess collusion resilience, in the sense that a coalition of the proxy and the delegatee can recover the delegator's private …
A Multi-User Steganographic File System On Untrusted Shared Storage, Jin Han, Meng Pan, Debin Gao, Hwee Hwa Pang
A Multi-User Steganographic File System On Untrusted Shared Storage, Jin Han, Meng Pan, Debin Gao, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
Existing steganographic file systems enable a user to hide the existence of his secret data by claiming that they are (static) dummy data created during disk initialization. Such a claim is plausible if the adversary only sees the disk content at the point of attack. In a multi-user computing environment that employs untrusted shared storage, however, the adversary could have taken multiple snapshots of the disk content over time. Since the dummy data are static, the differences across snapshots thus disclose the locations of user data, and could even reveal the user passwords. In this paper, we introduce a Dummy-Relocatable …
Protecting And Restraining The Third Party In Rfid-Enabled 3pl Supply Chains, Shaoying Cai, Chunhua Su, Yingjiu Li, Robert H. Deng
Protecting And Restraining The Third Party In Rfid-Enabled 3pl Supply Chains, Shaoying Cai, Chunhua Su, Yingjiu Li, Robert H. Deng
Research Collection School Of Computing and Information Systems
“Symmetric secret”-based RFID systems are widely adopted in supply chains. In such RFID systems, a reader’s ability to identify a RFID tag relies on the possession of the tag’s secret which is usually only known by its owner. If a “symmetric secret”-based RFID system is deployed in third party logistics (3PL) supply chains, all the three parties (the sender of the goods, the receiver of the goods and the 3PL provider) should have a copy of those tags’ secrets to access the tags. In case the three parties in 3PL supply chain are not all honest, sharing the secrets among …
A New Framework For Rfid Privacy, Robert H. Deng, Yingjiu Li, Moti Yung, Yunlei Zhao
A New Framework For Rfid Privacy, Robert H. Deng, Yingjiu Li, Moti Yung, Yunlei Zhao
Research Collection School Of Computing and Information Systems
Formal RFID security and privacy frameworks are fundamental to the design and analysis of robust RFID systems. In this paper, we develop a new definitional framework for RFID privacy in a rigorous and precise manner. Our framework is based on a zero-knowledge (ZK) formulation [8,6] and incorporates the notions of adaptive completeness and mutual authentication. We provide meticulous justification of the new framework and contrast it with existing ones in the literature. In particular, we prove that our framework is strictly stronger than the ind-privacy model of [18], which answers an open question posed in [18] for developing stronger RFID …
On Challenges In Evaluating Malware Clustering, Peng Li, Limin Liu, Debin Gao, Michael K Reiter
On Challenges In Evaluating Malware Clustering, Peng Li, Limin Liu, Debin Gao, Michael K Reiter
Research Collection School Of Computing and Information Systems
Malware clustering and classification are important tools that enable analysts to prioritize their malware analysis efforts. The recent emergence of fully automated methods for malware clustering and classification that report high accuracy suggests that this problem may largely be solved. In this paper, we report the results of our attempt to confirm our conjecture that the method of selecting ground-truth data in prior evaluations biases their results toward high accuracy. To examine this conjecture, we apply clustering algorithms from a different domain (plagiarism detection), first to the dataset used in a prior work's evaluation and then to a wholly new …
Embellishing Text Search Queries To Protect User Privacy, Hwee Hwa Pang, Xuhua Ding, Xiaokui Xiao
Embellishing Text Search Queries To Protect User Privacy, Hwee Hwa Pang, Xuhua Ding, Xiaokui Xiao
Research Collection School Of Computing and Information Systems
Users of text search engines are increasingly wary that their activities may disclose confidential information about their business or personal profiles. It would be desirable for a search engine to perform document retrieval for users while protecting their intent. In this paper, we identify the privacy risks arising from semantically related search terms within a query, and from recurring highspecificity query terms in a search session. To counter the risks, we propose a solution for a similarity text retrieval system to offer anonymity and plausible deniability for the query terms, and hence the user intent, without degrading the system’s precision-recall …
Pseudonym-Based Rfid Discovery Service To Mitigate Unauthorized Tracking In Supply Chain Management, Qiang Yan, Robert H. Deng, Zheng Yan, Yingjiu Li, Tieyan Li
Pseudonym-Based Rfid Discovery Service To Mitigate Unauthorized Tracking In Supply Chain Management, Qiang Yan, Robert H. Deng, Zheng Yan, Yingjiu Li, Tieyan Li
Research Collection School Of Computing and Information Systems
Unauthorized tracking of RFID tagged assets at the system level, where an adversary tracks movement of RFID tagged assets by eavesdropping network messages or compromising date center servers, has not been well recognized in prior research. Compared to the traditional unauthorized tracking by clandestine scanning at the physical level, unauthorized tracking at the system level could be even more harmful as the adversary is able to obtain tracking information on a global scale and without physical presence. This paper analyzes the threat of unauthorized tracking by a semi-trusted RFID Discovery Service which maintains a database of RFID tag location records …
A New Hardware-Assisted Pir With O(N) Shuffle Cost, Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong Wang
A New Hardware-Assisted Pir With O(N) Shuffle Cost, Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong Wang
Research Collection School Of Computing and Information Systems
Since the concept of private information retrieval (PIR) was first formalized by Chor et al., various constructions have been proposed with a common goal of reducing communication complexity. Unfortunately, none of them is suitable for practical settings mainly due to the prohibitively high cost for either communications or computations. The booming of the Internet and its applications, especially, the recent trend in outsourcing databases, fuels the research on practical PIR schemes. In this paper, we propose a hardware-assisted PIR scheme with a novel shuffle algorithm. Our PIR construction entails O(n) offline computation cost, and constant online operations and O(log n) …
An Efficient Signcryption Scheme With Key Privacy And Its Extension To Ring Signcryption, Chung Ki Li, Guomin Yang, Duncan S. Wong, Xiaotie Deng, Sherman S. M. Chow
An Efficient Signcryption Scheme With Key Privacy And Its Extension To Ring Signcryption, Chung Ki Li, Guomin Yang, Duncan S. Wong, Xiaotie Deng, Sherman S. M. Chow
Research Collection School Of Computing and Information Systems
In Information Processing Letters (2006), Tan pointed out that the anonymous signcryption scheme proposed by Yang, Wong and Deng (YWD) in ISC 2005 provides neither confidentiality nor anonymity. However, no discussion has been made on how a secure scheme can be made and there is no secure scheme available to date. In this paper, we propose a modification of YWD scheme which resolves the security issues of the original scheme without sacrificing its high efficiency and simple design. Indeed, we show that our scheme achieves confidentiality, existential unforgeability and anonymity with more precise reduction bounds. We also give a variation …
New Constructions For Identity-Based Unidirectional Proxy Re-Encryption, Junzuo Lai, Wen Tao Zhu, Robert H. Deng, Shengli Liu, Weidong Kou
New Constructions For Identity-Based Unidirectional Proxy Re-Encryption, Junzuo Lai, Wen Tao Zhu, Robert H. Deng, Shengli Liu, Weidong Kou
Research Collection School Of Computing and Information Systems
We address the cryptographic topic of proxy re-encryption (PRE), which is a special public-key cryptosystem. A PRE scheme allows a special entity, known as the proxy, to transform a message encrypted with the public key of a delegator (say Alice), into a new ciphertext that is protected under the public key of a delegatee (say Bob), and thus the same message can then be recovered with Bob’s private key. In this paper, in the identity-based setting, we first investigate the relationship between so called mediated encryption and unidirectional PRE. We provide a general framework which converts any secure identity-based unidirectional …