84 results on '"CRYPTOGRAPHY software"'
Search Results
2. On the (Im)possibility of Obfuscating Programs.
- Author
-
BARAK, BOAZ, GOLDREICH, ODED, IMPAGLIAZZO, RUSSELL, RUDICH, STEVEN, SAHAI, AMIT, VADHAN, SALIL, and YANG, KE
- Subjects
DATA encryption ,COMPUTER operating system security measures ,CRYPTOGRAPHY software ,COMPUTATIONAL complexity ,MATHEMATICAL proofs ,MACHINE theory ,COMPILERS (Computer programs) - Abstract
Informally, an obfuscator O is an (efficient, probabilistic) "compiler" that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is "unintelligible" in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic and complexity-theoretic applications, ranging from software protection to homomorphic encryption to complexity-theoretic analogues of Rice's theorem. Most of these applications are based on an interpretation of the "unintelligibility" condition in obfuscation as meaning that O(P) is a "virtual black box," in the sense that anything one can efficiently compute given O(P), one could also efficiently compute given oracle access to P. In this work, we initiate a theoretical investigation of obfuscation. Our main result is that, even under very weak formalizations of the above intuition, obfuscation is impossible. We prove this by constructing a family of efficient programs P that are unobfuscatable in the sense that (a) given any efficient program P′ that computes the same function as a program P ∈ P, the "source code" P can be efficiently reconstructed, yet (b) given oracle access to a (randomly selected) program P ∈ P, no efficient algorithm can reconstruct P (or even distinguish a certain bit in the code from random) except with negligible probability. We extend our impossibility result in a number of ways, including even obfuscators that (a) are not necessarily computable in polynomial time, (b) only approximately preserve the functionality, and (c) only need to work for very restricted models of computation (TC[sup 0]).We also rule out several potential applications of obfuscators, by constructing "unobfuscatable" signature schemes, encryption schemes, and pseudorandom function families. Categories and Subject Descriptors: D.4.6 [Operating Systems]: Security and Protection -- Cryptographic Controls; F.1.3 [Computation by Abstract Devices]: Complexity Measures and Classes General Terms: Theory [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
3. An optical authentication system based on imaging of excitation-selected lanthanide luminescence.
- Author
-
Carro-Temboury, Miguel R., Arppe, Riikka, Vosch, Tom, and Sørensen, Thomas Just
- Subjects
- *
COMPUTER access control , *DATA encryption , *RARE earth metals , *CRYPTOGRAPHY software , *OPTICAL computing - Abstract
The article focuses on the study of the optical authentication system designed through lanthanide luminescence from physical unclonable functions (PUFs). Topics include the capacity of PUFs to prevent counterfeiting and encryption, the composition of the authentication system which include image analysis, hardware readers, and authentication software, and the importance of excitation-selected imaging of lanthanide ions doped in preventing the random patterns from being copied.
- Published
- 2018
- Full Text
- View/download PDF
4. Memristor based Random Number Generator: Architectures and Evaluation.
- Author
-
Rai, Vikash Kumar, Tripathy, Somanath, and Mathew, Jimson
- Subjects
MEMRISTORS ,DATA security ,CRYPTOGRAPHY software ,COMPUTER network security ,INTERNET security - Abstract
Security plays an important role in various computer and network applications. Random number generator is a critical component for different cryptographic systems including key generation, unique identification, cookie generation etc. Recently, many architectures using memristor have been proposed for different computing and storage applications. It is observed that memristor based design possesses better randomness. This paper evaluates various memristor based random number generator structures and proposed a new architecture which meets the NIST standards for random number. It is shown that the proposed architecture is cost effective and low power consuming. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
5. Secure and Lightweight Cloud-Assisted Video Reporting Protocol over 5G-Enabled Vehicular Networks.
- Author
-
Nkenyereye, Lewis, Joonho Kwon, and Yoon-Ho Choi
- Subjects
- *
VEHICULAR ad hoc networks , *LONG-Term Evolution (Telecommunications) , *5G networks , *SECURITY systems software , *CRYPTOGRAPHY software - Abstract
In the vehicular networks, the real-time video reporting service is used to send the recorded videos in the vehicle to the cloud. However, when facilitating the real-time video reporting service in the vehicular networks, the usage of the fourth generation (4G) long term evolution (LTE) was proved to suffer from latency while the IEEE 802.11p standard does not offer sufficient scalability for a such congested environment. To overcome those drawbacks, the fifth-generation (5G)-enabled vehicular network is considered as a promising technology for empowering the real-time video reporting service. In this paper, we note that security and privacy related issues should also be carefully addressed to boost the early adoption of 5G-enabled vehicular networks. There exist a few research works for secure video reporting service in 5G-enabled vehicular networks. However, their usage is limited because of public key certificates and expensive pairing operations. Thus, we propose a secure and lightweight protocol for cloud-assisted video reporting service in 5G-enabled vehicular networks. Compared to the conventional public key certificates, the proposed protocol achieves entities' authorization through anonymous credential. Also, by using lightweight security primitives instead of expensive bilinear pairing operations, the proposed protocol minimizes the computational overhead. From the evaluation results, we show that the proposed protocol takes the smaller computation and communication time for the cryptographic primitives than that of the well-known Eiza-Ni-Shi protocol. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
6. A New CPA Resistant Software Implementation for Symmetric Ciphers with Smoothed Power Consumption: SIMON Case Study.
- Author
-
Pour, Morteza Safaei and Salmasizadeh, Mahmoud
- Subjects
CRYPTOGRAPHY software ,CODING theory ,ENERGY consumption - Abstract
In this paper we propose a new method for applying hiding countermeasure against CPA attacks. This method is for software implementation, based on smoothing power consumption of the device. This method is evaluated on the SIMON scheme as a case study, however, it is not relying on any specific SIMON features. Our new method includes only AND equivalent and XOR equivalent operations since every cryptographic algorithm can be implemented with two basic operations, namely AND and XOR. Therefore, hamming weight and hamming distance take constant values at each moment of time. This can decrease data-dependency between processed values and consumed power. In order to practically evaluate the resulting implementation overheads and the resistance improvement against CPA, we implement the proposed coding scheme on SIMON, a lightweight block cipher, on a smart card with the ATmega163 microprocessor. We define resistance as the number of traces, which for less than that number, the correct key cannot be distinguished from all other hypothetical keys by its correlation coefficient in any moment of time. The results of this implementation show 350 times more immunity against correlation attacks. [ABSTRACT FROM AUTHOR]
- Published
- 2017
7. Internet Banking Login with Multi-Factor Authentication.
- Author
-
Boonkrong, Sirapat
- Subjects
ONLINE banking ,COMPUTER access control ,FINANCIAL institutions ,COMPUTER security ,CRYPTOGRAPHY software - Abstract
Internet banking is one of many services provided by financial institutions that have become very popular with an increasing trend. Due to the increased amount of usage of the service, Internet banking has become a target from adversaries. One of the points that are at risk of an attack is the login process. Therefore, it is necessary to have a security mechanism that can reduce this risk. This research designs and develops a multi-factor authentication protocol, starting from a registration system, which generates authentication factors, to an actual authentication mechanism. These factors can be categorised into two groups: short term and long term. For the authentication protocol, only three messages need to be exchanged between a client and a financial institution's server. Many cryptographic processes are incorporated into the protocol, such as symmetric and asymmetric cryptography, a symmetric key generation process, a method for generating and verifying digital signatures. All of the authentication messages have been proved and analysed by the logic of GNY and the criteria of OWASP-AT-009. Even though there are additional factors of authentication, users do not really feel any extra load on their part, as shown by the satisfactory survey. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
8. Mission Assurance through Integrated Cyber Defense.
- Author
-
Bryant, William D.
- Subjects
- *
CYBERSPACE operations (Military science) , *MILITARY technology , *INTERNET security , *CRYPTOGRAPHY software - Abstract
The article focuses on the ability of the U.S. Air Force to perform its missions in and through the cyberspace environment. Topics mentioned include the military defense based on information technology (IT), the importance of technological innovations in the military defense, and the cybersecurity management. Also mentioned are the security measures for cryptography software and the management of computer software vulnerability.
- Published
- 2016
9. Differentially Private Frequent Sequence Mining.
- Author
-
Xu, Shengzhi, Cheng, Xiang, Su, Sen, Xiao, Ke, and Xiong, Li
- Subjects
- *
SEQUENTIAL pattern mining , *DATA mining , *WEB analytics , *CRYPTOGRAPHY software , *NUMERIC databases , *TEXT mining , *DATA analysis , *ALGORITHMS , *MATHEMATICAL models - Abstract
In this paper, we study the problem of mining frequent sequences under the rigorous differential privacy model. We explore the possibility of designing a differentially private frequent sequence mining (FSM) algorithm which can achieve both high data utility and a high degree of privacy. We found, in differentially private FSM, the amount of required noise is proportionate to the number of candidate sequences. If we could effectively prune those unpromising candidate sequences, the utility and privacy tradeoff can be significantly improved. To this end, by leveraging a sampling-based candidate pruning technique, we propose PFS $^2$
, a novel differentially private FSM algorithm. It is the first algorithm that supports the general gap-constrained FSM in the context of differential privacy. The gap constraints in FSM can be used to limit the mining results to a controlled set of frequent sequences. In our PFS$^2$ algorithm, the core is to utilize sample databases to prune the candidate sequences generated based on the downward closure property. In particular, we use the noisy local support of candidate sequences in the sample databases to estimate which candidate sequences are potentially frequent. To improve the accuracy of such private estimations, a gap-aware sequence shrinking method is proposed to enforce the length constraint on the sample databases. Moreover, to calibrate the amount of noise required by differential privacy, a gap-aware sensitivity computation method is proposed to obtain the sensitivity of the local support computations with different gap constraints. Furthermore, to decrease the probability of misestimating frequent sequences as infrequent, a threshold relaxation method is proposed to relax the user-specified threshold for the sample databases. Through formal privacy analysis, we show that our PFS $^2$ -differentially private. Extensive experiments on real datasets illustrate that our PFS$^2$- Published
- 2016
- Full Text
- View/download PDF
10. Linear complexity of Whiteman's generalized cyclotomic sequences of order 2k.
- Author
-
Kumari, Priti
- Subjects
- *
POLYNOMIAL approximation , *CRYPTOGRAPHY software , *CODING theory , *FINITE fields , *MATHEMATICAL analysis - Abstract
Let p1 and p2 be two odd distinct primes such that gcd(p1-1 ,p2-1) = 2k. In this correspondence, we calculate the accurate value of the minimal polynomial of Whiteman's generalized cyclotomic sequences of order 2k over galois field GF(q), where k ≥ 1 and q = pm and p is an odd prime and m is an integer. We calculate the linear complexity of these sequences. We get, the linear complexity is large. So, these sequences with high linear complexity are widely used in many areas such as combinatorics, cryptography and coding theory. [ABSTRACT FROM AUTHOR]
- Published
- 2016
11. Convolutional block codes with cryptographic properties over the semi-direct product $${\mathbb {Z}}/N{\mathbb {Z}} \rtimes {\mathbb {Z}}/M{\mathbb {Z}}$$.
- Author
-
Candau, Marion, Gautier, Roland, and Huisman, Johannes
- Subjects
CONVOLUTION codes ,NONABELIAN groups ,SYMMETRIC-key algorithms ,QUANTUM error correcting codes ,ERROR correction (Information theory) ,CRYPTOGRAPHY software - Abstract
Classic convolutional codes are defined as the convolution of a message and a transfer function over $$\mathbb {Z}$$ . In this paper, we study time-varying convolutional codes over a finite group G of the form $${\mathbb {Z}}/N{\mathbb {Z}} \rtimes {\mathbb {Z}}/M{\mathbb {Z}}$$ . The goal of this study is to design codes with cryptographic properties. To define a message u of length k over the group G, we choose a subset E of G that changes at each encoding, and we put $$u = \sum _i u_iE(i)$$ . These subsets E are generated chaotically by a dynamical system, walking from a starting point ( x, y) on a space paved by rectangles, each rectangle representing an element of G. So each iteration of the dynamical system gives an element of the group which is saved on the current E. The encoding is done by a convolution product with a fixed transfer function. We have found a criterion to check whether an element in the group algebra can be used as a transfer function. The decoding process is realized by syndrome decoding. We have computed the minimum distance for the group $$G=\mathbb {Z}/7\mathbb {Z} \rtimes \mathbb {Z}/3\mathbb {Z}$$ . We found that it is slightly smaller than those of the best linear block codes. Nevertheless, our codes induce a symmetric cryptosystem whose key is the starting point ( x, y) of the dynamical system. Consequently, these codes are a compromise between error correction and security. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
12. Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension.
- Author
-
Löndahl, Carl, Johansson, Thomas, Koochak Shooshtari, Masoumeh, Ahmadian-Attari, Mahmoud, and Aref, Mohammad
- Subjects
LOW density parity check codes ,LINEAR codes ,PUBLIC key cryptography ,CRYPTOGRAPHY software ,DECODING algorithms - Abstract
We present a general purpose algorithm for finding low-weight codewords as well as for decoding a received codeword in any quasi-cyclic code whose length and dimension is a multiple of a power of 2. In this paper, we apply the algorithm on a McEliece variant recently proposed by Misoczki et al. (MDPC-McEliece: New McEliece variants from moderate density parity-check codes, 2013). In their paper, the authors present instances of LDPC codes with increased weight for use in a McEliece type PKC. They claim that all message-recovery and key-recovery attacks can be avoided. We show that this is not true for certain parameters and public-key matrices. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
13. The Adaptation of Shamir's Approach for Increasing the Security of a Mobile Environment.
- Author
-
Buls, Jānis, Gorbans, Imants, Kulesovs, Ivans, and Straujums, Uldis
- Subjects
SMARTPHONES ,WEARABLE technology ,CRYPTOGRAPHY software ,COMPUTER software ,SAFETY - Abstract
The aim of the paper is to provide a solution which increases the security of a mobile environment for both individuals and for workers in an enterprise. The proposed solution adapts Shamir's approach for sharing a secret for encryption key management. One part of the key is stored on a Bluetooth or NFC wristband or on an enterprise server, while a mobile device is used to store all the rest. The approach can be applied for both securing documents and voice data. The solution is supported by a mathematical formality which is missing in the currently known advice within cryptographic folklore. [ABSTRACT FROM AUTHOR]
- Published
- 2016
14. VIDEO STEGANOGRAPHY USING LEAST SIGNIFICANT BIT IN FREQUENCY DOMAIN.
- Author
-
Ibrahim, A. E., Elshahed, M. A., and Elarif, T. I.
- Subjects
CRYPTOGRAPHY software ,MATHEMATICAL domains ,DIGITAL video ,DIGITAL images ,SOUNDS - Abstract
Video steganography is a technique to hide different types of files (secret massages) into a carrying video file. Video files contain a collection of images (frames) and sounds, so most of techniques that apply on images and audio files can be applied to video files also. The large amount of data that can be hidden inside the video and the fact that it is a moving stream of images and sounds gives the cover video files great advantages. In this paper, we present a proposed video steganography algorithm in the frequency domain. It was applied to two datasets to study the effect of selecting red, green and blue band on the quality of stego images. From the results we found, the quality of the stego images after data embedding into red channel, green channel and blue channel depends on the nature of the dataset. [ABSTRACT FROM AUTHOR]
- Published
- 2016
15. Location-Based Security for Resource Management.
- Author
-
GRUMAZ, Iulia
- Subjects
LOCATION-based services ,WIRELESS communications ,SMARTPHONES ,CRYPTOGRAPHY software ,RESOURCE management ,ACCESS control ,SECURITY systems - Abstract
Considering that wireless technology has widespread and mobile devices gain every day even more popularity, security concerns are increasingly shifting to these areas and solutions that take into account the high mobility users have been empowered with, are in demand. Hence, the aim of this paper is to propose a model for securing and controlling access of mobile clients to resources by using reliable location information, which is available by the means of access points already existing in network infrastructure of most organizations. The key part of the architecture, obtaining a reliable location proof and checking its authenticity, is based on a scheme derived from a validated cryptographic protocol, the Diffie-Hellman key-exchange. The software implementation demonstrates how current technology stack (Java, Android and Bluetooth etc.) can be used to create a workable system and a series of conclusions is drawn at the end to highlight the model's advantages, limitations and possible improvements. [ABSTRACT FROM AUTHOR]
- Published
- 2015
16. Secure and Efficient Architectures for Single Exponentiations in Finite Fields Suitable for High-Performance Cryptographic Applications.
- Author
-
Azarderakhsh, Reza, Mozaffari-Kermani, Mehran, and Jarvinen, Kimmo
- Subjects
- *
CRYPTOGRAPHY software , *GAUSSIAN processes , *EXPONENTIATION , *FINITE fields , *MULTIPLIERS (Mathematical analysis) - Abstract
High performance implementation of single exponentiation in finite field is crucial for cryptographic applications such as those used in embedded systems and industrial networks. In this paper, we propose a new architecture for performing single exponentiations in binary finite fields. For the first time, we employ a digit-level hybrid-double multiplier proposed by Azarderakhsh and Reyhani-Masoleh for computing exponentiations based on square-and-multiply scheme. In our structure, the computations for squaring and multiplication are uniform and independent of the Hamming weight of the exponent; considered to have built-in resistance against simple power analysis attacks. The presented structure reduces the latency of exponentiation in binary finite field considerably and thus can be utilized in applications exhibiting high-performance computations including sensitive and constrained ones in embedded systems used in industrial setups and networks. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
17. Accelerating elliptic curve scalar multiplication over [formula omitted] on graphic hardwares.
- Author
-
Seo, Seog Chung, Kim, Taehong, and Hong, Seokhie
- Subjects
- *
ELLIPTIC curves , *ACCELERATION measurements , *MULTIPLICATION , *COMPUTER graphics , *CRYPTOGRAPHY software - Abstract
In this paper, we present PEG (Parallel ECC library on GPU), which is efficient implementation of Elliptic Curve Scalar Multiplication over G F ( 2 m ) on Graphic Processing Units. While existing ECC implementations over GPU focused on limited parameterizations such as (fixed scalar and different curves) or (different scalars and same base point), PEG covers all parameter options ((a) fixed scalar and variable points, (b) random scalars and fixed input point, and (c) random scalars and variable points) which are used for ECC-based protocols such as ECDH, ECDSA and ECIES. With GPU optimization concerns and through analyzing parameter types used for ECC-based protocols, we investigate promising algorithms at both finite field arithmetic and scalar multiplication level for performance optimization according to each parameterization. PEG covers ECC implementations over G F ( 2 163 ) , G F ( 2 233 ) and G F ( 2 283 ) for 80-bit, 112-bit and 128-bit security on GTX285 and GTX480. PEG can achieve remarkable performance compared with MIRACL, one of the most famous ECC library, running on Intel i7 CPU (2.67 GHz). [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
18. Secure universal designated verifier identity-based signcryption.
- Author
-
Lin, Changlu, Tang, Fei, Ke, Pinhui, Harn, Lein, and Zhang, Shengyuan
- Subjects
DIGITAL signatures ,UNIVERSAL design ,CRYPTOGRAPHY software ,CONCRETE construction software ,DATA privacy - Abstract
ABSTRACT In 2003, Steinfeld et al. introduced the notion of universal designated verifier signature (UDVS), which allows a signature holder, who receives a signature from the signer, to convince a designated verifier whether he is possession of a signer's signature; at the same time, the verifier cannot transfer such conviction to anyone else. These signatures devote to protect the receiver's privacy, that is, the receiver may want to prove to any designated verifier who he is in possession of such signature signed by the known signer but reluctant to disclose it. Moreover, the receiver also does not want the verifier to be able to convince anyone that he is in possession of such signature. In the existing UDVS schemes, a secure channel is required between the signer and the signature holder to transfer the signature. This paper, for the first time, proposes the notion of universal designated verifier signcryption without this secure channel by combining the notions of UDVS and signcryption. We give the formal definitions and a concrete construction of universal designated verifier identity-based signcryption scheme. We also give the formal security proofs for our scheme under the random oracle model. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
19. A cryptography-based protocol against packet dropping and message tampering attacks on mobile ad hoc networks.
- Author
-
Obaidat, Mohammad S., Woungang, Isaac, Dhurandher, Sanjay Kumar, and Koo, Vincent
- Subjects
CRYPTOGRAPHY software ,DATA packeting ,TEXT messages ,AD hoc computer networks ,DATA transmission systems - Abstract
ABSTRACT In mobile ad hoc networks (MANETs), nodes are mobile in nature, but at the same time, they are assumed to rely on each other to relay their traffic even in case the wireless transmission medium is out of range. This requirement poses a serious challenge when malicious nodes are present in the MANET and may contribute to the routing operations, either by tampering the data packets or dropping them. This paper addresses this particular type of wormhole attacks, by introducing an enhancement (the so-called E-HSAM) to a recently proposed ad hoc on-demand distance vector-based protocol for preventing against such attacks in MANETs (the so-called highly secured approach against attacks on MANETs (HSAM)). Our contributions are twofold: (i) a simulation study of the HSAM protocol is provided for the first time, and (ii) the Advanced Encryption Standard (AES) is introduced in the route selection phase of E-HSAM (yielding our so-called E-HSAM-AES scheme) to strengthen the integrity of the data while securing the potential routes chosen for data transfer from source to destination nodes. Simulation results are presented, showing the superiority of E-HSAM-AES over E-HSAM and HSAM in terms of packet delivery ratio and broken link detected during data transmission, chosen as performance metrics. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
20. Research on Automatic Analysis of Security Protocols.
- Author
-
Liu, Yan-ling, Zhou, Qing-lei, and Zhao, Dong-ming
- Subjects
COMPUTER network protocol security measures ,VERIFICATION of computer systems ,COMPUTER Automated Measurement & Control ,CRYPTOGRAPHY software ,ALGORITHMS - Abstract
Abstract: Strand space model is a new formal analysis tool of the analysis of cryptographic protocols. Based on it, we proposed an improved automatic verification system to analyze NSK and Woo-Lam protocols. First, the paper initialized the protocol, then, designed the algorithms used to obtain the drawbacks of the protocol, and finally analyzed the experiment results. The whole process of analysis has showed the automatic tool is practicable. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
21. Secure Architecture for M-Learning Bluetooth Services.
- Author
-
Boja, Cătălin, Bătăgan, Lorena, and Zamfiroiu, Alin
- Subjects
BLUETOOTH technology software ,JAVA programming language software ,MOBILE learning ,MOBILE apps ,MOBILE communication systems ,CRYPTOGRAPHY software - Abstract
The paper describes a secure architecture for an M-Learning system that uses Bluetooth wireless networks to offer services for mobile devices. The solution is implemented on the Java ME platform using SATSA-CRYPTO. The access to these services is made possible by using Bluetooth capabilities of a mobile device that is part of a distributed system. The paper analyzes the security aspect of accessing the Bluetooth service from the confidentiality, integrity and authenticity, point of view. There are described the security options implemented by the Bluetooth Protocol, as described in JSR 82, for the Java ME platform. The proposed secure architecture solution authenticates users and their devices, using cryptographic techniques, without using devices IMEI, International Mobile Equipment Identity. [ABSTRACT FROM AUTHOR]
- Published
- 2010
22. Untraceable Mobile Node Authentication in WSN.
- Author
-
Kyusuk Han, Kwangjo Kim, and Taeshik Shon
- Subjects
- *
INTERNAL migration -- Social aspects , *WIRELESS sensor networks , *AUTHENTICATION (Law) , *DETECTORS , *MACHINE design , *COMPUTER network security , *VIRTUAL reality websites , *POLYNOMIALS , *ALGORITHM software , *CRYPTOGRAPHY software - Abstract
Mobility of sensor node in Wireless Sensor Networks (WSN) brings security issues such as re-authentication and tracing the node movement. However, current security researches on WSN are insufficient to support such environments since their designs only considered the static environments. In this paper, we propose the efficient node authentication and key exchange protocol that reduces the overhead in node re-authentication and also provides untraceability of mobile nodes. Compared with previous protocols, our protocol has only a third of communication and computational overhead. We expect our protocol to be the efficient solution that increases the lifetime of sensor network. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
23. Revisiting Sum of Residues Modular Multiplication.
- Author
-
Kong, Yinan and Phillips, Braden
- Subjects
- *
PUBLIC key cryptography , *MODULAR design , *ALGORITHMS , *COMPUTER programming , *COMPUTER network security , *COMPUTER architecture , *COMPUTER science , *CRYPTOGRAPHY software , *DIGITAL image processing , *MULTIPLICATION - Abstract
In the 1980s,when the introduction of public key cryptography spurred interest in modularmultiplication, many implementations performed modularmultiplication using a sumof residues. As the fieldmatured, sum of residues modularmultiplication lost favor to the extent that all recent surveys have either overlooked it or incorporated it within a larger class of reduction algorithms. In this paper, we present a new taxonomy of modular multiplication algorithms. We include sum of residues as one of four classes and argue why it should be considered different to the other, now more common, algorithms.We then apply techniques developed for other algorithms to reinvigorate sum of residues modular multiplication. We compare FPGA implementations of modular multiplication up to 24 bits wide. The Sum of Residues multipliers demonstrate reduced latency at nearly 50% compared to Montgomery architectures at the cost of nearly doubled circuit area. The new multipliers are useful for systems based on the Residue Number System (RNS). [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
24. Mitigating Denial-of-Service Attacks on the Chord Overlay Network: A Location Hiding Approach.
- Author
-
Srivatsa, Mudhakar and Ling Liu
- Subjects
- *
COMPUTER networks , *WIDE area networks , *ELECTRONIC file management , *STORAGE area networks (Computer networks) , *CRYPTOGRAPHY software , *ROUTING (Computer network management) , *ALGORITHM software , *PERFORMANCE , *DESKTOP publishing , *COMPUTER network resources - Abstract
Serverless distributed computing has received significant attention from both the industry and the research community. Among the most popular applications are the wide-area network file systems, exemplified by CFS, Farsite, and OceanStore. These file systems store files on a large collection of untrusted nodes that form an overlay network. They use cryptographic techniques to maintain file confidentiality and integrity from malicious nodes. Unfortunately, cryptographic techniques cannot protect a file holder from a denial-of-service (DoS) attack or a host compromise attack. Hence, most of these distributed file systems are vulnerable to targeted file attacks, wherein an adversary attempts to attack a small (chosen) set of files by attacking the nodes that host them. This paper presents LocationGuard--a location hiding technique for securing overlay file storage systems from targeted file attacks. LocationGuard has three essential components: 1) location key, consisting of a random bit string (e.g., 128 bits) that serves as the key to the location of a file, 2) routing guard, a secure algorithm that protects accesses to a file in the overlay network given its location key such that neither its key nor its location is revealed to an adversary, and 3) a set of location inference guards, which refer to an extensible component of the LocationGuard. Our experimental results quantify the overhead of employing LocationGuard and demonstrate its effectiveness against DoS attacks, host compromise attacks, and various location inference attacks. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
25. A fast pipelined multi-mode DES architecture operating in IP representation
- Author
-
Guilley, Sylvain, Hoogvorst, Philippe, and Pacalet, Renaud
- Subjects
- *
EMBEDDED computer systems , *COMPUTER storage devices , *COMPUTER network security , *CRYPTOGRAPHY software , *DATA protection , *SMART cards , *COMPUTER software - Abstract
Abstract: The Data Encryption Standard (DES) is a cipher that is still used in a broad range of applications, from smartcards, where it is often implemented as a tamper-resistant embedded co-processor, to PCs, where it is implemented in software (for instance, to compute crypt(3) on UNIX platforms). To the authors’ knowledge, implementations of DES published so far are based on the straightforward application of the NIST standard. This article describes an innovative architecture that features a speed increase for both hardware and software implementations, compared to the state of the art. For example, the proposed architecture, at constant size, is about twice as fast as the state of the art for 3DES-CBC. The first contribution of this article is an hardware architecture that minimizes the computation time overhead caused by key and message loading. The second contribution is an optimal chaining of computations, typically required when “operation modes” are used. The optimization is made possible by a novel computation paradigm, called “IP representation”. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
26. Password-Based Authentication: Preventing Dictionary Attacks.
- Author
-
Chakrabarti, Saikat and Singhal, Mukesh
- Subjects
- *
COMPUTER passwords , *COMPUTER security , *ELECTRONIC surveillance , *DATA encryption , *ZERO-knowledge proofs , *COMPUTER network protocols , *CRYPTOGRAPHY software , *CIPHERS - Abstract
The article discusses protocols for preventing attacks on password-based computer authentication. The use of passwords on insecure communication channels such as the Internet can allow others to eavesdrop and learn passwords. Challenge-response protocols have been established to protect passwords by requiring users to answer a challenge prior to password verification. A password-based encrypted key exchange uses session keys to prevent password attacks. A secure remote password (SRP) combines zero-knowledge proofs and asymmetric key-exchange protocols. Though the standard model of key exchange is utilized in cryptography, alternative models use block ciphers in place of ideal ciphers. Reverse Turing tests (RTT) prevent automated programs from stealing passwords.
- Published
- 2007
- Full Text
- View/download PDF
27. ID-based threshold decryption secure against adaptive chosen-ciphertext attack
- Author
-
Long, Yu, Chen, Kefei, and Liu, Shengli
- Subjects
- *
SYSTEM identification , *CRYPTOGRAPHY software , *PUBLIC key cryptography , *CIPHERS , *COMPUTER security software , *DATA encryption , *COMPUTER network security , *THRESHOLD logic , *BILINEAR forms , *COMPUTER engineering - Abstract
This paper proposes an identity-based threshold decryption scheme IB-ThDec and reduces its security to the Bilinear Diffie–Hellman problem. Compared with previous work, this conceals two pairing computations in the ciphertext validity verification procedure. The formal proof of security of this scheme is provided in the random oracle model. Additionally, we show that IB-ThDec can be applied to the threshold key escrow and the mediated cryptosystems. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
28. Proxy-protected signature secure against the undelegated proxy signature attack
- Author
-
Liu, Yu-Chuan, Wen, Hsiang-An, Lin, Chun-Li, and Hwang, Tzonelih
- Subjects
- *
PUBLIC key cryptography , *PROXY , *COMPUTER security , *PUBLIC key infrastructure (Computer security) , *DATA protection , *DATA encryption , *AUTHORITY , *CRYPTOGRAPHY software , *COMPUTER engineering - Abstract
The proxy signature scheme enables an original signer to delegate his/her signing capability to a designated proxy signer, thereby the proxy signer can sign messages on behalf of the original signer. Recently, Zhou et al. Proposed two proxy-protected signature schemes. One is based on the RSA problem and the other is based on the integer factorization problem. In this paper, however, we point out that Zhou et al. ’s schemes are insecure against undelegated proxy signature attack because any user without the delegation of the original signer can generate a valid proxy signature. To solve this problem, an improved scheme is proposed and its security is analyzed. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
29. Low-Weight Polynomial Form Integers for Efficient Modular Multiplication.
- Author
-
Jaewook Chung and Hasan, M. Anwar
- Subjects
- *
MODULAR programming , *CRYPTOGRAPHY software , *MODULI theory , *DATA encryption , *ALGEBRAIC geometry , *MODULAR arithmetic , *ELLIPTIC curves , *POLYNOMIALS , *COMPUTER programming - Abstract
In 1999, Solinas introduced families of moduli called the generalized Mersenne numbers (GMN5), which are expressed in low-weight polynomial form, p = f(t), where is limited to a power of 2. GMNs are very useful in elliptic curve cryptosystems over prime fields since modular reduction by a GMN requires only integer additions and subtractions. However, since there are not many GMNs and each GMN requires a dedicated implementation, GMNs are hardly useful for other cryptosystems. Here, we modify GMN by removing restriction on the choice oft. and restricting the coefficients of f(t) to 0 and ±1. We call such families of moduli low-weight polynomial form integers (LWPFIs). We show an efficient modular multiplication method using LWPFI moduli. LWPFI5 allow general implementation and there exist many LWPFI moduli. One may consider LWPFIs as a trade-oft between general integers and GMNs. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
30. Cryptographic methods for collusion-secure fingerprinting of digital data.
- Author
-
Biehl, Ingrid and Meyer, Bernd
- Subjects
- *
COPYRIGHT , *HUMAN fingerprints , *CRYPTOGRAPHY software , *COMPUTER software - Abstract
Investigates the cryptographic methods for collusion-secure fingerprinting of digital data in Germany. Explanation of anonymous fingerprinting presented by B. Pfitzmann and M. Waidner; Collusion-secure fingerprinting of data while protecting anonymity; Sketch on construction for anonymous fingerprinting schemes.
- Published
- 2002
- Full Text
- View/download PDF
31. Project #19 -- Enigma Cipher Machine.
- Author
-
Yates, Darren
- Subjects
ENIGMA cipher system ,ARDUINO (Microcontroller) ,MACHINE ciphers ,CRYPTOGRAPHY software ,TECHNOLOGICAL innovations - Abstract
The article focuses on a project about the development of an Enigma Cipher Machine. It discusses the design of the machine's hardware and the machine's software. It offers information on the Principle of Equivalence, a basic principle of computing which states that hardware can perform any task done by software and any operation performed by hardware can also be achieved in software. It also mentions the evolution of an Arduino Uno microcontroller to an Enigma Cipher Machine.
- Published
- 2014
32. Stegobot can steal passwords from your Facebook photos.
- Author
-
Aron, Jacob
- Subjects
- *
CRYPTOGRAPHY software , *DATA encryption , *ONLINE social network security , *MALWARE , *COMPUTER security - Abstract
The article discusses Stegobot, a botnet created by scientists led by Shishir Nagaraja of the Indraprastha Institute of Information Technology which uses steganography to hide information in picture files. The botnet inserts information about passwords or credit cards into files and then transmits the data through social networking websites such as Facebook. Nagaraja says that the botnet is nearly undetectable.
- Published
- 2011
- Full Text
- View/download PDF
33. HIDING IN PLAIN SIGHT.
- Author
-
Shannon, Elaine
- Subjects
- *
CRYPTOGRAPHY software , *COMPUTER software - Abstract
Features S-Tool, a software program executing digital steganography in the United States. Concept of digital steganography; Definition of steganography; Advantages and disadvantages of the software program.
- Published
- 2001
34. URL Pearls.
- Subjects
- *
COMPUTER software , *CRYPTOGRAPHY software , *DATA encryption , *DIGITAL watermarking , *DATA transmission systems , *COMPUTER hackers - Abstract
The article discusses covert channeling software. Loki is one of the most common channeling tools for Unix systems, and uses the transmission of seemingly normal packets to hide data. Reverse WWW shells place covert commands within HTTP requests, hiding secret data within traffic that appears to be routine Internet surfing. The author provides resources to learn more about covert channeling technology, as well as the prevalence of dark data/digital dark matter, cryptography, steganography, and digital watermarking.
- Published
- 2007
35. Crypography gets personal.
- Author
-
Loshin, Pete
- Subjects
- *
COMPUTER security software , *CRYPTOGRAPHY software - Abstract
Reviews several end-user crypography software tools as of November 1, 1997. Entrust/Solo; RSA SecurPC; Norton Your Eyes Only; Pretty Good Privacy; Microsoft Internet clients; Netscape Communicator; Microsoft's IE 4.0; Netscape's building of Secure Sockets Layer (SSL) into Navigator 1.0; Features; Vendor contact information. INSET: Tech focus..
- Published
- 1997
36. How secure is encrypted data?
- Author
-
Prosise, Jeff
- Subjects
CRYPTOGRAPHY software - Abstract
Focuses on the security of encrypted data. Discussions regarding WinCrypt; Practical lessons in decryption; Foolishness in placing absolute trust in encryption program; RSA.
- Published
- 1994
37. Under lock and key.
- Author
-
Graham-Rowe, Duncan
- Subjects
- *
DATA encryption software , *COMPUTER software , *COMPUTER security software , *CRYPTOGRAPHY software - Abstract
Discusses encryption software that encodes information so it can not be intercepted or read by anyone other than the person that it is supposed to receive it. Introduction of so-called key escrow, or government approved agencies that would hold encryption keys on behalf of citizens; Why the idea is not popular with people and businesses; The United States government's decision to relax export laws for encryption software.
- Published
- 1999
38. US may relax rules on encryption.
- Author
-
Ward, Mark
- Subjects
- *
CRYPTOGRAPHY software , *SEARCH engines , *CLIPPER (Microprocessor) - Abstract
Reports about the US government's willingness to discuss the issue of electronic security early September 1995 when it meets private and business users of cryptographic software to try and arrive at a policy acceptable to everyone. Vulnerability of Netscape, Internet browser; Views of Peter Shank, Netscape spokesman, on the subject; Flaws of the controversial Clipper chip.
- Published
- 1995
39. Java Security Architecture and Extensions.
- Author
-
Roth, Volker
- Subjects
- *
CRYPTOGRAPHY software , *APPLICATION program interfaces ,JAVA programming language software - Abstract
Provides information on the Java Cryptography Architecture (JCA), an application program interface software designed to provide a common interface for accessing basic cryptographic primitives. Goal of JCA; Correlation between JCA and Java Cryptography Extension (JCE); Features of JCA and JCE.
- Published
- 2002
40. Key-Management Infrastructure for Protecting Stored Data.
- Author
-
Martin, Luther
- Subjects
- *
COMPUTER security conferences , *COMPUTER security standards , *DATA security , *INFORMATION technology security , *CRYPTOGRAPHY software , *CRYPTOGRAPHY equipment industry - Abstract
This article discusses the development of a new key management systems standard, the IEEE P1619, by the Institute of Electrical & Electronics Engineers Inc. Security in Storage Working Group (SISWG). This standard simplifies the data storage system used in key management software. The SISWG developed this system as a chain of custody and security management system for the keys that are used to decrypt the data shared across online networks. Compliance with this standard, which will entail the establishment of a key-management server that controls the relationship between key-management client machines and actual cryptographic units, is discussed.
- Published
- 2008
- Full Text
- View/download PDF
41. The key to secure remote computing.
- Author
-
White, Andrew
- Subjects
- *
REMOTE computing , *CRYPTOGRAPHY software , *COMPUTER network security , *FIREWALLS (Computer security) , *COMPUTER viruses , *COMPUTER security software - Abstract
The article discusses technology to allow remote users secure access to enterprise applications. The possibility of natural and man-made disasters has exposed weaknesses in security approaches, while regulatory guidelines have made security management a challenge. Viruses, worms, and malware can infect corporate networks from home PCs. Using a highly portable, smart card-enabled cryptographic device that plugs into a USB port in a public key infrastructure (PKI) platform proves fully secure connectivity to enterprise applications from any PC. All data remain at the enterprise with no Internet exposure since they never leave the boundaries of the corporate firewall.
- Published
- 2006
42. Navy Beefing Up At-Sea Enterprise Network.
- Author
-
MACHI, VIVENNE
- Subjects
- *
ENTERPRISE networks (Telecommunications) , *INFORMATION warfare , *CRYPTOGRAPHY software , *STORAGE area networks (Computer networks) , *SECURITY systems - Abstract
The article discusses U.S. Navy's initiatives to improve its enterprise networks in preparation for power competition and information warfare with countries like Russia and China. It discusses the consolidated afloat networks and enterprise services program by defense technology firm Northrop Grumman, the cryptographic analysis, verification, exploration and synthesis contract from research firm Galois, and the storage server Hurricane S1U401- SHS from technology firm General Micro Systems.
- Published
- 2018
43. Google researchers help developers test cryptographic implementations.
- Author
-
Constantin, Lucian
- Subjects
CRYPTOGRAPHY software ,COMPUTER software testing ,DATA protection software ,SOFTWARE compatibility ,SECURITY systems - Abstract
The article focuses on a software testing tool developed by American technology company Google under Project Wycheproof. Topics discussed are test cases for cryptographic algorithms, including RSA, AES-GCM, and AES-EAX to find weaknesses in cryptographic libraries and implementations, protection against common attacks, portability to several programming languages.
- Published
- 2016
44. Heisenberg's certainty principle.
- Subjects
- *
QUANTUM theory , *VOTING , *PREVENTION of corrupt practices in elections , *CRYPTOGRAPHY software , *EQUIPMENT & supplies , *COMPUTER software ,SWISS politics & government, 1945- - Abstract
The article examines how Switzerland's election authorities used quantum cryptography to insure ballot security in that country's parliamentary elections on October 21, 2007. The technology manipulates the photons used for data transmission so that by the laws of quantum mechanics, they cannot be examined by a third party without destroying them. This will be the first large scale test of the technology, which has significant commercial potential.
- Published
- 2007
45. The quiet revolution.
- Author
-
Dreyfus, Suelette
- Subjects
- *
CRYPTOGRAPHY software , *DATA encryption , *HUMAN rights - Abstract
Focuses on the use of cryptography software by human rights organizations in Guatemala and Kosovo, Serbia to protect data on government abuses. Historical background on the use of encryption to record civil war and terror in Guatemala; Reasons of other organizations for not using cryptography; Views on the control in using cryptography.
- Published
- 2001
46. SHA-1 hashing algorithm could succumb to $75K attack, researchers say.
- Author
-
Sayer, Peter
- Subjects
HASHING ,ELECTRONIC file management ,ALGORITHMS ,CRYPTOGRAPHY software ,COMPUTER security - Abstract
The article reports a study indicating that the SHA-1 cryptographic hashing algorithm used in signing SSL certificates that secure major websites is prone to attack. Researchers including Thomas Peyrin of Nanyang University and Marc Stevens of Centrum Wiskunde and Informatica showed a way to simplify an identical prefix attack on SHA-1 which they estimated could only cost up to 120,000 dollars to do. The researchers recommended to phase out SHA-1.
- Published
- 2015
47. CryptoWall ransomware is back with new version after two months of silence.
- Author
-
Constantin, Lucian
- Subjects
DATA encryption ,RANSOMWARE ,NETWORK routers ,CRYPTOGRAPHY software - Abstract
The article offers information on the CryptoWall 3.0 file-encrypting ransomware program, which uses the Onion Router (Tor) and the Invisible Internet Project (I2P) anonymity networks. Topics include the use of cryptographic algorithm, the communication traffic of a user which passer through the I2P, and the launch of the Silk Road which is an online market for illegal goods and services.
- Published
- 2015
48. Crypto export laws loosened.
- Author
-
Kidman, Angus and Maher, William
- Subjects
DATA encryption laws ,CRYPTOGRAPHY software - Abstract
Reports on the United States government's plan to ease up laws restricting the export of strong cryptographic products. Proposed changes to the laws; Types of products affected; Arguments raised by the government in opposing the export of strong cryptography; Incentive for the change.
- Published
- 1999
49. Secret plans.
- Subjects
- *
CRYPTOGRAPHY software , *BANKING industry - Abstract
Discusses several aspects of encryption technology. Classification by the United States of cryptographic technology as munitions if they are being exported; Cruise missile technology and computer programs; The increasing uses for cryptology in banking and other areas; Challenge by Daniel Bernstein, a student at the University of California.
- Published
- 1995
50. Don't tell it to the Spartans (nor, indeed, to anyone else).
- Subjects
- *
COMPUTER network security , *CRYPTOGRAPHY software - Abstract
Says that dozens of firms are rushing to develop ways to send messages and conduct financial transactions safely on the Internet. Software encryption; Putting encryption machinery into a microchip; Hardware encryption; Advantages and disadvantages of the various methods.
- Published
- 1995
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.