scholarly journals Privacy-aware character pattern matching over outsourced encrypted data

2021 ◽  
Author(s):  
Nicholas Mainardi ◽  
Alessandro Barenghi ◽  
Gerardo Pelosi
Keyword(s):  
Data Transfer ◽  
Computational Effort ◽  
Pattern Search ◽  
Search Pattern ◽  
Genomic Dataset ◽  
Encrypted Data ◽  
Server Side ◽  
Document Collection ◽  
Baseline Solution ◽  
Application Requirements

Providing a method to efficiently search into outsourced encrypted data, without forsaking strong privacy guarantees, is a pressing concern rising from the separation of data ownership and data management typical of cloud-based applications. While several existing solutions allow a client to look-up the occurrences of a substring in an outsourced document collection, the practical application requirements in terms of privacy and efficiency call for the improvement of such solutions. In this work, we present a privacy-preserving substring search protocol with a polylogarithmic communication cost and a limited computational effort on the server side. The proposed protocol provides search pattern and access pattern privacy, for both exact string search, and character-pattern search with wildcards. Its extension to a multi-user setting shows significant savings in terms of outsourced storage w.r.t. a baseline solution where the whole dataset is replicated. The performance figures of an optimized implementation of our protocol, searching into a remotely stored genomic dataset, validate the practicality of the approach exhibiting a data transfer of less than 50 kiB to execute a query over a document of 40 MiB, with execution times on client and server in the range of a few seconds and a few minutes, respectively.

scholarly journals A Computational Modeling for Knowledge Binding of the Unstructured Web Data

2019 ◽  
Vol 9 (2S) ◽  
pp. 418-424
Keyword(s):  
Theoretical Analysis ◽  
Computational Modeling ◽  
Computational Effort ◽  
Significant Extent ◽  
Web Data ◽  
Web Based ◽  
Matching Algorithm ◽  
Computational Performance ◽  
Application Requirements ◽  
Unstructured Information

The focus of this manuscript is laid towards extracting insightful data embedded into web-based information which is crucial for various academic and commercialized application requirements. The study thereby introduces a robust computational modeling by means of computing knowledge from collaborative web-based unstructured information. For this purpose, this design is simplified with Fuzzy based matching algorithm and also with a set of procedures which reduces the computational effort to a significant extent. The numerical theoretical analysis shows that the effectiveness of the formulated model. It also shows that the formulated concept outperforms the baseline modeling by almost 50% when computational performance is concerned.

scholarly journals Building a Reliable Wireless Medical Device Network

2018 ◽  
pp. 42-49 ◽  
Author(s):  
David Hoglund ◽  
Vince Varga
Keyword(s):  
Best Practices ◽  
Product Design ◽  
Real Time ◽  
Medical Device ◽  
Medical Devices ◽  
Data Transfer ◽  
Wireless Network Design ◽  
Wireless Medium ◽  
Time Basis ◽  
Application Requirements

How to design and test the most effective and secure wireless medical device connectivity applications that will provide the true mobility experience that is needed in the 2018 healthcare marketplace. Today’s medical devices will need to be connected to provide the data to the electronic medical record. This connectivity will be either real time or on a non real time basis. In either case; the majority of this data transfer will move toward a wireless medium from a legacy wired connection. The following will discuss best practices for wireless network design based upon application requirements; but also the protection of any data regarding cybersecurity requirements. The author has over three decades of medical device knowledge sense but also two decades of wireless and security integration knowledge sense. The take away is to understand the best practices and how to apply this to product design and the overall enterprise implementation into the healthcare ecosystem of connected devices.

scholarly journals Storage and Communication Security in Cloud Computing Using a Homomorphic Encryption Scheme Based Weil Pairing

2020 ◽  
Vol 26 (1) ◽  
pp. 78-83
Author(s):  
Demet Cidem Dogan ◽  
Huseyin Altindis
Keyword(s):  
Cloud Computing ◽  
Elliptic Curve ◽  
Data Transfer ◽  
Homomorphic Encryption ◽  
Discrete Logarithm ◽  
Original Data ◽  
Bilinear Pairing ◽  
Encryption Scheme ◽  
Weil Pairing ◽  
Encrypted Data

With introduction of smart things into our lives, cloud computing is used in many different areas and changes the communication method. However, cloud computing should guarantee the complete security assurance in terms of privacy protection, confidentiality, and integrity. In this paper, a Homomorphic Encryption Scheme based on Elliptic Curve Cryptography (HES-ECC) is proposed for secure data transfer and storage. The scheme stores the data in the cloud after encrypting them. While calculations, such as addition or multiplication, are applied to encrypted data on cloud, these calculations are transmitted to the original data without any decryption process. Thus, the cloud server has only ability of accessing the encrypted data for performing the required computations and for fulfilling requested actions by the user. Hence, storage and transmission security of data are ensured. The proposed public key HES-ECC is designed using modified Weil-pairing for encryption and additional homomorphic property. HES-ECC also uses bilinear pairing for multiplicative homomorphic property. Security of encryption scheme and its homomorphic aspects are based on the hardness of Elliptic Curve Discrete Logarithm Problem (ECDLP), Weil Diffie-Hellman Problem (WDHP), and Bilinear Diffie-Helman Problem (BDHP).

Distributed Searchable Asymmetric Encryption

2016 ◽  
Vol 4 (3) ◽  
pp. 684
Author(s):  
Shoulin Yin ◽  
Lin Teng ◽  
Jie Liu
Keyword(s):  
Keyword Search ◽  
The Other ◽  
Public Key ◽  
Search Pattern ◽  
Public Key Encryption ◽  
Information Protection ◽  
Encrypted Data ◽  
Private Key ◽  
Asymmetric Encryption ◽  
Encryption Decryption

<p><em>Searchable asymmetric encryption (SAE) can also be called Public Key Encryption with Keyword Search (PEKS), which allows us to search the keyword on the data of having been encrypted. The essence of Asymmetric searchable encryption is that users exchange the data of encryption, one party sends a ciphertext with key encryption, the other party with another key receives the ciphertext. Encryption key is not the same as the decryption key, and cannot deduce another key from any one of the key, thus it greatly enhances the information protection, and can prevent leakage the user's search criteria<span style="font-family: 宋体;">—</span><span style="font-family: 'Times New Roman';">Search Pattern. Secure schemes of SAE are practical, sometimes, however the speed of encryption/decryption in Public-key encryption is slower than private key. In order to get higher efficiency and security in information retrieval, in this paper we introduce the concept of distributed SAE, which is useful for security and can enable search operations on encrypted data. Moreover, we give the proof of security.</span></em><em></em></p>

A Novel Approach for Encrypted Data-Deduplication in Clouds

2020 ◽  
Vol 17 (8) ◽  
pp. 3631-3635
Author(s):  
L. Mary Gladence ◽  
Priyanka Reddy ◽  
Apoorva Shetty ◽  
E. Brumancia ◽  
Senduru Srinivasulu
Keyword(s):  
Data Transfer ◽  
Distributed Storage ◽  
Security Analysis ◽  
Test Plot ◽  
Security Model ◽  
Proof Of Concept ◽  
Data Deduplication ◽  
Encrypted Data ◽  
Novel Approach ◽  
Encryption Method

Data deduplication is one of the main techniques for copying recovery data duplicates and was widely used in distributed storage to minimize extra space and spare data transfer capacity. It was proposed that the simultaneous encryption method encode the data before re-appropriating to preserve the confidentiality of delicate data while facilitating de replication. Unlike conventional de duplication systems, consumers are therefore viewed as having differential advantages as indupli-cate tests other than the data itself. Security analysis shows that our approach is safe in terms of the values set out in the proposed security model. For this deduplication M3 encryption algorithm and DES algorithm are used. M3 encryption is to compare another with the latest technology, for more effective, security purposes, fast actions and. The second DES encryption that was used to open the file and decrypt understandable language for humans in a secure language. A model of our current accepted copy check program is revised as proof of concept by the current research and explicitly shows the tests using our model. The proposed research shows that when opposed to conventional operations, our proposed duplicate test plot creates marginal overhead.

TOWARD AN OPTIMAL BLOCK MOTION ESTIMATION ALGORITHM FOR H.264/AVC

2007 ◽  
Vol 07 (02) ◽  
pp. 303-320
Author(s):  
MOHAMED ALI BEN AYED ◽  
AMINE SAMET ◽  
NOURI MASMOUDI
Keyword(s):  
Computational Complexity ◽  
Motion Estimation ◽  
Computational Cost ◽  
Block Size ◽  
Estimation Algorithm ◽  
Computational Effort ◽  
Point Of View ◽  
Block Matching ◽  
Search Pattern ◽  
Computational Bottleneck

A merging procedure joining search pattern and variable block size motion estimation for H.264/AVC is proposed in this paper. The principal purpose of the proposed methods is the reduction of the computational complexity for block matching module. In fact, there are numerous contributions in the literature aiming the reduction of the computational cost needed for motion estimation. The best solution from a qualitative point of view is the full search that considers every possible detail. The computational effort required is enormous and this makes motion estimation by far the most important computational bottleneck in video coding systems. Our approach invests and exploits the center-biased characteristics of the real world video sequences, aiming to achieve an acceptable image quality while independently targeting the reduction of the computational complexity. The simulations results demonstrated that the proposal performs well.

scholarly journals A Blockchain Framework for Patient-Centered Health Records and Exchange (HealthChain): Evaluation and Proof-of-Concept Study (Preprint)

2019 ◽  
Author(s):  
Ray Hales Hylock ◽  
Xiaoming Zeng
Keyword(s):  
Medical Records ◽  
Cumulative Record ◽  
Data Access ◽  
Patient Data ◽  
Mixed Block ◽  
Smart Contracts ◽  
Proof Of Concept ◽  
Patient Centered ◽  
Encrypted Data ◽  
Server Side

BACKGROUND Blockchain has the potential to disrupt the current modes of patient data access, accumulation, contribution, exchange, and control. Using interoperability standards, smart contracts, and cryptographic identities, patients can securely exchange data with providers and regulate access. The resulting comprehensive, longitudinal medical records can significantly improve the cost and quality of patient care for individuals and populations alike. OBJECTIVE This work presents HealthChain, a novel patient-centered blockchain framework. The intent is to bolster patient engagement, data curation, and regulated dissemination of accumulated information in a secure, interoperable environment. A mixed-block blockchain is proposed to support immutable logging and redactable patient blocks. Patient data are generated and exchanged through Health Level-7 Fast Healthcare Interoperability Resources, allowing seamless transfer with compliant systems. In addition, patients receive cryptographic identities in the form of public and private key pairs. Public keys are stored in the blockchain and are suitable for securing and verifying transactions. Furthermore, the envisaged system uses proxy re-encryption (PRE) to share information through revocable, smart contracts, ensuring the preservation of privacy and confidentiality. Finally, several PRE improvements are offered to enhance performance and security. METHODS The framework was formulated to address key barriers to blockchain adoption in health care, namely, information security, interoperability, data integrity, identity validation, and scalability. It supports 16 configurations through the manipulation of 4 modes. An open-source, proof-of-concept tool was developed to evaluate the performance of the novel patient block components and system configurations. To demonstrate the utility of the proposed framework and evaluate resource consumption, extensive testing was performed on each of the 16 configurations over a variety of scenarios involving a variable number of existing and imported records. RESULTS The results indicate several clear high-performing, low-bandwidth configurations, although they are not the strongest cryptographically. Of the strongest models, one’s anticipated cumulative record size is shown to influence the selection. Although the most efficient algorithm is ultimately user specific, Advanced Encryption Standard–encrypted data with static keys, incremental server storage, and no additional server-side encryption are the fastest and least bandwidth intensive, whereas proxy re-encrypted data with dynamic keys, incremental server storage, and additional server-side encryption are the best performing of the strongest configurations. CONCLUSIONS Blockchain is a potent and viable technology for patient-centered access to and exchange of health information. By integrating a structured, interoperable design with patient-accumulated and generated data shared through smart contracts into a universally accessible blockchain, HealthChain presents patients and providers with access to consistent and comprehensive medical records. Challenges addressed include data security, interoperability, block storage, and patient-administered data access, with several configurations emerging for further consideration regarding speed and security.

scholarly journals The Impact COVID-19 Pandemic on Productivity of Tax Return Document Processing in the New Normal Era at Tax Data and Document Processing Center

2020 ◽  
Vol 10 (2) ◽  
pp. 474
Author(s):  
Pri Budiarti Rini Sejati
Keyword(s):  
Data Transfer ◽  
Organizational Management ◽  
Scientific Article ◽  
Document Processing ◽  
New Normal ◽  
New Era ◽  
Work From Home ◽  
Before And After ◽  
Document Collection ◽  
The Impact

This study aims to determine the impact of the Covid-19 Pandemic on the productivity of  documents in the New Normal Era at PPDDP. This type of research is a descriptive study, with a research focused by analyzing the production of Tax Return document processing before and after the Covid-19 pandemic. The Purpose of this scientific article is to provide a new view to the State Civil Service (SCS) that the normal era is a pushing factor or triger for future organizational management innovation.The method used in this study is a qualitative approach. Data collection was carried out through direct interviews with employees in the Taxation Data and Document Processing Center. The key informants in this study were employees of the Document Collection and Receiving Section and the Recording and Data Transfer Section. This study shows that there were changes in behavior and habits at work such as lessening work days due to the Work From Office and Work From Home policies leading to a significant decrease in the productivity of Tax Return document processing. The higher number of employees and work days (as well as work hours/day) in office the higher number of processed Tax Return documents. The number of Tax Return documents processing in the new era is normal has significant decreased due to limited human resources available in office and  decreasing work days.   

The Efficiency of Different Search Patterns in Electronic Market

2010 ◽  
pp. 55-73
Author(s):  
Theresa Lauraeus-Niinivaara ◽  
Timo Saarinen ◽  
Anne Sunikka ◽  
Anssi Öörni
Keyword(s):  
Information Search ◽  
High Efficiency ◽  
Search Costs ◽  
Pattern Search ◽  
Consumer Information ◽  
Search Pattern ◽  
Electronic Market ◽  
Iterative Search ◽  
Factors Affecting ◽  
Search Patterns

Electronic markets are expected to facilitate consumer information search and product comparison to the extent that consumers are able to accumulate nearly perfect information. The authors present an analysis of search patterns based on a laboratory experiment on product search processes. They identified three types of search patterns in the experiment: sequential, agent search, and iterative search. They studied the factors affecting the choice and the outcome of agent search pattern compared to the other search patterns. The results show that the employed search pattern has an impact on search cost and the efficiency of search measured with purchase price and the time used for searching. Agent search seems to combine low search costs with high efficiency. Sequential search still emerged as the dominant search pattern even though it leads to the most expensive purchase. Iterative search pattern search pattern.

Sign in / Sign up

Export Citation Format

Share Document