Chen Progress on Cryptography

25 Years of Cryptography in China
2004
ISBN: 978-1-4020-7987-0
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 769, 261 Seiten, eBook

Reihe: The Springer International Series in Engineering and Computer Science

Cryptography in Chinese consists of two characters meaning "secret coded". Thanks to Ch'in Chiu-Shao and his successors, the Chinese Remainder Theorem became a cornerstone of public key cryptography. Today, as we observe the constant usage of high-speed computers interconnected via the Internet, we realize that cryptography and its related applications have developed far beyond "secret coding". China, which is rapidly developing in all areas of technology, is also writing a new page of history in cryptography. As more and more Chinese become recognized as leading researchers in a variety of topics in cryptography, it is not surprising that many of them are Professor Xiao's former students.

Progress on Cryptography: 25 Years of Cryptography in China is a compilation of papers presented at an international workshop in conjunction with the ChinaCrypt, 2004. After 20 years, the research interests of the group have extended to a variety of areas in cryptography. This edited volume includes 32 contributed chapters. The material will cover a range of topics, from mathematical results of cryptography to practical applications. This book also includes a sample of research, conducted by Professor Xiao's former and current students.

Progress on Cryptography: 25 Years of Cryptography in China is designed for a professional audience, composed of researchers and practitioners in industry. This book is also suitable as a secondary text for graduate-level students in computer science, mathematics and engineering.

Zielgruppe

Research

Autoren/Hrsg.

Chen, Kefei

Inhaltsverzeichnis

Foreword. Preface. Randomness and Discrepancy Transforms; Guang Gong. Legendre Sequences and Modified Jacobi Sequences; Enjian Bai, Bin Zhang Resilient Functions with Good Cryptographic Properties; Wen Qiao-yan, Zhang Jie. Differential Factoring for Integers; Chuan-Kun Wu. Simple and Efficient Systematic A-codes from Error Correcting Codes; Cunsheng Ding, Xiaojian nan, Xuesong Wang. On Coefficients of Binary Expression of Integer Sums; Bao Li, Zongduo Dai. A new publicly verifiable proxy sign-cryption scheme; Zhang Zhang, Qingkuan Dong, Mian Cai. Some New Proxy Signature Schemes from Pairings; Fangguo Zhang, R. Safavi-Naini, Chih-Yin Lin. Construction of Digital Signature Schemes Based on DLP; Wei-Zhang Du , Kefei Chen. DLP-based blind signatures and their application in E-Cash systems; Weidong Qiu. A Group of Threshold Group-Signature Schemes with Privilege Subsets; Chen Weidong, Feng Dengguo. A New Group Signature Scheme with Unlimited Group Size; Fu Xiaotong, Xu Chunxiang. Identity Based Signature Scheme Based on Quadratic Residues; Weidong Qiu, Kefei Chen. New Signature Scheme Based on Factoring and Discrete Logarithms; Shimin Wei. New Transitive Signature Scheme based on Discreted Logarithm Problem; Zichen Li, Juanmei Zhang, Dong Zheng. Blind signature schemes based on GOST signature; Zhenjie Huang, Yumin Wang. One-off Blind Public Key; Zhang Qiupu, Guo Baoan. Analysis on the two classes of Robust Threshold Key Escrow Schemes; Feng Dengguo, Chen Weidong. Privacy-Preserving Approximately Equation Solving over Reals; Zhi Gan, Qiang Li, Kefei Chen. An Authenticated Key Agreement Protocol Resistant to DoS attack; Lu Haining, Gu Dawu. A comment on a multi-signature scheme; Zheng Dong, Chen Kefei, He Liangsheng. Cryptanalysis of LKK Proxy Signature; Zheng Dong, Liu Sheng/i, Chen Kefei. Attack on Identity-Based Broadcasting Encryption Schemes; Sheng/i Liu, Zheng Dong, Kefei Chen. Differential-Linear Cryptanalysis of Camellia; Wen/inK Wu; Dengguo Feng. Security Analysis of EV-DO System; Zhu, Hong Ru. A Remedy of Zhu-Lee-Deng's Public Key Cryptosystem; Huafei Zhu, Yongjian Liao. Quantum cryptographic algorithm for classical binary information; Nanrun Zhou, Guihua Zeng. Practical Quantum Key Distribution Network; Jie Zhu, Guihua Zeng. A Survey of P2P Network Security Issues based on Protocol Stack; Zhang Dehua, Zhang Yuqing. DDoS Scouter: A simple IP traceback scheme; Chen Kai, Hu Xiaoxin, Hao Ruibing. A Method of Digital Data Transformation-Base91; He Dake, He Wei. An approach to the formal analysis of TMN protocol; Zhang Yu-Qing, Liu Xiu-fing.

Leseproben

Simple and Efficient Systematic A-codes from Error Correcting Codes (p. 33-34)

Cunsheng Ding, Xiaojian Tian, Xuesong Wang

Abstract: In this paper, we present a simple and generic construction of systematic authentication codes which are optimal with respect to several bounds. The construction is based on error correcting codes. The authentication codes provide the best level of security with respect to spoofing attacks of various orders, including the impersonation and substitution attacks. The encoding of source states and the authentication verification are very simple and are perhaps the most efficient among all authentication systems.

Keywords: authentication codes, cryptography, linear codes.


1. Introduction

Nowadays authentication and secrecy of messages are two basic security requirements in many computer and communication systems, and therefore two important areas in cryptography. Authentication codes are designed to provide sender and message authentication, and dates back to 1994 when Gilbert, MacWilliams and Sloane published the first paper in this area [see Gilbert, MacWilliams, Sloane, 1974]. Later Simmons [Simmos, 1984] developed a theory of unconditional authentication, which is analogous to Shannon’s theory of unconditional secrecy [Shannon, 1949].

During the last tweenty years codes that provide authentication and/or secrecy have been considered, and bounds and characterizations of these codes have been established, see, for example, [Gilbert, MacWilliams, Sloane, 1974], [Stinson 1990], [Casse, Martin, and Wild, 1998]. Most existing optimal authentication codes are constructed from combinatorial designs, and seem hard to implement. Even if some of them can be implemented in software or hardware, the implementation may not be efficient. In addition, these authentication codes provide protection against the imperson ation and substitution attacks, but may not provide protection against spoofing attacks of order more than 1.

The purpose of this paper is to present a simple and generic construction of systematic authentication codes with the following properties:

* The authentication codes are optimal with respect to certain bounds.

* They offer the best security with respect to not only impersonation and substitution atacks, but also spoofing attacks of higher orders.

* The encoding of source states and authentication are extremely efficient and can be easily implemented in both software and hardware.

The construction of authentication codes presented here is based on error correcting codes, and is different from other constructions of authentication codes, see [Bierauer 1997], [Bierbrauer, Johansson, Kabatianskii and Smeets 1993], [Gilbert, Mac Williams, Sloane, 1974], [Kabatianskii, Smeets, and Johansson, 1996], [Simmons 1984], [Safavi-Naini and Seberry 1991], [Safavi-Naini, Wang and Xing 2001], using error correcting codes, in the sense that error correcting codes are employed to construct only the source states here in this paper.