Privacy enhancing security COM3030

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/46

encourage image

There's no tags or description

Looks like no tags are added yet.

47 Terms

1
New cards

What is Privacy as Control?

User participation, Transparency, Accountability and Organisational compliance

2
New cards

What is Privacy as Transparency?

Improve user agency, Aid decision making and transparency of social impact

3
New cards

What is Privacy as confidentiality

Minimize data disclosure, distribute trust

4
New cards

Who is an adversary?

The “Others“, any person or entity outside of your system

5
New cards

Why is Surveillance not inherently Security?

Surveillance may not be effective for smart adversaries, Surveillance tools can be abused and can be subverted for crime/terrorism

6
New cards

What makes Privacy a Security property?

For individuals its about protection against crime and control over one’s information. For companies its about protection of trade secrets and internal operations. For governments its about protection of national secrets and law enforcement investigations.

7
New cards

What are the privacy properties?

Confidentiality, Pseudonymity, Anonymity, Unlinkability, Unobservability, Plausible deniability

8
New cards

What is the No Free Lunch Theorem?

The No Free Lunch Theorems state that any one algorithm is optimal for one solution cannot be universally superior to any other algorithm.

9
New cards

What is Pseudonymity?

A user may use a resource or service without disclosing its identity, but can still be accountable for that use.

10
New cards

What is Anonymity?

Anonymity is the state of being unidentifiable within a set of all possible subjects that might cause an action. Decoupling identity and action.

11
New cards

Anonymity vs Privacy

Privacy is the control over personal information and the ability to keep it confidential, whereas anonymity is being unknown and unidentifiable.

12
New cards

What is Unlinkability?

The ability to make multiple uses of resources or services without others being able to link these uses together. Decoupling two actions from one user.

13
New cards

What is Unobservability?

Using a resource or service without others, especially third parties, being able to observe its use. Decoupling observation from action. Implies anonymity

14
New cards

What is Plausible Deniability?

Making it impossible to prove a user knows, has done or has said something. Decoupling observation from true action

15
New cards

What is a One Time Pad?

A single use, random string used for encryption the same length as the string

16
New cards

What is Computational Security?

Computational security is the property of a cryptographic system where breaking the encryption or gaining meaningful information is theoretically possible but practically infeasible due to resource constraints, such as time, computational power, or money

17
New cards

What is Public key encryption?

An asymmetric cryptography method that uses a mathematically linked public and private key to secure data and enable confidential communication.

18
New cards

What is Encryption’s requirements, pros and cons?

Encryption requires a secret key. It has a strong guarantee at the cost of efficiency and flexibility. Information leakage is negligible.

19
New cards

What is Obfuscation?

Obfuscation has no secret. It limits information leakage by adding and removing obfuscation noise.

20
New cards

What is the difference between a key attribute, sensitive attribute and a quasi-identifier?

A key attribute is a unique identifier, a sensitive attribute is one that is legally or ethically protected, and a quasi-identifier is an attribute that does not uniquely identify a person on its own but can reveal identity when combined with other data.

21
New cards

What are the Data Anonymisation properties?

k-anonymity, t-closeness, l-diversity among others.

22
New cards

What are the four data anonymisation techniques?

Data Generalization, Data Suppression, Dummy data addition and Data Perturbation

23
New cards

What is Data Generalisation?

Coarsening an attribute to a more general value through reduction or bucketisation. E.g. changing a ZIP code from 51300 to 51*** or an age of 21 to 10-30.

24
New cards

What is Data Suppression?

Suppressing information by not releasing values e.g Hiding 50% of values in a column for count suppression, or 100% for full suppression.

25
New cards

What is the difference between data generalisation and suppression?

Generalisation is replacing values with a less precise one, whereas suppression is not releasing the values.

26
New cards

What is Dummy Addition?

Adding fake data to what the adversary receives. This leads to errors in adversary’s inference and must be indistinguishable from real data.

27
New cards

What is the difference between data suppression and data anonymisation?

Data Suppression is removing values whereas data anonymisation is altering values.

28
New cards

What is Data Anonymisation?

Decoupling identity from information using quasi-identifiers and k-anonymity.

29
New cards

What is k-anonymity?

Modifying attributes such that any possible grouping has at least k-values per quasi-identifier

30
New cards

What is l-diversity?

Every grouping has at least l sensitive values

31
New cards

What is T-closeness?

How close is the distribution of sensitive values in a particular table from distribution over all sensitive values (from public sources).

32
New cards

What is Data Perturbation?

Adding noise, shuffling values or altering numerical values within certain limits and preserving statistical properties.

33
New cards

What is differential privacy?

When an adversary can make the same inference about any individual private information, whether or not that individual’s private information is included in the input of the analysis.

34
New cards

What is a Shamir Threshold Secret Sharing?

A secret sharing scheme splits a secret into shares under some policy, such that the threshold shares can later be used to recover the secret. At least t+1 participants are needed.

35
New cards

What is a weighted structure for secret sharing? Ψ 𝐴 = 𝑡 < 𝑤𝑒𝑖𝑔ℎ𝑡 𝐴 𝑎𝑛𝑑 𝐴 ⊆ 𝑈

The sum of all weights assigned to set 𝑥 is at least 𝑡 + 1. Each participant has a positive weight based on their role.

36
New cards

What is Hierarchical structure for Secret Sharing?

Participants are divided into disjointed levels according to their importance, with the lowest being 1.

37
New cards

How can a dishonest Shamir dealer cheat?

By using a polynomial with the wrong degree or distributing inconsistent shares, causing unauthorised recovery or inconsistent secrets.

38
New cards

How can a dishonest participant cheat during recovery?

By submitting a fake share, preventing honest participants from recovering the original secret.

39
New cards

What is secure multi-party computation?

A protocol allowing parties to compute a public function over private inputs without revealing those inputs.

40
New cards

What is oblivious transfer?

A two-party primitive where the receiver obtains selected data without revealing the choice, and the sender's unselected data remains hidden.

41
New cards

What are OT correctness and privacy?

Correctness means intended outputs are obtained; privacy means each party learns nothing beyond its intended output.

42
New cards

What is receiver security in OT?

A sender cannot determine which input the receiver selected.

43
New cards

What is sender security in OT?

A receiver cannot learn the sender's unselected input.

44
New cards

Name five outsourcing techniques from the module.

Oblivious transfer, private information retrieval, privacy-preserving machine learning, searchable encryption, and secret sharing.

45
New cards

What is perfect privacy in secret sharing?

Unauthorised shares reveal no information about the secret; the adversary's advantage is zero.

46
New cards

What is computational privacy for secret sharing scheme?

The adversary's advantage is negligible, so it can guess the secret bit with only approximately 50% probability.

47
New cards

What is a key advantage of zero-knowledge age verification?

A user can prove they meet an age requirement without revealing unnecessary identity information.