7. Authentication and Authorizationprovider. One of the benefits over OpenID and Face<strong>book</strong> Connect is that theidentity provider (e-mail provider) does not find out which web service theuser is trying to use. On the other hand, while the identity provider does notlearn the relaying party, the relaying party learns the user’s identity on theidentity provider’s service; i.e., his e-mail address. PseudoID [152] employsblind cryptographic signatures to eliminate this privacy concern. Moreover,while Face<strong>book</strong> Connect and Google Login associate the user with a socialprofile and may share some of that information with the third-party webservice, BrowserID does not. While BrowserID and Face<strong>book</strong> Connect seemto eliminate the need for web services to maintain and manage the securityc<strong>red</strong>entials for their users, they also present single points of failure that, ifabused could result in domino-like security failures. For instance, a user whohas enabled Face<strong>book</strong> Connect to log in to a plethora of web services, he onlyneeds to manage the Face<strong>book</strong> password. However, if the same passwordis also used for another service that does not support Face<strong>book</strong> Connect, apotential leak from either Face<strong>book</strong> or that service could allow an attackeraccess to all the services connected to that user’s Face<strong>book</strong> identity. Anotherexample, is the case where security flaws in the single-sign-on system enablean attacker to access the victim’s account in any of the services supportingsuch password-less login [391].7.5.2 Password CrackingPassword cracking is not a new technique [344]. However, up until recently,the use of cryptographic hash functions in the way authentication informationwas handled by services appea<strong>red</strong> as an effective defense. This is no longerthe case since modern CPUs/GPUs [60] can be combined to form powerfulcracking platforms targeting password digests. Many of them, such as Cloud-Cracker, are provided as an off-the-shelf paid service for the average user [9].Even if strong cryptographic hash functions are used for keeping passwordssafe, other properties of the system may be exploited to boost the processof cracking [12]. Research efforts have been directed towards suggestingharder-to-guess passwords and pass-phrases [234, 322, 396].7.5.3 Adaptive HashingAdaptive cryptographic hash functions, such as bcrypt [323] and scrypt [313],have been proposed to address the increasing ease with which passwordhashes can be cracked. These hash functions can adapt to hardware evolution,by deliberately wasting resources - either computational or memory - duringa hash validation. By employing such hash functions, a web site can slowdown an attacker sufficiently in cracking a particular user password. However,this also requires that the service invests additional resources into generating56
7.6. Research Gapshashes and evaluating passwords. We should emphasize that, compa<strong>red</strong> tobrute-force attacks, these functions have much less effect on dictionary attacks.7.6 Research GapsText-based passwords are convenient and are already accepted by the majorityof users. However, today we need stronger authentication mechanisms.Rich Authentication. It is well known that for authenticating with a partywe use something we know (i.e., a password), something we have (i.e., atoken), or something we are (i.e., biometrics). There is an interestinggap between security and usability in current forms of authentication.We have strong authentication mechanisms, but it is hard to use themeffectively because they are not convenient. On the other hand, there arecertain mechanisms that are already accepted by users, such as text-basedpasswords or 4-digit PINs. Unfortunately, these provide low securityguarantees. One research challenge is to invent new rich authenticationmechanisms, variants or combinations of the currently existing ones, thatprovide better security without sacrificing convenience.Service Decoupling. Services experience heavy interconnection, explicitly orimplicitly. It is common practice to use an e-mail service for registering(or resetting the c<strong>red</strong>entials) to another service. Social applicationscan also interfere with content delive<strong>red</strong> via third-party networks. Forexample, a Twitter account may post comments in the user’s Face<strong>book</strong>feed, if it is so configu<strong>red</strong>. This service coupling provides new anddynamic functionality; however, it is security sensitive. An attacker needsonly to compromise one service and may then take over many of thevictim’s valuable assets just by exploiting this service interconnection [126,212]. It is challenging, from a research point of view, to identify all thisinterconnection, create taxonomies with current practices, study the wayscurrent services interconnect with each other, and design new techniquesfor interconnecting services in a secure fashion.7.7 Example ProblemsSome interesting problems in this area include:Factors in Authentication. It is common to combine multiple communicationchannels for providing stronger authentication, something commonlyknown as 2-factor authentication. As a quick example, consider a userauthenticating with a service by giving a password and a code receivedby SMS. It is debatable which factors are more efficient from the usabilityperspective, while providing the most security guarantees.57
- Page 1:
SEVENTH FRAMEWORK PROGRAMMETHERED B
- Page 4 and 5:
The Red Book. ©2013 The SysSec Con
- Page 7 and 8:
PrefaceAfter the completion of its
- Page 9 and 10:
Contents1 Executive Summary 32 Intr
- Page 11 and 12:
1 Executive SummaryBased on publish
- Page 13: 1.2. Grand Challenges4. will have t
- Page 16 and 17: 2. Introductionwho want to get at t
- Page 18 and 19: 2. Introduction• Although conside
- Page 20 and 21: 2. Introductionfuture, where each a
- Page 22 and 23: 2. Introductiondrones), such sensor
- Page 24 and 25: 2. Introductioncover our energy nee
- Page 27: Part I: Threats Identified
- Page 30 and 31: 3. In Search of Lost Anonymity3.2 W
- Page 32 and 33: 3. In Search of Lost Anonymityguide
- Page 35 and 36: 4 Software VulnerabilitiesExtending
- Page 37 and 38: 4.1. What Is the Problem?infrastruc
- Page 39 and 40: 4.5. State of the Artparts of criti
- Page 41: 4.7. Example Problemstem mitigation
- Page 44 and 45: 5. Social Networks5.1 Who Is Going
- Page 46 and 47: 5. Social Networksby such an applic
- Page 48 and 49: 5. Social Networksdisasters. This r
- Page 50 and 51: 6. Critical Infrastructure Security
- Page 52 and 53: 6. Critical Infrastructure Security
- Page 54 and 55: 6. Critical Infrastructure Security
- Page 56 and 57: 6. Critical Infrastructure Security
- Page 59 and 60: 7 Authentication and AuthorizationH
- Page 61 and 62: 7.2. Who Is Going to Be Affected?so
- Page 63: 7.5. State of the ArtFinally, ident
- Page 67 and 68: 8 Security of Mobile DevicesIn an e
- Page 69 and 70: 8.3. What Is the Worst That Can Hap
- Page 71 and 72: 8.4. State of the ArtAll the other
- Page 73: 8.6. Example Problemserated anomaly
- Page 76 and 77: 9. Legacy Systemsthe execution of a
- Page 78 and 79: 9. Legacy Systemsparts of the progr
- Page 81 and 82: 10 Usable SecurityKeys, locks, and
- Page 83 and 84: 10.4. What Is the Worst That Can Ha
- Page 85 and 86: 10.6. Research Gaps10.6 Research Ga
- Page 87: 10.7. Example Problemsof value for
- Page 90 and 91: 11. The Botnet that Would not DieNu
- Page 92 and 93: 11. The Botnet that Would not Diefa
- Page 94 and 95: 11. The Botnet that Would not Dieti
- Page 96 and 97: 12. Malwarethan 128 million malware
- Page 98 and 99: 12. Malwareequipped with auto-updat
- Page 100 and 101: 12. Malwarethe introduction of App
- Page 102 and 103: 13. Social Engineering and Phishing
- Page 104 and 105: 13. Social Engineering and Phishing
- Page 106 and 107: 13. Social Engineering and Phishing
- Page 108 and 109: 13. Social Engineering and Phishing
- Page 111 and 112: 14 Grand ChallengesOne of the most
- Page 113: Part II: Related Work
- Page 116 and 117:
15. A Crisis of Prioritization•
- Page 118 and 119:
16. Forwardare accessible from the
- Page 120 and 121:
16. ForwardRecommendation 4: “The
- Page 122 and 123:
17. Federal Plan for Cyber Security
- Page 124 and 125:
17. Federal Plan for Cyber Security
- Page 126 and 127:
18. EffectsPlus18.1 Roadmap Structu
- Page 128 and 129:
18. EffectsPlus18.6 Identified Prio
- Page 130 and 131:
19. Digital GovernmentThe roadmap o
- Page 132 and 133:
20. Horizon2020• “Making cyber
- Page 135 and 136:
21 Trust in the Information Society
- Page 137:
21.2. Recommendationsallows for the
- Page 140 and 141:
22. ENISA Threat Landscape2. Malwar
- Page 142 and 143:
22. ENISA Threat LandscapeSocial Te
- Page 144 and 145:
22. ENISA Threat Landscapewriters w
- Page 146 and 147:
23. Cyber Security Research Worksho
- Page 149 and 150:
24 Cyber Security Strategy of theEu
- Page 151 and 152:
24.2. Strategic PrioritiesProposed
- Page 153 and 154:
25 The Dutch National Cyber Securit
- Page 155 and 156:
25.1. ContextsInternet (e.g., smart
- Page 157 and 158:
25.1. Contextsdefensive approaches
- Page 159 and 160:
25.2. Research Themesand radio broa
- Page 161 and 162:
25.2. Research Themesconsists of se
- Page 163 and 164:
25.2. Research ThemesRisk managemen
- Page 165 and 166:
AMethodologiesIn this appendix we o
- Page 167 and 168:
BSysSec Threats Landscape Evolution
- Page 169 and 170:
B.4. SysSec 2013 Threats LandscapeT
- Page 171 and 172:
B.4. SysSec 2013 Threats LandscapeS
- Page 173 and 174:
Bibliography[1] 10 Questions for Ke
- Page 175 and 176:
Bibliography[45] SCADA & Security o
- Page 177 and 178:
Bibliography[88] A. Avizienis, J.-C
- Page 179 and 180:
Bibliography[130] G. Cluley. 600,00
- Page 181 and 182:
Bibliography[172] D. Evans. Top 25
- Page 183 and 184:
Bibliography[214] ICS-CERT. Monthly
- Page 185 and 186:
Bibliography[253] C. Lever, M. Anto
- Page 187 and 188:
Bibliography[291] Mozilla. Browseri
- Page 189 and 190:
Bibliography[329] F. Raja, K. Hawke
- Page 191 and 192:
Bibliography[370] T. Telegraph. Bog
- Page 193 and 194:
Bibliography[407] W. Yang, N. Li, Y