Yen-Ping Chu

A new multi-secret images sharing scheme using Largrange's interpolation

Secret sharing is to send shares of a secret to several participants, and the hidden secret can be decrypted only by gathering the distributed shares. This paper proposes an efficient secret sharing scheme using Largranges interpolation for generalized access structures. Furthermore, the generated shared data for each qualified set is 1/(r-1) smaller than the original secret image if the corresponding qualified set has r participants. In our sharing process, a sharing circle is constructed first and the shared data is generated from the secret images according to this sharing circle. The properties of the sharing circle not only reduce the size of generated data between two qualified sets but also maintain the security. Thus the actual ratio of the shared data to the original secret images is reduced further. The proposed scheme offers a more efficient and effective way to share multiple secrets.

Improvement of Authenticated Encryption Schemes with Message Linkages for Message Flows*This research was partially supported by the National Science Council, Taiwan, R.O.C., under contract no.: NSC91-2213-E-324-003.

An authenticated encryption scheme provides a mechanism of signing and encrypting simultaneously, and furthermore, the receiver can verify and decrypt the signature at the same time. Tseng et al. proposed two efficiently authenticated encryption schemes which can check the validity of the sent data before message recovery, but in fact their schemes cannot achieve completely the function. In this article, we point out the flaw and propose an improved scheme of revision.

A Generic Application Sharing Architecture Based on Message-Oriented Middleware Platform

Previous application sharing systems have no unified communication protocols. The well known application sharing protocols include RFB (Remote FrameBuffer), RDP (Remote Desktop Protocol) and ITU-T T.128. A generic application sharing architecture is proposed for providing the capability of connecting various application sharing servers with the same application sharing client. A communication standard for application sharing systems is defined based on the Message-Oriented Middleware (MOM). To compare with previous application sharing systems, there are many advantages including easy to use, easy to connect, easy to integrate, higher scalability and less bandwidth consumption.

A generic application sharing architecture based on message-oriented middleware platform

Previous application sharing systems have no unified communication protocols. The well known application sharing protocols include RFB (remote framebuffer), RDP (remote desktop protocol) and ITU-T T.128. A generic application sharing architecture is proposed for providing the capability of connecting various application sharing servers with the same application sharing client. A communication standard for application sharing systems is defined based on the message-oriented middleware (MOM). To compare with previous application sharing systems, there are many advantages including easy to use, easy to connect, easy to integrate, higher scalability and less bandwidth consumption

Object finding system based on RFID technology

Locations of moving or missing objects are getting important information for context-aware applications which try to get the locality of an object, and then provide services pertaining to the object. To position an object, most systems use a predefined coordinate to compute object location while sensing the appearance of the target object. Usually, it is troublesome and costs much to define the base coordinate in advance for most object positioning systems, especially when the target object is locating in an unknown environment. To reduce the cost and complexity of object locating system and improve the accuracy of location, this paper proposed an Object Finding System based on RFID technology to identify the localities of target objects in buildings. In this paper, we introduce the design concepts of the proposed system as well as the algorithms used to calculate the object locations. In addition, the experimental results show that it is a feasibility study.

SARS-CoV infection was from at least two origins in the Taiwan area

Objective: Severe acute respiratory syndrome (SARS) is caused by a new coronavirus. Genomic sequence analysis will provide the molecular epidemiology and help to develop vaccines. Methods: We developed a rapid method to amplify and sequence the whole SARS-CoV genome from clinical specimens. The technique employed one-step multiplex RT-PCR to amplify the whole SARS-CoV genome, and then nested PCR was performed to amplify a 2-kb region separately. The PCR products were sequenced. Results: We sequenced the genomes of SARS-CoV from 3 clinical specimens obtained in Taiwan. The sequences were similar to those reported by other groups, except that 17 single nucleotide variations and two 2-nucleotide deletions, and a 1-nucleotide deletion were found. All the variations in the clinical specimens did not alter the amino acid sequence. Of these 17 sequenced variants, two loci (positions 26203 and 27812) were segregated together as a specific genotype – T:T or C:C. Phylogenetic analysis showed two major clusters of SARS patients in Taiwan. Conclusion: We developed a very economical and rapid method to sequence the whole genome of SARS-CoV, which can avoid cultural influence. From our results, SARS patients in Taiwan may be infected from two different origins.

A neural-based boolean function generator

Abstract A neural technique is used to implement a positive logic boolean function. The neural technique is a modified perceptron learning algorithm by which a boolean function can be generated. The connected weight values in the neural network represents the sum of product terms of a boolean function. The paper is divided into four parts. First, a neural network technique to generate functional-link cells for successful learning is provided. Second, an improved method is described to decrease the required number of functional-link cells for successful learning. Third, the algorithm is described and proved. Finally, a functional hardware diagram is proposed to illustrate the overall structure and an example is taken to validate its effectiveness.