Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00290593n
Noun Concept
Categories: Theory of cryptography
EN
non-interactive zero-knowledge proof  Bulletproofs  NIZB  NIZK  SNARK
EN
Non-interactive zero-knowledge proofs are cryptographic primitives, where information between a prover and a verifier can be authenticated by the prover, without revealing any of the specific information beyond the validity of the statement itself. Wikipedia
Definitions
Relations
Sources
EN
Non-interactive zero-knowledge proofs are cryptographic primitives, where information between a prover and a verifier can be authenticated by the prover, without revealing any of the specific information beyond the validity of the statement itself. Wikipedia
A common random string shared between the prover and the verifier is enough to achieve computational zero-knowledge without requiring interaction Wikipedia Disambiguation
Common random string shared between the prover and the verifier is enough to achieve computational zero-knowledge without requiring interaction Wikidata
IS A
zero-knowledge proof
Wikipedia
EN
non-interactive zero-knowledge proof
Wikidata
EN
Non-interactive zero-knowledge proof
Wikipedia Redirections
EN
Bulletproofs, NIZB, NIZK, SNARK, STARK (cryptography), zk-SNARK, Zk STARK, ZkSNARK
Wikidata Alias
EN
NIZK

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License