ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(ジャーナル)
  2. Vol.53
  3. No.4

Provably-Secure Cancelable Biometrics Using 2-DNF Evaluation

https://ipsj.ixsq.nii.ac.jp/records/81784
https://ipsj.ixsq.nii.ac.jp/records/81784
9e398ed5-3d7c-43c7-bc25-5fac6da589c0
名前 / ファイル ライセンス アクション
IPSJ-JNL5304026.pdf IPSJ-JNL5304026 (389.8 kB)
Copyright (c) 2012 by the Information Processing Society of Japan
オープンアクセス
Item type Journal(1)
公開日 2012-04-15
タイトル
タイトル Provably-Secure Cancelable Biometrics Using 2-DNF Evaluation
タイトル
言語 en
タイトル Provably-Secure Cancelable Biometrics Using 2-DNF Evaluation
言語
言語 eng
キーワード
主題Scheme Other
主題 一般論文
資源タイプ
資源タイプ識別子 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

Search repository
Nori, Matsuda

× Nori, Matsuda

Nori, Matsuda

Search repository
Takashi, Ito

× Takashi, Ito

Takashi, Ito

Search repository
Yoichi, Shibata

× Yoichi, Shibata

Yoichi, Shibata

Search repository
Katsuyuki, Takashima

× Katsuyuki, Takashima

Katsuyuki, Takashima

Search repository
Takeshi, Yoneda

× Takeshi, Yoneda

Takeshi, Yoneda

Search repository
著者名(英) Mitsuhiro, Hattori

× Mitsuhiro, Hattori

en Mitsuhiro, Hattori

Search repository
Nori, Matsuda

× Nori, Matsuda

en Nori, Matsuda

Search repository
Takashi, Ito

× Takashi, Ito

en Takashi, Ito

Search repository
Yoichi, Shibata

× Yoichi, Shibata

en Yoichi, Shibata

Search repository
Katsuyuki, Takashima

× Katsuyuki, Takashima

en Katsuyuki, Takashima

Search repository
Takeshi, Yoneda

× Takeshi, Yoneda

en Takeshi, Yoneda

Search repository
論文抄録
内容記述タイプ 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.

------------------------------
This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.20.496
------------------------------
論文抄録(英)
内容記述タイプ 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.

------------------------------
This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.20.496
------------------------------
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN00116647
書誌情報 情報処理学会論文誌

巻 53, 号 4, 発行日 2012-04-15
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7764
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-20 06:51:43.820466
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3