indentification Flashcards

1
Q

1 reason why does a service provider need to track the identity of users requesting its services

A

the user identity is a parameter in access control decision

user identities aren’t always necessary to access control

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

2nd reason why does a service provider need to track the identity of users requesting its services

A

the user identity is recorded when logging security relevant events in an audit trail
identities are more useful in audit logs, for accountability

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

entity authentication

A

process where one party is assured on the identity of a second party in protocol

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

objectives of entry authentication

A
  1. honest participant A can successfully authentication itself to the verifier B
  2. Transferability: B can’t re-use A’s identification to impersonate A to another party
  3. the probability that a third party C, distinct from A, playing the role of A, can cause B to accept A’s identity is negligible
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what is a relay attack

A

alice pays bob, bob thinks he’s sending alice’s payment info to alice, but really he’s sending it to chloe, who’s impersonating alice (relays authentication credentials) . Chloe sends that shit to dennis, the menace. Like, chloe? Chloe.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what is a relay attack also called

A

also called a mafia fraud attack

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

what is WEAK and SIMPLE authentication

A

password based
unilateral, meaning one entity proves its identity to the verifier
proves knowledge of the secret by giving up the secret

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

what is strong authentication

A
  • Involves mutual authentication; both parties take both the roles of claimant and verifier:
  • Challenge-response protocols: sequence of steps to prove knowledge of shared secrets.
  • Prove knowledge of secret WITHOUT giving up the secret
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

salting

A

Salt is random data that is used as an additional input to a one-way function that “hashes” a password. Salts are used to safeguard passwords in storage. The primary function of salts is to defend against dictionary attacks. basically its a nonce.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Password storage security relies on a cryptographic construct called one-way function

A

A one-way function 𝒇𝒇 is a function that is
relatively easy to compute but hard to
reverse.
• Given an input 𝑥𝑥 it is easy to
compute 𝑓𝑓(𝑥𝑥), but given an output 𝑦𝑦
it is hard to find 𝑥𝑥 so that 𝑦𝑦 = 𝑓𝑓(𝑥𝑥)

Hash functions are an example of one-way
function:
• A hash function 𝑓𝑓 takes an input 𝑥𝑥 of
arbitrary length, and produces an
output 𝑓𝑓(𝑥𝑥) of fixed length.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Suppose H is a hash function. We say H satisfies:

A

 Pre-image resistant if given a hash value 𝑦𝑦, it is computationally infeasible to find 𝑥𝑥 such that 𝐻𝐻(𝑥𝑥) = 𝑦𝑦.
 Collision resistant if it is computationally infeasible to find a pair (𝑥𝑥, 𝑦𝑦) such that 𝑥𝑥 ≠ 𝑦𝑦 and 𝐻𝐻(𝑥𝑥) = 𝐻𝐻(𝑦𝑦).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

fucking dumb storing plaintext passwords

A

• Passwords stored in plaintext.
• Claimant’s password is checked against the
database of passwords.
• No protection against insider (system admin) or
an attacker who gains access to the system.
Hence dispute is possible!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

why are hashed and encrypted passwords good

A

• Passwords are encrypted, or hashed, and only
the encrypted/hashed passwords are stored.
• Claimant’s password is hashed/encrypted, and
checked against the database of
hashed/encrypted password.
• Some degree of protection against
insider/attacker

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

passwords at the application level, why might it be eksies

A

passwords may be temporarily held in intermediate storage locations like buffers, caches or web pages

The management of these storage locations is normally beyond the control of the user; a password may be
kept longer than the user has bargained for

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

what are the attacks on passwords

A

offline guessing attacks like exhaustive attacks and dictionary attacks

phishing and spoofing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

what is an offiline guessing attack

A

attack where attacker obtains the hashed passwords, then attempts to guess the passwords

This is a plausible threat, due to:
 many incidents of stolen (hashed) passwords as a consequence of hacks on servers.
 usage of the same passwords across different accounts; so compromise of a password for one account
affects other accounts.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

what is a brute force attack

A

Brute force guessing attack against passwords tries to guess password
by enumerating all passwords and their hashes in sequence, and check whether they match the target hashes.
 A measure against brute force attack is to increase the space of possible passwords, e.g., longer passwords, allowing more varieties of symbols (alphabets, numerals, signs).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

A measure of the strength of passwords against brute-force attack is based on what thing

A

the concept of entropy from information theory.
it’s log2 of the search space.
so er, like, “ Suppose the set of passwords 𝑋𝑋 is drawn from any 5 character strings, each character
ranges from ‘a’ to ‘z’.=, then search space is 26^5. so entropy is log2(26^5) which is 23.5. I guess bring a calculator.

erm, somehow, the approximate number of guesses needed is 2^23.5. okay I guess mathwise that makes sense when you consider the log

19
Q

how to prevent brute force attack

A

choose password with high entropy

20
Q

why do we suck at preventing brute force attack

A

 However, hashed passwords, especially for human-generated passwords, are still vulnerable to dictionary attack.
 This exploits weakness in human-chosen passwords, which tend to derive from words in natural languages.

21
Q

what is the pre computed hash table strategy for cracking hashed passwords

A

A strategy for cracking hashed passwords is to pre-compute a hash table, containing pairs of passwords and
their hashes.
• If we have 𝑘𝑘 password candidates and each hash has 𝑛𝑛 bit, then we have a table of size 𝑘𝑘 × 𝑛𝑛.
• This may not be practical if 𝑘𝑘 is large.

  • Hash tables are often represented using a data structure called rainbow table.
  • Not all hashes are stored; some will be computed from the stored hashes.
  • Not all hashes are represented.
  • Tradeoff between space requirement and query time
22
Q

Salting describe more pl0x

A

• To reduce the effectiveness of offline attacks using
pre-computed hashes, a salt is added to a password
before applying the hash function.
• A salt is just a random string.
• Each password has its own salt.
• The salt value is stored along with the hash of password+salt.
• So the salt is not secret.
• For a salt of 𝑛𝑛-bit, the attacker needs to precompute 2𝑛𝑛 of hashes for the same password.

23
Q

password policies rap

A

set a password a mass of words dont let it age
limit the logins and don’t default to basic (preset) names
then tell the user of who(is) trying to get his name
he’s gotta change he’s gotta make up a passphrase
or draw on a interface or he’ll pick some dogs outofa picture frame
pause
then tell he’s got an OTP
what’s an OTP
just one time just tell me

24
Q

alt forms of passwords rap

A

he’s gotta change he’s gotta make up a passphrase
or draw on a interface or he’ll pick some dogs up outta a picture frame
then tell he’s got an OTP
what’s on OTP
just one time just tell me

25
Q

OTP

A

 The one-time passwords scheme attempts to address a key weakness in the password-based
scheme: reuse of stolen passwords.
 The idea is to generate a list of passwords, and each password is used only once.
 We’ll discuss one scheme based on Lamport’s one-time passwords.
 Lamport’s scheme uses a one-way function, e.g., cryptographic hash, to generate a sequence of
passwords.

26
Q

phishing and spoofing

A

TLDR: Im telling secret’s to michael but he’s actually vicky
 Identification and authentication through
username and password provide unilateral authentication.
 Computer verifies the user’s identity but the user has no guarantees about the identity of the party that has received the password.
 In phishing and spoofing attacks, a party voluntarily sends the password over a channel, but is misled about the end-point of the channel.

27
Q

spoofing (as a joke)

A

fake login screen lol

28
Q

spoofing (as a serious_)

A
  1. Attacker starts a program that presents a fake login screen and leaves the computer.
  2. If the next user coming to this machine enters username and password on the fake login screen, these values are captured by the program.
     Login is then typically aborted with a (fake) error message
    and the spoofing program terminates.
     Control returned to operating system, which now prompts the user with a genuine login request.
29
Q

elaborate on counter measures against attacks like phishing and spoofing

A

I tell the user of who(is) trying to get his name
switch the beat
then I get a trusted path user’s never spoof’d it’s mutual
authentication
pause
see I key your back you key mine
CNTRLALTDELETE is a secure (attention line)

30
Q

Phishing regular

A

computer says: hi sir enter here upgrade your passwords make it clear

31
Q

phishing social engineering

A

TLDR: my name is vincent adultman

attacker impersonates ther user to trick a system operator into releasing the password to the attacker.

32
Q

how to protect the password file

A

Options for protecting the password file:
 cryptographic protection,
 access control enforced by the operating system,
 combination of cryptographic protection and access control, possibly with further measures to slow down dictionary attacks

33
Q

what is access control

A
  1. Only privileged users must have write access to the password file.
    • Otherwise, an attacker could get access to the data of other users simply by changing their password, even if it is protected by cryptographic means.
  2. If read access is restricted to privileged users, then passwords in theory could be stored unencrypted.
  3. If password file contains data required by unprivileged users, passwords must be “encrypted”; such a file can still be used in dictionary attacks.
    • Thus modern Unix/Linux system hides the actual password file in /etc/shadow that is not accessible to non-privileged users.
34
Q

what are security tokens, say 4 things

A

offline devices that generate sequencess of seemingly random numbers
the number generation algo is deterministic but it’s dependant on a seed value and a challenge
seed values are secret and shared between the verifier and claimant. Challenges are provided by verifier each time the authentication is requested.
seed values are stored in tamper proof chips inside the tokens.

35
Q

what is the most secure solution for authenticating a person

A

biometric

36
Q

fingerprint authentication walk through the process

A

Enrolment: reference sample of the user’s fingerprint is acquired
at a fingerprint reader.
Features are derived from the sample: Fingerprint minutiae: end
points of ridges, bifurcation points, core, delta, loops, whorls, …
For higher accuracy, record features for more than one finger.
Feature vectors are stored in a secure database.
When the user logs on, a new reading of the fingerprint is taken;
features are compared against the reference features.

37
Q

what are the two purposes of biometric authentication

A

identification: 1:n comparison tries to indentify the user from a database of n people
Verification: 1:1 comparison checks whether there is a match for a given user

38
Q

talk about acceptance in biometric authentication

A

user is accepted if match is above a predefined threshold

39
Q

false match rate

A

number of successful false matches / number of attempted false matches

40
Q

false non match rate

A

number of rejected genuiine matches/ number of attempted genuine matches

41
Q

equal error rate

A

when FMR and FNMR are equal.

Currently, the best state-of-the-art fingerprint recognition schemes have an EER of about 0.5 - 2%

42
Q

what is neelu and 50Cent rapping on an song tgt about fingers

A

Currently, the best state-of-the-art fingerprint recognition schemes have an EER of about 0.5 - 2%

43
Q

how fingerprints have been stolen

A
In general, may be unique but they
are no secrets.
• In September 2013, hackers show
how to lift fingerprints from
iPhone 5s. Similar attacks also
apply to Samsung S5 phone.
Rubber fingers have defeated many
commercial fingerprint recognition
systems in the past.
• Minor issue if authentication takes
place in the presence of security
personnel.
• When authenticating remote users
additional precautions have to be
taken to counteract this type of
fraud.