Data Protection Methods Research Articles

Tokenization and Other Methods of Security for Cardholder Data

ABSTRACT This paper compares the relative security strengths and practical use of tokenization with other cardholder data protection methods including truncation, masking, encryption, hash, and keyed hash. The usefulness of each method is described, and the subtle security weaknesses of combining methods are explored. Further, the inherent complexities of using cryptographic methods with sound key management practices are also presented.

THE RESEARCH OF MUTUAL INFLUENCE OF COMPRESSION AND ENCIPHERING PROCEDURES FOR INFORMATIVE MESSAGES

The analysis of dependence of efficiency of methods of data protection from statistical descriptions of messages is provided. The entropy characteristics of messages are considered: the entropy of plaintext of related to the ciphertext, which characterize the unreliability of cryptosystem; entropy of the uncompressed message, which determine its surplus. The mathematical model of procedure of research of influence of combination of procedures of compression and enciphering on firmness of plaintext and degree of compression is created. The formed model is realized with the programmatic facilities of Cryptool. The statistical characteristics of initial and modified texts are calculated.

UID Project: The 1984 of Our Times?

With the rapid modernization of our governance systems as is evidenced by the introduction of the Unique Identity Project spearheaded by the Unique Identification Authority of India under the Planning Commission, there is an urgent need to update our jurisprudence on the understanding of the right to privacy and data protection methods. There are many dangers attendant to the introduction of IT into governance the most common being loss of privacy and increasing risks of data theft and loss. Though the law on data protection vis a vis private interference is well developed in India, there are no measures to limit government intrusion and mismanagement of sensitive private data of individuals. The present paper seeks to first identify some axiomatic and fundamental rights of an individual as are entrenched in foreign jurisdictions with respect to privacy laws and then subsequently emphasizes the need to mould this understanding of privacy and data protection in our jurisprudence, as to make sure that progressive measures such as the UID Project see the light of day. The author has tried charting out the discourse of the right to privacy law in our jurisprudence and makes a case for introduction of information privacy within the present framework, of which data protection laws form a significantly large part.

Flexible Hardware Processor for Elliptic Curve Cryptography Over NIST Prime Fields

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Exchange of private information over a public medium must incorporate a method for data protection against unauthorized access. Elliptic curve cryptography (ECC) has become widely accepted as an efficient mechanism to secure sensitive data. The main ECC computation is a scalar multiplication, translating into an appropriate sequence of point operations, each involving several modular arithmetic operations. We describe a flexible hardware processor for performing computationally expensive modular addition, subtraction, multiplication, and inversion over prime finite fields <formula formulatype="inline"><tex Notation="TeX">$GF(p)$</tex> </formula>. The proposed processor supports all five primes <formula formulatype="inline"> <tex Notation="TeX">$p$</tex></formula> recommended by NIST, whose sizes are 192, 224, 256, 384, and 521 bits. It can also be programmed to automatically execute sequences of modular arithmetic operations. Our field-programmable gate-array implementation runs at 60 MHz and takes between 4 and 40 ms (depending on the used prime) to perform a typical scalar multiplication. </para>

On the disclosure risk of multivariate microaggregation

The aim of data protection methods is to protect a microdata file both minimizing the disclosure risk and preserving the data utility. Microaggregation is one of the most popular such methods among statistical agencies. Record linkage is the standard mechanism used to measure the disclosure risk of a microdata protection method. However, only standard, and quite generic, record linkage methods are usually considered, whereas more specific record linkage techniques can be more appropriate to evaluate the disclosure risk of some protection methods. In this paper we present a new record linkage technique, specific for microaggregation, which obtains more correct links than standard techniques. We have tested the new technique with MDAV microaggregation and two other microaggregation methods, based on projections, that we propose here for the first time. The direct consequence is that these microaggregation methods have a higher disclosure risk than believed up to now.

RAID0.5: design and implementation of a low cost disk array data protection method

RAID has long been established as an effective way to provide highly reliable as well as high-performance disk subsystems. However, reliability in RAID systems comes at the cost of extra disks. In this paper, we describe a mechanism that we have termed RAID0.5 that enables striped disks with very high data reliability but low disk cost. We take advantage of the fact that most disk systems use offline backup systems for disaster recovery. With the use of these offline backup systems, the disk system needs to only replicate data since the last backup, thus drastically reducing the storage space requirement. Though RAID0.5 has the same data loss characteristics of traditional mirroring, the lower storage space comes at the cost of lower availability. Thus, RAID0.5 is a tradeoff between lower disk cost and lower availability while still preserving very high data reliability. We present analytical reliability models and experimental results that demonstrate the enhanced reliability and performance of the proposed RAID0.5 system.

Methods of Observing and Correcting Errors in Data-Acquisition Storage and Transmission Systems

Data protection methods are compared for measurements systems, which are based on the use of error-correcting codes, which can correct errors of given multiplicity and observe the maximum number of uncorrectable errors.

Disclosure control for demographic statistics Redefined guidelines and development of methods at statistics Finland

New IT applications do not only facilitate but also diversify the use of statistics. However, data protection may be an obstacle to dissemination of data. This paper describes some efforts to correspond better to the needs rising from the changing demand especially concerning small area statistics in Finland. The proposals set forth by the personal data protection workgroup for redefined data protection guidelines is presented. In addition, a new data protection method under development is introduced. This method is chiefly based on distribution of detailed geographic information.

Controlled Operation-Based Fast Methods of Data Protection in Automated Control Systems

A new controlled operation-based approach was proposed to construct fast algorithms of information processing to tackle efficiently the topical problems of information protection in high-performance automated control systems. Design criteria were discussed, and the algebraic and probabilistic characteristics of the controlled dyadic operations were studied. Consideration was given to the promising methods of encryption for wide application in the information-protection facilities of the automated control systems.

Error detection and correction with the IDT49C466

Until recently parity has been the traditional method of data protection. Parity, however, has several drawbacks: it masks out even bit errors, it cannot locate the bit in error and beyond a certain buswidth it can become inefficient. These factors have led to the development of a new breed of devices for data protection. Error detection and correction circuits (EDSs or EDACs) are today's response to the growing need for greater data reliability. They afford a greater level of protection than that offered by parity, by using a higher order error correction code (modified Hamming code).

Crypto management made manageable — Demands on crypto equipment design

Encryption is a very useful method for data protection, but its use is often made unnecessarily difficult by products which are not adjusted to common situations in the real world. Products should be highly modularized, with encryption/decryption, key management and protocol-dependent adjustments clearly kept apart. Then products can be further refined to meet specific customer demands on physical security, encrypted communications between “dumb” and “intelligent” terminals and nodes, true end-to-end encryption in complicated networks, etc. All this is necessary if encryption is ever to be of real use in the computer world.

The IPS cryptographic programs

Cryptographic methods of data protection have taken on new importance as computers have become faster and as strong cryptographic algorithms, such as the Data Encryption Standard (DES), have become available. But a standard encipherment technique is only the first step in applying cryptography in a computing center. This paper discusses the Information Protection System (IPS), a set of cryptographic application programs designed to use the DES algorithm in a working computing center. In designing IPS, several important augmentations of DES were formulated. IPS was first implemented to help increase computing-center security at the IBM Thomas J. Watson Research Center and is now widely installed at other IBM locations. IPS is not an IBM product and is not available for use outside IBM, but many cryptographic techniques in IPS were incorporated into the IBM cryptographic products announced in 1977.