<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JCC</journal-id><journal-title-group><journal-title>Journal of Computer and Communications</journal-title></journal-title-group><issn pub-type="epub">2327-5219</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jcc.2016.414003</article-id><article-id pub-id-type="publisher-id">JCC-71969</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  Online Accounts Management Method Using Risk-Based Approach
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Yoshio</surname><given-names>Kakizaki</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Takumi</surname><given-names>Akiyama</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Kazuya</surname><given-names>Otani</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Ryoichi</surname><given-names>Sasaki</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Science and Technology for Future Life, Tokyo Denki University, Tokyo, Japan</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>kakizaki@im.dendai.ac.jp(YK)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>11</day><month>11</month><year>2016</year></pub-date><volume>04</volume><issue>14</issue><fpage>26</fpage><lpage>36</lpage><history><date date-type="received"><day>October</day>	<month>20,</month>	<year>2016</year></date><date date-type="rev-recd"><day>Accepted:</day>	<month>November</month>	<year>11,</year>	</date><date date-type="accepted"><day>November</day>	<month>14,</month>	<year>2016</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  In this paper, we propose an online accounts management method that uses a risk-based approach to minimize any risk of personal information leakage, while permitting users to reuse passwords. The proposed method clusters some accounts to reduce the number of passwords a user has to remember. This is achieved without increasing the risk value of any leaked personal information because the clustered accounts have similar attributes. Further, the proposed method suppresses any increase in risk by optimizing the cluster even if the password is shared by numerous accounts, and can reduce the number of passwords to approximately 30% - 40%. In evaluations conducted, 91% of participants accepted our method, indicating that it balances usability with security.
 
</p></abstract><kwd-group><kwd>Password</kwd><kwd> Authentication</kwd><kwd> Usability</kwd><kwd> Security</kwd><kwd> Risk Management</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>In their 2014 annual security report, Cisco stated that, “although brute-force login attempts are by no means a new tactic for cybercriminals, their use increased threefold in the first half of 2013” [<xref ref-type="bibr" rid="scirp.71969-ref1">1</xref>] . This was said about list-based attacks, suggesting that list- based attacks have become a serious threat. If attackers succeed in logging into a user’s web account, they can login to that user’s other web accounts if they have the same password. This is critical as 59% of web users have in fact admitted to reusing passwords because remembering multiple different passwords is too difficult [<xref ref-type="bibr" rid="scirp.71969-ref2">2</xref>] .</p><p>Countermeasures to list-based attacks include setting different IDs and passwords for different websites and installing Single Sign-On (SSO) or two-factor authentication (2FA). However, because SSO or 2FA can only be installed on the server, these methods are not list-based attack countermeasures that users can adopt directly. One countermeasure that users can adopt on their end is the use of password manager software (such as LastPass, 1Password, and KeePass) installed on their computer. Such software allows users to manage several different passwords so that users do not need to reuse the same passwords for different websites.</p><p>On the other hand, only 20% of web users prefer to use SSO instead of conventional login methods [<xref ref-type="bibr" rid="scirp.71969-ref3">3</xref>] . In addition, both the usage rate and the support rate for 2FA are low. The most common method users utilize to manage passwords is simply their memory (63%). Only 8% of users actually use password manager software [<xref ref-type="bibr" rid="scirp.71969-ref2">2</xref>] . This is because many users cannot master these solutions; therefore, they continue to entrust password management to their memory. The number of such low literacy users who do not use these solutions is also significant. Thus, an easy-to-use and acceptable method for managing reusable passwords is required.</p><p>In this paper, we propose a method for managing online accounts for such low literacy users that uses a risk-based approach. The proposed method facilitates ease of use and reduces the risk of personal information leakage by allowing users to reuse passwords on multiple websites. The objective of this method is to minimize personal information leakage by regulating the risk of a list-based attack.</p></sec><sec id="s2"><title>2. Related Works</title><p>Various password-related studies have been conducted. For example, Inglesant and Sasse [<xref ref-type="bibr" rid="scirp.71969-ref4">4</xref>] and Al Fayyadh et al. [<xref ref-type="bibr" rid="scirp.71969-ref5">5</xref>] conducted studies on password policies. Al Fayyadh et al. pointed out that users often adopt strategies to simplify password management, such as selecting weak passwords and reusing passwords across multiple accounts which, unfortunately, can cause security vulnerabilities [<xref ref-type="bibr" rid="scirp.71969-ref5">5</xref>] . Password management strategies have also been studied by Jeslet et al. [<xref ref-type="bibr" rid="scirp.71969-ref6">6</xref>] , Choong [<xref ref-type="bibr" rid="scirp.71969-ref7">7</xref>] , and Gaw and Felten [<xref ref-type="bibr" rid="scirp.71969-ref8">8</xref>] . Various password management applications have also been analyzed [<xref ref-type="bibr" rid="scirp.71969-ref9">9</xref>] - [<xref ref-type="bibr" rid="scirp.71969-ref14">14</xref>] . Karole et al. [<xref ref-type="bibr" rid="scirp.71969-ref9">9</xref>] conducted a comparative usability study of three popular password managers: Last Pass, Kee Pass, and Roboform2Go. Gasti and Rasmussen [<xref ref-type="bibr" rid="scirp.71969-ref11">11</xref>] analyzed storage formats used by popular password managers. Bojinov et al. [<xref ref-type="bibr" rid="scirp.71969-ref15">15</xref>] and McCarney et al. [<xref ref-type="bibr" rid="scirp.71969-ref16">16</xref>] proposed password managers. Ruiz et al. [<xref ref-type="bibr" rid="scirp.71969-ref17">17</xref>] researched personal behaviors regarding privacy that allows the leakage of information.</p><p>Gaw et al. [<xref ref-type="bibr" rid="scirp.71969-ref8">8</xref>] discussed how current systems support poor password practices from the perspective of user behavior. They also proposed changes to website authentication systems and password managers. To determine the current situation with regard to password reuse by users, they surveyed how often users reused passwords and their reasons for doing so. Consequently, they demonstrated that people relied on their memory. Alas, whereas current systems do not help users to recall their passwords, they do enable passwords to be reused.</p><p>Flor&#234;ncio et al. [<xref ref-type="bibr" rid="scirp.71969-ref18">18</xref>] found that many currently available methods for managing passwords are ineffective at ensuring the safety of web services and establishing a basis for password management. Thus, they surveyed password durability and analyzed the basis for strong password durability. They postulated that web accounts that do not contain important information about users did not need to be managed, and that only web accounts that do possess important information about users should be managed. Indeed, the following are commonly held opinions regarding safe passwords [<xref ref-type="bibr" rid="scirp.71969-ref19">19</xref>] :</p><p>1) Passwords should be random and strong.</p><p>2) Passwords should not be reused in all web accounts.</p><p>However, users frequently fail to adopt this advice. Crucially, there is no reliable way to remember strong passwords. To minimize the user’s burden when managing passwords, and to minimize damage from personal information leakage, Flor&#234;ncio et al. proposed grouping web accounts [<xref ref-type="bibr" rid="scirp.71969-ref19">19</xref>] . They investigated the influence of grouped web accounts that allow users to reuse the same password and found that reusing a password actually makes it stronger, whereas restricting the reuse of a password weakens it. There is thus a trade-off between reusing a password and the strength of that password. Furthermore, grouping web accounts and allowing passwords to be reused in web- account groups increases the probability that personal information will be leaked, but decreases the expected damage from such leakage. Flor&#234;ncio et al. stated that it is actually difficult to manage several randomized passwords, and that methods for managing passwords must address weak passwords and their reusability.</p></sec><sec id="s3"><title>3. Online Accounts Management Method</title><sec id="s3_1"><title>3.1. Concept</title><p>Not all web users understand password managers such as SSO and 2FA. Moreover, some users also do not understand account management. Such users reuse passwords, and are therefore exposed to the threat of list-based attacks. This research is geared towards these “low literacy” users.</p><p>It is necessary to accord password management with the importance of the account, as pointed out by Flor&#234;ncio et al. [<xref ref-type="bibr" rid="scirp.71969-ref18">18</xref>] . We consider the similarities of the attributes of accounts. Some accounts retain similar attributes to other accounts. We believe that the risk when such accounts, which retain similar attributes, are attacked by list-based attacks is the same even if information is leaked.</p><p>Our proposed method is geared towards online account management from the viewpoint of usability and security. The method reduces the number of passwords that a user has to remember by clustering some accounts. However, because the clustered accounts all have similar attributes, the risk value of any leaked personal information does not increase. Thus, both the passwords that the user remembers and the risk value of any leaked personal information are minimized.</p></sec><sec id="s3_2"><title>3.2. Preliminaries</title><sec id="s3_2_1"><title>3.2.1. Survey of Account Information</title><p>To determine what information can be leaked as a result of a malicious login, we analyzed popular websites from the Alexa Top 500 (January 5th, 2015), and targeted the 50 most accessed websites. Then we categorized account information into two groups: Revealed information and unrevealed information.</p><p>Revealed information is information that can be confirmed after logging into personal pages such as “My Page”. For example, on personal pages, there is information that can be seen, such as the username. Unrevealed information is information that cannot be confirmed even after has logged into personal pages such as “My Page”. For our purposes, only the information that can be ascertained after logging in is considered Revealed information.</p><p><xref ref-type="table" rid="table1">Table 1</xref> lists information from a few of the websites we surveyed. In the table, “Y” denotes Revealed information and “N” denotes Unrevealed information. In this paper, both required and Unrevealed information are referred to as attributes.</p></sec><sec id="s3_2_2"><title>3.2.2. Questionnaire Survey</title><p>We obtained 88 answers to our questionnaire given to university students. These answers were used to decide on an index for evaluating the proposed method’s utility.</p><p>The list of questions asked and an explanation of each are provided below.</p><p>PQ1: What online accounts do you have? We permitted participants to indicate all of the web accounts that they have registered to among the surveyed websites described in Section 3.2.1.</p><p>PQ2: What information do you not want leaked? We asked participants to choose the information from the attributes that they did not want leaked. In this paper, we refer to this information as confidential information.</p><p>The breakdown of the answers to PQ1 and PQ2 are shown in <xref ref-type="fig" rid="fig1">Figure 1</xref> and <xref ref-type="fig" rid="fig2">Figure 2</xref>, respectively. The “possession rate” in <xref ref-type="fig" rid="fig1">Figure 1</xref> refers to the ratio of people who registered for the web account. <xref ref-type="fig" rid="fig2">Figure 2</xref> represents the ratio of people who do not want the respective attribute information leaked. There were multiple answers to this question.</p></sec></sec><sec id="s3_3"><title>3.3. Method</title><p>To find web accounts with similar attributes, we cluster web accounts by calculating their similarity to each other. To calculate this similarity, we use the Revealed information. Clustering is a method for grouping data according to the similarity of its features. Grouped datasets are called “clusters”. By clustering web accounts, we can generate sets of web accounts that have similar attributes.</p><p>To group web accounts according to the similarity of their attributes, we cluster web accounts using cosine similarity and k-means clustering.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Sample of surveyed web sites</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Site</th><th align="center" valign="middle" >User name</th><th align="center" valign="middle" >Real name</th><th align="center" valign="middle" >E-mail</th><th align="center" valign="middle" >Phone number</th><th align="center" valign="middle" >Country</th><th align="center" valign="middle" >Sex</th></tr></thead><tr><td align="center" valign="middle" >Google</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >N</td></tr><tr><td align="center" valign="middle" >Rakuten</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >Amazon</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >Mixi</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" >Y</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" >Y</td></tr></tbody></table></table-wrap><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Possesion rate of commonly registered wen accounts</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-1730472x2.png"/></fig><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Information considered confidential by survey respondents</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-1730472x3.png"/></fig><p>To calculate the information leakage risk value, we regard the percentage of replies for each attribute as the risk value of leaked personal information in <xref ref-type="fig" rid="fig2">Figure 2</xref>. We then calculate the risk value of leaked personal information for each cluster. Specifically, the sum of the risk value for each attribute included in a cluster is regarded as the risk value for that cluster.</p><p>The number of clusters k is the number of passwords that must be remembered. The number of accounts that shares the same password increases when k is small, which increases the risk value. In our method, k and the risk value are minimized according to the accounts that the user is using. Thus, our method provides the account group that can reuse the password based on the risk value.</p></sec><sec id="s3_4"><title>3.4. Example Execution</title><p>We present an example execution of our method in this section. To cluster the web accounts, we selected accounts based on the responses to our survey (Section 3.2.2). In this example, we selected the following web accounts for clustering (see <xref ref-type="fig" rid="fig1">Figure 1</xref>):</p><p>1) Web accounts registered by more than 40% of participants (the 10 web accounts between Google and Pixiv).</p><p>2) Web accounts registered by more than 20% of participants (the 16 web accounts between Google and Rakuten).</p><p>The results for Group A and Group B are shown in <xref ref-type="table" rid="table2">Table 2</xref> and <xref ref-type="table" rid="table3">Table 3</xref>, respectively. The k = 1 case refers to the situation of a single password being used for all web accounts. Similarly, the k = 10 case in <xref ref-type="table" rid="table2">Table 2</xref> and the k = 16 case in <xref ref-type="table" rid="table3">Table 3</xref> refer to the use of a different password for each web account.</p><p>In <xref ref-type="table" rid="table2">Table 2</xref>, k = 4 is optimum when the result for k = 1 and that for k = 9 are removed because k and the risk value are both minimum. Likewise, in <xref ref-type="table" rid="table3">Table 3</xref>, k = 5 is optimum. Details of the result of k = 4 in Group A are shown in <xref ref-type="table" rid="table4">Table 4</xref>. Cluster 4 contains the most attributes; thus, its risk value is the maximum. Our method adopts the maximum risk value in the clustering result.</p><p>Our method minimizes the number of passwords and the information leakage risk, and can reduce the number of passwords to approximately 30% - 40%. For more details, please see [<xref ref-type="bibr" rid="scirp.71969-ref20">20</xref>] .</p><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Risk value for Group A</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >k</th><th align="center" valign="middle" >Risk Value</th><th align="center" valign="middle" >k</th><th align="center" valign="middle" >Risk Value</th></tr></thead><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >5.275</td><td align="center" valign="middle" >6</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >4.275</td><td align="center" valign="middle" >7</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >4.375</td><td align="center" valign="middle" >8</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >4.215</td><td align="center" valign="middle" >9</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >5</td><td align="center" valign="middle" >4.215</td><td align="center" valign="middle" >10</td><td align="center" valign="middle" >2.784</td></tr></tbody></table></table-wrap><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> Risk value of Group B</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >k</th><th align="center" valign="middle" >Risk Value</th><th align="center" valign="middle" >k</th><th align="center" valign="middle" >Risk Value</th></tr></thead><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >5.852</td><td align="center" valign="middle" >9</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >4.602</td><td align="center" valign="middle" >10</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >4.784</td><td align="center" valign="middle" >11</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >4.784</td><td align="center" valign="middle" >12</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >5</td><td align="center" valign="middle" >4.215</td><td align="center" valign="middle" >13</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >6</td><td align="center" valign="middle" >4.215</td><td align="center" valign="middle" >14</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >7</td><td align="center" valign="middle" >4.215</td><td align="center" valign="middle" >15</td><td align="center" valign="middle" >4.215</td></tr><tr><td align="center" valign="middle" >8</td><td align="center" valign="middle" >4.215</td><td align="center" valign="middle" >16</td><td align="center" valign="middle" >2.784</td></tr></tbody></table></table-wrap><table-wrap id="table4" ><label><xref ref-type="table" rid="table4">Table 4</xref></label><caption><title> Details of k = 4 clustering results for Group A</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Cluster #</th><th align="center" valign="middle" >Accounts</th><th align="center" valign="middle" >Risk Value</th></tr></thead><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >Pixiv, niconico</td><td align="center" valign="middle" >1.644</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >Twitter, DMM.com, Amazon</td><td align="center" valign="middle" >1.624</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >Yahoo!, Microsoft, goo</td><td align="center" valign="middle" >2.871</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >Apple ID, Google</td><td align="center" valign="middle" >4.215</td></tr></tbody></table></table-wrap></sec></sec><sec id="s4"><title>4. Evaluation</title><p>In evaluating the proposed method, we sought to determine how useful it is for web service users. For it to be useful, the proposed method should satisfy the following criteria:</p><p>1) Minimize attribute leakage resulting from list-based attacks.</p><p>2) Minimize the number of passwords that must be remembered by users.</p><sec id="s4_1"><title>4.1. Evaluation Procedure</title><p>To evaluate Criteria 1 and 2, we applied our method to 74 participants (different to those in Section 3.2.2). In this case, we requested that the participants indicate the web service they were using. We showed the participants the clustering result of our method, and asked whether it was acceptable. For those who stated that it was not, we asked for an explanation. In addition, we asked the participants the following:</p><p>EQ1: How many ID/password pairs do you remember?</p><p>EQ2: Do you use any password manager?</p><p>EQ3: Do you use two-factor authentication?</p><p>EQ4: Can you remember the number of passwords indicated by our method?</p></sec><sec id="s4_2"><title>4.2. Evaluation Results</title><p><xref ref-type="table" rid="table5">Table 5</xref> shows the results of statistical analyses. The number of accounts is A; number of clusters is C, and reduction rate (RR) of the passwords is calculated from A/C. The risk value (RV) uses the value in Section 3.3.</p><p>To clarify the relation between the reduction rate in the number of passwords and the risk value, we sort by the number of accounts, and present the reduction rate and the risk value by 4-quantiles in <xref ref-type="table" rid="table6">Table 6</xref>. <xref ref-type="table" rid="table7">Table 7</xref> shows the results for EQ2, EQ3, and EQ4.</p><table-wrap id="table5" ><label><xref ref-type="table" rid="table5">Table 5</xref></label><caption><title> Statical analyses of the results</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Item</th><th align="center" valign="middle" >Average</th><th align="center" valign="middle" >Median</th><th align="center" valign="middle" >Mode</th><th align="center" valign="middle" >Min</th><th align="center" valign="middle" >Max</th><th align="center" valign="middle" >SD</th></tr></thead><tr><td align="center" valign="middle" >EQ1</td><td align="center" valign="middle" >3.94</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >10</td><td align="center" valign="middle" >1.99</td></tr><tr><td align="center" valign="middle" >A</td><td align="center" valign="middle" >10.04</td><td align="center" valign="middle" >10</td><td align="center" valign="middle" >6</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >26</td><td align="center" valign="middle" >4.90</td></tr><tr><td align="center" valign="middle" >C</td><td align="center" valign="middle" >4.04</td><td align="center" valign="middle" >4</td><td align="center" valign="middle" >4</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >7</td><td align="center" valign="middle" >0.98</td></tr><tr><td align="center" valign="middle" >RR</td><td align="center" valign="middle" >0.47</td><td align="center" valign="middle" >0.48</td><td align="center" valign="middle" >0.50</td><td align="center" valign="middle" >0.18</td><td align="center" valign="middle" >0.80</td><td align="center" valign="middle" >0.17</td></tr><tr><td align="center" valign="middle" >RV</td><td align="center" valign="middle" >3.92</td><td align="center" valign="middle" >4.22</td><td align="center" valign="middle" >4.22</td><td align="center" valign="middle" >1.10</td><td align="center" valign="middle" >7.26</td><td align="center" valign="middle" >1.54</td></tr></tbody></table></table-wrap><table-wrap id="table6" ><label><xref ref-type="table" rid="table6">Table 6</xref></label><caption><title> Analyses by 4-quartiles</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Item</th><th align="center" valign="middle" >Q1/4</th><th align="center" valign="middle" >Q2/4</th><th align="center" valign="middle" >Q3/4</th><th align="center" valign="middle" >Q4/4</th></tr></thead><tr><td align="center" valign="middle" >RR</td><td align="center" valign="middle" >0.67</td><td align="center" valign="middle" >0.53</td><td align="center" valign="middle" >0.41</td><td align="center" valign="middle" >0.27</td></tr><tr><td align="center" valign="middle" >RV</td><td align="center" valign="middle" >3.85</td><td align="center" valign="middle" >3.75</td><td align="center" valign="middle" >4.36</td><td align="center" valign="middle" >3.70</td></tr></tbody></table></table-wrap><table-wrap id="table7" ><label><xref ref-type="table" rid="table7">Table 7</xref></label><caption><title> Result of EQ2, EQ3, and EQ4</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Item</th><th align="center" valign="middle" >Yes</th><th align="center" valign="middle" >Maybe</th><th align="center" valign="middle" >No</th></tr></thead><tr><td align="center" valign="middle" >EQ2</td><td align="center" valign="middle" >30</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >44</td></tr><tr><td align="center" valign="middle" >EQ3</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >56</td></tr><tr><td align="center" valign="middle" >EQ4</td><td align="center" valign="middle" >29</td><td align="center" valign="middle" >39</td><td align="center" valign="middle" >3</td></tr></tbody></table></table-wrap></sec></sec><sec id="s5"><title>5. Discussion</title><p>According to Flor&#234;ncio et al., web service users should protect web accounts that contain confidential information, and they should reduce the costs from protecting web accounts that do not possess such information [<xref ref-type="bibr" rid="scirp.71969-ref18">18</xref>] .</p><p>In this evaluation, <xref ref-type="table" rid="table5">Table 5</xref> clarifies that the participants used 10 accounts on average, with the maximum being 26 accounts.</p><p><xref ref-type="table" rid="table5">Table 5</xref> shows that many of the participants could remember about three or four ID/password pairs (EQ1). This indicates that users cannot remember more than four passwords, even when our method reduces the number of passwords. Therefore, it is preferable that the clustering result of our method is approximately four.</p><p>In <xref ref-type="table" rid="table5">Table 5</xref>, our clustering result C is 4.04 on the average, and the standard deviation (SD) is 0.98. As a result, many results can optimize the number of passwords, and can also minimize the risk value. The risk value RV is 3.92 on average, and the reduction rate RR is 48%. Each result also is no different from the result in Section 3.4, which demonstrates the effectiveness of our method.</p><p><xref ref-type="table" rid="table6">Table 6</xref> shows the relation between the reduction rate of the number of passwords and the risk value. The risk value RV is virtually the same from Q1/4 to Q4/4. This result indicates that our method optimizes the combination of accounts and minimizes the risk value. In fact, criterion 1 is satisfied. The reduction rate is 67% at most because the number of accounts for Q1/4 is the lowest. Conversely, the reduction rate is 27% because the number of accounts for Q4/4 is the highest. Our method can suppress any increase in the risk value from these results by optimizing the cluster even if the password is shared by numerous accounts.</p><p><xref ref-type="fig" rid="fig3">Figure 3</xref> shows the relation between the number of accounts and the reduction rate for all participants. The reduction rate is also low when the number of accounts is small. Conversely, the reduction rate is high when the number of accounts is large. This result shows that many online accounts contain similar attributes. In other words, the similarity of the account is high.</p><p>From EQ2 and EQ3 in <xref ref-type="table" rid="table7">Table 7</xref>, most users use neither a password manager nor two- factor authentication. We examined whether participants with numerous accounts used a password manager or two-factor authentication. However, there was no significant difference. The result in EQ4 shows that our method was accepted by 91% of the participants. As described with EQ1, it is clear that our clustering result approximates the number of ID/password pairs that users can memorize. Thus, criterion 2 is satisfied.</p><p>Finally, our online accounts management method satisfies all criteria.</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Relation between the number of accounts and the reduction rate</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-1730472x4.png"/></fig></sec><sec id="s6"><title>6. Conclusions</title><p>In this study, we analyzed online accounts and proposed an online accounts management method that uses a risk-based approach. Multiple different passwords should be used for multiple different online accounts. Password managers, single sign-on, and two-factor authentication mitigate this issue. However, some users do not understand these solutions. Such users reuse passwords, and are therefore exposed to the threat of list-based attacks.</p><p>Our method reduces the number of passwords that a user has to remember. Further, the risk value of leaked personal information does not increase because the clustered accounts have similar attributes. Thus, both the passwords that the user remembers and the risk value of any leaked personal information are minimized.</p><p>The evaluations conducted of our method indicate that it can suppress any increase in the risk value by optimizing the clusters even if the password is shared by numerous accounts. The evaluation results also show that many online accounts contain similar attributes. In other words, the similarity of the accounts is high. Finally, our method was accepted by 91% of participants.</p><p>In future work, we will consider the influence of dynamic attributes. In this study, we targeted only static attributes. However, it is necessary to consider dynamic attributes such as historical data and activity logs. This will facilitate more accurate risk analysis of online accounts.</p></sec><sec id="s7"><title>Cite this paper</title><p>Kakizaki, Y., Akiyama, T., Otani, K. and Sasaki, R. (2016) Online Accounts Management Method Using Risk-Based Approach. Journal of Computer and Communications, 4, 26-36. http://dx.doi.org/10.4236/jcc.2016.414003</p></sec></body><back><ref-list><title>References</title><ref id="scirp.71969-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Cisco. (2014) Cisco 2014 Annual Security Report. 
https://www.cisco.com/web/offer/gist_ty2_asset/Cisco_2014_ASR.pdf</mixed-citation></ref><ref id="scirp.71969-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Password Boss. (2015) The State of Consumer Password Habits. 
https://www.passwordboss.com/password-habits-survey-part-1/</mixed-citation></ref><ref id="scirp.71969-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">AddShoppers. (2015) 2015 On-Site Marketing Breakdown. 
http://learn.addshoppers.com/2015/</mixed-citation></ref><ref id="scirp.71969-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Inglesant, P.G. and Sasse, M.A. (2010) The True Cost of Unusable Password Policies: Password Use in the Wild. Proceedings of CHI 2010, Atlanta, 10-15 April 2010, 383-392. 
http://dx.doi.org/10.1145/1753326.1753384</mixed-citation></ref><ref id="scirp.71969-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">AlFayyadh, B., Thorsheim, P., Josang, A. and Klevjer, H. (2012) Improving Usability of Password Management with Standardized Password Policies. Proceedings of SAR-SSI 2012, Cabourg, 22-25 May 2012.</mixed-citation></ref><ref id="scirp.71969-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Santhi Jeslet, D., Sivaraman, G., Uma, M., Thangadurai, K. and Punithavalli, M. (2010) Survey on Awareness and Security Issues in Password Management Strategies. International Journal of Computer Science and Network Solutions, 10, 19-23.</mixed-citation></ref><ref id="scirp.71969-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Choong, Y.-Y. (2014) A Cognitive-Behavioral Framework of User Password Management Lifecycle. HAS 2014 Second International Conference, Heraklion, 22-27 June 2014, 127-137.</mixed-citation></ref><ref id="scirp.71969-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Gaw, S. and Felten, E.W. (2006) Password Management Strategies for Online Accounts. Proceedings of SOUPS’06, Pittsburgh, 12-14 July 2006, 44-55.  
http://dx.doi.org/10.1145/1143120.1143127</mixed-citation></ref><ref id="scirp.71969-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Karole, A., Saxena, N. and Christin, N. (2011) A Comparative Usability Evaluation of Traditional Password Managers. Proceedings of ICISC 2010, Seoul, 1-3 December 2010, 233-251.</mixed-citation></ref><ref id="scirp.71969-ref10"><label>10</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Ciampa</surname><given-names> M. </given-names></name>,<etal>et al</etal>. (<year>2011</year>)<article-title>Are Password Management Applications Viable? An Analysis of User Training and Reactions</article-title><source> ISEDJ</source><volume> 9</volume>,<fpage> 4</fpage>-<lpage>13</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.71969-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Gasti, P. and Rasmussen, K.B. (2012) On the Security of Password Manager Database Formats. 17th European Symposium on Research in Computer Security, Pisa, 10-12 September 2012, 770-787.</mixed-citation></ref><ref id="scirp.71969-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Alkaldi, N. and Renaud, K. (2016) Why Do People Adopt, or Reject, Smartphone Password Managers? 1st European Workshop on Usable Security, Darmstadt, 18 July 2016, 1-14.</mixed-citation></ref><ref id="scirp.71969-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Li, Z., He, W., Akhawe, D. and Song, D. (2014) The Emperor’s New Password Manager: Security Analysis of Web-Based Password Managers. Usenix Conference on Security Symposium, San Diego, 20-22 August 2014, 465-479.</mixed-citation></ref><ref id="scirp.71969-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Liou, J.-C. (2016) Performance Measures for Evaluating the Dynamic Authentication Techniques. International Journal of Cyber-Security and Digital Forensics, 5, 83-93.  
http://dx.doi.org/10.17781/P002052</mixed-citation></ref><ref id="scirp.71969-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Bojinov, H., Bursztein, E., Boyen, X. and Kamouflage, D.B. (2010) Loss-Resistant Password Management. European Symposium on Research in Computer Security, Athens, 20-22 September 2010, 286-302.</mixed-citation></ref><ref id="scirp.71969-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">McCarney, D., Barrera, D., Clark, J., Chiasson, S. and van Oorschot, P.C. (2012) Tapas: Design, Implementation, and Usability Evaluation of a Password Manager. Proceedings of the Annual Computer Security Applications Conference, Orlando, 3-7 December 2012, 89-98.  
http://dx.doi.org/10.1145/2420950.2420964</mixed-citation></ref><ref id="scirp.71969-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Ruiz, R., Amatte, F.P., Park, K.J.B. and Winter, R. (2015) Overconfidence: Personal Behavious Regarding Privacy That Allows the Leakage of Information in Private Browsing Mode. International Journal of Cyber-Security and Digital Forensics, 4, 404-416.  
http://dx.doi.org/10.17781/P001619</mixed-citation></ref><ref id="scirp.71969-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Florêncio, D., Herley, C. and van Oorschot, P.C. (2014) An Administrator’s Guide to Internet Password Research. Usenix Conference on Security Symposium, San Diego, 20-22 August 2014, 44-61.</mixed-citation></ref><ref id="scirp.71969-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Florêncio, D., Herley, C. and van Oorschot, P.C. (2014) Password Portfolios and the Finite-Effort User: Sustainably Managing Large Numbers of Accounts. Usenix Conference on Security Symposium, San Diego, 20-22 August 2014, 575–590.</mixed-citation></ref><ref id="scirp.71969-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Akiyama, T., Otani, K., Kakizaki, Y. and Sasaki, R. (2015) Evaluation of a Risk-Based Management Method for Online Accounts. 4th International Conference on Cyber Security, Cyber Warfare, and Digital Forensic, Jakarta, 29-31 October 2015, 52-57.</mixed-citation></ref></ref-list></back></article>