National Institute of Standards and Technology における超伝導研究及び生活

The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

A new 1D chaotic system for image encryption

A chaos-based symmetric image encryption scheme using a bit-level permutation

A new color image encryption using combination of the 1D chaotic map

Boolean-operation-based secret image sharing (BSIS), which aims to encode a secret image into some shared images and discloses the original secret image later, has drawn more and more attention in academia. Since Chen and Wu pioneer in proposing the Boolean-operation-based multiple secret image sharing (BMSIS) scheme, there more and more BMSIS schemes proposed in the literature. In order to remove the limitation that in the existing BMSIS schemes, this paper presents Boolean-operation-based multiple-secret image sharing with general access structure for secret reconstruction. Compared with the existing related BMSIS schemes with the property of all-or-nothing reconstruction, the proposed scheme achieves a milestone, i.e., secrets can be reconstructed by the pre-defined access structure. Hence, the secret reconstruction no longer needs to collect all share images. Furthermore, distinct combinations of shares have the ability to disclose the secrets defined in the qualified set. The theoretical analysis and the experimental results demonstrate the proposed scheme does work.

Multiple secret image sharing with general access structure

Visual multiple-secret sharing for flexible general access structure by random grids

Remarks on some signature schemes based on factoring and discrete logarithms

The invention of public-key cryptography makes many new network applications, such as electronic commerce (CE), possible. However, the widely used Internet is open and unprotected. Therefore, verifying the legitimacy of an individual's public key is very important. Most of the key authentication schemes require one or more trustworthy authorities to authenticate the key of a user. Consequently, the system security is mainly dependent on the honesty of these third parties. Unfortunately, a security solution in wide area networks (for example, the Internet) often cannot be applied to local area networks directly without any modification. Sometimes, a complete rebuild is necessary, especially for performance criteria consideration. In this paper, we propose two simple key authentication schemes that require no certification authorities for computer systems in local area networks, in which a host is responsible for user authentication and it uses a designated password authentication mechanism.

/pdf/public-key-authentication-schemes-for-local-area-networks-45fj3oms0s.pdf

Tzung-Her Chen

Papers

Multiple secret image sharing with general access structure

Visual multiple-secret sharing for flexible general access structure by random grids

Remarks on some signature schemes based on factoring and discrete logarithms

Public Key Authentication Schemes for Local Area Networks

Color image authentication with tamper detection and remedy based on BCH and Bayer Pattern