Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Claw-free_permutation> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Claw-free_permutation abstract "In mathematical and computer science field of cryptography, a group of three numbers (x,y,z) is said to be a claw of two permutations f0 and f1 iff0(x) = f1(y) = z.A pair of permutations f0 and f1 are said to be claw-free if there is no efficient algorithm for computing a claw.The terminology claw free was introduced by Goldwasser, Micali, and Rivest in their 1984 paper, \"A Paradoxical Solution to the Signature Problem\" (and later in a more complete journal paper), where they showed that the existence of claw-free pairs of trapdoor permutations implies the existence of digital signature schemes secure against adaptive chosen-message attack. This construction was later superseded by the construction of digital signatures from any one-way trapdoor permutation. The existence of trapdoor permutations does not by itself imply claw-free permutations exist; however, it has been shown that claw-free permutations do exist if factoring is hard.The general notion of claw-free permutation (not necessarily trapdoor) was further studied by Ivan Damgård in his PhD thesis The Application of Claw Free Functions in Cryptography (Aarhus University, 1988), where he showed how to construct Collision Resistant Hash Functions from claw-free permutations. The notion of claw-freeness is closely related to that of collision resistance in hash functions. The distinction is that claw-free permutations are pairs of functions in which it is hard to create a collision between them, while a collision-resistant hash function is a single function in which it's hard to find a collision, i.e. a function H is collision resistant if it's hard to find a pair of distinct values x,y such thatH(x) = H(y).In the hash function literature, this is commonly termed a hash collision. A hash function where collisions are difficult to find is said to have collision resistance.".
- Claw-free_permutation wikiPageExternalLink koshiba96selfdefinable.html.
- Claw-free_permutation wikiPageID "3625890".
- Claw-free_permutation wikiPageLength "4830".
- Claw-free_permutation wikiPageOutDegree "12".
- Claw-free_permutation wikiPageRevisionID "705571391".
- Claw-free_permutation wikiPageWikiLink Category:Permutations.
- Claw-free_permutation wikiPageWikiLink Category:Theory_of_cryptography.
- Claw-free_permutation wikiPageWikiLink Collision_(computer_science).
- Claw-free_permutation wikiPageWikiLink Collision_resistance.
- Claw-free_permutation wikiPageWikiLink Commitment_scheme.
- Claw-free_permutation wikiPageWikiLink Computer_science.
- Claw-free_permutation wikiPageWikiLink Cryptographic_hash_function.
- Claw-free_permutation wikiPageWikiLink Cryptography.
- Claw-free_permutation wikiPageWikiLink Digital_signature.
- Claw-free_permutation wikiPageWikiLink Ivan_Damgård.
- Claw-free_permutation wikiPageWikiLink Mathematics.
- Claw-free_permutation wikiPageWikiLink Trapdoor_function.
- Claw-free_permutation wikiPageWikiLinkText "Claw-free permutation".
- Claw-free_permutation wikiPageUsesTemplate Template:Cite_paper.
- Claw-free_permutation wikiPageUsesTemplate Template:Reflist.
- Claw-free_permutation subject Category:Permutations.
- Claw-free_permutation subject Category:Theory_of_cryptography.
- Claw-free_permutation type Combinatoric.
- Claw-free_permutation type Function.
- Claw-free_permutation comment "In mathematical and computer science field of cryptography, a group of three numbers (x,y,z) is said to be a claw of two permutations f0 and f1 iff0(x) = f1(y) = z.A pair of permutations f0 and f1 are said to be claw-free if there is no efficient algorithm for computing a claw.The terminology claw free was introduced by Goldwasser, Micali, and Rivest in their 1984 paper, \"A Paradoxical Solution to the Signature Problem\" (and later in a more complete journal paper), where they showed that the existence of claw-free pairs of trapdoor permutations implies the existence of digital signature schemes secure against adaptive chosen-message attack. ".
- Claw-free_permutation label "Claw-free permutation".
- Claw-free_permutation sameAs Q5129749.
- Claw-free_permutation sameAs m.09qsf_.
- Claw-free_permutation sameAs Q5129749.
- Claw-free_permutation wasDerivedFrom Claw-free_permutation?oldid=705571391.
- Claw-free_permutation isPrimaryTopicOf Claw-free_permutation.