Telematics Exam: DNS Security Solutions
25 Questions
0 Views

Choose a study mode

Play Quiz
Study Flashcards
Spaced Repetition
Chat to lesson

Podcast

Play an AI-generated podcast conversation about this lesson

Questions and Answers

How and where can DNS be attacked? (Give 3 different answers)

  • Cache poisoning (correct)
  • Redirection (correct)
  • Forging requests or responses (correct)
  • Spoofing of DNS servers on different levels (correct)
  • Why is DNS vulnerable?

    Unencrypted requests/responses, non-verified answers, non-authorized servers, unprotected caches - all is based on the simple assumption: “don't lie about others” and trust among the involved systems.

    What can happen, if DNS gives wrong answers? What can be done against this (name two solutions)?

  • Cutting of part of the name space (correct)
  • Choosing DNS server directly (e.g., 8.8.8.8) (correct)
  • Using DNSSEC (correct)
  • Redirection of mapping name to IP address (correct)
  • How does DNS ensure the uniqueness of names? Who owns the names in DNS?

    <p>Uniqueness of top level, within each top-level uniqueness of second level, within each second level uniqueness of third level etc. On each level NIC/admin of level manages/distributes names to owners, owner is registered in data base.</p> Signup and view all the answers

    What is the difference between recursive and iterative name resolution?

    <p>Iterative: node will return a pointer to the requestor for further requests</p> Signup and view all the answers

    What is the focus of congestion and flow control, respectively? Why are they needed?

    <p>Congestion control: focus on network, try to avoid congestion in the network, needed to keep network stable. Flow control: focus on end-system, try to avoid overloading of the receiver, both are needed to avoid packet loss due to buffer overflow (n routers of end-systems, respectively).</p> Signup and view all the answers

    What does a duplicated ACK in TCP tell the sender? What is the idea of fast recovery?

    <p>At least some packets go through the network, no severe congestion of complete link failure. Fast recovery avoids slow-start (congestion window starts at 1 MSS), but starts right away with ½ old congestion window.</p> Signup and view all the answers

    What determines the flow of data in TCP? Name three issues and describe!

    <p>Receiver window: shows the capabilities of the receiver, has to be taken into account by receiver, can be even 0 to choke transmission</p> Signup and view all the answers

    How can TCP detect a congestion? Describe briefly! What are the pros and cons of the two solutions?

    <p>Implicit: sender experiences time-out, ACKs to late, missing ACKs and concludes from late/missing ACKs congestion in network</p> Signup and view all the answers

    Why can't we build large networks with many nodes based on switches only?

    <p>Flat address space, no address aggregation would require storing all addresses individually in switches logical tree structure to avoid loops not feasible in large/world-wide networks, no TTL requires this.</p> Signup and view all the answers

    How is routing scalability in the Internet handled?

    <p>Hierarchies, routing concerns only limited regions, IGP/EGP, AS with IGP used inside, EGP to connect, AS black box from outside, no complete view of topology needed, routing inside AS independent from outside, only EGP must be compatible worldwide.</p> Signup and view all the answers

    What are differences between routing and forwarding? Name two!

    <p>Routing often SW, forwarding with HW support</p> Signup and view all the answers

    Give 3 examples for routing metrics!

    <p>Drop rate</p> Signup and view all the answers

    Besides scalability, what is missing in standard link-state and distance vector routing protocols? How does BGP handle these issues?

    <p>Paths exchanged, different policies can be applied, paths dropped or accepted based on policies, advertisement of paths also based on policies</p> Signup and view all the answers

    Why is it so easy to announce "false" paths?

    <p>BGP based on trust between peering partners, original version does not allow for verification of routing data, false announcements cannot be verified, AS can claim to be owner of prefix, path announcements can be manipulated.</p> Signup and view all the answers

    Why can RPKI also help in the web ecosystem - isn't it enough to encrypt web pages?

    <p>TLS can encrypt content, but can do nothing against e.g. forged certificates or blackholing; attacker can manipulate routing; thus, traffic may never reach web server or may be redirected, web server not wares of attack, DoS made easy.</p> Signup and view all the answers

    What does “ossification” of the transport layer mean? What causes this "ossification" (give 2 examples)?

    <p>TCP and UDP exist for many years, and thus, their headers are often the only accepted ones for layer 4; these protocols are “hard wired” in many systems, not only end-systems, but also middle boxes</p> Signup and view all the answers

    Why does simply sending different data packets of a single TCP connection over different paths not work?

    <p>Middle boxes, such as NAT, keep state and, thus, &quot;follow&quot; the states of a TCP connection, may even ACK bytes acting as proxies; incoming packets from an unknown TCP connection (known only via another path) are typically not accepted and, thus, dropped.</p> Signup and view all the answers

    How does MPTCP circumvent the "ossification"?

    <p>Use of several TCP connections; for the network these TCP-connections belonging to a single MPTCP connection look like “normal” TCP connections with individual states; MPTCP mux/demux the data stream on top of the regular, build-in TCP of the OS.</p> Signup and view all the answers

    Why may TCP slow down HTTP and thus the rendering of web pages?

    <p>Even HTTP/2 that allows the mux of several http requests and the out-of-order delivery of responses suffers from head-of-line blocking; TCP may cause when a segment is lost; TCP segmentation is independent of the semantics of requests/responses; a lost segment may block the delivery of correct received segments/data to the browser and thus nothing is displayed unless the lost data has been retransmitted; user experience suffers.</p> Signup and view all the answers

    How does QUIC solve this issue and how does it circumvent the “ossification” of the transport layer?

    <p>QUIC offers several independent streams e.g. for different objects on web pages; data loss in one stream does not influence other streams; using UDP all received data is immediately forwarded to the next higher layer(QUIC); using UDP circumvents the ossification as UDP is well-accepted; QUIC is handled in end-systems only, the network only sees partially encrypted UDP packets</p> Signup and view all the answers

    Can we directly transmit data? What is always required?

    <p>No, data is something abstract, we always need a physical representation; we need a mapping of data elements to physical signal elements; modulation of physical signals based on data.</p> Signup and view all the answers

    What are the effects of bandwidth limitation of a physical medium?

    <p>The effective bandwidth of a physical medium limits the max. available data rate; Shannon's law: data rate = bandwidth * log_2 (1 + S/N); limitation of the symbol rate.</p> Signup and view all the answers

    How to achieve bit synchronization between sender and receiver? Give two examples!

    <p>Provide falling/rising edge always in the middle of a bit (Manchester); ensure that no long sequences of Os (or) 1s exist – then use (differential) NRZ (4B5B etc.); separate clock line if distance is short.</p> Signup and view all the answers

    Why is it impossible to detect all possible errors?

    <p>A really mean error could map a valid codeword onto another valid one – this is impossible to detect; receiver does not know what the sender has send, thus all legal codewords are fine; CRC does not detect e.g. multiples of the generator polynomial added to transmitted data.</p> Signup and view all the answers

    Study Notes

    Exam Telematics - Solutions

    • The solutions provided are examples, not exhaustive, but sufficient for full marks. Correct keywords and coherent arguments are essential.

    DNS (16 points)

    • DNS Attacks (3):

      • Cache poisoning
      • Spoofing of DNS servers (at various levels)
      • Forging requests/responses
      • Redirection
    • DNS Vulnerability (2):

      • Unencrypted requests/responses
      • Non-verified answers
      • Unauthorised servers
      • Unprotected caches
    • Incorrect DNS Answers (4):

      • Consequences: Name to IP mapping errors, redirection to wrong servers, reduced web access.
      • Solutions: Direct use of trusted DNS servers (e.g., 8.8.8.8), DNSSEC implementation
    • DNS Name Uniqueness (3):

      • Uniqueness ensured through hierarchical structure (top-level, second-level, etc).
      • Each level's Network Information Center (NIC)/administrator manages/assigns names to owners.
      • Owner registration in a database.
    • Recursive vs. Iterative Resolution (4):

      • Recursive: Query answered by the requested node, possibly involving further requests without user involvement.
      • Iterative: Node provides pointers to the requester for further queries.

    Congestion and Flow Control (20 points)

    • Congestion Control Focus (4):

      • Focus on the network
      • Aims to prevent congestion
      • Necessary for network stability
    • Flow Control Focus (4):

      • Focus on the end-system
      • Prevents receiver overload
      • Necessary for preventing packet loss
    • Duplicated ACKs in TCP (4):

      • Indication of successful packet transmission.
      • Fast recovery avoids 'slow start'. 'Slow start' initializes the congestion window at one maximum segment size (MSS) but starts right away.
    • TCP Flow Determination (6):

      • RTT: Round trip time
      • Error rate: Determines retransmission amount
      • Receiver window: Defines receiver capacity
    • TCP Congestion Detection (6):

      • Explicit: Using ECN bits in the IP header (set by routers experiencing congestion, reflected to sender).
      • Implicit: Sender detects time-outs or missing ACKs (indicating congestion).

    Routing (18 points)

    • Limitations of Switches (2):

      • Flat address space requires storing all addresses
      • Inefficient for large networks.
      • Requires logical tree structure to avoid loops.
    • Routing Scalability (2):

      • Hierarchies
      • Interior Gateway Protocols (IGPs) and Exterior Gateway Protocols (EGPs)
      • Autonomous Systems (AS) boundaries
    • Routing vs. Forwarding (3):

      • Forwarding is time-critical with one choice
      • Routing is less time-critical and multiple paths.
    • Routing Metrics (3):

      • Delay
      • Hop count
      • Data rate
    • Routing Issue Handling (Routing Protocols) (3):

      • Policies and paths
      • Handling asymmetric routing
      • Different policies applied to paths
    • False Path Announcement (2):

      • Lack of verification mechanisms
      • Trust-based system
      • Manipulating announcements
    • RPKI Support on Web (3):

      • Enables encrypting website content
      • Protection against routing manipulation
      • Protection against Denial of Service (DoS).

    Ossification/New Protocols (18 points)

    • Transport Layer Ossification (4):

      • Established protocols (TCP/UDP) are widely used and integrated.
      • Changes to protocols are difficult due to widespread use.
      • Middleboxes cause dependency on existing protocols.
    • TCP Connection Handling (4):

      • Maintaining state during packet delivery over different paths often fails.
      • Middleboxes follow connections, making it difficult.
    • MPTCP Circumvention (2):

      • Breaks up connections into multi-path TCP (MPTCP) individual segments.
    • HTTP Slowdown (4):

      • Lost segments block correct data delivery
      • TCP congestion can cause delays
      • User experience is negatively affected.

    Bits and Signals (18 points)

    • Data Transmission Requirement (4):

      • Physical representation mapping needed
      • Signal modulation crucial
    • Bandwidth Limitation (2):

      • Shannon's law defines data rates dependent on bandwidth and signal-to-noise ratio.
    • Quantization Challenges (2):

      • Decreasing signal levels lead to increasing interference, potential for data corruption.
    • Bit Synchronization (4):

      • Manchester encoding (edge-based): Transitions in the middle of a bit
      • Differential encoding: Transitions based on difference between previous and current bit values
    • Frame Alignment (4):

      • Defining and separating frame starts/limits.
      • Including checksums/length information for error checks.
    • Transmission Error Detection (2):

      • CRC (Cyclic Redundancy Check).

    Studying That Suits You

    Use AI to generate personalized quizzes and flashcards to suit your learning preferences.

    Quiz Team

    Related Documents

    Description

    This quiz covers the solutions to DNS attacks, vulnerabilities, and incorrect answers. It explores the importance of DNSSEC implementation and the uniqueness of DNS names. Assess your understanding of these concepts relevant to telematics and network security.

    More Like This

    Use Quizgecko on...
    Browser
    Browser