Cryptographic Principles BDC Practice Questions (Page 8)

Questions 36–37

1. 36foundation · easy

   Which property of a cryptographic hash function ensures that it is computationally infeasible to find any two different inputs that produce the same output?

   • APreimage resistance
   • BCollision resistance
   • CDeterminism
   • DAvalanche effect
   Reveal Solution Discussion Select an answer first
2. 37expert · hard

   A developer is designing a system where multiple parties need to sign a document, and the order of signatures matters. They want to ensure that the final signature can be verified as a whole, and that the order is cryptographically enforced. Which approach is most suitable?

   • AUse a single signature from the last signer that covers the document and all previous signatures.
   • BUse a symmetric key to encrypt the document and have each signer encrypt the key.
   • CUse a hash of the document and have each signer sign the hash independently.
   • DUse a multi-signature scheme where each signer signs the previous signature.
   Reveal Solution Discussion Select an answer first