WEKO3
アイテム
Provably-Secure Cancelable Biometrics Using 2-DNF Evaluation
https://ipsj.ixsq.nii.ac.jp/records/81812
https://ipsj.ixsq.nii.ac.jp/records/818127698b51b-b4cc-4419-b292-58fee0c32487
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2012 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | JInfP(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2012-04-15 | |||||||
タイトル | ||||||||
タイトル | Provably-Secure Cancelable Biometrics Using 2-DNF Evaluation | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | Provably-Secure Cancelable Biometrics Using 2-DNF Evaluation | |||||||
言語 | ||||||||
言語 | eng | |||||||
キーワード | ||||||||
主題Scheme | Other | |||||||
主題 | [Recommended Paper] biometric authentication, cancelable biometrics, provable security, homomorphic encryption | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
資源タイプ | journal article | |||||||
著者所属 | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属 | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属 | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属 | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属 | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属 | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Mitsubishi Electric Corporation | ||||||||
著者名 |
Mitsuhiro, Hattori
× Mitsuhiro, Hattori
|
|||||||
著者名(英) |
Mitsuhiro, Hattori
× Mitsuhiro, Hattori
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | Biometric authentication has been attracting much attention because it is more user-friendly than other authentication methods such as password-based and token-based authentications. However, it intrinsically comprises problems of privacy and revocability. To address these issues, new techniques called cancelable biometrics have been proposed and their properties have been analyzed extensively. Nevertheless, only a few considered provable security, and provably secure schemes known to date had to sacrifice user-friendliness because users have to carry tokens so that they can securely access their secret keys. In this paper, we propose two cancelable biometric protocols each of which is provably secure and requires no secret key access of users. We use as an underlying component the Boneh-Goh-Nissim cryptosystem proposed in TCC 2005 and the Okamoto-Takashima cryptosystem proposed in Pairing 2008 in order to evaluate 2-DNF (disjunctive normal form) predicate on encrypted feature vectors. We define a security model in a semi-honest manner and give a formal proof which shows that our protocols are secure in that model. The revocation process of our protocols can be seen as a new way of utilizing the veiled property of the underlying cryptosystems, which may be of independent interest. | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | Biometric authentication has been attracting much attention because it is more user-friendly than other authentication methods such as password-based and token-based authentications. However, it intrinsically comprises problems of privacy and revocability. To address these issues, new techniques called cancelable biometrics have been proposed and their properties have been analyzed extensively. Nevertheless, only a few considered provable security, and provably secure schemes known to date had to sacrifice user-friendliness because users have to carry tokens so that they can securely access their secret keys. In this paper, we propose two cancelable biometric protocols each of which is provably secure and requires no secret key access of users. We use as an underlying component the Boneh-Goh-Nissim cryptosystem proposed in TCC 2005 and the Okamoto-Takashima cryptosystem proposed in Pairing 2008 in order to evaluate 2-DNF (disjunctive normal form) predicate on encrypted feature vectors. We define a security model in a semi-honest manner and give a formal proof which shows that our protocols are secure in that model. The revocation process of our protocols can be seen as a new way of utilizing the veiled property of the underlying cryptosystems, which may be of independent interest. | |||||||
書誌レコードID | ||||||||
収録物識別子タイプ | NCID | |||||||
収録物識別子 | AA00700121 | |||||||
書誌情報 |
Journal of information processing 巻 20, 号 2, p. 496-507, 発行日 2012-04-15 |
|||||||
ISSN | ||||||||
収録物識別子タイプ | ISSN | |||||||
収録物識別子 | 1882-6652 | |||||||
出版者 | ||||||||
言語 | ja | |||||||
出版者 | 情報処理学会 |