References of "Chen, Xiaofeng"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailExtend the Concept of Public Key Encryption with Delegated Search
Tang, Qiang UL; Ma, Hua; Chen, Xiaofeng

in Computer Journal (2015), 58(4), 11

We revisit the concept of public key encryption with delegated keyword search (PKEDS), a concept proposed by Ibraimi et al. A PKEDS scheme allows a receiver to authorize a third-party server to search in ... [more ▼]

We revisit the concept of public key encryption with delegated keyword search (PKEDS), a concept proposed by Ibraimi et al. A PKEDS scheme allows a receiver to authorize a third-party server to search in two ways: either according to a message chosen by the server itself or according to a trapdoor sent by the receiver.We first show some observations on the primitive formulation and the proposed PKEDS scheme by Ibraimi et al. and point out that the single-server setting may limit the application of this primitive. We then extend the concept to the multiple-server setting and present a new security model. We finally propose a new PKEDS scheme, which is proven secure, and compare it with that by Ibraimi et al. [less ▲]

Detailed reference viewed: 76 (1 UL)
Full Text
Peer Reviewed
See detailNew Algorithms for Secure Outsourcing of Modular Exponentiations
Chen, Xiaofeng; Li, Jin; Ma, Jianfeng et al

in IEEE Trans. Parallel Distrib. Syst. (2014), 25(9), 2386-2396

With the rapid development in availability of cloud services, the techniques for securely outsourcing the prohibitively expensive computations to untrusted servers are getting more and more attentions in ... [more ▼]

With the rapid development in availability of cloud services, the techniques for securely outsourcing the prohibitively expensive computations to untrusted servers are getting more and more attentions in the scientific community. Exponentiations modulo a large prime have been considered the most expensive operation in discrete-logarithm based cryptographic protocols, and the computationally limited devices such as RFID tags or smartcard may be incapable to accomplish these operations. Therefore, it is meaningful to present an efficient method to securely outsource most of this work-load to (untrusted) cloud servers. In this paper, we propose a new secure outsourcing algorithm for (variable-exponent, variable-base) exponentiation modular a prime in the two untrusted program model. Compared with the state-of-the-art algorithm \cite{HL05}, the proposed algorithm is superior in both efficiency and checkability. We then utilize this algorithm as a subroutine to achieve outsource-secure Cramer-Shoup encryptions and Schnorr signatures. Besides, we propose the first outsource-secure and efficient algorithm for simultaneous modular exponentiations. Moreover, we formally prove that both the algorithms can achieve the desired security notions. We also provide the experimental evaluation that demonstrates the efficiency and effectiveness of the proposed outsourcing algorithms and schemes. [less ▲]

Detailed reference viewed: 173 (12 UL)
Full Text
Peer Reviewed
See detailEfficient Algorithms for Secure Outsourcing of Bilinear Pairings
Chen, Xiaofeng; Susilo, Willy; Li, Jin et al

in Theoretical Computer Science (2014)

The computation of bilinear pairings has been considered the most expensive operation in pairing-based cryptographic protocols. In this paper, we first propose an efficient and secure outsourcing ... [more ▼]

The computation of bilinear pairings has been considered the most expensive operation in pairing-based cryptographic protocols. In this paper, we first propose an efficient and secure outsourcing algorithm for bilinear pairings in the two untrusted program model. Compared with the state-of-the-art algorithm, adistinguishing property of our proposed algorithm is that the (resource-constrained) outsourcer is not required to perform any expensive operations, such as point multiplications or exponentiations. Furthermore, we utilize this algorithm as a subroutine to achieve outsource-secure identity-based encryptions and signatures. [less ▲]

Detailed reference viewed: 85 (1 UL)
Full Text
Peer Reviewed
See detailTowards asymmetric searchable encryption with message recovery and flexible search authorization
Tang, Qiang UL; Chen, Xiaofeng

in Proceeding of 8th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2013) (2013)

Detailed reference viewed: 90 (4 UL)