Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Non-interactive_zero-knowledge_proof> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Non-interactive_zero-knowledge_proof abstract "Non-interactive zero-knowledge proofs are a variant of zero-knowledge proofs in which no interaction is necessary between prover and verifier. Blum, Feldman, and Micali showed that a common reference string shared between the prover and the verifier is enough to achieve computational zero-knowledge without requiring interaction. Goldreich and Oren gave impossibility results for one shot zero-knowledge protocols in the standard model. In 2003, Goldwasser and Kalai published an instance of identification scheme for which any hash function will yield an insecure digital signature scheme. These results are not contradictory, as the impossibility result of Goldreich and Oren does not hold in the common reference string model or the random oracle model. Non-interactive zero-knowledge proofs however show a separation between the cryptographic tasks that can be achieved in the standard model and those that can be achieved in 'more powerful' extended models.The model influences the properties that can be obtained from a zero-knowledge protocol. Pass showed that in the common reference string model non-interactive zero-knowledge protocols do not preserve all of the properties of interactive zero-knowledge protocols, e.g. they do not preserve deniability.Non-interactive zero-knowledge proofs can also be obtained in the random oracle model using the Fiat-Shamir heuristic.".
- Non-interactive_zero-knowledge_proof wikiPageExternalLink GMR.html.
- Non-interactive_zero-knowledge_proof wikiPageID "11589052".
- Non-interactive_zero-knowledge_proof wikiPageRevisionID "602422974".
- Non-interactive_zero-knowledge_proof hasPhotoCollection Non-interactive_zero-knowledge_proof.
- Non-interactive_zero-knowledge_proof subject Category:Cryptographic_protocols.
- Non-interactive_zero-knowledge_proof subject Category:Theory_of_cryptography.
- Non-interactive_zero-knowledge_proof type Abstraction100002137.
- Non-interactive_zero-knowledge_proof type Communication100033020.
- Non-interactive_zero-knowledge_proof type CryptographicProtocols.
- Non-interactive_zero-knowledge_proof type Direction106786629.
- Non-interactive_zero-knowledge_proof type Message106598915.
- Non-interactive_zero-knowledge_proof type Protocol106665108.
- Non-interactive_zero-knowledge_proof type Rule106652242.
- Non-interactive_zero-knowledge_proof comment "Non-interactive zero-knowledge proofs are a variant of zero-knowledge proofs in which no interaction is necessary between prover and verifier. Blum, Feldman, and Micali showed that a common reference string shared between the prover and the verifier is enough to achieve computational zero-knowledge without requiring interaction. Goldreich and Oren gave impossibility results for one shot zero-knowledge protocols in the standard model.".
- Non-interactive_zero-knowledge_proof label "Non-interactive zero-knowledge proof".
- Non-interactive_zero-knowledge_proof sameAs m.02rkk3k.
- Non-interactive_zero-knowledge_proof sameAs Q7048932.
- Non-interactive_zero-knowledge_proof sameAs Q7048932.
- Non-interactive_zero-knowledge_proof sameAs Non-interactive_zero-knowledge_proof.
- Non-interactive_zero-knowledge_proof wasDerivedFrom Non-interactive_zero-knowledge_proof?oldid=602422974.
- Non-interactive_zero-knowledge_proof isPrimaryTopicOf Non-interactive_zero-knowledge_proof.