An Efficient User Privacy and Protecting Location Content in Location Based S...IJRST Journal
In location-based query a user wants to query a database of location data, known as Points Of Interest (POIs), and does not want to reveal his/her location to the server due to privacy concerns; (ii) the owner of the location data, that is, the location server, do Abstract: Nowadays, it is very easy for a person to learn his/her location with the help of a Global Positioning System (GPS) enabled device. A location s not want to simply distribute its data to all users. The location server desires to have some control over its data, since the data is its asset. A major enhancement upon previous solutions by introducing a two stage approach, the first step is based on Oblivious Transfer using homomorphic encryption and the second step is based on Private Information Retrieval, to achieve a secure solution for both parties. Introduce a security model and analyse the security in the context of our protocol. To highlight a security weakness of our previous work and present a solution using efficient homomorphic system.
Research trends review on RSA scheme of asymmetric cryptography techniquesjournalBEEI
One of the cryptography classifications is asymmetric cryptography, which uses two different keys to encrypt and decrypt the message. This paper discusses a review of RSA scheme of asymmetric cryptography techniques. It is trying to present the domains of RSA scheme used including in public network, wireless sensor network, image encryption, cloud computing, proxy signature, Internet of Things and embedded device, based on the perspective of researchers’ effort in the last decade. Other than that, this paper reviewed the trends and the performance metrics of RSA scheme such as security, speed, efficiency, computational complexity and space based on the number of researches done. Finally, the technique and strengths of the proposed scheme are also stated in this paper.
In today’s network-based cloud computing era, software applications are playing big role. The security of these software applications is paramount to the successful use of these applications. These applications utilize cryptographic algorithms to secure the data over the network through encryption and decryption
processes. The use of parallel processors is now common in both mobile and cloud computing scenarios.
Cryptographic algorithms are compute intensive and can significantly benefit from parallelism. This paper
introduces a parallel approach to symmetric stream cipher security algorithm known as RC4A, which is
one of the strong variants of RC4. We present an efficient parallel implementation to the compute intensive
PRGA that is pseudo-random generation algorithm portion of the RC4A algorithm and the resulted
algorithm will be named as PARC4-I. We have added some functionality in terms of lookup tables.
Modified algorithm is having four lookup tables instead of two and is capable of returning four distinct
output bytes at each iteration. Further, with the help of Parallel Additive Stream Cipher Structure and loop
unrolling method, encryption/decryption is being done on multi core machine. Finally, the results shows
that PARC4-I is a time efficient algorithm.
File transfer with multiple security mechanismShubham Patil
The system enhances the security and the data confidentiality between the users and receiver by the two-layer encryption mechanism and the QR code for verification. The system consists of three main components which are very important to providing the security between sender and receiver while transmitting the data
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A novel authenticated cipher for rfid systemsijcisjournal
In this paper, we present RBS (Redundant Bit Security) algorithm which is a low-complexity symmetric
encryption with a 132-bit secret key. In this algorithm redundant bits are distributed among plaintext data
bits to change the location of the plaintext bits in the transmitted data without changing their order. The
location of redundant bits inside the transmitted data represents the secret key between sender and
receiver. The algorithm provides integrity and authentication of the original data as well. The
implementation comparison of this algorithm with other algorithms confirms that it a good candidate for
resource-constraint devices such as RFID systems and wireless sensors.
An Efficient User Privacy and Protecting Location Content in Location Based S...IJRST Journal
In location-based query a user wants to query a database of location data, known as Points Of Interest (POIs), and does not want to reveal his/her location to the server due to privacy concerns; (ii) the owner of the location data, that is, the location server, do Abstract: Nowadays, it is very easy for a person to learn his/her location with the help of a Global Positioning System (GPS) enabled device. A location s not want to simply distribute its data to all users. The location server desires to have some control over its data, since the data is its asset. A major enhancement upon previous solutions by introducing a two stage approach, the first step is based on Oblivious Transfer using homomorphic encryption and the second step is based on Private Information Retrieval, to achieve a secure solution for both parties. Introduce a security model and analyse the security in the context of our protocol. To highlight a security weakness of our previous work and present a solution using efficient homomorphic system.
Research trends review on RSA scheme of asymmetric cryptography techniquesjournalBEEI
One of the cryptography classifications is asymmetric cryptography, which uses two different keys to encrypt and decrypt the message. This paper discusses a review of RSA scheme of asymmetric cryptography techniques. It is trying to present the domains of RSA scheme used including in public network, wireless sensor network, image encryption, cloud computing, proxy signature, Internet of Things and embedded device, based on the perspective of researchers’ effort in the last decade. Other than that, this paper reviewed the trends and the performance metrics of RSA scheme such as security, speed, efficiency, computational complexity and space based on the number of researches done. Finally, the technique and strengths of the proposed scheme are also stated in this paper.
In today’s network-based cloud computing era, software applications are playing big role. The security of these software applications is paramount to the successful use of these applications. These applications utilize cryptographic algorithms to secure the data over the network through encryption and decryption
processes. The use of parallel processors is now common in both mobile and cloud computing scenarios.
Cryptographic algorithms are compute intensive and can significantly benefit from parallelism. This paper
introduces a parallel approach to symmetric stream cipher security algorithm known as RC4A, which is
one of the strong variants of RC4. We present an efficient parallel implementation to the compute intensive
PRGA that is pseudo-random generation algorithm portion of the RC4A algorithm and the resulted
algorithm will be named as PARC4-I. We have added some functionality in terms of lookup tables.
Modified algorithm is having four lookup tables instead of two and is capable of returning four distinct
output bytes at each iteration. Further, with the help of Parallel Additive Stream Cipher Structure and loop
unrolling method, encryption/decryption is being done on multi core machine. Finally, the results shows
that PARC4-I is a time efficient algorithm.
File transfer with multiple security mechanismShubham Patil
The system enhances the security and the data confidentiality between the users and receiver by the two-layer encryption mechanism and the QR code for verification. The system consists of three main components which are very important to providing the security between sender and receiver while transmitting the data
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A novel authenticated cipher for rfid systemsijcisjournal
In this paper, we present RBS (Redundant Bit Security) algorithm which is a low-complexity symmetric
encryption with a 132-bit secret key. In this algorithm redundant bits are distributed among plaintext data
bits to change the location of the plaintext bits in the transmitted data without changing their order. The
location of redundant bits inside the transmitted data represents the secret key between sender and
receiver. The algorithm provides integrity and authentication of the original data as well. The
implementation comparison of this algorithm with other algorithms confirms that it a good candidate for
resource-constraint devices such as RFID systems and wireless sensors.
Efficient two-stage cryptography scheme for secure distributed data storage i...IJECEIAES
Cloud computing environment requires secure access for data from the cloud server, small execution time, and low time complexity. Existing traditional cryptography algorithms are not suitable for cloud storage. In this paper, an efficient two-stage cryptography scheme is proposed to access and store data into cloud safely. It comprises both user authentication and encryption processes. First, a two-factor authentication scheme one-time password is proposed. It overcomes the weaknesses in the existing authentication schemes. The proposed authentication method does not require specific extra hardware or additional processing time to identity the user. Second, the plaintext is divided into two parts which are encrypted separately using a unique key for each. This division increases the security of the proposed scheme and in addition decreases the encryption time. The keys are generated using logistic chaos model theory. Chaos equation generates different values of keys which are very sensitive to initial condition and control parameter values entered by the user. This scheme achieves high-security level by introducing different security processes with different stages. The simulation results demonstrate that the proposed scheme reduces the size of the ciphertext and both encryption and decryption times than competing schemes without adding any complexity.
In many of today’s computer application needs, faster operation is essential to the efficient implementation
of information security algorithm. RC4 has been used as the data encryption algorithm for many
applications and protocols including the Wi-Fi, Skype, and Bit Torrent to name a few. Several efficient
approaches to the implementation of RC4 have been proposed and we review some of those. More recently
some parallel approaches to faster implementation of RC4 have been presented and we include those in our
survey of efficient approaches to RC4. This paper presents an analysis of available hardware/software
parallel implementations of RC4 symmetric key-based algorithm and some security approaches which
make it more secure.
Improving Efficiency of Security in Multi-CloudIJTET Journal
Abstract--Due to risk in service availability failure and the possibilities of malicious insiders in the single cloud, a movement towards “Multi-clouds” has emerged recently. In general a multi-cloud security system there is a possibility for third party to access the user files. Ensuring security in this stage has become tedious since, most of the activities are done in network. In this paper, an enhanced security methodology has been introduced in order to make the data stored in cloud more secure. Duple authentication process introduced in this concept defends malicious insiders and shields the private data. Various disadvantages in traditional systems like unauthorized access, hacking have been overcome in this proposed system and a comparison made with the traditional systems in terms of performance and computational time have shown better results.
NEW ALGORITHM FOR WIRELESS NETWORK COMMUNICATION SECURITYijcisjournal
This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid
algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations
A Survey on DPI Techniques for Regular Expression Detection in Network Intrus...ijsrd.com
Deep Packet Inspection (DPI) is becoming more widely used in virtually all applications or services like Intrusion Detection System (IDS), which operate with or within a network. DPI analyzes all data present in the packet as it passes an inspection to determine the application transported and protocol. Deep packet inspection typically uses regular expression matching as a core operator. Regular expressions (RegExes) are used to flexibly represent complex string patterns in many applications ranging from network intrusion detection and prevention systems (NIDPSs). Regular expressions represent complex string pattern as attack signatures in DPI. It examine whether a packet’s payload matches any of a set of predefined regular expressions. There are various techniques developed in DPI for deep packet inspection for regular expression. We survey on these techniques for further improvement in regular expression detection in this paper. In the result we found that it is possible to reduce RegEx transaction memory required in network intrusion detection. We made this survey with possible use of DPI techniques in the wireless network.
A Modified Technique For Performing Data Encryption & Data DecryptionIJERA Editor
In this age of universal electronic connectivity of viruses and hackers of electronic eavesdropping and electronic fraud, there is indeed needed to store the information securely. This, in turn, led to a heightened awareness to protect data and resources from disclosure, to guarantee the authenticity of data and messages and to protect systems from network-based attacks. Information security via encryption decryption techniques is a very popular research area for many people’s over the years. This paper elaborates the basic concept of the cryptography, specially public and private cryptography. It also contains a review of some popular encryption decryption algorithms. A modified method is also proposed. This method is fast in comparison to the existing methods.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Efficient two-stage cryptography scheme for secure distributed data storage i...IJECEIAES
Cloud computing environment requires secure access for data from the cloud server, small execution time, and low time complexity. Existing traditional cryptography algorithms are not suitable for cloud storage. In this paper, an efficient two-stage cryptography scheme is proposed to access and store data into cloud safely. It comprises both user authentication and encryption processes. First, a two-factor authentication scheme one-time password is proposed. It overcomes the weaknesses in the existing authentication schemes. The proposed authentication method does not require specific extra hardware or additional processing time to identity the user. Second, the plaintext is divided into two parts which are encrypted separately using a unique key for each. This division increases the security of the proposed scheme and in addition decreases the encryption time. The keys are generated using logistic chaos model theory. Chaos equation generates different values of keys which are very sensitive to initial condition and control parameter values entered by the user. This scheme achieves high-security level by introducing different security processes with different stages. The simulation results demonstrate that the proposed scheme reduces the size of the ciphertext and both encryption and decryption times than competing schemes without adding any complexity.
In many of today’s computer application needs, faster operation is essential to the efficient implementation
of information security algorithm. RC4 has been used as the data encryption algorithm for many
applications and protocols including the Wi-Fi, Skype, and Bit Torrent to name a few. Several efficient
approaches to the implementation of RC4 have been proposed and we review some of those. More recently
some parallel approaches to faster implementation of RC4 have been presented and we include those in our
survey of efficient approaches to RC4. This paper presents an analysis of available hardware/software
parallel implementations of RC4 symmetric key-based algorithm and some security approaches which
make it more secure.
Improving Efficiency of Security in Multi-CloudIJTET Journal
Abstract--Due to risk in service availability failure and the possibilities of malicious insiders in the single cloud, a movement towards “Multi-clouds” has emerged recently. In general a multi-cloud security system there is a possibility for third party to access the user files. Ensuring security in this stage has become tedious since, most of the activities are done in network. In this paper, an enhanced security methodology has been introduced in order to make the data stored in cloud more secure. Duple authentication process introduced in this concept defends malicious insiders and shields the private data. Various disadvantages in traditional systems like unauthorized access, hacking have been overcome in this proposed system and a comparison made with the traditional systems in terms of performance and computational time have shown better results.
NEW ALGORITHM FOR WIRELESS NETWORK COMMUNICATION SECURITYijcisjournal
This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid
algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations
A Survey on DPI Techniques for Regular Expression Detection in Network Intrus...ijsrd.com
Deep Packet Inspection (DPI) is becoming more widely used in virtually all applications or services like Intrusion Detection System (IDS), which operate with or within a network. DPI analyzes all data present in the packet as it passes an inspection to determine the application transported and protocol. Deep packet inspection typically uses regular expression matching as a core operator. Regular expressions (RegExes) are used to flexibly represent complex string patterns in many applications ranging from network intrusion detection and prevention systems (NIDPSs). Regular expressions represent complex string pattern as attack signatures in DPI. It examine whether a packet’s payload matches any of a set of predefined regular expressions. There are various techniques developed in DPI for deep packet inspection for regular expression. We survey on these techniques for further improvement in regular expression detection in this paper. In the result we found that it is possible to reduce RegEx transaction memory required in network intrusion detection. We made this survey with possible use of DPI techniques in the wireless network.
A Modified Technique For Performing Data Encryption & Data DecryptionIJERA Editor
In this age of universal electronic connectivity of viruses and hackers of electronic eavesdropping and electronic fraud, there is indeed needed to store the information securely. This, in turn, led to a heightened awareness to protect data and resources from disclosure, to guarantee the authenticity of data and messages and to protect systems from network-based attacks. Information security via encryption decryption techniques is a very popular research area for many people’s over the years. This paper elaborates the basic concept of the cryptography, specially public and private cryptography. It also contains a review of some popular encryption decryption algorithms. A modified method is also proposed. This method is fast in comparison to the existing methods.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
SECURE THIRD PARTY AUDITOR (TPA) FOR ENSURING DATA INTEGRITY IN FOG COMPUTINGIJNSA Journal
Fog computing is an extended version of Cloud computing. It minimizes the latency by incorporating Fog servers as intermediates between Cloud Server and users. It also provides services similar to Cloud like Storage, Computation and resources utilization and security.Fog systems are capable of processing large amounts of data locally, operate on-premise, are fully portable, and can be installed on the heterogeneous hardware. These features make the Fog platform highly suitable for time and location-sensitive applications. For example, the Internet of Things (IoT) devices isrequired to quickly process a large amount of data. The Significance of enterprise data and increased access rates from low-resource terminal devices demands for reliable and low- cost authentication protocols. Lots of researchers have proposed authentication protocols with varied efficiencies.As a part of our contribution, we propose a protocol to ensure data integrity which is best suited for fog computing environment.
SECURE THIRD PARTY AUDITOR (TPA) FOR ENSURING DATA INTEGRITY IN FOG COMPUTINGIJNSA Journal
Fog computing is an extended version of Cloud computing. It minimizes the latency by incorporating Fog servers as intermediates between Cloud Server and users. It also provides services similar to Cloud like Storage, Computation and resources utilization and security.Fog systems are capable of processing large amounts of data locally, operate on-premise, are fully portable, and can be installed on the heterogeneous hardware. These features make the Fog platform highly suitable for time and location-sensitive applications. For example, the Internet of Things (IoT) devices isrequired to quickly process a large amount of data. The Significance of enterprise data and increased access rates from low-resource terminal devices demands for reliable and low- cost authentication protocols. Lots of researchers have proposed authentication protocols with varied efficiencies.As a part of our contribution, we propose a protocol to ensure data integrity which is best suited for fog computing environment.
A Survey Paper On Data Confidentiatity And Security in Cloud Computing Using ...IJSRD
Now days rapidly increased use of cloud computing in the many organization and IT industries and provides latest software solution with minimum cost. So the cloud computing give us number of benefits with minimum cost and of data accessibility through Internet. The ensuring security risks of the cloud computing is the main factor in the cloud computing environment, The evolving essence is Cloud computing, that is beneficial in cost effective parts, such as capability inflexible computing, decreasing the time period to market and insufficient computing power. By using the complete ability of cloud computing, data are transmitted, processed and stored on the outside cloud service providers. The fact is that, the owner of the data is feeling extremely unconfident to locate their data outer to their own control. Security and Confidentiality of data stored in the cloud are key setbacks in the area of Cloud Computing. Security and Confidentiality are the key issues for cloud storage. This paper proposes a KIST encryption algorithm to concentrate on the security and Confidentiality issues in cloud storage and also compressed cipher text data in order to protect the data stored in the cloud.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Review and Performance Comparison of Distributed Wireless Reprogramming Proto...IOSR Journals
Abstract:A Reprogramming service should be efficient, reliable and secured in Wireless sensor network.
Wireless reprogramming for wireless sensor network emphasize over the process of changing or improving the
functionality of simulation or existing code. For challenging and on demand security purpose, secure and
distributed routing protocols such as SDRP and ISDRP were developed. This paper reviews and compares the
propagation delay for two reprogramming protocols, SDRP and ISDRP, which based on hierarchy of energies
in network. Both are based on identity-based cryptography. But in the improved protocol the keys are
distributed to the network as per the sorting and communication capabilities to improve the broadcast or
communication nature of the network. Moreover, ISDRP demonstrates the security concepts, which deals over
the key encryption properties using heap sort algorithm and the confidentiality parameter is enhanced by
changing the private key values after certain interval of time for cluster head in respect to different public keys.
The ISDRP shows high efficiency rate clearly with the throughput and propagation results by implementation in
practice over SRDP.
Keywords: identity-based cryptography,ISDRP, heapsort algorithm, Reprogramming, SDRP, Wireless sensor
network.
Electrically small antennas: The art of miniaturizationEditor IJARCET
We are living in the technological era, were we preferred to have the portable devices rather than unmovable devices. We are isolating our self rom the wires and we are becoming the habitual of wireless world what makes the device portable? I guess physical dimensions (mechanical) of that particular device, but along with this the electrical dimension is of the device is also of great importance. Reducing the physical dimension of the antenna would result in the small antenna but not electrically small antenna. We have different definition for the electrically small antenna but the one which is most appropriate is, where k is the wave number and is equal to and a is the radius of the imaginary sphere circumscribing the maximum dimension of the antenna. As the present day electronic devices progress to diminish in size, technocrats have become increasingly concentrated on electrically small antenna (ESA) designs to reduce the size of the antenna in the overall electronics system. Researchers in many fields, including RF and Microwave, biomedical technology and national intelligence, can benefit from electrically small antennas as long as the performance of the designed ESA meets the system requirement.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfPeter Spielvogel
Building better applications for business users with SAP Fiori.
• What is SAP Fiori and why it matters to you
• How a better user experience drives measurable business benefits
• How to get started with SAP Fiori today
• How SAP Fiori elements accelerates application development
• How SAP Build Code includes SAP Fiori tools and other generative artificial intelligence capabilities
• How SAP Fiori paves the way for using AI in SAP apps
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
1. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, No 5, May 2013
1670
www.ijarcet.org
An Overview of Partial Shuffle for Database
Access Pattern Protection Using Reverse
Encryption Algorithm
Priti V. Bhagat1
, Rohit Singhal2
1
M.Tech student, Department of Computer Science & Engineering, I.E.T. Alwar, Rajasthan, India
2
Astt. Professor, Department of Computer Science & Engineering, I.E.T. Alwar, Rajasthan, India
Abstract - Encryption of database is an important topic for
research, as secure and efficient encryption algorithms are
needed that provide the ability to query over encrypted
database and allow optimized encryption and decryption of
data. There is always a compromise between the degree of
security provided by encryption algorithm and the efficient
querying on the database, because the encryption and
decryption on database greatly degrade query performance.
For this, we propose a new encryption algorithm; Reverse
Encryption Algorithm (REA). REA is simple and fast enough
for most applications. REA provides maximum security and
limits the added time cost for encryption and decryption to
as to not degrade the performance of a database system.
Privacy protection is one of the fundamental security
requirements for database outsourcing. A major threat is
information leakage from database access patterns generated
by query executions. Recent works propose to protect access
patterns by introducing a trusted component with constant
storage size. The resulting privacy assurance is as strong as
PIR, though with O(1) online computation cost, they still
have O(n) amortized cost per query due to periodically full
database shuffles. In this wok, we design a novel scheme in
the same model with provable security, which only shuffles a
portion of the database.
Keywords: Database, data privacy, information security
I. INTRODUCTION
Privacy protection is one of the fundamental security
requirements for database outsourcing. A major threat is
information leakage from database access patterns
generated by query executions. Private Information
Retrieval (PIR) protocol allows a user to retrieve an item
from a server in possession of a database without
revealing which item they are retrieving. PIR is a weaker
version of 1-out-of n oblivious transfer, where it is also
required that the user should not get information about
other database items. While this problem admits a trivial
solution – sending the entire database to the client allows
the client to query with perfect privacy-there are
techniques to reduce the communication complexity of
this problem, which can be critical for large databases.
The Strong Private Information Retrieval (SPIR) is the
retrieval with the additional requirements that the client
only learn about the elements of the query. This
requirements typical privacy needs of a database owner.
Private Information Retrieval (PIR) formulated the
well-known cryptographic mechanism inhibiting
information leakage from access patterns. Many PIR
schemes have been proposed with the emphasis on
lowering the communication complexity between the
server and the user. Nonetheless, as pointed out by Sino
and Carbunar, those PIR schemes incur even more
turnaround time than transferring the entire database as a
reply to the user, because the heavy computation incurred
at the server outweighs the saved communication expense.
The Private Information Retrieval problem is only
concerned with user’s privacy, without requiring any
protection of server’s privacy. The database use in the
different session process in different areas. The entire
database as a reply to the user, because the heavy
computation incurred at the server outweighs the saved
communication expense. Compared with the standard PIR
schemes, these PIR schemes works on encrypted data
records rather than bits in plaintext.
However, how to query efficiently on the encrypted
database becomes a challenge. This usually found that the
system has to sacrifice the performance to obtain the
security. When data is stored in encrypted form, we have
to decrypt all the data before querying them. It is
impractical because the cost of decryption over all the
encrypted data is very expensive.
For this purpose, we put forward the innovative
encryption algorithm, known as “Reverse Encryption
Algorithm (REA)”. Reverse Encryption Algorithm is
efficient and reliable. To protect access pattern of the
database generated by query, we follow this line of
research and design a novel scheme which only shuffles a
portion of the database.
II. THE MODELS OF PRIVATE INFORMATION
RETRIEVAL
A. Information-Theoretic PIR.
Information-theoretic PIR protocols guarantee perfect
privacy – even an unbounded server learns no
information. However, they require replication of the data
among several non-communicating servers. Information-
theoretic PIR protocols were introduced and constructed
by Chor et al. [1]. In particular, they construct the best
known 2-server protocol with communication complexity
O(n1/3
) (where n is the database length). More efficient
constructions of k-server protocols for k > 2 appear in [2],
[3], [4]. The best known 3-server PIR protocol is
constructed in a lovely work of Yekhanin [5]; assuming
that there are infinitely many Mersenne primes, he
constructs a 3-server PIR protocol with communication
complexity nO(1/log log n) for infinitely many values of
n. Specifically, his protocol implies, without any
2. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, No 5, May 2013
1671
www.ijarcet.org
assumptions, a 3-server PIR protocol with communication
complexity nε
for some ε < 10-7
. To date, Yekhanin’s
protocol is the best k-server PIR protocol for every
constant k.
B. Computational PIR.
In computational PIR protocols a polynomial-time
server cannot learn information on the index the client
retrieves. In other words, unless the server runs in an
unreasonable time, the privacy of the index is guaranteed.
The first computational PIR protocol was a multi-server
PIR protocol of [6] (assuming that one-way functions
exist). Following this work, Kushilevitz and Ostrovsky [7]
showed that there is a 1-server computational PIR
protocol with sub-linear communication (assuming that
the quadratic residuosity problem is hard). Subsequently,
more efficient computational protocols, based on various
hardness assumptions, were constructed [7], [8], [9]. The
best 1-server PIR protocol was constructed by Lipmaa [8];
it is based on the so-called composite residuosity
assumption and has communication complexity O(log2
n)
(ignoring the security parameter). It is important to note
that 1-server computational PIR protocols with sublinear
communication require some hardness assumptions [10].
Computational PIR protocols are used for
constructing efficient protocols for more complex crypto-
graphic tasks. They can be used to construct several
cryptographic primitives, e.g., unconditionally hiding
commitment [10], oblivious transfer protocols [11], and
collision-resistant hash functions [12]. Further-more, PIR
protocols can be used to construct efficient zero-
knowledge arguments for a certain class of languages
[13]. The twist is that the server performing the encryption
should not know the criteria for choosing the relevant
information; nevertheless, the length of the encryption
should be shorter than the encrypted database. Other
applications of PIR protocols for complexity theory are
discussed in the survey [16].
C. Symmetric PIR.
In the above discussion of the PIR problem, we only
protect the privacy of the client. While each server is not
allowed to learn information about the bit that the client is
interested in, the client can learn many bits of the
database. This might be problematic in many scenarios.
For example, if the server wants to charge the client for
each bit it retrieves, then the client gets extra information
for free. Gertner, Ishai, Kushilevitz, and Malkin [17]
defined symmetric private information retrieval,
abbreviated SPIR, where the server does not learn any
information and the client only learns the bit that it wants.
Such protocols were actually considered before the
introduction of PIR protocols and were called oblivious
transfer, abbreviated OT, or all-or-nothing disclosure of
secrets [18]. The name oblivious transfer, coined by Rabin
[18], illustrates the nature of the protocol where the server
transfers information to the client, while being oblivious
to which information it transfers. However, prior to the
PIR literature, the communication complexity of OT
protocols was not optimized. In other words, SPIR
protocols can be thought of as oblivious transfer protocols
with sub-linear communication.
III. PROPOSED METHODOLOGY
In this work, we shall study various approaches which are
followed in realizing this system. We will further study
factual aspects which can be made use of in designing and
developing an efficient database access pattern protection
with partial shuffle scheme. The important consideration
made in this work is of using the existing standard
methods and have developed the innovative algorithm
with different functionalities.
A. System Model
The system consists of a group of users, a database D
modeled as an array of n data items of equal length
denoted by {d1,d2,....dn} , and a database host denoted by
H . A trusted component denoted by T is embedded in H.
T has an internal cache which stores up to k data item. No
adversary can tamper T’s executions or access its private
space including the cache. T is capable of performing
symmetric key encryption/decryption and pseudorandom
number generation.
B. Basic Construction
1. Reverse Encryption Algorithm
We recommend the new encryption algorithm, “Reverse
Encryption Algorithm (REA)”, because of its simplicity
and efficiency. Reverse Encryption Algorithm limits the
added time cost for encryption and decryption. In this
section we provide a comprehensive yet concise
algorithm.
Reverse Encryption Algorithm is a symmetric stream
cipher that can be effectively used for encryption and
decryption of data. It takes a variable-length key. The
Reverse Encryption Algorithm encipherment and
decipherment consists of the same operations, except the
two operations: 1) adds the key to the text in the
encipherment and removes the keys from the text in the
decipherment. 2) Execute divide operation on the text by 4
in the encipherment and execute multiply operation on the
text by 4 in the decipherment. We execute divide
operation by 4 on the text to narrow the range domain of
the ASCII code table at converting the text.
Encryption Algorithm of the REA
The steps are (see Figure 1):
Step 1: Input the text and the key.
Step 2: Add the key to the text.
Step 3: Convert the previous text to ASCII code.
Step 4: Convert the previous ASCII code to binary data.
Step 5: Find out One’s complement of the previous binary
data.
Step 6: Gather each 8 bits from the previous binary data
and obtain the Decimal value from it.
Step 7: Divide the previous Decimal value by 4.
Step 8: Obtain the ASCII code of the previous result
divide and put it as one character.
Step 9: Obtain the remainder of the previous divide and
put it as a second character.
Step 10: Return encrypted text.
3. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, No 5, May 2013
1672
www.ijarcet.org
Figure 1: Block Diagram of REA encryption algorithm
Decryption Algorithm of the REA
The steps are (see Figure 2):
Step 1: Input the encrypted text and the key.
Step 2: Loop on the encrypted text to obtain ASCII code
of characters and add the next character.
Step 3: Multiply ASCII code of the first character by 4.
Step 4: Add the next digit (remainder) to the result
multiplying operation. (Consider result as Decimal value)
Step 5: Convert the previous Decimal value to binary data.
Step 6: Find out One’s complement of the previous binary
data.
Step 7: Gather each 8 bits from the previous binary data
and obtain the ASCII code from it.
Step 8: Convert the previous ASCII code to text.
Step 9: Remove the key from the text.
Step 10: Return decrypted data.
Figure 2: Block Diagram of REA decryption algorithm
2. Twin Retrieval Algorithm
Initially, all the entries of database are labeled as white.
Once a record is fetched, it is labeled as black. For a query
on di, T executes a twin retrieval algorithm, if di is
available in the cache, T randomly fetches a pair of
records, black and white, respectively; otherwise, it
retrieves the needed record and another random record in
a different color.
Algorithm
INPUT: a query on di, B.
OUTPUT: di.
If di not in the cache then
j ← ζ (i).
u ← binary_search (j, B);
If u ≠ NULL then
di is black; set v ← B [πs (u)] and read Ds[v] and read a
random white record from database;
Else
di is white; read a random black record from database and
read D[j] which stores di;
End if
Else
Read a random black and a white record from Ds into the
cache.
End if
Return di to the user.
Where, di is the ith
entry in the original database D, B is
the array of addresses of all black records, stored in
ascending order. ζ is the initial permutation used for
shuffling and Ds[v] is vth
entry in Ds.
3. Partial Shuffle Algorithm
To protect information leakage from database access
pattern generated due to query executions by shuffling
database entries. Due to full database shuffle computation
cost increases. So, in the proposed scheme only Black
records (touched records) are shuffled and re-encrypted.
Note that it is unnecessary to shuffle white records
(untouched records). A white record does not leak any
query information for the following two reasons. First, all
records are encrypted and therefore a white record itself
does not compromise privacy. Second, since it is white,
there exists no access pattern involving it. Therefore, it is
observed that an encrypted record is not touched does not
help the adversary to derive any information about
(existing) user queries. The objective of database shuffle
is to remix the touched database entries with the
untouched ones, so that future executions appear
independent with preceding ones.
Algorithm
INPUT: B with (1+s) k/2 black records.
OUTPUT: Ds+1.
Secretly generate a random permutation πs+1: [1, |B|] →
[1, |B|], and a new key sks+1.
For (I= If =1, I ≤ |B| - k; I++) do
While True do
j ← π-1
s+1 (If); t ← ζ-1
(B [j]);
If dt is in the cache, If ← If+1; else break;
End while
δ ← |{di|di is in cache and is white and ζ(i) < B[j]}|,
v ← πs(j-δ);
δ ← |{di|di is in cache and is white and ζ(i) < B[v]}|,
v ← v +δ;
Fetch Ds [B[v]] as dt.
If I = If then
Write εsks+1(dt, t) into Ds+1[B [I]];
Else
Insert (t, dt) into cache.
j ← π-1
s+1 (I); t ← ζ-1
(B [j]);
Retrieve dt from the cache and write εsk+1(dt, t) to Ds+1[B
[I]].
End If
If = If + 1;
4. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, No 5, May 2013
1673
www.ijarcet.org
End for
Encrypt and write the remaining k records in to the cache
to Ds+1 according, securely eliminate πs-1. Quite the sth
sessions.
IV. CONCLUSION
We have presented a novel hardware-based scheme to
prevent database access patterns from being exposed to a
malicious server. By virtue of twin-retrieval and partial-
shuffle, our scheme avoids full-database shuffle and
reduces the amortized server computation complexity.
Cryptographic support is an important mechanism of
securing important data. In this work, we introduce a new
encryption algorithm, which we call “Reverse Encryption
Algorithm (REA)”. REA is simple and fast enough for
most applications. Our new encryption algorithm REA
can reduce the cost time of the encryption/decryption
operations and improve the performance.
REFERENCES
[1]. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private
information retrieval. In Proc. of the 36th IEEE Symp. on
Foundations of Computer Science, pages 41–51, 1995. Journal
version: J. of the ACM, 45:965–981, 1998.
[2]. A. Ambainis. Upper bound on the communication complexity of
private information retrieval. In P. Degano, R. Gorrieri, and A.
Marchetti-Spaccamela, editors, Proc. of the 24th International Col-
loquium on Automata, Languages and Programming, volume 1256
of Lecture Notes in Computer Science, pages 401–407. Springer-
Verlag, 1997.
[3]. A. Beimel, Y. Ishai, and E. Kushilevitz. General constructions for
information-theoretic private infor-mation retrieval. J. of Computer
and System Sciences, 71(2):213–247, 2005.
[4]. A. Beimel, Y. Ishai, E. Kushilevitz, and J. F. Raymond. Breaking
the O(n2k¡1
) barrier for information-theoretic private information
retrieval. In Proc. of the 43rd IEEE Symp. on Foundations of
Computer Science, pages 261–270, 2002.
[5]. S. Yekhanin. Towards 3-query locally decodable codes of
subexponential length. In Proc. of the 39th ACM Symp. on the
Theory of Computing, pages 266–274, 2007.
[6]. B. Chor and N. Gilboa. Computationally private information
retrieval. In Proc. of the 29th ACM Symp. on the Theory of
Computing, pages 304–313, 1997.
[7]. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single
database, computationally-private information retrieval. In Proc. of
the 38th IEEE Symp. on Foundations of Computer Science, pages
364–373, 1997.
[8]. H. Lipmaa. An oblivious transfer protocol with log-squared
communication. In J. Zhou and J. Lopez, editors, the 8th
Information Security Conference (ISC’05), volume 3650 of Lecture
Notes in Computer Science, pages 314–328. Springer-Verlag, 2005.
[9]. E. Mann. Private access to distributed information. Master’s thesis,
Technion – Israel Institute of Technology, Haifa, 1998.
[10]. A. Beimel, Y. Ishai, E. Kushilevitz, and T. Malkin. One-way
functions are essential for single-server private information
retrieval. In Proc. of the 31st ACM Symp. on the Theory of
Computing, pages 89–98, 1999.
[11]. G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database
private information retrieval implies oblivious transfer. In
Advances in Cryptology – EUROCRYPT 2000, volume 1807 of
Lecture Notes in Computer Science, pages 122–138. Springer-
Verlag, 2000.
[12]. Y. Ishai, E. Kushilevitz, and R. Ostrovsky. Sufficient conditions
for collision-resistant hashing. In J. Kilian, editor, Proc. of the
Second Theory of Cryptography Conference – TCC 2005, volume
3378 of Lecture Notes in Computer Science, pages 445–456.
Springer-Verlag, 2005.
[13]. Tauman Kalai and R. Raz. Succinct non-interactive zero-
knowledge proofs with preprocessing for LOGSNP. In Proc. of the
47th IEEE Symp. on Foundations of Computer Science, pages 355–
366, 2006.
[14]. R. Ostrovsky and W. E. Skeith III. Private searching on streaming
data. J. of Cryptology, 20(4):397– 430, 2007.
[15]. D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III.
Public key encryption that allows PIR queries. In A. Menezes,
editor, Advances in Cryptology – CRYPTO 2007, volume 4622 of
Lecture Notes in Computer Science, pages 50–67. Springer-Verlag,
2007.
[16]. R. Ostrovsky and W. E. Skeith III. A survey of single-database
private information retrieval: Techniques and applications. In T.
Okamoto and X. Wang, editors, Public Key Cryptography: 10th
Inter-national Workshop on Practice and Theory in Public Key
Cryptosystems, PKC 2007, volume 4450 of Lecture Notes in
Computer Science, pages 393–411. Springer-Verlag, 2007.
[17]. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data
privacy in private information retrieval schemes. J. of Computer
and System Sciences, 60(3):592–629, 2000. Conference version in
Proc. of the 30th ACM Symp. on the Theory of Computing, pages
151–160, 1998.
[18]. M. O. Rabin. How to exchange secrets by oblivious transfer.
Technical Report TR-81, Harvard Aiken Computation Laboratory,
1981. Available online in the Cryptology ePrint Archive, Report
2005/187, eprint.iacr.org/2005/187.
Priti V. Bhagat received her BE (Computer Engineering) from
Bapuraoji Deshmukh College of Engineering, Wardha in June 2007.
Presently she is working as a Lecturer at Datta Meghe Institute of
Engineering, Technology & Research, Sawangi (M), Wardha.
Rohit Singhal Presently he is working as Assistant Professor at IET,
Alwar.