An Efficient Authentication for Lightweight Devices by Perfecting Zero-Knowledgeness
スポンサーリンク
概要
- 論文の詳細を見る
We present a new methodology for constructing an efficient identification scheme, and based on it, we propose a lightweight identification scheme whose computational and storage costs are sufficiently low even for cheap devices such as RFID tags. First, we point out that the efficiency of a scheme with statistical zero-knowledgeness can be significantly improved by enhancing its zero-knowledgeness to perfect zero-knowledge. Then, we apply this technique to the Girault-Poupard-Stern (GPS) scheme which has been standardized by ISO/IEC. The resulting scheme shows a perfect balance between communication cost, storage cost, and circuit size (computational cost), which are crucial factors for implementation on RFID tags. Compared to GPS, the communication and storage costs are reduced, while the computational cost is kept sufficiently low so that it is implementable on a circuit nearly as small as GPS. Under standard parameters, the provers response is shortened 80 bits from 275 bits to 195 bits and in application using coupons, storage for one coupon is also reduced 80 bits, whereas the circuit size is estimated to be larger by only 335 gates. Hence, we believe that the new scheme is a perfect solution for fast authentication of RFID tags.
著者
-
SANTOSO Bagus
Research Center for Information Security, National Institute of Advanced Industrial Science and Tech
-
OHTA Kazuo
Dept. of Informatics, The University of Electro-Communications
-
SAKIYAMA Kazuo
Dept. of Informatics, The University of Electro-Communications
-
HANAOKA Goichiro
Research Center for Information Security, National Institute of Advanced Industrial Science and Tech
関連論文
- An Efficient Authentication for Lightweight Devices by Perfecting Zero-Knowledgeness
- Sequential Bitwise Sanitizable Signature Schemes
- Extension of Broadcasting Service by Using Electronic Tokens(Contents Technology and Web Information Systems)
- Unconditionally Secure Chaffing-and-Winnowing
- Factorization of Square-Free Integers with High Bits Known
- A New 'On the Fly' Identification Scheme : An Asymptoticity Trade-Off between ZK and Correctness
- Invisibly Sanitizable Digital Signature Scheme
- CCA-Secure Public Key Encryption without Group-Dependent Hash Functions
- Security Tightness Evaluation of Fujisaki-Okamoto Conversion in Identity Based Encryption
- Relations among Notions of Security for Identity Based Encryption Schemes (特集:ユビキタス社会を支えるコンピュータセキュリティ技術)
- Towards Security Enhancement with Efficient Reduction for Identity Based Encryption
- An Efficient Authentication for Lightweight Devices by Perfecting Zero-Knowledgeness
- Sequential Bitwise Sanitizable Signature Schemes