Home »
Trending Technologies MCQs
Zero-Knowledge Proofs MCQs (Multiple-Choice Questions)
Test your knowledge of Zero-Knowledge Proofs (ZKPs) with these multiple-choice questions. This collection covers fundamental concepts, proof properties, interactive and non-interactive protocols, cryptographic techniques, zk-SNARKs, zk-STARKs, and practical applications in blockchain, authentication, and privacy-preserving systems. Each question includes the correct answer and an explanation to help you understand the underlying concepts.
Zero-Knowledge Proofs MCQs
Zero-Knowledge Proofs are cryptographic protocols that allow a prover to demonstrate the validity of a statement to a verifier without revealing the secret information that makes the statement true. They are valuable in systems where confidentiality and verification must coexist, such as digital identity, secure authentication, private transactions, and blockchain applications.
These MCQs examine the three core properties of zero-knowledge proofs: completeness, soundness, and zero-knowledge. They also explore proof systems, cryptographic commitments, trusted setups, succinct proofs, proof composition, and the trade-offs involved in implementing zero-knowledge technologies.
List of Zero-Knowledge Proofs MCQs
The following questions cover introductory concepts, protocol characteristics, cryptographic foundations, proof generation and verification, blockchain scalability, privacy protection, security assumptions, and practical scenarios involving Zero-Knowledge Proofs.
1. What is the primary purpose of a Zero-Knowledge Proof?
- To reveal all information about a secret
- To prove the validity of a statement without revealing the underlying secret
- To eliminate the need for cryptographic algorithms
- To store passwords in plaintext
Answer: B) To prove the validity of a statement without revealing the underlying secret
Explanation:
A Zero-Knowledge Proof allows a prover to convince a verifier that a statement is true without disclosing the secret information used to establish its validity.
2. Which three properties are traditionally associated with Zero-Knowledge Proofs?
- Confidentiality, availability, and durability
- Encryption, compression, and hashing
- Completeness, soundness, and zero-knowledge
- Authentication, authorization, and accounting
Answer: C) Completeness, soundness, and zero-knowledge
Explanation:
Completeness ensures that valid statements can be accepted, soundness limits the ability to prove false statements, and zero-knowledge ensures that the verifier learns nothing beyond the validity of the statement, subject to the protocol's formal definition.
3. Who is the prover in a Zero-Knowledge Proof protocol?
- The party attempting to demonstrate that a statement is true
- The party that always generates the verification key
- The party that publishes the secret information
- The party responsible for storing every transaction
Answer: A) The party attempting to demonstrate that a statement is true
Explanation:
The prover possesses or can use a witness, which is secret information that establishes a statement's validity. The prover generates proof messages or a proof that a verifier can check.
4. What is the role of the verifier in a Zero-Knowledge Proof?
- To recover the prover's secret
- To publish the witness to the public
- To replace the cryptographic protocol with encryption
- To check whether the proof establishes the claimed statement
Answer: D) To check whether the proof establishes the claimed statement
Explanation:
The verifier checks the proof according to the protocol's verification procedure. A correctly designed zero-knowledge system allows this check without exposing the witness.
5. What does the completeness property mean?
- Every false statement must be accepted
- A valid statement with an honest prover is accepted, according to the protocol's completeness guarantee
- The verifier must learn the witness
- The proof must contain the complete original dataset
Answer: B) A valid statement with an honest prover is accepted, according to the protocol's completeness guarantee
Explanation:
Completeness means that when the statement is true and the prover follows the protocol correctly, the verifier accepts the proof, either always or with a specified high probability depending on the system.
6. What does soundness protect against?
- A verifier learning the public statement
- Proofs being represented as binary data
- A dishonest prover successfully convincing the verifier of a false statement
- A valid proof being checked by a computer
Answer: C) A dishonest prover successfully convincing the verifier of a false statement
Explanation:
Soundness limits the probability that a cheating prover can make a verifier accept a false statement. The exact guarantee depends on the proof system and its security assumptions.
7. What does the zero-knowledge property ensure?
- The verifier gains no additional information about the witness beyond what the statement itself reveals
- The proof requires no computation
- The prover never communicates with the verifier
- All public inputs are hidden from everyone
Answer: A) The verifier gains no additional information about the witness beyond what the statement itself reveals
Explanation:
Zero-knowledge is commonly formalized by showing that the verifier's view can be simulated without knowing the secret witness. The property protects the witness while still allowing verification.
8. What is a witness in a Zero-Knowledge Proof?
- A public announcement made by the verifier
- A record of every proof ever generated
- A cryptographic key that must always be shared publicly
- Secret information that satisfies the statement being proved
Answer: D) Secret information that satisfies the statement being proved
Explanation:
A witness is the private input that establishes a relationship described by a public statement. For example, it may be a password, a secret key, or a value that satisfies a mathematical equation.
9. What is an interactive Zero-Knowledge Proof?
- A proof that can only be stored on a blockchain
- A protocol in which the prover and verifier exchange messages
- A protocol that requires publishing the witness
- A proof that does not involve verification
Answer: B) A protocol in which the prover and verifier exchange messages
Explanation:
Interactive protocols involve multiple communication steps, often including a verifier's challenge and the prover's response. The verifier uses the exchange to evaluate the claim without learning the secret witness.
10. What distinguishes a non-interactive Zero-Knowledge Proof?
- It never requires cryptographic assumptions
- It cannot be verified by another party
- The prover can produce a proof that the verifier checks without an interactive message exchange
- It always reveals the private input
Answer: C) The prover can produce a proof that the verifier checks without an interactive message exchange
Explanation:
A non-interactive proof is typically generated as a single proof object that can be verified independently. Some systems require a common reference string or use a transformation such as the Fiat–Shamir heuristic under appropriate assumptions.
11. What is a cryptographic commitment used for in zero-knowledge protocols?
- To commit to a value while concealing it and preventing later changes, subject to the scheme's properties
- To disclose a secret before verification
- To replace all digital signatures
- To guarantee that a network has no malicious participants
Answer: A) To commit to a value while concealing it and preventing later changes, subject to the scheme's properties
Explanation:
A commitment scheme typically provides hiding and binding properties. Commitments can help a prover demonstrate relationships between values without directly disclosing those values.
12. Which statement best describes a Sigma protocol?
- A system for compressing blockchain data
- A protocol used exclusively for encrypting stored files
- A database replication method
- A three-move interactive proof commonly structured as commitment, challenge, and response
Answer: D) A three-move interactive proof commonly structured as commitment, challenge, and response
Explanation:
Sigma protocols are a class of interactive proof protocols with three main messages: a commitment from the prover, a challenge from the verifier, and a response from the prover. Many are used to prove knowledge of cryptographic secrets.
13. What is the Fiat–Shamir heuristic commonly used for?
- Converting encrypted files into plaintext
- Removing the need for all security assumptions
- Transforming certain interactive protocols into non-interactive ones using a hash function to derive challenges
- Generating a user's password from public data
Answer: C) Transforming certain interactive protocols into non-interactive ones using a hash function to derive challenges
Explanation:
The Fiat–Shamir heuristic replaces a verifier's random challenge with a challenge derived from a cryptographic hash of relevant protocol data. Its security depends on the protocol and the model or assumptions used in the analysis.
14. What is a zk-SNARK?
- A password storage format
- A zero-knowledge succinct non-interactive argument of knowledge
- A network routing protocol
- A type of symmetric encryption algorithm
Answer: B) A zero-knowledge succinct non-interactive argument of knowledge
Explanation:
zk-SNARKs are proof systems designed to provide compact proofs that can be verified without interaction. Depending on the construction, they may rely on a trusted setup and specific cryptographic assumptions.
15. What does the word "succinct" mean in zk-SNARK?
- The proof and its verification can be small or inexpensive relative to the computation being proved, according to the system's design
- The proof always contains the entire computation trace
- The proof must be generated without a computer
- The proof can only establish statements about passwords
Answer: A) The proof and its verification can be small or inexpensive relative to the computation being proved, according to the system's design
Explanation:
Succinct proof systems aim to make proofs compact and verification comparatively inexpensive. The exact proof size and verification cost depend on the particular construction.
16. What is a zk-STARK?
- A traditional password hashing algorithm
- A centralized identity database
- A method for exchanging private keys without verification
- A zero-knowledge scalable transparent argument of knowledge
Answer: D) A zero-knowledge scalable transparent argument of knowledge
Explanation:
zk-STARKs are proof systems designed for scalable verification and transparent setup assumptions. Their security is commonly based on cryptographic hash functions and related assumptions rather than the same pairing-based assumptions used by many SNARK constructions.
17. What is a major difference between many zk-SNARK and zk-STARK constructions?
- zk-STARKs cannot prove computational statements
- zk-SNARKs always require interactive verification
- Many zk-SNARKs use a trusted setup, while zk-STARKs are designed to avoid a trusted setup
- zk-STARKs always disclose the witness
Answer: C) Many zk-SNARKs use a trusted setup, while zk-STARKs are designed to avoid a trusted setup
Explanation:
Many widely used zk-SNARK systems require setup parameters whose security depends on correct generation and handling. zk-STARKs are transparent proof systems and generally avoid a secret setup ceremony. These characteristics depend on the specific construction.
18. What is a trusted setup in certain zero-knowledge proof systems?
- A process that automatically validates every future transaction
- A procedure for generating public parameters that must meet specified security requirements
- A method for revealing all private inputs
- A process that eliminates the need for cryptographic verification
Answer: B) A procedure for generating public parameters that must meet specified security requirements
Explanation:
A trusted setup generates parameters used by certain proof systems. If secret setup material remains available and is misused, it may undermine soundness or permit forged proofs. Some systems use multiparty ceremonies to reduce this risk.
19. Why can a multiparty trusted setup ceremony improve security?
- It ensures every participant learns the witness
- It eliminates the need for public parameters
- It guarantees that the software has no bugs
- It can reduce reliance on trust in a single participant if at least one participant contributes securely and destroys their secret contribution
Answer: D) It can reduce reliance on trust in a single participant if at least one participant contributes securely and destroys their secret contribution
Explanation:
In a properly designed ceremony, the security of the resulting parameters may hold if at least one participant honestly generates and destroys their secret contribution. The guarantee depends on the ceremony protocol and its assumptions.
20. What is a common use of Zero-Knowledge Proofs in authentication?
- Demonstrating knowledge of a secret credential without directly transmitting the credential itself
- Publishing user passwords on a public server
- Removing all need to identify the intended service
- Replacing every network security control
Answer: A) Demonstrating knowledge of a secret credential without directly transmitting the credential itself
Explanation:
Zero-knowledge techniques can support authentication by allowing a user to prove knowledge of a secret without sending the secret directly. A secure implementation must also address replay attacks, session binding, and other protocol-specific risks.
21. How can Zero-Knowledge Proofs support privacy in blockchain transactions?
- By removing all transaction verification
- By ensuring every transaction amount is publicly readable
- By proving that transaction rules are satisfied without necessarily disclosing all transaction details
- By preventing the blockchain from recording any data
Answer: C) By proving that transaction rules are satisfied without necessarily disclosing all transaction details
Explanation:
A zero-knowledge proof can establish that a transaction satisfies conditions such as valid authorization or conservation of value while hiding selected details. The actual privacy provided depends on the protocol and what information remains public.
22. What is a validity rollup in blockchain systems?
- A method for deleting the base blockchain
- A system that submits batches of transactions with cryptographic proofs that their state transitions are valid
- A system that accepts every submitted transaction without checking it
- A mechanism that stores all user passwords in a public ledger
Answer: B) A system that submits batches of transactions with cryptographic proofs that their state transitions are valid
Explanation:
A validity rollup executes or processes transactions off-chain and submits a proof that the resulting state transition follows the protocol rules. A base layer verifies the proof, reducing the need to re-execute all transactions there.
23. What is a common benefit of using validity proofs for blockchain scaling?
- They remove the need to check transaction validity
- They guarantee that transaction data never needs to be published or made available
- They make cryptographic computation free
- They can allow a base layer to verify a batch of state transitions without re-executing every transaction
Answer: D) They can allow a base layer to verify a batch of state transitions without re-executing every transaction
Explanation:
Validity proofs can reduce the computation a base layer needs to perform for batched transactions. However, data availability, proof-generation cost, and the design of the rollup remain important considerations.
24. Which statement about privacy and Zero-Knowledge Proofs is correct?
- They can hide selected private inputs while proving a defined statement, but they do not automatically conceal all associated metadata
- They automatically hide all network traffic and IP addresses
- They always make the prover anonymous to every participant
- They eliminate all possible data leaks from an application
Answer: A) They can hide selected private inputs while proving a defined statement, but they do not automatically conceal all associated metadata
Explanation:
Zero-knowledge proofs protect information covered by the protocol's security definition. Public inputs, transaction timing, network metadata, and application behavior may still reveal information unless additional privacy measures are used.
25. What is the main purpose of a circuit in many zero-knowledge proof systems?
- To physically connect blockchain nodes
- To store the prover's secret in plaintext
- To represent the computation or constraints that the proof must establish
- To replace every public input with a password
Answer: C) To represent the computation or constraints that the proof must establish
Explanation:
A circuit or constraint system describes the mathematical relationships that must hold for a proof to be valid. The prover demonstrates that suitable private values satisfy those constraints for the supplied public inputs.
26. What is a constraint system in a zero-knowledge proof implementation?
- A list of all users' secret passwords
- A collection of mathematical conditions that a valid witness must satisfy
- A hardware device used only for encryption
- A collection of unverified network messages
Answer: B) A collection of mathematical conditions that a valid witness must satisfy
Explanation:
A constraint system expresses the relationships that must hold between public inputs, private witness values, and intermediate computation values. The proof establishes that these conditions are satisfied without exposing the witness.
27. What is a public input in a Zero-Knowledge Proof?
- A value that is available to the verifier and forms part of the statement being proved
- A secret value that only the prover can know
- A private key that must be disclosed after every proof
- A value that cannot be used during verification
Answer: A) A value that is available to the verifier and forms part of the statement being proved
Explanation:
Public inputs are values included in the statement being verified. A proof may establish that a private witness satisfies a relationship involving those public inputs.
28. What is a private input in a Zero-Knowledge Proof?
- A value that every verifier must publish
- A value that is always part of the proof's public output
- A value that cannot influence the statement
- A secret value known to the prover and used to establish the statement
Answer: D) A secret value known to the prover and used to establish the statement
Explanation:
Private inputs form some or all of the witness. A zero-knowledge proof aims to establish the required relationship without revealing those inputs, apart from information implied by the statement and any other available information.
29. Which cryptographic primitive is frequently used in the design of zero-knowledge protocols?
- Lossy image compression only
- Cryptographic hash functions
- Plaintext file indexing only
- Audio signal amplification
Answer: B) Cryptographic hash functions
Explanation:
Cryptographic hash functions are used in many proof systems for commitments, challenge derivation, and integrity checks. Other constructions may rely on elliptic curves, polynomial commitments, or additional cryptographic primitives.
30. What is the purpose of a polynomial commitment in certain proof systems?
- To disclose every coefficient of every polynomial automatically
- To encrypt the entire internet connection
- To commit to a polynomial and later prove claims about its evaluations
- To guarantee that a verifier cannot reject any proof
Answer: C) To commit to a polynomial and later prove claims about its evaluations
Explanation:
A polynomial commitment scheme lets a prover commit to a polynomial and provide a proof about its value at a particular point. Some schemes support succinct verification and are important building blocks in modern proof systems.
31. What is proof composition in zero-knowledge systems?
- Combining proofs or proof statements to establish a larger claim from smaller claims
- Publishing all private witness values
- Removing the verifier from the protocol
- Replacing a cryptographic proof with a text document
Answer: A) Combining proofs or proof statements to establish a larger claim from smaller claims
Explanation:
Proof composition allows systems to build complex statements from smaller verified components. Depending on the construction, proof aggregation or recursive verification can reduce the cost of verifying many computations.
32. What is recursive proof verification?
- Repeating a proof without checking it
- Generating the same proof indefinitely
- Publishing the secret witness at each verification step
- Using a proof system to prove the validity of another proof or its verification process
Answer: D) Using a proof system to prove the validity of another proof or its verification process
Explanation:
Recursive proof systems can verify one proof inside another proof. This technique can support proof aggregation, scalable computation, and systems that verify long sequences of operations through a compact final proof.
33. Which statement best describes proof aggregation?
- Converting all proofs into passwords
- Combining multiple proofs into a single proof or compact verification object, where supported by the system
- Removing the mathematical conditions from a proof
- Making every proof publicly reveal its witness
Answer: B) Combining multiple proofs into a single proof or compact verification object, where supported by the system
Explanation:
Proof aggregation combines evidence from multiple statements or computations. It can reduce verification overhead or the amount of proof data that needs to be transmitted, depending on the proof system.
34. Why can proof generation be computationally expensive?
- Because all proof systems require a physical security token
- Because the prover must always reveal the witness
- Because the prover may need to perform substantial cryptographic operations and process large constraint systems
- Because verification must always repeat the entire computation
Answer: C) Because the prover may need to perform substantial cryptographic operations and process large constraint systems
Explanation:
Generating a proof may involve extensive arithmetic, polynomial operations, memory usage, and cryptographic computations. The cost depends on the statement, implementation, hardware, and proof-system design.
35. What is a common design goal for zero-knowledge proof verification?
- To make checking a proof less expensive than independently repeating the entire computation, when the proof system supports this
- To ensure that verification reveals the witness
- To require the verifier to trust the prover without checking anything
- To make every proof larger than the original computation
Answer: A) To make checking a proof less expensive than independently repeating the entire computation, when the proof system supports this
Explanation:
Many proof systems aim for efficient verification so that a verifier can check the result of a large computation at lower cost than recomputing it. The extent of this advantage varies by construction and workload.
36. Which is a potential application of Zero-Knowledge Proofs in digital identity?
- Publishing a person's complete identity record for every transaction
- Disabling all identity verification
- Replacing all legal identity documents with a public password
- Proving that a person meets an eligibility condition without revealing unnecessary personal details
Answer: D) Proving that a person meets an eligibility condition without revealing unnecessary personal details
Explanation:
A person may prove a property, such as meeting an age threshold or holding a valid credential, without disclosing the complete underlying record. The credential and proof system must be designed to support the required claim securely.
37. How can Zero-Knowledge Proofs support age verification?
- By publishing the user's date of birth in every transaction
- By proving that the user's age satisfies a required threshold without revealing the exact date of birth
- By removing the need for a trustworthy age credential
- By allowing anyone to alter the user's birth date
Answer: B) By proving that the user's age satisfies a required threshold without revealing the exact date of birth
Explanation:
A suitable credential system can let a user prove a predicate such as being at least a specified age. This can reduce disclosure of personal information, although the system must also prevent forged credentials and address revocation where necessary.
38. What is a range proof?
- A proof that a network has a specified number of computers
- A proof that a password contains a certain number of letters
- A proof that a committed value lies within a specified numerical interval without necessarily revealing the value
- A proof that every transaction has the same amount
Answer: C) A proof that a committed value lies within a specified numerical interval without necessarily revealing the value
Explanation:
Range proofs establish that a hidden value falls within an allowed interval. They are useful in confidential transactions and other applications where a value must satisfy bounds without being disclosed.
39. What does a proof of knowledge aim to establish?
- That the prover possesses or can produce a valid witness for the claimed statement, under the proof system's security definition
- That the verifier knows every secret used by the prover
- That the statement must be false
- That the prover's computer contains no malware
Answer: A) That the prover possesses or can produce a valid witness for the claimed statement, under the proof system's security definition
Explanation:
A proof of knowledge provides a formal guarantee that a successful prover must effectively know a witness, often expressed through an extraction argument. It is stronger than merely proving that a statement is true in some settings.
40. What is a common risk when implementing a Zero-Knowledge Proof system?
- Every proof automatically becomes invalid after one use
- Public inputs cannot be represented digitally
- Zero-knowledge proofs cannot use mathematical constraints
- Implementation bugs or incorrect circuit constraints may allow invalid statements to be accepted
Answer: D) Implementation bugs or incorrect circuit constraints may allow invalid statements to be accepted
Explanation:
A secure proof system can still be undermined by flawed application logic, missing constraints, unsafe setup procedures, or implementation vulnerabilities. Developers must verify that the circuit expresses the intended rules and test the complete system.
41. What is a circuit soundness bug in a zero-knowledge application?
- A harmless change to a webpage's appearance
- A flaw in the constraints that may allow a prover to establish an invalid claim
- A feature that makes proofs smaller
- A method for improving the privacy of every input
Answer: B) A flaw in the constraints that may allow a prover to establish an invalid claim
Explanation:
If a circuit omits an essential condition, a malicious prover may construct a witness that satisfies the implemented constraints but violates the application's intended rules. Careful constraint design and independent audits help reduce this risk.
42. What is the purpose of a verifier key in many non-interactive proof systems?
- To recover the prover's private witness
- To generate the user's password
- To provide parameters used to verify proofs for a specified relation or circuit
- To replace the public statement with encrypted text
Answer: C) To provide parameters used to verify proofs for a specified relation or circuit
Explanation:
Some proof systems use a verification key containing public parameters required to check proofs. The key is associated with the relevant statement relation or circuit and does not ordinarily reveal the prover's witness.
43. Which statement about zero-knowledge proof security assumptions is correct?
- Security depends on the proof construction and its assumptions, such as the hardness of particular mathematical problems or the security of hash functions
- Every zero-knowledge proof is secure regardless of its implementation
- Security requires publishing all private keys
- Security is guaranteed solely by using a large file size
Answer: A) Security depends on the proof construction and its assumptions, such as the hardness of particular mathematical problems or the security of hash functions
Explanation:
Zero-knowledge systems rely on formal protocol properties and underlying cryptographic assumptions. Security also depends on parameter selection, implementation correctness, and whether the system is used according to its design.
44. What is the difference between zero-knowledge proofs and encryption?
- They are identical techniques with different names
- Encryption can only be used with public data
- Zero-knowledge proofs always encrypt an entire database
- Encryption protects the confidentiality of data, while a zero-knowledge proof establishes a statement's validity without revealing its witness
Answer: D) Encryption protects the confidentiality of data, while a zero-knowledge proof establishes a statement's validity without revealing its witness
Explanation:
Encryption transforms data so that only authorized parties with the appropriate key can recover it. A zero-knowledge proof lets a verifier check a claim without requiring disclosure of the witness. Applications may use both techniques for different purposes.
45. What is a potential benefit of Zero-Knowledge Proofs for regulatory compliance?
- They remove every legal obligation automatically
- They can help prove that specified compliance conditions are met while minimizing disclosure of sensitive records
- They guarantee that all information is anonymous in every context
- They allow organizations to avoid maintaining accurate records
Answer: B) They can help prove that specified compliance conditions are met while minimizing disclosure of sensitive records
Explanation:
A properly designed system can prove that a condition holds, such as a value falling within an allowed range, without revealing all underlying data. Whether this satisfies a particular regulation depends on the applicable legal requirements and implementation.
46. What does proof verification failure indicate?
- That the prover has necessarily disclosed the witness
- That the proof system has permanently stopped working
- That the proof did not satisfy the verification procedure for the supplied inputs and parameters
- That the public statement must be true
Answer: C) That the proof did not satisfy the verification procedure for the supplied inputs and parameters
Explanation:
A verifier rejects a proof when the proof or its associated inputs fail the required checks. This may occur because the statement is invalid, the proof is malformed, the parameters are incorrect, or an implementation or communication error has occurred.
47. Why is randomness important in many interactive Zero-Knowledge Proofs?
- It can prevent predictable protocol behavior and help ensure that a cheating prover cannot prepare a response for every possible challenge
- It ensures that every false statement is accepted
- It makes the secret witness public
- It removes the need to verify responses
Answer: A) It can prevent predictable protocol behavior and help ensure that a cheating prover cannot prepare a response for every possible challenge
Explanation:
Random challenges and carefully generated randomness are central to the security of many interactive protocols. Poor randomness or predictable challenges can weaken soundness or expose secrets, depending on the protocol.
48. Which statement about the Fiat–Shamir heuristic is most accurate?
- It makes every interactive protocol secure without further analysis
- It removes all cryptographic hash functions from a protocol
- It guarantees that every proof is zero-knowledge regardless of its construction
- It can remove interaction in suitable protocols, but the resulting security must be justified for the specific construction and assumptions
Answer: D) It can remove interaction in suitable protocols, but the resulting security must be justified for the specific construction and assumptions
Explanation:
The Fiat–Shamir heuristic derives challenges from a hash function rather than receiving them from a live verifier. Its use does not automatically make any protocol secure; the protocol's design and security model still matter.
49. A Zero-Knowledge Proof system has a soundness error of 1/1024 for one independent verification attempt. Assuming independent attempts and that a cheating prover must succeed in all five attempts, what is the combined soundness error?
- 1/512
- 1/1024
- 1/1,125,899,906,842,624
- 5/1024
Answer: C) 1/1,125,899,906,842,624
Explanation:
For five independent attempts, the combined soundness error is (1/1024)5. Since 1024 = 210, the result is 1/250 = 1/1,125,899,906,842,624. Requiring a cheating prover to succeed in all five independent attempts reduces the probability of success substantially.
50. A digital identity system allows a user to prove that they are at least 18 years old without revealing their exact date of birth. Which approach best describes this use case?
- Publishing the user's complete birth certificate to every verifier
- Using a Zero-Knowledge Proof to demonstrate that a trusted credential satisfies the age threshold
- Encrypting the date of birth and giving every verifier the decryption key
- Removing all verification and accepting the user's claim without evidence
Answer: B) Using a Zero-Knowledge Proof to demonstrate that a trusted credential satisfies the age threshold
Explanation:
A suitable credential and zero-knowledge proof system can establish that the user's age meets the required threshold without revealing the exact birth date. The design must also ensure that the credential is authentic and address issues such as expiration and revocation when relevant.