📝 Message integrity authentication digital signature (9 MCQs)
📖 From Data Communication and Networks • 31. Cryptography and Network Security • 9 questions available
What is Message integrity authentication digital signature?
Message integrity ensures data has not been altered, authentication verifies the sender’s identity, and digital signatures combine both by using cryptographic techniques to prove origin and detect tampering in electronic messages.
📝 All Message integrity authentication digital signature MCQs
Q1. In a system that uses a MAC for message authentication, if the receiver detects a MAC mismatch, what logical conclusion is most justified?
📖 Explanation: A MAC mismatch indicates that the computed tag does not match the transmitted tag, which directly points to a loss of integrity. This typically means the message was altered—either accidentally or maliciously—while in transit, rather than an issue with encryption or key freshness.
Q2. Suppose a sender computes a MAC using a secret key and sends both the ciphertext and MAC to a receiver. Which inference best explains why confidentiality is still protected despite the MAC revealing no secret information?
📖 Explanation: A MAC is derived from the secret key and the message, but it does not disclose the key itself. Consequently, even though the MAC is transmitted in clear, an adversary cannot recover the encryption key or the plaintext, preserving confidentiality while ensuring integrity.
Q3. A digital signature is verified with a public key that does not correspond to the signer's private key. What is the most likely effect on the verification outcome?
📖 Explanation: Digital signatures rely on a matching key pair; using an incorrect public key prevents the mathematical verification from succeeding. The algorithm will output a failure, signaling that the signature cannot be trusted, while confidentiality and integrity of the original message remain unrelated to this mismatch.
Q4. Compare symmetric‑key and asymmetric‑key distribution methods. Which statement best captures their primary difference regarding scalability?
📖 Explanation: Symmetric‑key systems demand a unique secret key for every communicating pair, leading to an exponential growth in keys as participants increase. Asymmetric systems, by contrast, use public keys that can be freely distributed, allowing the number of keys to grow linearly with participants, thereby offering superior scalability.
Q5. Evaluate the trade‑offs between using a MAC and a digital signature for entity authentication. Which assessment is most accurate?
📖 Explanation: Digital signatures, built on asymmetric cryptography, enable anyone to verify the signer’s identity and provide non‑repudiation because only the private key holder could have created the signature. MACs, generated with a shared secret, are computationally cheaper but lack public verifiability and cannot prove who created the tag without revealing the secret.
Q6. Analyze a protocol that first encrypts a message with a symmetric key and then signs the ciphertext with a private key. Which vulnerability is most likely if the signer’s private key is compromised?
📖 Explanation: Compromise of the private signing key allows the attacker to generate valid signatures on any ciphertext, impersonating the original sender. However, without the symmetric key, the attacker cannot decrypt the ciphertext. If the protocol also transmits the symmetric key encrypted with the public key, the attacker could recover it, enabling decryption and further manipulation.
Q7. Apply key‑rollover principles: How does regularly updating symmetric keys improve message integrity in a long‑running communication session?
📖 Explanation: Frequent key updates limit the window in which an adversary could capture a key and reuse it to replay previously authenticated messages. By rotating keys, any replayed message would fail the MAC verification because the MAC would have been computed with a different key, thereby strengthening integrity.
Q8. Synthesize a security scheme that simultaneously ensures confidentiality, integrity, and entity authentication using both symmetric and asymmetric techniques. Which combination best meets all three goals?
📖 Explanation: The proposed hybrid approach encrypts the payload with an efficient symmetric algorithm, protects the symmetric key by encrypting it with the receiver’s public key (confidentiality), and adds a digital signature from the sender (entity authentication and non‑repudiation). The MAC can also be included to verify integrity, yielding a comprehensive solution.
Q9. Explain the relationship between a Message Authentication Code (MAC) and non‑repudiation. Which statement accurately reflects this relationship?
📖 Explanation: A MAC is derived from a shared secret, meaning both the sender and receiver could produce it; thus, a receiver cannot prove that the sender, rather than themselves, generated the tag. Consequently, MACs alone do not furnish non‑repudiation, which requires an asymmetric mechanism like a digital signature to uniquely bind the sender to the message.