The search functionality is under construction.

The search functionality is under construction.

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 prover's 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.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.1 pp.92-103

- Publication Date
- 2011/01/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E94.A.92

- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)

- Category
- Identification

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Bagus SANTOSO, Kazuo OHTA, Kazuo SAKIYAMA, Goichiro HANAOKA, "An Efficient Authentication for Lightweight Devices by Perfecting Zero-Knowledgeness" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 1, pp. 92-103, January 2011, doi: 10.1587/transfun.E94.A.92.

Abstract: 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 prover's 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.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.92/_p

Copy

@ARTICLE{e94-a_1_92,

author={Bagus SANTOSO, Kazuo OHTA, Kazuo SAKIYAMA, Goichiro HANAOKA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={An Efficient Authentication for Lightweight Devices by Perfecting Zero-Knowledgeness},

year={2011},

volume={E94-A},

number={1},

pages={92-103},

abstract={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 prover's 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.},

keywords={},

doi={10.1587/transfun.E94.A.92},

ISSN={1745-1337},

month={January},}

Copy

TY - JOUR

TI - An Efficient Authentication for Lightweight Devices by Perfecting Zero-Knowledgeness

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 92

EP - 103

AU - Bagus SANTOSO

AU - Kazuo OHTA

AU - Kazuo SAKIYAMA

AU - Goichiro HANAOKA

PY - 2011

DO - 10.1587/transfun.E94.A.92

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E94-A

IS - 1

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - January 2011

AB - 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 prover's 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.

ER -