WEKO3
アイテム
User Identification of Pseudonyms without Identity Information Exposure - A Scenario in Access Federations
https://ipsj.ixsq.nii.ac.jp/records/183022
https://ipsj.ixsq.nii.ac.jp/records/183022a5ff6de1-e4a2-4447-abfb-0d47e078d539
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2017 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Journal(1) | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2017-08-15 | |||||||||||
タイトル | ||||||||||||
タイトル | User Identification of Pseudonyms without Identity Information Exposure - A Scenario in Access Federations | |||||||||||
タイトル | ||||||||||||
言語 | en | |||||||||||
タイトル | User Identification of Pseudonyms without Identity Information Exposure - A Scenario in Access Federations | |||||||||||
言語 | ||||||||||||
言語 | eng | |||||||||||
キーワード | ||||||||||||
主題Scheme | Other | |||||||||||
主題 | [特集:Applications and the Internet in Conjunction with Main Topics of COMPSAC 2016(推薦論文)] access federation, SAML, privacy protection, pseudonym | |||||||||||
資源タイプ | ||||||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
資源タイプ | journal article | |||||||||||
著者所属 | ||||||||||||
The University of Tokyo | ||||||||||||
著者所属 | ||||||||||||
Kyoto University | ||||||||||||
著者所属 | ||||||||||||
National Institute of Informatics | ||||||||||||
著者所属(英) | ||||||||||||
en | ||||||||||||
The University of Tokyo | ||||||||||||
著者所属(英) | ||||||||||||
en | ||||||||||||
Kyoto University | ||||||||||||
著者所属(英) | ||||||||||||
en | ||||||||||||
National Institute of Informatics | ||||||||||||
著者名 |
Hiroyuki, Sato
× Hiroyuki, Sato
× Yasuo, Okabe
× Motonori, Nakamura
|
|||||||||||
著者名(英) |
Hiroyuki, Sato
× Hiroyuki, Sato
× Yasuo, Okabe
× Motonori, Nakamura
|
|||||||||||
論文抄録 | ||||||||||||
内容記述タイプ | Other | |||||||||||
内容記述 | The concept and design of access federations have been widely accepted and their world-wide deployment is in progress. In an access federation, control of user information (personal identification information) is a key issue in its operation in terms of privacy. Pseudonym is proposed and implemented as a solution to this problem. We consider the case where the requirement of privacy protection by using pseudonyms and that of user identification for service providing conflict with each other. In this paper, we propose a “counting server” for the identification of different pseudonyms or social identities. SPs can use this identification information to provide special services such as student discount and limit of use. We also show an implementation of this scheme on Shibboleth/SAML platforms. Related protocols are designed, another SAML engine is provided on SP, and a counting server is provided. Furthermore, we analyze this scheme, and prove the security properties. ------------------------------ 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.25(2017) (online) DOI http://dx.doi.org/10.2197/ipsjjip.25.788 ------------------------------ |
|||||||||||
論文抄録(英) | ||||||||||||
内容記述タイプ | Other | |||||||||||
内容記述 | The concept and design of access federations have been widely accepted and their world-wide deployment is in progress. In an access federation, control of user information (personal identification information) is a key issue in its operation in terms of privacy. Pseudonym is proposed and implemented as a solution to this problem. We consider the case where the requirement of privacy protection by using pseudonyms and that of user identification for service providing conflict with each other. In this paper, we propose a “counting server” for the identification of different pseudonyms or social identities. SPs can use this identification information to provide special services such as student discount and limit of use. We also show an implementation of this scheme on Shibboleth/SAML platforms. Related protocols are designed, another SAML engine is provided on SP, and a counting server is provided. Furthermore, we analyze this scheme, and prove the security properties. ------------------------------ 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.25(2017) (online) DOI http://dx.doi.org/10.2197/ipsjjip.25.788 ------------------------------ |
|||||||||||
書誌レコードID | ||||||||||||
収録物識別子タイプ | NCID | |||||||||||
収録物識別子 | AN00116647 | |||||||||||
書誌情報 |
情報処理学会論文誌 巻 58, 号 8, 発行日 2017-08-15 |
|||||||||||
ISSN | ||||||||||||
収録物識別子タイプ | ISSN | |||||||||||
収録物識別子 | 1882-7764 |