Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Fiat–Shamir_heuristic> ?p ?o }
Showing triples 1 to 35 of
35
with 100 triples per page.
- Fiat–Shamir_heuristic abstract "The Fiat–Shamir heuristic is a technique in cryptography for taking an interactive proof of knowledge and creating a digital signature based on it. This way, some fact (for example, knowledge of a certain number secret to the public) can be proven without revealing underlying information. The technique is due to Fiat and Shamir (1986). The original interactive proof must have the property of being public-coin, for the method to work. For the algorithm specified below, a reader should be familiar with the laws of modular arithmetic, especially with multiplicative groups of integers modulo n with prime n.The heuristic was originally presented without a proof of security; later, Pointcheval and Stern proved its security against chosen message attacks in the random oracle model, that is, under the assumption that random oracles exist. In the case that random oracles don't exist, the Fiat–Shamir heuristic has been proven insecure by Goldwasser and Kalai. The Fiat–Shamir heuristic thus demonstrates a major application of random oracles. If the hash value used below does not depend on the (public) value of y, the security of the scheme is weakened, as a malicious prover can then select a certain value x so that the product cx is known.More generally, the Fiat–Shamir heuristic may also be viewed as converting a public-coin interactive proof of knowledge into a non-interactive proof of knowledge. If the interactive proof is an identification protocol, then the non-interactive version can be used directly as a digital signature.".
- Fiat–Shamir_heuristic wikiPageID "23851017".
- Fiat–Shamir_heuristic wikiPageLength "4689".
- Fiat–Shamir_heuristic wikiPageOutDegree "14".
- Fiat–Shamir_heuristic wikiPageRevisionID "697693020".
- Fiat–Shamir_heuristic wikiPageWikiLink Anonymous_veto_network.
- Fiat–Shamir_heuristic wikiPageWikiLink Category:Theory_of_cryptography.
- Fiat–Shamir_heuristic wikiPageWikiLink Chosen-plaintext_attack.
- Fiat–Shamir_heuristic wikiPageWikiLink Cryptographic_hash_function.
- Fiat–Shamir_heuristic wikiPageWikiLink Digital_signature.
- Fiat–Shamir_heuristic wikiPageWikiLink Interactive_proof_system.
- Fiat–Shamir_heuristic wikiPageWikiLink Modular_arithmetic.
- Fiat–Shamir_heuristic wikiPageWikiLink Multiplicative_group_of_integers_modulo_n.
- Fiat–Shamir_heuristic wikiPageWikiLink Non-interactive_zero-knowledge_proof.
- Fiat–Shamir_heuristic wikiPageWikiLink Proof_of_knowledge.
- Fiat–Shamir_heuristic wikiPageWikiLink Random_oracle.
- Fiat–Shamir_heuristic wikiPageWikiLinkText "Fiat–Shamir heuristic".
- Fiat–Shamir_heuristic wikiPageWikiLinkText "Fiat–Shamir transform".
- Fiat–Shamir_heuristic wikiPageWikiLinkText "Fiat–Shamir".
- Fiat–Shamir_heuristic wikiPageUsesTemplate Template:Context.
- Fiat–Shamir_heuristic wikiPageUsesTemplate Template:Crypto-stub.
- Fiat–Shamir_heuristic subject Category:Theory_of_cryptography.
- Fiat–Shamir_heuristic hypernym Technique.
- Fiat–Shamir_heuristic type TopicalConcept.
- Fiat–Shamir_heuristic type Page.
- Fiat–Shamir_heuristic type Protocol.
- Fiat–Shamir_heuristic type Redirect.
- Fiat–Shamir_heuristic comment "The Fiat–Shamir heuristic is a technique in cryptography for taking an interactive proof of knowledge and creating a digital signature based on it. This way, some fact (for example, knowledge of a certain number secret to the public) can be proven without revealing underlying information. The technique is due to Fiat and Shamir (1986). The original interactive proof must have the property of being public-coin, for the method to work.".
- Fiat–Shamir_heuristic label "Fiat–Shamir heuristic".
- Fiat–Shamir_heuristic sameAs Q5446341.
- Fiat–Shamir_heuristic sameAs Fiat-Shamir-Heuristik.
- Fiat–Shamir_heuristic sameAs m.06_ttrx.
- Fiat–Shamir_heuristic sameAs Q5446341.
- Fiat–Shamir_heuristic wasDerivedFrom Fiat–Shamir_heuristic?oldid=697693020.
- Fiat–Shamir_heuristic isPrimaryTopicOf Fiat–Shamir_heuristic.