Email this article Ensuring Semantic Security in Keyword Search using Searchable Public-Key Ciphertexts with Hidden Structures
Abstract
This paper propose searchable public key ciphertexts with inconspicuous structure for catchphrase investigate as quick as doable lacking giving up semantic security of the scrambled watchwords. In SPCHS, each one watchword searchable ciphertext are arranged by inconspicuous relative, and with the pursuit trapdoor consequent to a catchphrase, the littlest sum in succession of the relations is identify with a search for calculation as the supervision to find all comparing ciphertext capably. In SPCHS (Searchable Public-Key Ciphertexts with Hidden Structures), all catchphrase searchable ciphertexts are organized by concealed relations, and with the inquiry trapdoor relating to a watchword, the base data of the relations is revealed to a hunt calculation as the direction to locate all coordinating ciphertexts proficiently. The inquiry intricacy of our plan is reliant on the genuine number of the ciphertexts containing the questioned catchphrase, instead of the quantity of all ciphertexts. At long last, we introduce a non specific SPCHS development from mysterious character based encryption and crash free full-personality moldable Identity-Based Key Encapsulation Mechanism (IBKEM) with secrecy. We outline two impact free full-character pliant IBKEM examples, which are semantically secure and unknown, individually.
References
Boneh D., Crescenzo G. D., Ostrovsky R., Persiano G.: Public Key Encryption with Keyword Search. In: Cachin C., Camenisch J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506-522. Springer, Heidelberg (2004).
Bellare M., Boldyreva A., O’Neill A.: Deterministic and Efficiently Searchable Encryption. In: Menezes A. (ed.) CRYPTO 2007. LNCS vol. 4622, pp. 535-552. Springer, Heidelberg (2007)
Boneh D., Boyen X.: Efficient Selective-ID Secure Identity-Based Encryption without Random Oracles. In: Cachin C., Camenisch J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223-238. Springer, Heidelberg (2004)
Boyen X., Waters B. R.: Anonymous Hierarchical Identity-Based
Encryption (Without Random Oracles). In: Dwork C. (ed.) CRYPTO
LNCS, vol. 4117, pp. 290-307. Springer, Heidelberg (2006)
Gentry C.: Practical Identity-Based Encyrption Without Random
Oracles. In: Vaudenay S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp.445-464. Springer, Heidelberg (2006)
Ateniese G., Gasti P.: Universally Anonymous IBE Based on the
Quadratic Residuosity Assumption. In: Fischlin M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 32-47. Springer, Heidelberg (2009)
Ducas L.: Anonymity from Asymmetry: New Constructions for Anonymous HIBE. In: Pieprzyk J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 148-164. Springer, Heidelberg (2010)
Abdalla M., Catalano D., Fiore D.: Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions. Journal of Cryptology, 27(3), pp. 544-593 (2013)
Freire E.S.V., Hofheinz D., Paterson K.G., Striecks C.: Programmable Hash Functions in the Multilinear Setting. In: Canetti R., Garay J.A. (eds.) Advances in Cryptology - CRYPTO 2013. LNCS, vol. 8042, pp. 513-530. Springer, Heidelberg (2013)
Garg S., Gentry C., Halevi S.: Candidate Multilinear Maps from Ideal Lattices. In: Johansson T., Nguyen P. (eds.) Advances in Cryptology - EUROCRYPT 2013. LNCS, vol. 7881, pp. 1-17. Springer, Heidelberg (2013)
Boneh D., Franklin M.: Identity-Based Encryption from the Weil Pairing. In: Kilian J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-239. Springer, Heidelberg (2001)
Barth A., Boneh D., Waters B.: Privacy in Encrypted Content Distribution Using Private Broadcast Encryption. In: Di Crescenzo G., Rubin A.(eds.) FC 2006. LNCS, vol. 4107, pp. 52-64. Springer, Heidelberg (2006)
Libert B., Paterson K. G., Quaglia E. A.: Anonymous Broadcast
Encryption: Adaptive Security and Efficient Constructions in the Standard Model. In: Fischlin M., Buchmann J., Manulis M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 206-224. Springer, Heidelberg (2012)
Curtmola R., Garay J., Kamara S., Ostrovsky R.: Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. In: ACM CCS 2006, pp. 79-88. ACM (2006)
Song D. X., Wagner D., Perrig A.: Practical techniques for searches on encrypted data. In: IEEE S&P 2000, pp. 44-55. IEEE (2000)
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.
Â