← All CBCP Flashcard Decks

Cryptography Flashcards

7 cards from real CBCP practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.

Read the first 7 Cryptography flashcards as text
  1. What distinguishes a zero-knowledge proof from a standard cryptographic proof?

    Answer: It proves knowledge of a secret without revealing the secret itself

    A zero-knowledge proof lets a prover convince a verifier that a statement is true without disclosing any information beyond the validity of the statement.

  2. What is the primary cryptographic function of a commitment scheme in blockchain protocols?

    Answer: Allowing a party to commit to a value while keeping it hidden, then reveal it later

    A commitment scheme binds a party to a hidden value; the binding property prevents changing the value after committing, and the hiding property conceals it until reveal.

  3. In threshold signature schemes, what does a (t, n) configuration mean?

    Answer: Any t out of n key holders must cooperate to produce a valid signature

    A (t, n) threshold scheme requires at least t participants from a group of n to jointly sign, so no single party controls the key.

  4. What attack does salting a password hash defend against?

    Answer: Pre-computed rainbow table attacks

    A salt is a random value appended to the password before hashing, ensuring identical passwords produce different hashes and invalidating pre-computed lookup tables.

  5. Which property of SHA-256 makes it suitable as a proof-of-work function?

    Answer: It produces deterministic, uniformly distributed output that is expensive to invert

    SHA-256 is deterministic and its output is uniformly distributed, so finding an input producing output below a threshold requires many trial hashes — exactly what proof-of-work needs.

  6. What role does the Keccak-256 hash function play in Ethereum?

    Answer: It derives Ethereum addresses and is the primary hash used across the protocol

    Ethereum uses Keccak-256 (a variant of SHA-3) for address derivation, transaction hashing, Merkle trees, and event topic encoding throughout the protocol.

  7. What does 'forward secrecy' mean in the context of cryptographic key exchange?

    Answer: Compromise of a long-term private key does not expose past session keys

    Forward secrecy (also called perfect forward secrecy) ensures that even if a server's long-term key is compromised, previously recorded encrypted sessions remain secure.