Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Fiat–Shamir_heuristic> ?p ?o. }
Showing items 1 to 11 of
11
with 100 items 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. 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.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.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 wikiPageRevisionID "590476216".
- Fiat–Shamir_heuristic subject Category:Cryptographic_protocols.
- Fiat–Shamir_heuristic subject Category:Theory_of_cryptography.
- 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. The technique is due to Fiat and Shamir (1986).".
- Fiat–Shamir_heuristic label "Fiat–Shamir heuristic".
- Fiat–Shamir_heuristic sameAs Fiat%E2%80%93Shamir_heuristic.
- Fiat–Shamir_heuristic sameAs Q5446341.
- Fiat–Shamir_heuristic sameAs Q5446341.
- Fiat–Shamir_heuristic wasDerivedFrom Fiat–Shamir_heuristic?oldid=590476216.