Search

Keyword search on encrypted data allows one to issue the search token and conduct search operations on encrypted data while still preserving keyword privacy. In the present paper, we consider the keyword search problem further and introduce a novel notion called attribute-based proxy re-encryption with keyword search (ABRKS), which introduces a promising feature: In addition to supporting keyword search on encrypted data, it enables data owners to delegate the keyword search capability to some other data users complying with the specific access control policy. To be specific, ABRKS allows (i) the data owner to outsource his encrypted data to the cloud and then ask the cloud to conduct keyword search on outsourced encrypted data with the given search token, and (ii) the data owner to delegate other data users keyword search capability in the fine-grained access control manner through allowing the cloud to re-encrypted stored encrypted data with a re-encrypted data (embedding with some form of access control policy). We formalize the syntax and security definitions for ABRKS, and propose two concrete constructions for ABRKS: key-policy ABRKS and ciphertext-policy ABRKS. In the nutshell, our constructions can be treated as the integration of technologies in the fields of attribute-based cryptography and proxy re-encryption cryptography.

A grouping-proof protocol is to generate a proof that a group of tags have been scanned simultaneously in the range of a reader. Security and efficiency become the core issues when designing a grouping-proof protocol. In this paper, we first describe the deployment model, adversary model, and security requirements of a grouping-proof protocol. Then, we propose an offline reading order-independent grouping-proof protocol. To demonstrate security of our scheme, we present an ideal grouping-proof functionality in the universally composable framework. Subsequently, we prove that the proposed protocol realizes the defined ideal functionality. Compared with the existing grouping-proof protocols, our scheme satisfies the privacy and security requirements of a grouping-proof protocol including tag/reader anonymity, tag/reader location privacy, mutual authorized access, anti-active attack, anti-replay attack, concurrent security, and so on. Meanwhile, our scheme has desirable performance. It conforms to the computational constraints of low-cost passive radio frequency identification tags, which makes it suitable for large-scale application. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Password authentication is a type of authentication protocol for communications over an insecure network. Recently, Kim, Jeon, and Yoo gave an improvement of Yang-Shieh password authentication schemes to resist an existing forgery attack. However, in this paper, we construct a new forgery attack and show that Kim-Jeon-Yoo schemes are not secure under our attack. [ABSTRACT FROM AUTHOR]

Abstract: In recent years, a large number of data mining tools were developed, which may reveal costumers’ privacy if proper protection measure is not taken. On the other hand, customers are becoming increasingly concerned about privacy. They are reluctant to provide personal information unless privacy-preserving techniques are used. In this paper, we propose a privacy-preserving protocol for mining support counts, which maintains high accuracy and strong privacy while achieving very good efficiency. Compared with existing works with similar privacy and accuracy guarantees, our solution is much more efficient. We use identity-based cryptography, which has an additional advantage that no public key certificate is needed. Further, our evaluation results show that the protocol is very efficient and practical. [Copyright &y& Elsevier]