Distributed pair programming (DPP) supports two programmers to work on the same task from different locations. One programmer acting as the driver controls the keyboard and mouse to actively write code or design docum...
详细信息
ISBN:
(纸本)9781424463886;9780769539874
Distributed pair programming (DPP) supports two programmers to work on the same task from different locations. One programmer acting as the driver controls the keyboard and mouse to actively write code or design document. The other partner as the navigator helps plan as well as identifies and prevents any syntactic or strategic deficiencies in code or design document. This paper first reviews the existing DPP tools and how to increase the compatibility of pair programmers. Then some pilot experiment results are proposed of pair programming with 53 students in Software engineering course. Finally, the paper analyzes the compatibility problems of pair programming such as gender, time management, and active learning outside the classroom, which are resolved by the DPP, and some basic requirements of the DPP system are given.
Two types of miniature shielded-loop type magnetic probes were used to analyze RF magnetic near field on the ISO/IEC 18033-3 Standard Cryptographic LSI made by 0.13 μm CMOS process with clock frequency of 24 MHz. The...
详细信息
Two types of miniature shielded-loop type magnetic probes were used to analyze RF magnetic near field on the ISO/IEC 18033-3 Standard Cryptographic LSI made by 0.13 μm CMOS process with clock frequency of 24 MHz. The 180 × 180 μm 2 -size on-chip shielded loop probe we developed was applied to scan the magnetic near field on the LSI and clarified that the magnetic filed is strong not only on the targeting cryptographic circuit. Such a detailed map was depicted for the first time for cryptographic LSI. Then the differential electromagnetic analysis (DEMA) was performed with the shielded-loop probe (1000 × 500 μm 2 , CP-2S, NEC). All the BITEs of 16-BYTEs long secret key are decrypted by using only 1×10 4 waveform data in case the waveform is measured closely to the cryptographic circuit whereas the error rate does not converge to zero until the waveform number reaches 3×10 4 if the data were extracted far away from the circuit. As the countermeasure against DEMA, 25 μm thick magnetic film (μr=50 at 1MHz, NEC Tokin Co, type E25) was attached on top of bare LSI chip to suppress magnetic field intensity by 6 dB, which can be a good candidate to protect cryptographic LSI from side channel attack.
A Boolean function is k-normal if it is constant on a k-dimensional flat of its domain. This paper demonstrates that k-normality of a Boolean function can be exploited to mount a dedicated algebraic attack on a stream...
详细信息
A Boolean function is k-normal if it is constant on a k-dimensional flat of its domain. This paper demonstrates that k-normality of a Boolean function can be exploited to mount a dedicated algebraic attack on a stream cipher of the nonlinear filter generator type, which employs a k-normal Boolean function as its filter function. The cryptanalysis is based on the possibility for pre-computing a table of the state-key stream pairs via solving certain system of algebraic equations as a consequence of the employed k-normal Boolean function. This pre-computed table is the main origin for mounting the cryptanalysis and it is independent of a the sample for cryptanalysis and the secret key employed for generating the sample.
Visual cryptography is a cryptographic technique which emerges in the informationsecurity domain in recent years. Each of the sharing sub-keys may be a stochastic noise image or a significative image with no informat...
详细信息
Visual cryptography is a cryptographic technique which emerges in the informationsecurity domain in recent years. Each of the sharing sub-keys may be a stochastic noise image or a significative image with no information on the original key. But a mass of sub-keys have to be saved actually, which faces the problem of inconvenient discrimination and management. This paper presents a visual cryptography scheme based on the digital signature for image discrimination and management, applying the digital signature and the time-stamp technology to the visual cryptography scheme. The scheme both solves the problem on the storage and management of the sharing sub-keys, increases the verification of image contents, thus enhances the validity of storage and management without security effect.
Providing integrity of execution is considered as the most challenging problem in Mobile Agent System (MAs). Mobile agent watermarking (MAW) is a technique that attempts to provide integrity of execution to a mobile a...
详细信息
ISBN:
(纸本)9781605586427
Providing integrity of execution is considered as the most challenging problem in Mobile Agent System (MAs). Mobile agent watermarking (MAW) is a technique that attempts to provide integrity of execution to a mobile agent. We discuss the attacks against MAW technique and how the security properties for MAs data integrity are fulfilled. We try to model the behavior of a malicious host by launching a series of passive attacks against mobile agent and then see to what extent the security properties for mobile agent can be achieved. The experimental results suggest that MAW framework can be used to protect the computations results of mobile agents Copyright 2009 ACM.
Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification,...
详细信息
Partially blind signature is a variant of blind signature. It allows a signer to explicitly include common information in a blind signature under some agreement with a receiver. It provides anonymity of users in appli...
详细信息
Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification,...
详细信息
ISBN:
(纸本)9780769537443
Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification, each shareholder keeps both x-coordinate and y-coordinate of a polynomial as private share. In our second modification, dealer uses polynomial with degree larger than the threshold value t to generate shares for a (t, n) threshold scheme. We show that these two modified schemes are ideal and perfect. Using these two modifications, we design a multilevel threshold secret sharing schemes (MTSS). We prove that the proposed scheme is secure.
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed) require supplementary component...
详细信息
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed) require supplementary components to be added onto the original key pairs of the schemes. In addition, some of them can only be applied to a certain type of signature schemes. In this paper, we propose a new generic transformation technique which converts any unforgeable signature scheme into a strongly unforgeable one without modifying any component in the original key pair. This makes our technique especially compatible for practical use. Our technique is based on strong one-time signature schemes. We show that they can be constructed efficiently from any one-time signature scheme that is based on one-way functions. The performance of our technique also compares favorably with that of current ones. Besides, it is shown in this paper that our transformation can further be applied to schemes satisfying only a weak variant of unforgeability without any further modification. Furthermore, our technique can also be used for constructing strongly unforgeable signature schemes in other cryptographic settings which include certificateless signature, identity-based signature, and several others. To the best of our knowledge, similar extent of versatility is not known to be supported by any of those comparable techniques. Finally and of independent interest, we show that our generic transformation technique can be modified to an on-line/off-line signature scheme, which possesses a very efficient signing process.
Parallel approach is an important way to improve the performance of networked based intrusion detection system. A parallel architecture of intrusion detection system based on the ideas of combining twice data-flow par...
详细信息
Parallel approach is an important way to improve the performance of networked based intrusion detection system. A parallel architecture of intrusion detection system based on the ideas of combining twice data-flow partition with real-time load balancing feedback is presented. The components of data-flow partition and its optimized algorithm are designed and implemented. The experiment shows that the architecture may have higher speed and lower packet loss in high-speed network circumstance. Thus, it may raise the speed of data transmission and improve the efficiency of parallel intrusion detection.
暂无评论