Search results for "ENCR"
showing 10 items of 121 documents
Feasibility of FPGA accelerated IPsec on cloud
2018
Abstract Hardware acceleration for famous VPN solution, IPsec, has been widely researched already. Still it is not fully covered and the increasing latency, throughput, and feature requirements need further evaluation. We propose an IPsec accelerator architecture in an FPGA and explain the details that need to be considered for a production ready design. This research considers the IPsec packet processing without IKE to be offloaded on an FPGA in an SDN network. Related work performance rates in 64 byte packet size for throughput is 1–2 Gbps with 0.2 ms latency in software, and 1–4 Gbps with unknown latencies for hardware solutions. Our proposed architecture is capable to host 1000 concurre…
Mobile agents principles of operation
2004
Publisher Summary This chapter discusses the mobile agent technology and summarizes their features, principles of operation and implementation elements. Some development tools are also discussed. The chapter provides general description of mobile agents as an advanced software paradigm, which extends object oriented programming. Then it discusses principles of operation starting from agent intelligent behavior and continuing with mobility, communication, coordination, and fault tolerance. Finally, as for related topics, monitoring, performances, and security issues are discussed in the chapter. Agent monitoring techniques are very useful because they allow users to know which agents are run…
Random bit generation through polarization chaos in nonlinear optical fibers
2017
Nowadays, cryptographic applications are becoming of paramount importance in order to guarantee ultimately secure communications. Performances of classical and quantum key distribution and encryption algorithms are strongly dependent on the used Random Number Generator (RNG). A good RNG must produce unpredictable, unreproducible and unbiased sequences of numbers. For this reason, many true random number generators relying on chaotic physical phenomena, such as chaotic oscillations of high-bandwidth lasers [1, 2] or polarization chaos from a VCSEL diode [3], have been developed. In this work, we propose a RNG implementation based on a different physical mechanism than the ones previously use…
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…