SEC 573 Week 2 Quiz

 SEC 573 Week 2 Quiz  | Devry University

Question 1

The CIA triad stands for _________ .  

·         Confidentiality, Integrity, Availability  

·         Confidentiality, Inventory, Authentication  

·         Continuity, Integrity, Accounting 

·         Continuity, Integrity, Authorization

 

Question 2

A passive Internet Security Attack entails one of the following actions: ______.  

·         Traffic analysis  

·         Denial of service  

·         Changed/modified data  

·         Unauthorized access

 

Question 3

Data Integrity can be achieved by the following security mechanism: ______.  

·         Routing control  

·         Authentication exchange  

·         Encipherment  

·         Access control

 

Question 4

In Asymmetric key cryptography, _________________.  

·         no keys are required for the encryption and decryption of a plaintext message  

·         there are two different keys for the encryption and decryption of a plaintext message 

·         a hash of a plaintext message is produced  

·         there is one key for both the encryption and decryption of a plaintext message

 

Question 5

The Diffie-Hellman Algorithm is used to (as) _________.  

·         directly hashing a plaintext message into its hash value 

·         directly encrypt a plaintext message into a ciphertext message 

·         a Nonrepudiation mechanism 

·         a key exchange mechanism between two entities

 

 

Question 6

A “hash tree” is a concept that is associated with ______.  

·         an RSA Algorithm  

·         Lamport Signatures schemes  

·         an El-gamal Algorithm  

·         a Diffie-Hellman Algorithm

 

Question 7

Nonrepudiation is achieved by ______.  

·         Serialization  

·         Electronic signature  

·         Encryption  

·         Hashing

 

Question 8

In a Hashing algorithm, a collision condition is said to occur if _______.  

·         the hash of two different messages is the same  

·         the hash of a given message is not pseudo random  

·         the hash of a given message is reversable  

·         there is a finite number of hash values for a given message (for a given hash function)

 

Question 9

A message that is signed first, then encrypted last holds the following characteristic: _____.  

·         The public key of the sender is protected by the private key of the receiver  

·         To retrieve the plaintext message, we need just one key 

·         The private key of the sender is protected by the public key of the receiver

·         The sender’s identity is readily verified at the receiver side, reducing the time of dealing with forged messages

 

Question 10

Message Authentication Code is a hashing algorithm where both sender and receiver share a “symmetric key”. This is a security risk. Which of the following approaches achieves the same goal without having a shared key?  

·         Sign the hash with the senders’ private key  

·         Encrypt the hash with the senders’ public key  

·         Sign the hash with the receivers’ private key  

·         Encrypt the hash with the receivers’ public key