Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Leftover_hash_lemma> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Leftover_hash_lemma abstract "The leftover hash lemma is a lemma in cryptography first stated by Russell Impagliazzo, Leonid Levin, and Michael Luby.Imagine that you have a secret key that has uniform random bits, and you would like to use this secret key to encrypt a message. Unfortunately, you were a bit careless with the key, and know that an adversary was able to learn about bits of that key, but you do not know which. Can you still use your key, or do you have to throw it away and choose a new key? The leftover hash lemma tells us that we can produce a key of almost bits, over which the adversary has almost no knowledge. Since the adversary knows all but bits, this is almost optimal.More precisely, the leftover hash lemma tells us that we can extract about (the min-entropy of ) bits from a random variable that are almost uniformly distributed. In other words, an adversary who has some partial knowledge about , will have almost no knowledge about the extracted value. That is why this is also called privacy amplification (see privacy amplification section in the article Quantum key distribution).Randomness extractors achieve the same result, but use (normally) less randomness.".
- Leftover_hash_lemma wikiPageExternalLink abs_all.jsp?isnumber=10153&arnumber=476316&type=ref.
- Leftover_hash_lemma wikiPageExternalLink citation.cfm?coll=GUIDE&dl=GUIDE&id=312213.
- Leftover_hash_lemma wikiPageExternalLink citation.cfm?coll=GUIDE&dl=GUIDE&id=45477.
- Leftover_hash_lemma wikiPageExternalLink citation.cfm?coll=GUIDE&dl=GUIDE&id=73009.
- Leftover_hash_lemma wikiPageID "7006101".
- Leftover_hash_lemma wikiPageRevisionID "506116127".
- Leftover_hash_lemma hasPhotoCollection Leftover_hash_lemma.
- Leftover_hash_lemma subject Category:Probability_theorems.
- Leftover_hash_lemma subject Category:Theory_of_cryptography.
- Leftover_hash_lemma type Abstraction100002137.
- Leftover_hash_lemma type Communication100033020.
- Leftover_hash_lemma type Message106598915.
- Leftover_hash_lemma type ProbabilityTheorems.
- Leftover_hash_lemma type Proposition106750804.
- Leftover_hash_lemma type Statement106722453.
- Leftover_hash_lemma type Theorem106752293.
- Leftover_hash_lemma comment "The leftover hash lemma is a lemma in cryptography first stated by Russell Impagliazzo, Leonid Levin, and Michael Luby.Imagine that you have a secret key that has uniform random bits, and you would like to use this secret key to encrypt a message. Unfortunately, you were a bit careless with the key, and know that an adversary was able to learn about bits of that key, but you do not know which.".
- Leftover_hash_lemma label "Leftover hash lemma".
- Leftover_hash_lemma sameAs m.0g_yjh.
- Leftover_hash_lemma sameAs Q6517045.
- Leftover_hash_lemma sameAs Q6517045.
- Leftover_hash_lemma sameAs Leftover_hash_lemma.
- Leftover_hash_lemma wasDerivedFrom Leftover_hash_lemma?oldid=506116127.
- Leftover_hash_lemma isPrimaryTopicOf Leftover_hash_lemma.