Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.595
JCR 5-Year IF: 0.661
Issues per year: 4
Current issue: May 2018
Next issue: Aug 2018
Avg review time: 106 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

1,967,620 unique visits
536,402 downloads
Since November 1, 2009



No robots online now


SJR SCImago RANK

SCImago Journal & Country Rank


SEARCH ENGINES

aece.ro - Google Pagerank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 18 (2018)
 
     »   Issue 2 / 2018
 
     »   Issue 1 / 2018
 
 
 Volume 17 (2017)
 
     »   Issue 4 / 2017
 
     »   Issue 3 / 2017
 
     »   Issue 2 / 2017
 
     »   Issue 1 / 2017
 
 
 Volume 16 (2016)
 
     »   Issue 4 / 2016
 
     »   Issue 3 / 2016
 
     »   Issue 2 / 2016
 
     »   Issue 1 / 2016
 
 
 Volume 15 (2015)
 
     »   Issue 4 / 2015
 
     »   Issue 3 / 2015
 
     »   Issue 2 / 2015
 
     »   Issue 1 / 2015
 
 
  View all issues  








LATEST NEWS

2017-Jun-14
Thomson Reuters published the Journal Citations Report for 2016. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.595, and the JCR 5-Year Impact Factor is 0.661.

2017-Apr-04
We have the confirmation Advances in Electrical and Computer Engineering will be included in the EBSCO database.

2017-Jan-30
We have the confirmation Advances in Electrical and Computer Engineering will be included in the Gale database.

Read More »


    
 

  2/2016 - 2

Secure Multi-Keyword Search with User/Owner-side Efficiency in the Cloud

LEE, Y. See more information about LEE, Y. on SCOPUS See more information about LEE, Y. on IEEExplore See more information about LEE, Y. on Web of Science, KIM, P. See more information about  KIM, P. on SCOPUS See more information about  KIM, P. on SCOPUS See more information about KIM, P. on Web of Science, PARK, Y. See more information about PARK, Y. on SCOPUS See more information about PARK, Y. on SCOPUS See more information about PARK, Y. on Web of Science
 
Click to see author's profile on See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (1,453 KB) | Citation | Downloads: 436 | Views: 943

Author keywords
keyword search, encryption, data security, information security, security

References keywords
data(7), cloud(7), security(6), privacy(6), search(5), preserving(5), encrypted(5), text(4), secure(4), keyword(4)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2016-05-31
Volume 16, Issue 2, Year 2016, On page(s): 11 - 18
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2016.02002
Web of Science Accession Number: 000376996100002
SCOPUS ID: 84974851886

Abstract
Quick view
Full text preview
As the amount of data in the cloud grows, ranked search system, the similarity of a query to data is ranked, are of significant importance. on the other hand, to protect privacy, searchable encryption system are being actively studied. In this paper, we present a new similarity-based multi-keyword search scheme for encrypted data. This scheme provides high flexibility in the pre- and post-processing of encrypted data, including splitting stem/suffix and computing from the encrypted index-term matrix, demonstrated to support Latent Semantic Indexing(LSI). On the client side, the computation and communication costs are one to two orders of magnitude lower than those of previous methods, as demonstrated in the experimental results. we also provide a security analysis of the proposed scheme.


References | Cited By  «-- Click to see who has cited this paper

[1] L. M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner, "A Break in the Clouds: towards a Cloud Definition", ACM SIGCOMM Comput. Commun. Rev., vol. 39, no.1, pp. 50-55, 2009.
[CrossRef]


[2] S. Yu, C. Wang, K. Ren, and W. Lou, "Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing", Proc. IEEE INFOCOM, pp. 1-9, 2010.
[CrossRef]


[3] C. Wang, Q. Wang, K. Ren, and W. Lou, "Privacy-preserving Public auditing for Data Storage Security in Cloud Computing", Proc. IEEE INFOCOM, pp. 1-9, 2010.
[CrossRef] [SCOPUS Times Cited 651]


[4] T. Yu, S. Jajodia, "Secure Data Management in Decentralized Systems." Advances in Information Security, vol. 33, pp. 355-380, Springer Press, 2007.
[CrossRef]


[5] H. Pang, X. Ding, and X. Xiao. "Embellishing Text Search Queries to Protect User Privacy." Proc. VLDB Endowment vol. 3.1/2, pp. 598-607, 2007.
[CrossRef] [SCOPUS Times Cited 20]


[6] D. Song, D. Wagner, and A. Perrig, "Practical Techniques for Searches on Encrypted Data", Proc. IEEE Security and Privacy, pp. 44-55, 2000.
[CrossRef]


[7] R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky, "Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions", Proc. ACM Computer and Communication Security, pp. 79-88, 2006.
[CrossRef] [SCOPUS Times Cited 716]


[8] M. Bellare, A. Boldyreva, and A. O’Neill, "Deterministic and Efficiently Searchable Encryption", Proc. Advances in Cryptology - CRYPTO, pp. 535-552, 2007.
[CrossRef]


[9] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, "Searchable Encryption Revisited: Consistency properties, relation to Anonymous IBE, and Extensions", Journal of Cryptology, vol. 21, no. 3, pp. 350-391, 2008.
[CrossRef] [Web of Science Times Cited 112] [SCOPUS Times Cited 164]


[10] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, "Fuzzy Keyword Search over Encrypted Data in Cloud Computing", Proc. IEEE INFOCOM'10 Mini-Conference, pp. 1-5, San Diego, CA, USA, March 2010.
[CrossRef] [SCOPUS Times Cited 440]


[11] C. Wang, N. Cao, J. Li, K. Ren and W. Lou, "Secure Ranked Keyword Search over Encrypted Cloud Data", in Proc. ICDCS'10, pp.253-362, 2010.
[CrossRef] [SCOPUS Times Cited 365]


[12] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou. "Privacy-preserving Multi-keyword Ranked Search over Encrypted Cloud Data", in Proc IEEE INFOCOM'11, pp.222-233, 2011.
[CrossRef] [SCOPUS Times Cited 315]


[13] Sun, W. et al. "Verifiable Privacy-Preserving Multi-keyword Text Search in the Cloud Supporting Similarity-based Ranking." IEEE Trans. on Parallel and Distributed Systems, in Press, 2013.
[CrossRef] [Web of Science Times Cited 34] [SCOPUS Times Cited 58]


[14] H. Pang, J. Shen, and R. Krishnan, "Privacy-Preserving Similarity-Based Text Retrieval", ACM Transactions on Internet Technology, vol. 10, no. 1, article #4, Feb. 2010.
[CrossRef] [Web of Science Times Cited 15] [SCOPUS Times Cited 33]


[15] S. T. Dumais, "Latent Semantic Indexing (LSI) and TREC-2", In Second Text REtrieval Conference (TREC2), D. Harman, ed., pp. 105-115, March 1994.

[16] T. K. Landauer, D. S. McNamara, S. Dennis, and W. Kintsch, "Handbook of Latent Semantic Analysis," 1st edition, ISBN-13: 978-0805854183, pp. 293-322, Psychology Press, 2007.

[17] M. Bellare, A. Boldyreva, L. Knudsen, and C. Namprempre, "Online ciphers and the hash-CBC construction", Proc. Advances in Cryptology - CRYPTO, 2001, pp.292-309, 2001.
[CrossRef]


[18] A. Boldyreva, N. Chenette, Y. Lee, and A. O’Neill, "Order Preserving Symmetric Encryption", Proc. Advances in Cryptology - EUROCRYPT’09, pp. 224-241, 2009.
[CrossRef] [SCOPUS Times Cited 299]


[19] M. Bellare, "Practice-oriented provable-security", in Proc. Information Security. Springer Berlin Heidelberg, pp. 221-231, 1998.
[CrossRef]


[20] W. Wong, D. W. Cheung, B. Kai, and N. Mamouolis, "Secure kNN computation on encrypted databases", Proc. ACM SIGMOD’09, pp. 139-152, 2009.
[CrossRef] [SCOPUS Times Cited 292]




References Weight

Web of Science® Citations for all references: 161 TCR
SCOPUS® Citations for all references: 3,353 TCR

Web of Science® Average Citations per reference: 8 ACR
SCOPUS® Average Citations per reference: 160 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2018-06-23 08:42 in 124 seconds.




Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2018
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania


All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.




Website loading speed and performance optimization powered by: