When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Zero-knowledge proof - Wikipedia

    en.wikipedia.org/wiki/Zero-knowledge_proof

    This is called a "zero-knowledge proof of knowledge". However, a password is typically too small or insufficiently random to be used in many schemes for zero-knowledge proofs of knowledge. A zero-knowledge password proof is a special kind of zero-knowledge proof of knowledge that addresses the limited size of passwords. [citation needed]

  3. Zero-knowledge password proof - Wikipedia

    en.wikipedia.org/wiki/Zero-knowledge_password_proof

    A common use of a zero-knowledge password proof is in authentication systems where one party wants to prove its identity to a second party using a password but doesn't want the second party or anybody else to learn anything about the password. For example, apps can validate a password without processing it and a payment app can check the ...

  4. Commitment scheme - Wikipedia

    en.wikipedia.org/wiki/Commitment_scheme

    One particular motivating example is the use of commitment schemes in zero-knowledge proofs.Commitments are used in zero-knowledge proofs for two main purposes: first, to allow the prover to participate in "cut and choose" proofs where the verifier will be presented with a choice of what to learn, and the prover will reveal only what corresponds to the verifier's choice.

  5. Zero knowledge - Wikipedia

    en.wikipedia.org/wiki/Zero_Knowledge

    Zero knowledge may mean: Zero-knowledge proof , a concept from cryptography, an interactive method for one party to prove to another that a (usually mathematical) statement is true, without revealing anything other than the veracity of the statement

  6. Non-interactive zero-knowledge proof - Wikipedia

    en.wikipedia.org/wiki/Non-interactive_zero...

    Using different commitment schemes, this idea was used to build zero-knowledge proof systems under the sub-group hiding [38] and under the decisional linear assumption. [39] These proof systems prove circuit satisfiability, and thus by the Cook–Levin theorem allow proving membership for every language in NP. The size of the common reference ...

  7. Proof of knowledge - Wikipedia

    en.wikipedia.org/wiki/Proof_of_knowledge

    In cryptography, a proof of knowledge is an interactive proof in which the prover succeeds in 'convincing' a verifier that the prover knows something. What it means for a machine to 'know something' is defined in terms of computation.

  8. Zero-knowledge service - Wikipedia

    en.wikipedia.org/wiki/Zero-knowledge_service

    In addition, zero-knowledge services often strive to hold as little metadata as possible, holding only that data that is functionally needed by the service. The term "zero-knowledge" was popularized by backup service SpiderOak , which later switched to using the term "no knowledge" to avoid confusion with the computer science concept of zero ...

  9. Category:Zero-knowledge protocols - Wikipedia

    en.wikipedia.org/wiki/Category:Zero-knowledge...

    Zero-knowledge proof This page was last edited on 13 April 2012, at 20:15 (UTC). Text is available under the Creative Commons Attribution-ShareAlike 4.0 License ...