Board paper

Cyber Security 2022 Board Question Paper

ITM 304 · Cyber Security

examination paper loaded.
Programme
BIM
Academic year
Semester 5
Exam year
2022 AD
Sitting
regular
Full marks
40
Duration
120 minutes

Tribhuvan University

Faculty of Management

Office of the Dean

2022 AD / Regular Examination

Course: ITM 304 · Cyber Security

Level: Bachelor of Information Management (BIM) · Semester 5

Full Marks: 40

Time: 2 hrs.

Time: 2 hrs | Full Marks: 40 | Pass Marks: 20

Subjective Questions

  1. i. Define denial of receipt. ii. List the differences between Block and stream cipher. iii. List different types of VPN. iv. List the characteristics of proactive password checker. v. Define Principle of Psychological Acceptability. vi. Differentiate between Virus and Worm. vii. Differentiate between Hacker and Cracker. viii. Define the Concept of Secure Email. ix. Define Inference control. x. Differentiate between Trade mark and Patent.

    [10]
    View model solution

    Step-by-Step Solutions: Core Cyber Security Concepts

    i. Denial of Receipt:

    A repudiation attack where a recipient maliciously denies having received a specific message, file, or transaction. Countered via non-repudiation digital receipts.

    ii. Block Cipher vs. Stream Cipher:

    • Block Cipher: Encrypts fixed-size blocks of plaintext simultaneously (e.g., AES 128-bit blocks, DES 64-bit blocks).
    • Stream Cipher: Encrypts plaintext bit-by-bit or byte-by-byte continuously using a pseudorandom keystream (e.g., RC4, ChaCha20).

    iii. Types of VPN:

    1. Remote Access VPN: Connects individual remote telecommuters to a corporate network.
    2. Site-to-Site VPN: Connects entire branch office networks securely across the internet.

    iv. Characteristics of a Proactive Password Checker:

    Rejects weak or compromised passwords during creation by verifying length, entropy, and checking against leaked password dictionaries.

    v. Principle of Psychological Acceptability:

    Security mechanisms should not make resource access so cumbersome that users attempt to bypass or subvert the controls.

    vi. Virus vs. Worm:

    A virus requires a host executable to propagate; a worm is a standalone program that self-replicates across networks autonomously.

    vii. Hacker vs. Cracker:

    A hacker explores and analyzes security architectures; a cracker breaches security systems with malicious intent for theft or vandalism.

    viii. Secure Email:

    Email secured using asymmetric cryptography for end-to-end encryption and digital signatures (e.g., PGP, S/MIME).

    ix. Inference Control:

    Techniques in statistical databases that prevent users from deducing confidential individual records through aggregate statistical queries.

    x. Trademark vs. Patent:

    A trademark protects distinctive brand names and logos; a patent grants exclusive rights to novel functional inventions.

  2. Explain Biba integrity model with example.

    [5]
    View model solution

    Biba Integrity Model

    The Biba Integrity Model is a formal state-machine model focused on information integrity rather than confidentiality:

    1. Simple Integrity Axiom (No Read Down): A subject at a given integrity level cannot read data from a lower integrity level (ss can read o    I(s)I(o)o \iff I(s) \le I(o)).
    2. Star (\star) Integrity Axiom (No Write Up): A subject at a given integrity level cannot write data to a higher integrity level (ss can write o    I(o)I(s)o \iff I(o) \le I(s)).
    • Goal: Prevents low-integrity (untrusted) data from contaminating high-integrity critical data.
  3. In a public-key system using RSA, you intercept the ciphertext C=8 sent to a user whose public key is e=3, n=33. What is the plaintext M?

    [5]
    View model solution

    RSA Decryption Numerical Problem

    Given:

    • Ciphertext C=8C = 8
    • Public Key e=3,n=33e = 3, \quad n = 33

    Step 1: Factor nn to find pp and qqn=33=3×11    p=3,q=11n = 33 = 3 \times 11 \implies p = 3, \quad q = 11$

    Step 2: Compute Euler’s Totient ϕ(n)\phi(n)ϕ(n)=(p1)(q1)=(31)(111)=2×10=20\phi(n) = (p - 1)(q - 1) = (3 - 1)(11 - 1) = 2 \times 10 = 20$

    Step 3: Compute Private Key dded1(modϕ(n))    3d1(mod20)e \cdot d \equiv 1 \pmod{\phi(n)} \implies 3d \equiv 1 \pmod{20}$

    Testing values: 3×7=211(mod20)    d=73 \times 7 = 21 \equiv 1 \pmod{20} \implies \mathbf{d = 7}.

    Step 4: Decrypt Ciphertext CC to find Plaintext MMM=Cd(modn)=87(mod33)M = C^d \pmod n = 8^7 \pmod{33}$

    • 82=642(mod33)8^2 = 64 \equiv -2 \pmod{33}
    • 84(2)2=4(mod33)8^4 \equiv (-2)^2 = 4 \pmod{33}
    • 86=84×824×(2)=8(mod33)8^6 = 8^4 \times 8^2 \equiv 4 \times (-2) = -8 \pmod{33}
    • 87=86×8(8)×8=642(mod33)8^7 = 8^6 \times 8 \equiv (-8) \times 8 = -64 \equiv 2 \pmod{33}

    The original plaintext is M=2\mathbf{M = 2}.

  4. Explain DSS approach and RSA approach with figure.

    [5]
    View model solution

    Comparison: DSS vs. RSA Digital Signature Approaches

    1. RSA Approach: The hash of the message is directly encrypted with the sender’s private key to form the signature. Anyone with the sender’s public key can decrypt the signature to verify the hash.
    2. DSS (Digital Signature Standard) Approach: Uses SHA with the Digital Signature Algorithm (DSA). It produces a pair of large numbers (r,sr, s) that verify authenticity without revealing private key components.
  5. Illustrate SSL handshake protocol action.

    [5]
    View model solution

    SSL/TLS Handshake Protocol Flow

    ClientServerClientHello (Supported ciphers, nonce)ServerHello (Chosen cipher, nonce)Certificate (Server Public Key) + ServerHelloDoneClientKeyExchange (Pre-master secret encrypted with Server PubKey)ChangeCipherSpec + FinishedChangeCipherSpec + FinishedSecure Symmetric Encrypted SessionEstablished\begin{matrix} \textbf{Client} & & \textbf{Server} \\ \text{ClientHello (Supported ciphers, nonce)} & \longrightarrow & \\ & \longleftarrow & \text{ServerHello (Chosen cipher, nonce)} \\ & \longleftarrow & \text{Certificate (Server Public Key) + ServerHelloDone} \\ \text{ClientKeyExchange (Pre-master secret encrypted with Server PubKey)} & \longrightarrow & \\ \text{ChangeCipherSpec + Finished} & \longrightarrow & \\ & \longleftarrow & \text{ChangeCipherSpec + Finished} \\ \textbf{Secure Symmetric Encrypted Session} & \longleftrightarrow & \textbf{Established} \end{matrix}
  6. Explain the architecture of intrusion detection systems.

    [5]
    View model solution

    Architecture of Intrusion Detection Systems (IDS)

    An IDS consists of four functional architectural modules:

    1. Sensors/Agents: Collect security event data from packet sniffers, host system logs, and network interfaces.
    2. Analysis Engine: Analyzes incoming sensor feeds using Signature-based detection (known threat patterns) or Anomaly-based detection (statistical deviations from baselines).
    3. Alert/Response Module: Generates administrator alerts or triggers automated countermeasures (e.g., firewall rule updates).
    4. Database Repository: Stores attack signatures, event logs, and baseline behavior profiles.
  7. List and explain any four Common Security related programming problems.

    [5]
    View model solution

    Four Common Security Programming Vulnerabilities

    1. Buffer Overflow: Writing data past the allocated boundaries of a buffer in memory, allowing attackers to overwrite execution return addresses (e.g., using unsafe strcpy() in C).
    2. SQL Injection (SQLi): Concatenating unsanitized user inputs into database queries, allowing attackers to bypass authentication or extract sensitive data.
    3. Cross-Site Scripting (XSS): Injecting malicious client-side JavaScript into web pages viewed by other users.
    4. Improper Error Handling & Information Leakage: Returning verbose database stack traces to end users, revealing internal server architectures to potential attackers.
  8. Define Digital Forensics. Explain digital forensic investigation procedures in brief.

    [5]
    View model solution

    Digital Forensics: Definition & Investigation Procedures

    Digital Forensics is the scientific preservation, identification, extraction, documentation, and analysis of digital evidence stored on electronic devices for legal proceedings.

    Standard Investigation Phases:

    1. Identification: Identifying crime scenes, potential digital devices, and relevant storage media.
    2. Preservation: Isolating evidence and creating bit-stream disk images while maintaining strict chain of custody.
    3. Analysis: Recovering deleted artifacts, analyzing timeline metadata, and identifying malicious footprints.
    4. Documentation and Reporting: Compiling factual forensic reports suitable for presentation in court.