Hajime Watanabe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hajime Watanabe has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
Hideki Imai
12 shared publicationsKazuto Ogawa
Japan Broadcasting Corporation (NHK)
7 shared publicationsManabu Hagiwara
National Institute of Advanced Industrial Science and Technology (AIST)
7 shared publicationsTakashi Kitagawa
National Institute of Advanced Industrial Science and Technology (AIST)
7 shared publications- Koji Nuida
Institute of Mathematics for Industry (IMI), Kyushu University
6 shared publications - Goichiro Hanaoka
National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
5 shared publications
Latest Publications
- 11 August 2016
- Published by Springer Nature
- No. 9,p. 42-61
Attribute-Based Encryption for Range Attributes
- 11 August 2016
- Published by Springer Nature
- No. 9,p. 42-61
Attribute-Based Encryption for Range Attributes
- 29 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 11 (8) , 1647-1660
Localization Attacks Using Matrix and Tensor Factorization
It is known that various types of location privacy attacks can be carried out using a personalized transition matrix that is learned for each target user, or a population transition matrix that is common to all target users. However, since many users disclose only a small amount of location information in their daily lives, the training data can be extremely sparse. The aim of this paper is to clarify the risk of location privacy attacks in this realistic situation. To achieve this aim, we propose a learning method that uses tensor factorization (or matrix factorization) to accurately estimate personalized transition matrices (or a population transition matrix) from a small amount of training data. To avoid the difficulty in directly factorizing the personalized transition matrices (or population transition matrix), our learning method first factorizes a transition count tensor (or matrix), whose elements are the number of transition counts that the user has made, and then normalizes counts to probabilities. We focus on a localization attack, which derives an actual location of a user at a given time instant from an obfuscated trace, and compare our learning method with the maximum likelihood (ML) estimation method in both the personalized matrix mode and the population matrix mode. The experimental results using four real data sets show that the ML estimation method performs only as well as a random guess in many cases, while our learning method significantly outperforms the ML estimation method in all of the four data sets.
- 29 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 11 (8) , 1647-1660
Localization Attacks Using Matrix and Tensor Factorization
It is known that various types of location privacy attacks can be carried out using a personalized transition matrix that is learned for each target user, or a population transition matrix that is common to all target users. However, since many users disclose only a small amount of location information in their daily lives, the training data can be extremely sparse. The aim of this paper is to clarify the risk of location privacy attacks in this realistic situation. To achieve this aim, we propose a learning method that uses tensor factorization (or matrix factorization) to accurately estimate personalized transition matrices (or a population transition matrix) from a small amount of training data. To avoid the difficulty in directly factorizing the personalized transition matrices (or population transition matrix), our learning method first factorizes a transition count tensor (or matrix), whose elements are the number of transition counts that the user has made, and then normalizes counts to probabilities. We focus on a localization attack, which derives an actual location of a user at a given time instant from an obfuscated trace, and compare our learning method with the maximum likelihood (ML) estimation method in both the personalized matrix mode and the population matrix mode. The experimental results using four real data sets show that the ML estimation method performs only as well as a random guess in many cases, while our learning method significantly outperforms the ML estimation method in all of the four data sets.
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 13-21
Location prediction attacks using tensor factorization and optimal defenses
Recent studies have proposed various attacks against location privacy using a Markov Chain transition matrix trained for each user. However, when a user has disclosed only a small amount of location information in the past, the training data can be extremely sparse. In this paper, we show how the attacker can solve this sparse data problem, and how the defender can defend against this type of attack. Our proposal is twofold: 1) We propose a training method that regards a set of transition matrices as a “tensor”, and adopt tensor factorization to robustly estimate transition matrices from a small amount of training data. 2) We then focus on a location prediction attack, which predicts a location of a target user from a past location that he/she disclosed, and propose a region merging method to minimize the region size as an optimal defense. The experimental results using the dataset of taxi traces show the effectiveness of our proposals. We also point out that our region merging method is effective especially when the defender has Big Data to train transition matrices.
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 13-21
Location prediction attacks using tensor factorization and optimal defenses
Recent studies have proposed various attacks against location privacy using a Markov Chain transition matrix trained for each user. However, when a user has disclosed only a small amount of location information in the past, the training data can be extremely sparse. In this paper, we show how the attacker can solve this sparse data problem, and how the defender can defend against this type of attack. Our proposal is twofold: 1) We propose a training method that regards a set of transition matrices as a “tensor”, and adopt tensor factorization to robustly estimate transition matrices from a small amount of training data. 2) We then focus on a location prediction attack, which predicts a location of a target user from a past location that he/she disclosed, and propose a region merging method to minimize the region size as an optimal defense. The experimental results using the dataset of taxi traces show the effectiveness of our proposals. We also point out that our region merging method is effective especially when the defender has Big Data to train transition matrices.
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3946-3951
Vulnerability of the conventional accessible CAPTCHA used by the White House and an alternative approach for visually impaired people
Many people with visual impairments complain about the poor accessibility of conventional CAPTCHA systems because the audio-style test is too difficult for humans. Even a U.S. governmental site, the “We the People” public website, was criticized for the same reason, and thus it implemented a more accessible quiz-based CAPTCHA system. However, this system is vulnerable to simple heuristics. In this study, we demonstrate the insecurity of this type of CAPTCHA system. We demonstrate that our solver program can beat the CAPTCHA with a success rate of over 99%. In addition, we propose a new verbal-style system to replace the quiz-based CAPTCHA. Our system synthesizes several sentences, which have different degrees of naturalness in terms of their contextual meaning, from a set of source documents using a flexible-order Markov chain. Only human users can perceive the difference in the semantics and select the most (or the least) meaningful option correctly. This test is implemented in a verbal style, which means that it is universally suitable for any type of perceptual channel. We implemented our proposed scheme and analyzed its security based on experiments.
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3946-3951
Vulnerability of the conventional accessible CAPTCHA used by the White House and an alternative approach for visually impaired people
Many people with visual impairments complain about the poor accessibility of conventional CAPTCHA systems because the audio-style test is too difficult for humans. Even a U.S. governmental site, the “We the People” public website, was criticized for the same reason, and thus it implemented a more accessible quiz-based CAPTCHA system. However, this system is vulnerable to simple heuristics. In this study, we demonstrate the insecurity of this type of CAPTCHA system. We demonstrate that our solver program can beat the CAPTCHA with a success rate of over 99%. In addition, we propose a new verbal-style system to replace the quiz-based CAPTCHA. Our system synthesizes several sentences, which have different degrees of naturalness in terms of their contextual meaning, from a set of source documents using a flexible-order Markov chain. Only human users can perceive the difference in the semantics and select the most (or the least) meaningful option correctly. This test is implemented in a verbal style, which means that it is universally suitable for any type of perceptual channel. We implemented our proposed scheme and analyzed its security based on experiments.
- 1 January 2014
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE ESS Fundamentals Review
- Vol. 7 (3) , 166-171
Voluntary Posting on Open Web Sites
- 1 January 2014
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE ESS Fundamentals Review
- Vol. 7 (3) , 166-171
Voluntary Posting on Open Web Sites
- 1 January 2013
- Published by INSTICC
- p. 339-346
Partially Wildcarded Attribute-based Encryption and Its Efficient Construction
The SCITEPRESS Digital Library offers online access to all papers presented at INSTICC conferences, as well as a few conferences organized by others.
- 1 January 2013
- Published by INSTICC
- p. 339-346
Partially Wildcarded Attribute-based Encryption and Its Efficient Construction
The SCITEPRESS Digital Library offers online access to all papers presented at INSTICC conferences, as well as a few conferences organized by others.
- 1 January 2011
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E94-A (6) , 1328-1337
Secure Broadcast System with Simultaneous Individual Messaging
- 1 January 2011
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E94-A (6) , 1328-1337
Secure Broadcast System with Simultaneous Individual Messaging
- 2 April 2009
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 52 (3) , 339-362
An improvement of discrete Tardos fingerprinting codes
- 2 April 2009
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 52 (3) , 339-362
An improvement of discrete Tardos fingerprinting codes
- 1 January 2009
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E92-A (1) , 197-206
An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation
- 1 January 2009
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E92-A (1) , 197-206
An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation
- 1 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
A group testing based deterministic tracing algorithm for a short random fingerprint code
Digital watermarking techniques have been used for preventing an illegal copying and re-distributing of contents. A collusion attack is a strong attack against digital watermarking schemes. To prevent such attacks, a collusion secure fingerprint code can be used. Collusion secure fingerprint code have been studied widely and many codes have been proposed. However, a code length of them are too long to embed it into a content using digital watermarking.
- 1 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
A group testing based deterministic tracing algorithm for a short random fingerprint code
Digital watermarking techniques have been used for preventing an illegal copying and re-distributing of contents. A collusion attack is a strong attack against digital watermarking schemes. To prevent such attacks, a collusion secure fingerprint code can be used. Collusion secure fingerprint code have been studied widely and many codes have been proposed. However, a code length of them are too long to embed it into a content using digital watermarking.