21,934 Hits in 7.0 sec

Output Privacy Protection With Pattern-Based Heuristic Algorithm

P.Cynthia Selvi, A.R.Mohammed Shanavas
2014 International Journal of Computer Science & Information Technology (IJCSIT)  
been adopted for PPDM, of them the rule hiding approach is used in this article.  ...  with an arbitrarily low support threshold.  ...  The proposed algorithm has other promising features which are listed below: -no hiding failure -very low misses cost -no false drops -minimum sanitization rate -very low proportion of dissimilarity between  ... 
doi:10.5121/ijcsit.2014.6210 fatcat:pfanchpzmbgufgbcetgjbevsfu

Hiding the Access Pattern is Not Enough: Exploiting Search Pattern Leakage in Searchable Encryption [article]

Simon Oya, Florian Kerschbaum
2020 arXiv   pre-print
These schemes focus on hiding the access pattern, which refers to the set of documents that match the client's queries.  ...  We propose an attack that leverages both access and search pattern leakage, as well as some background and query distribution information, to recover the keywords of the queries performed by the client  ...  This work benefited from the use of the CrySP RIPPLE Facility at the University of Waterloo. Availability Our code is available at USENIX21-sap-code.  ... 
arXiv:2010.03465v1 fatcat:gf4bhzthhjblzgwfvbkmsgbmfe

Concealing Sequential and Spatiotemporal patterns using Polynomial Sanitization

A. Vijay, M H M Krishna Prasad
2013 International Journal of Computer Applications  
The concept of NP hardness is observed over the sequential pattern hiding.  ...  Over the time, various approaches for hiding knowledge have emerged, mainly in the focus of Association rules and frequent item sets mining.  ...  Fig.3 Procedural representation of hiding using DBSH Here the patterns of the dataset is taken for process which finds match with the input sensitive sequences and there by yield the cost in terms of  ... 
doi:10.5120/11603-6970 fatcat:joyl7eknkrbabefde7urxmkdbu

Secure and Privacy Preserving Outsourcing of Tree Structured Data [chapter]

Ping Lin, K. Selçuk Candan
2004 Lecture Notes in Computer Science  
With the increasing use of web services, many new challenges concerning data security are becoming critical.  ...  Data or applications can now be outsourced to powerful remote servers, which are able to provide services on behalf of the owners. Unfortunately, such hosts may not always be trustworthy.  ...  Since the whole database should be read into the secure processor to hide the query from the server, cost linear in the database size is still incurred at the server side.  ... 
doi:10.1007/978-3-540-30073-1_1 fatcat:bcsrchlshngozolbg6lcbtdwkm

Holistic Query Transformations for Dynamic Web Applications

Amit Manjhi, Charles Garrod, Bruce M. Maggs, Todd C. Mowry, Anthony Tomasic
2009 Proceedings / International Conference on Data Engineering  
As examples of our concept, we propose and evaluate two source-to-source holistic transformations that focus on hiding the latencies of database queries.  ...  This approach, unfortunately, can introduce latency between the application and database servers, which in turn increases the network latency of Web interactions for the clients (end users).  ...  To decide whether to apply this transformation in such "speculative" situations or not, we use estimates of the relative costs of evaluating the query result and the frequencies with which the different  ... 
doi:10.1109/icde.2009.194 dblp:conf/icde/ManjhiGMMT09 fatcat:rrc4pxhbsfevxp6cymql4tqvci

Knowledge Representation as Linked Data

Joachim Van Herwegen, Pieter Heyvaert, Ruben Taelman, Ben De Meester, Anastasia Dimou
2018 Proceedings of the 27th ACM International Conference on Information and Knowledge Management - CIKM '18  
We also show how to easily publish Linked Data on the Web as Triple Pattern Fragments.  ...  The process of extracting, structuring, and organizing knowledge requires processing large and originally heterogeneous data sources.  ...  The approach consists of a low-cost server interface that accepts triple pattern queries, while clients evaluate more complex SPARQL queries.  ... 
doi:10.1145/3269206.3274275 dblp:conf/cikm/HerwegenHTMD18 fatcat:ayadmyvujjan5i2t6puq2s4qjm

Privacy-preserving ranked multi-keyword search leveraging polynomial function in cloud computing

Yanzhi Ren, Yingying Chen, Jie Yang, Bin Xie
2014 2014 IEEE Global Communications Conference  
Specifically, we first propose a basic scheme using polynomial function to hide the encrypted keyword and search patterns for efficient multi-keyword ranked search.  ...  We analyze the privacy guarantee of our proposed scheme and conduct extensive experiments based on the real-world dataset.  ...  Query Finally, we evaluate the effectiveness of our search scheme in terms of the time cost on query.  ... 
doi:10.1109/glocom.2014.7036872 dblp:conf/globecom/RenC0X14 fatcat:hiu5t77lgbhl7pbzyutqrz6wwi

Building castles out of mud

Peter Williams, Radu Sion, Bogdan Carbunar
2008 Proceedings of the 15th ACM conference on Computer and communications security - CCS '08  
We built a first practical system -orders of magnitude faster than existing implementations -that can execute over several queries per second on 1Tbyte+ databases with full computational privacy and correctness  ...  We introduce a new practical mechanism for remote data storage with efficient access pattern privacy and correctness.  ...  The authors also wish to thank Motorola Labs, IBM Research, the IBM Software Cryptography Group, CEWIT, and the Stony Brook Office of the Vice President for Research.  ... 
doi:10.1145/1455770.1455790 dblp:conf/ccs/WilliamsSC08 fatcat:57quqjkmwraohoh3akueil32ae

Privacy-Preserving Approximate k-Nearest-Neighbors Search that Hides Access, Query and Volume Patterns

Alexandra Boldyreva, Tianxin Tang
2021 Proceedings on Privacy Enhancing Technologies  
The construction provides very strong security guarantees, not only hiding the information about the data, but also the access, query, and volume patterns.  ...  We study the problem of privacy-preserving approximate kNN search in an outsourced environment — the client sends the encrypted data to an untrusted server and later can perform secure approximate kNN  ...  Due to Lemma D.2, we only need to focus on the situation where 1 ≤ X < size r . We prove the lemma using the property of the eLSH instances.  ... 
doi:10.2478/popets-2021-0084 fatcat:fvvd57dazjdhrfuouf7bfjnrea

Hiding in the Mobile Crowd: LocationPrivacy through Collaboration

2014 IEEE Transactions on Dependable and Secure Computing  
The results show that our scheme hides a high fraction of location-based queries, thus significantly enhancing users' location privacy.  ...  Used in the Bayesian inference framework, this model helps analyze the effects of various parameters, such as the users' querying rate and the lifetime of context information, on users' location privacy  ...  Moreover, the hiding probability of each query for long lifetimes and low request rate values (i.e., long intervals between requests) appears to be more or less the same as the hiding probability for short  ... 
doi:10.1109/tdsc.2013.57 fatcat:mnfiqibf5jdejihzbnasa7yvcy

Privacy-Preserving Ranked Search on Public-Key Encrypted Data

Sahin Buyrukbilen, Spiridon Bakiras
2013 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing  
These protocols allow users to upload encrypted versions of their documents to the cloud, while retaining the ability to query the database with traditional plaintext keyword queries.  ...  Using measurements from Amazon's Elastic Compute Cloud, we show that our method provides reasonable response times with low communication cost.  ...  ACKNOWLEDGMENTS This research has been funded by the NSF CAREER Award IIS-0845262.  ... 
doi:10.1109/hpcc.and.euc.2013.33 dblp:conf/hpcc/BuyrukbilenB13 fatcat:wp3v4fykvneunjg5ga2to6odru

A pattern language for developing privacy enhancing technologies

Munawar Hafiz
2011 Software, Practice & Experience  
This paper describes the first pattern language for developing privacy enhancement technologies. Currently, it contains 12 patterns.  ...  A Privacy Enhancement Technology (PET) is an application or a mechanism which allows users to protect the privacy of their personally identifiable information.  ...  The main overhead of layered encryption is the path setup cost.  ... 
doi:10.1002/spe.1131 fatcat:n3h4bq4yjvfxrj5rs7mlcwgyia

Resource Efficient Privacy Preservation of Online Social Media Conversations [chapter]

Indrajeet Singh, Masoud Akhoondi, Mustafa Y. Arslan, Harsha V. Madhyastha, Srikanth V. Krishnamurthy
2015 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
In this paper, we present Hermes, a decentralized OSN architecture, designed explicitly with the goal of hiding sharing patterns while minimizing users' costs.  ...  Though there are proposals for decentralized OSNs to protect user privacy, they have paid scant attention to optimizing the cost borne by users or hiding their sharing patterns.  ...  Given this, to reduce the costs incurred to guarantee anonymity (hiding user sharing patterns), we partition any conversation into two phases.  ... 
doi:10.1007/978-3-319-28865-9_13 fatcat:y5ckavzncbegjivgubjgio7yvu

Efficient and secure outsourcing of genomic data storage

João Sá Sousa, Cédric Lefebvre, Zhicong Huang, Jean Louis Raisaro, Carlos Aguilar-Melchor, Marc-Olivier Killijian, Jean-Pierre Hubaux
2017 BMC Medical Genomics  
Cloud computing is becoming the preferred solution for efficiently dealing with the increasing amount of genomic data.  ...  Results: Results show that our solution outperforms the state-of-the-art solutions and enables researchers to search over millions of encrypted variants in a few seconds.  ...  Acknowledgements We would like to thank all of those who externally reviewed the manuscript or somehow participated in the development of this solution, in particular: Juan Troncoso-Pastoriza, David Froelicher  ... 
doi:10.1186/s12920-017-0275-0 pmid:28786363 pmcid:PMC5547444 fatcat:yfczyorcq5g6vdxmnjfnwu4xom

Efficient and secure ranked multi-keyword search on encrypted cloud data

Cengiz Örencik, Erkay Savaş
2012 Proceedings of the 2012 Joint EDBT/ICDT Workshops on - EDBT-ICDT '12  
A related protocol, Private Information Retrieval (PIR), provides useful cryptographic tools to hide the queried search terms and the data retrieved from the database while returning most relevant documents  ...  To the best of our knowledge the majority of previous works are not efficient for assumed scenario where documents are large files.  ...  The proposed scheme fails to hide the search pattern since the search indices are generated in a deterministic way.  ... 
doi:10.1145/2320765.2320820 dblp:conf/edbt/OrencikS12 fatcat:yk5jbo2plvgstbclirvjrhp7x4
« Previous Showing results 1 — 15 out of 21,934 results