Quiz 1 Flashcards

1
Q

What makes a cryptographically secure hash function?

A
  1. Collision resistance
  2. Hiding/Pre-Image resistance
  3. Puzzle friendliness (hard to find x given y)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Hash Pointers

A

Pointer to where some data is stored, cryptographic hash of info.

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

Hash Function

A

Mathematical functions that satisfy the following three properties:
• Inputs can be any size (not-fixed);
• Outputs are fixed-size (we’ll generally employ a hash function such as SHA-256 that has an output size of 256 bits)
• Efficiently computable, i.e., the mapping should be efficiently (in polynomial time in terms of the input size) computable

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

Blockchain

A

Linked list of hash pointers, each block contains header of previous block

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

Merkle Tree

A

Binary tree of hash pointers

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

Digital Signature

A

Private key to encrypt/sign, public key to decrypt

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

Symmetric encryption

A

Single key encryption

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

Asymmetric/Public key encryption

A

Public key used to encrypt, private key used to decrypt

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