Designated Cloud Server Public Key Encryption with Keyword Search from Lattice in the Standard Model

ZHANG Xiaojun; XU Chunxiang; XIE Run; JIN Chunhua

doi:10.1049/cje.2018.01.012

Volume 27 Issue 2

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2018 > 27(2): 304-309

ZHANG Xiaojun, XU Chunxiang, XIE Run, JIN Chunhua. Designated Cloud Server Public Key Encryption with Keyword Search from Lattice in the Standard Model[J]. Chinese Journal of Electronics, 2018, 27(2): 304-309. doi: 10.1049/cje.2018.01.012

Citation:

ZHANG Xiaojun, XU Chunxiang, XIE Run, JIN Chunhua. Designated Cloud Server Public Key Encryption with Keyword Search from Lattice in the Standard Model[J]. Chinese Journal of Electronics, 2018, 27(2): 304-309. doi: 10.1049/cje.2018.01.012

Citation:

PDF( 279 KB)

Designated Cloud Server Public Key Encryption with Keyword Search from Lattice in the Standard Model

doi: 10.1049/cje.2018.01.012

1.
School of Computer Science, Southwest Petroleum University, Chengdu 610500, China;
2.
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China

Funds: This work is supported by the National Natural Science Foundation of China (No.61370203), China Postdoctoral Science Foundation Funded Project (No.2017M623008), and Scientific Research Starting Project of SWPU (No.2017QHZ023).

Received Date: 2015-10-14
Rev Recd Date: 2016-01-30
Publish Date: 2018-03-10

Abstract

Abstract

Recently, how to retrieve the encrypted data efficiently from a cloud storage system becomes a hot topic. Public key encryption with keyword search (PEKS) can allow one to search the encrypted data with a keyword efficiently. Due to the booming of post-quantum cryptography, we propose public key encryption with keyword search from lattice assumption, which can resist quantum computer attacks. We delegate a particular cloud server to search the results, thus only the designated cloud server can finish the test process. Our scheme has been proved ciphertext indistinguishability in the standard model, which can reflect its security in the real world. To the best of our knowledge, our scheme is the first construction based on lattice in the standard model, which is a step stone in the post-quantum cryptographic communication.
- Cloud storage,
- Public key encryption with keyword search,
- Lattice assumption,
- Standard model

FullText(HTML)

References(13)

References

C. Wang, S.M. Chow, Q. Wang, et al., "Privacy-preserving public auditing for secure cloud storage", IEEE Transactions on Computers, Vol.62, No.2, pp.362-375, 2013.

Z. Ren, L. Wang, Q. Wu, et al., "Data dynamics enabled privacy-preserving public batch auditing in cloud storage", Chinese Journal of Electronics, Vol.23, No.2, pp.297-301, 2014.

D. Boneh, G.D. Crescenzo, R. Ostrovsky, et al.,"Public key with keyword search", Proceedings of Eurocrypt'04, LNCS, Vol.3027, pp.506-522, 2004.

J. Baek, R.S. Naini and W. Susilo, "Public key encryption with keyword search revisited", Proceedings of ACIS06, LNCS Vol.5072, pp.1249-1259, 2006.

H.S. Rhee, J.H. Park, W. Susilo, et al., "Trapdoor security in a searchable public-key encryption scheme with a designated tester", Journal of Systems and Software, Vol.83, No.5, pp.763-771, 2010.

H.S. Rhee, J.H. Park and D.H. Lee, "Generic construction of designated tester public-key encryption with keyword search", Information Sciences, Vol.205, No.1, pp.93-109, 2012.

Y.W. Tsu, T.T. Tung and Y.M. Tseng, "Efficient searchable identity-based encryption with a designated server", Annals of Telecommunications-Annales Des Tlcommunications, Vol.69, No.7, pp.391-402, 2014.

P. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer", SIAM Journal on Computing, Vol.26, No.5, pp.1484-1509, 1997.

M. Ajtai, "Generating hard instances of the short basis problem", Proceedings of Automata, Languages and Programming ICALP 1999, LNCS, Vol.1644, pp.1-9, 1999.

C. Gentry, C. Peikert and V. Vaikuntanathan, "Trapdoors for hard lattices and new cryptographic constructions", Proceedings of STOC'08, pp.197-206, 2008.

O. Regev, "On lattices, learning with errors, random linear codes, and cryptography", Proceedings of STOC'05, ACM, pp.84-93, 2005.

S. Agrawal, D. Boneh and X. Boyen, "Efficient lattice (H)IBE in the standard model", Proceedings of EUROCRYPT'10, LNCS, pp.553-572, 2010.

J. Alwen, C. Peikert, "Generating shorter bases for hard random lattices", Theorem of Computer Systems, Vol.09001, pp.75-86, 2009.

Relative Articles

Supplements(0)

Cited By

Proportional views