Most concepts are drawn from Chapter 11
Distributed Systems: Security
Revised and Updated by: Chapter 2 Revision: Security Model
Copyright By PowCoder代写 加微信 powcoder
Some Cyber Security Facts https://www.cybintsolutions.com/cyber-security-facts-stats/
1. 95% of breached records came from only three industries in 2016
– Government, retail, and technology (high level of personal identifying information contained in their records)
2. There is a hacker attack every 39 seconds 3. 43% of cyber attacks target small business
– 64% of companies have experienced web-based attacks. 62% experienced phishing & social engineering attacks. 59% of companies experienced malicious code and botnets and 51% experienced denial of service attacks.
Some Cyber Security Facts https://www.cybintsolutions.com/cyber-security-facts-stats/
4. The average cost of a data breach in 2020 exceeded $150 million
– As more business infrastructure gets connected, data suggests that cybercrime will cost businesses over $2 trillion total in 2019.
– June 2019: The Australian National University has been hit by a massive data hack, with unauthorised access to significant amounts of personal details dating back 19 years.
5. Since COVID-19, the US FBI reported a 300% increase in reported cybercrimes
– As if a pandemic wasn’t scary enough, hackers leveraged the opportunity to attack vulnerable networks as office work moved to personal homes.
Some Cyber Security Facts https://www.cybintsolutions.com/cyber-security-facts-stats/
6. Over 75% of healthcare industry has been infected with malware over last year
7. Large-scale DDoS attacks increase in size by 500%
8. Approximately $6 trillion is expected to be spent globally on cybersecurity by 2021
Some Cyber Security Facts https://www.cybintsolutions.com/cyber-security-facts-stats/
9. Unfilled cybersecurity jobs worldwide is already over 4 million
– More than 500,000 cybersecurity jobs in the U.S. are unfilled, and postings are up 74% over the past five years
10. Connected IoT devices will reach 75 billion by 2025
– The risk is real with IoT and its growing.
– Smart Healthcare
– Smart City
– Smart Transport
Some Cyber Security Facts https://www.cybintsolutions.com/cyber-security-facts-stats/
11. 95% of cybersecurity breaches are due to human error
– Cyber-criminals and hackers will infiltrate your company through your weakest link, which is almost never in the IT department.
12. More than 77% of organizations do not have a Cyber Security Incident Response plan
– What’s worse? An estimated 54 percent of companies say they have experienced one or more attacks in the last 12 months.
13. Total cost for cybercrime committed globally will reach $6 trillion by 2021
– As long as you’re connected to the Internet, you can become a victim of cyber attacks.
‘Zoom bombers’ invade virtual classrooms’:
Unauthorized Participants and Disruptions
Zoom Challenges
8 https://www.sumologic.com/blog/zoom-security-challenges/
Learning objectives
Security model – Types of threat
Basic techniques
– Cryptographic techniques
Authentication
Certificates and credentials Access control
– Audit trails
Symmetric and asymmetric encryption concepts
Digital signatures
Approaches to secure system design
Pragmatics and case studies (Kerberos and Secure Socket
Why Security is so important in DS?
Security Goal: Restrict access to information/resources to just to those entities that are authorized to access.
There is a pervasive need for measures to guarantee the privacy, integrity, and availability of resources in DS.
Security attacks take various forms: Eavesdropping, masquerading, tampering, and denial of service.
Designers of secure distributed systems must cope with the exposed interfaces and insecure network in an environment where attackers are likely to have knowledge of the algorithms used to deploy computing resources.
Cryptography provides the basis for the authentication of
messages as well as their secrecy and integrity.
How is security in real world?
In the physical world, organisations adopt “security policies” that provide for the sharing of resources within specified limits.
– Company may permit entry to its building for its employees and for accredited visitors.
– A security policy for documents may specify groups of employees who can access classes of documents or it may be defined for individual documents and users.
Security policies are enforced with security mechanisms.
– Access to building may be controlled by a reception clerk, who issues badges to accredited visitors, and enforced by security guard or by electronic door locks.
In electronic world, the distinction between security policy and mechanisms is equally important.
Chapter 2 Revision: Objects and principals
Access rights
invocation result
Server Principal (user) Network Principal (server)
Object (or resource)
– Mailbox, system file, part of a commercial web site
Principal
– User or process that has authority (rights) to perform actions – Identity of principal is important
Chapter 2 Revision: The enemy
Process p m
Communication channel
– On applications that handle financial transactions or other information
whose secrecy or integrity is crucial
Enemy (or adversary)
– To processes, to communication channels, denial of service
Chapter 2 Revision: Secure channels
Cryptography PrincipalB Processp Secure channel Processq
PrincipalA The enemy
POrwonpeersrhtiepsofsecrets:
Cryptographic concealment is based on:
Each process is sure of the identity of the other Conventional shared crypto keys
Confusion and diffusion
Data is private and protected against tampering
Protection against repetition and reordering of data Public/private key pair
Employs cryptography
Secrecy based on cryptographic concealment
Authentication based on proof of ownership of secrets 14
Threats and Attacks
Security Threats – Three broad Classes:
– Leakage: Acquisition of information by unauthorised recipients
– Tampering: Unauthorised alteration of information
– Vandalism: Interference with the proper operation of systems
Method of Attacks are listed below: Eavesdropping – A form of leakage
– obtaining private or secret information or copies of messages without authority.
Masquerading – A form of impersonating
– assuming the identity of another user/principal – i.e, sending or receiving messages using the identity
of another principal without their authority.
Message tampering
– altering the content of messages in transit
man in the middle attack (tampers with the secure channel mechanism) Replaying
– storing secure messages and sending them at a later date
Denial of service – Vandalism
– flooding a channel or other resource, denying access to others
Threats not defeated by secure channels or other cryptographic techniques
Denial of service (DoS) attacks
– Deliberately excessive use of resources to the extent that they are
not available to legitimate users
E.g. the Internet ‘IP spoofing’ attack, February 2000
Trojan horses and other viruses
– Viruses can only enter computers when program code is imported.
– But users often require new programs, for example:
New software installation
Mobile code downloaded dynamically by existing software (e.g. Java
Accidental execution of programs transmitted surreptitiously
– Defences: code authentication (signed code), code validation (type checking, proof), sandboxing.
The February 2000 IP Spoofing DDoS attack (creation of IP packets with a false source IP address)
Campus intranets
IP = n.n.n.i
yahoo.com IP = y.y.y.y
Compromised host on each local network sends repeatedly (for all i):
resulting in:
amazon.com IP = x.x.x.x
Echo request | source = x.x.x.x | destination = n.n.n.i
Echo reply | source = n.n.n.i | destination = x.x.x.x
Securing Electronic Transactions
– Traditionally no support for security.
– But it is important to Keep messages secret. – Modern mail clients incorporate cryptography.
Purchase of goods and services
Banking transactions
Micro-transactions
– Currently access to Web pages is not charged, but the development of
Web as a highly quality publishing medium surely needs it.
– The price of such services may amount to only a fraction of cent and the payment overhead must be low (for this to be feasible).
– How to manage “fraudulent vendors” – who obtain payment with no
intension of supplying good.
Sensible security policies for Internet vendors and buyers leads to various requirements
Authenticate the vendor to the buyer
Keep buyer’s credit card details secure
Ensure that content is delivered to the buyer
Authenticate the identity of account holder before giving them access to their account
Designing Secure Systems
Immense strides have been made in recent years in the development of cryptographic techniques and their applications, yet design of secure systems remains an inherently difficult task.
– Aim: exclude all possible attacks and loop holes.
– This looks like programmer aiming to exclude all bugs from his/her program.
Security is about avoiding disasters and minimizing mishaps. When designing for security it is necessary to assume the worst.
The design of security system is an exercise in balancing costs against threats:
– A cost (computational and network usage) is incurred for their use.
– Inappropriately specified security measures may exclude legitimate users from performing necessary actions.
Worst case assumptions and design guidelines
Interfaces are exposed
– DSs made up of processes with open interfaces
Networks are insecure
– Messages sources can be falsified.
Limit the lifetime and scope of each secret
– Passwords and keys validity – needs to be time restricted.
Algorithms and code are available to hackers
Attackers may have access to large resources
Minimise the trusted base. 21
Overview of Security Techniques
Digital cryptography provides the basis for most computer security mechanisms, but it is important to note that computer security and cryptography are distinct subjects.
– Cryptography is an art of encoding information in a format that only intended recipient can access.
– Cryptography can be used to provide a proof of authenticity of information in a manner analogous to the use of signature in conventional transactions.
We will focus more on security of distributed systems and applications rather than cryptography algorithms.
Cryptography: Introduction
Cryptography: encryption and decryption
Encryption is the process of encoding a message in
such a way as to hide its contents.
Modern cryptography includes several secure algorithms for encrypting and decrypting messages. They are based on keys.
A cryptography key is a parameter used in an encryption algorithm in such a way that the encryption cannot be reversed without a knowledge of the key.
Classes of Cryptography Algorithms
There are two main classes:
– Shared Secret Keys:
The sender and recipient share a knowledge of the key and it must not be revealed to anyone.
– Public/Private Key Pair:
The sender of a message uses a recipient’s public key to encrypt the message. The recipient uses a corresponding private key to decrypt the message.
Uses of Cryptography:
– Secrecy and integrity (to stop eavesdropping and tampering) + also use
redundant information (checksums) for maintaining integrity.
– Authentication
– Digital Signatures
Security notations –
Familiar names and notations in security literature
KA Alice’s secret key
KB Bob’s secret key
KAB Secret key shared between Alice and Apriv Alice’s private key (known only to Alice)
KApub Alice’s public key (published by Alice for all to read)
{M} Message M encrypted with key K K
[M]K Message M signed with key K
Alice First participant
participant
in three- and four-party protocols in four-party protocols
Scenario 1:
Secret communication with a shared secret key
Alice wishes to send some information secretly. Alice and Bob share a secret key KAB.
1. Alice uses KAB and an agreed encryption function E(KAB, M) to encrypt and send any number of messages {Mi}KAB to Bob.
2. Bob reads the encrypted messages using the corresponding decryption function D(KAB, M).
Alice and Bob can go on using KAB as long as it is safe to assume that KAB has not been compromised.
Key distribution: How can Alice send a shared key KAB to Bob securely?
Freshness of communication: How does Bob know that any {Mi} isn’t a copy of
an earlier encrypted message from Alice that was captured by Mallory and
replayed later? Problem: if the message is a request to pay some money to
someone. Mallory might trick Bob into paying twice?
Scenario 2: Authenticated communication with a server (Server knows secret keys of all parties)
Bob is a file server; Sara is an authentication service. Sara shares secret key KA with Alice and secret key KB with Bob.
1. Alice sends an (unencrypted) message to Sara stating her identity and requesting a ticket for access to Bob.
2. Sara sends a response to Alice. {{Ticket}KB, KAB}KA. It is encrypted in KA and consists of a ticket (to be sent to Bob with each request for file access) encrypted in KB and a new secret key KAB.
3. Alice uses KA to decrypt the response.
4. Alice sends Bob a request R to access a file: {Ticket}KB, Alice, R.
5. The ticket is actually {KAB, Alice}KB. Bob uses KB to decrypt it, checks that Alice’s name matches and then uses KAB to encrypt responses to Alice.
This is a simplified version of the Needham and Schroeder (and Kerberos) protocol.
Timing and replay issues – addressed in N-S and Kerberos.
Not suitable for e-commerce because authentication service doesn’t scale… 27
Scenario 2: Illustration
2: {{Ticket}KB, KAB}KA
Sara knows KA and KB Can create KAB
4{Ticket}KB, Alice, R. {Response Msg} KAB
The ticket is actually {KAB, Alice}KB.
Limitation of Needham and
It depends upon prior knowledge by the
authentication server Sara of Alice’s and Bob’s keys.
This is feasible in a single organisation where Sara
run a physically secure computer and is managed by
a trusted principal.
– Not suitable in E-commerce or other wide area applications.
Usefulness of challenges: They introduced the concept of a cryptographic challenge. That means in step 2 of our scenario, where Sara issues a ticket to Allice encypted in Alice’s secret key, KA .
Scenario 3:
Authenticated communication with public keys
Bob has a public/private key pair
1. Alice obtains a certificate that was signed by a trusted authority stating Bob’s public key KBpub
2. Alice creates a new shared key KAB , encrypts it using KBpub using a public-key algorithm and sends the result to Bob.
3. Bob uses the corresponding private key KBpriv to decrypt it.
(If they want to be sure that the message hasn’t been tampered with, Alice can add an agreed value to it and Bob can check it.)
Mallory might intercept Alice’s initial request to a key distribution service for Bob’s public-key certificate and send a response containing his own public key. He can then
intercept all the subsequent messages.
Scenario 4:
Digital signatures with a secure digest function
Alice wants to publish a document M in such a way that anyone can verify that it is from her.
1. Alice computes a fixed-length digest of the document Digest(M).
2. Alice encrypts the digest in her private key, appends it to M and makes the resulting signed document (M, {Digest(M)}KApriv) available to the intended users.
3. Bob obtains the signed document, extracts M and computes Digest(M).
4. Bob uses Alice’s public key to decrypt {Digest(M)}KApriv and compares it with his computed digest. If they match, Alice’s signature is verified.
A Certificate with Digital signatures
IBM (employer) uses UniMelb’s public key to decrypt {Digest(M)} KUniMelbpriv and compares it with his computed digest of Transcript content. If they match, UniMelb’s signature is verified. Then IBM trusts and hires you☺ Algo MD5 128 bit from: https://www.freeformatter.com/message-digest.html The MD5 hashing algorithm is a one-way cryptographic function that accepts a message of any length as input and returns as output a fixed-length digest
value to be used for authenticating the original message.
Transcript
1. COMP90015: Distributed Systems: 95 marks 2….
Computed message digest: {491103ea18660f4c4d9f3c32af5d28f5}KUni Algorithms
Message M, key K, published encryption functions E, D
Symmetric (secret key)
E(K, M) = {M}K D(K, E(K, M)) = M
Same key for E and D
M must be hard (infeasible) to compute if K is not known.
Usual form of attack is brute-force: try all possible key values for a known pair M, {M}K. Resisted by making K sufficiently large ~ 128 bits
Asymmetric (public key)
Separate encryption and decryption keys: Ke, Kd
D(Kd. E(Ke, M)) = M
depends on the use of a trap-door function to make the keys. E has high
computational cost. Very large keys > 512 bits
Hybrid protocols – used in SSL (now called TLS)
Uses asymmetric crypto to transmit the symmetric key that is then used to encrypt a session.
Public Key Infrastructure (PKI)
PKI allows you to know that a given public key belongs to a given user
PKI builds on asymmetric encryption:
– Each entity has two keys: public and private
– Data encrypted with one key can only be decrypted with other.
– The private key is known only to the entity
The public key is given to the world encapsulated in a X.509 certificate
Public Key Infrastructure (PKI) Overview
X.509 Certificates
Certificate Authorities (CAs)
Certificate Policies – Namespaces
Requesting a certificate – Certificate Request
– RegistrationAuthority
Certificates
CFiegrutriefi7c.a4teA:licaes’stabtaenmk eanctcosuignnt ceedrtbifiycaaten appropriate authority.
Certificates require:
1. Certificate type: Account number • An agreed standard format
2. Name: Alice
• Agreement on the construction of chains of trust.
3. Account: 6262626
• Expiry dates, so that certificates can be revoked.
4. Certifying authority: Bob’s Bank
5. Signature: {Digest(field 2 + field 3)}KBpriv
Public-key certificate for Bob’s Bank
1. Certificate type:
3. Public key:
4. Certifying authority: 5. Signature:
Public key Bob’s Bank
Fred – The Bankers Federation
{Digest(field 2 + field 3)}KFpriv 36
X509 Certificate format
Period of validity Administrative information Extended Information
Distinguished Name, Public Key Distinguished Name, Signature Not Before Date, Not After Date Version, Serial Number
It provides a public key to a named entity called the subject. The binding is in the signature, which is issued by another entity called issuer (CA, Certificate Authority)
Certificates
Similar to passport or driver’s license
Public Key
111, of
BD 01-0X-197X Male 165cms, 65Kg Valid: Jun 30, 2030
An example of Certificate
Certificate: Data:
Version: 3 (0x2)
Serial Number: 28 (0x1c)
Signature Algorithm: md5WithRSAEncryption
Issuer: C=US, O=Globus, CN=Globus Certification Authority Validity
Not Before: Apr 22 19:21:50 2020 GMT
Not After : Apr 22 19:21:50 2030 GMT
Subject: /O=Grid/O=Globus/OU=cis.unimelb.edu.au/CN= Subject Public Key Info:
Public Key Algorithm: RSAEncryption RSA Public Key:
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com