Search results for "Encryption"
showing 10 items of 94 documents
Secure integration of multiprotocol instant messenger
2017
Pidgin communicator is a multiprotocol instant messenger client, developed by open source community. It was originally a third party client of AIM (AOL Instant Messenger) protocol for Linux operating system founded in 1998. At present, its main goal is to provide common interface for every protocol it supports, so the user does not need care about protocol to use or peer's IM identifier, while he just want to talk with a Bob. The work focuses mainly on security and functionality aspects like password storage strategies, integration with plugins which provide privacy of communication. This paper shares experiences has been gained during the process of developing and replacement of existing c…
A secure architecture for P2PSIP-based communication systems
2009
Today, Peer-to-Peer SIP based communication systems have attracted much attention from both academia and industry. The decentralized nature of P2P might provide the distributed peer-to-peer communication system without help of the traditional SIP server. However, it comes to the cost of reduced manageability and therefore causes security problems, e.g. distrust, privacy leaks, unpredictable availability, etc. In this paper, we investigate on P2PSIP security issues and propose a proxy-based system architecture that improves security during P2PSIP session initiation. The main issues considered in this architecture include Source inter-working, Encryption & Decryption, Policy Management, Desti…
Quantum Security Proofs Using Semi-classical Oracles
2019
We present an improved version of the one-way to hiding (O2H) Theorem by Unruh, J ACM 2015. Our new O2H Theorem gives higher flexibility (arbitrary joint distributions of oracles and inputs, multiple reprogrammed points) as well as tighter bounds (removing square-root factors, taking parallelism into account). The improved O2H Theorem makes use of a new variant of quantum oracles, semi-classical oracles, where queries are partially measured. The new O2H Theorem allows us to get better security bounds in several public-key encryption schemes.
Improved Magic Ink Signatures Using Hints
1999
We introduce two improvements to the recently proposed so called magic ink DSS signatures. A first improvement is that we reduce the overhead for tracing without noticeably increasing any other cost. The tracing cost is linear in the number of generated signatures in the original proposal; our improved version reduces this to a logarithmic cost in the common case. A second improvement is that we introduce a method for determining whether forged currency is in circulation, without affecting the privacy of honest users. Our improvements rely on our introducing a so called hint value. This is an encryption of the signature transcript received, submitted by the signature receiver. Part of the p…
Combining hashing and enciphering algorithms for epidemiological analysis of gathered data.
2008
Summary Objectives: Compiling individual records coming from different sources is necessary for multi-center studies. Legal aspects can be satisfied by implementing anonymization procedures. When using these procedures with a different key for each study it becomes almost impossible to link records from separate data collections. Methods: The originality of the method relies on the way the combination of hashing and enciphering techniques is performed: like in asymmetric encryption, two keys are used but the private key depends on the patient’s identity. Results: The combination of hashing and enciphering techniques provides a great improvement in the overall security of the proposed scheme…
Secure and efficient data storage in unattended wireless sensor networks
2009
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/NTMS.2009.5384753 Providing forward and backward secrecy is still a big challenge in Unattended Wireless Sensor Networks (UWSNs), though some storage schemes have been proposed. Additionally, high storage requirement needs efficient storage techniques. In this paper, we propose a novel homomorphic…
Elliptic Curve-Based Secure Multidimensional Aggregation for Smart Grid Communications
2017
In smart grid, data aggregation is considered as an essential paradigm in assessing information about current energy usage. To achieve the privacy-preserving goal, several homomorphic-based solutions have been proposed. However, these solutions either consider one-dimensional information or use costly pairing computation in order to ensure source authentication. In fact, smart grid data are likely to be multidimensional (e.g., time, purpose, and so on) for more accurate control. In addition, the aggregation node in smart grid needs to verify data that come from several smart meters in a residential area; hence, the verification must be cost-efficient. In this paper, we propose a scheme that…
PROLISEAN: A New Security Protocol for Programmable Matter
2021
The vision for programmable matter is to create a material that can be reprogrammed to have different shapes and to change its physical properties on demand. They are autonomous systems composed of a huge number of independent connected elements called particles. The connections to one another form the overall shape of the system. These particles are capable of interacting with each other and take decisions based on their environment. Beyond sensing, processing, and communication capabilities, programmable matter includes actuation and motion capabilities. It could be deployed in different domains and will constitute an intelligent component of the IoT. A lot of applications can derive fro…
Fingerprint Traits and RSA Algorithm Fusion Technique
2012
The present work deals with modern computing systems security issues, focusing on biometric based asymmetric keys generation process. Conventional PKI systems are based on private/public keys generated through RSA or similar algorithms. The present solution embeds biometric information on the private/public keys generation process. In addition the corresponding private key depends on physical or behavioural biometric features and it can be generated when it is needed. Starting from fingerprint acquisition, the biometric identifier is extracted, cyphered, and stored in tamper-resistant smart card to overcome the security problems of centralized databases. Biometric information is then used f…
Homomorphic Approach to RF-Inhomogeneity Removal Based on Gabor Filter
2007
In this paper a bias correction algorithm for magnetic resonance imaging (MRI) is presented. The magnetic resonance (MR) images affected by this artifact, also called RF-inhomogeneity, exhibit irregular spatial brightness variations caused by magnetic field inhomogeneity. Here we present an original algorithm based on E2D - HUM, already proposed by some of the authors, where a modified Gabor filter is introduced in the elaboration chain to provide directional capabilities to suppress the artifact. The process of restoration doesn't care about the structure of the image and it has been applied to MR images of different parts of body like knee, abdomen, pelvis and brain. A comparison with oth…