![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Recent Advances in Computational Extractors
Recent Advances in Computational ExtractorsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani. This talk has been canceled/deleted Randomness extractors are algorithms that map sources of sufficient min-entropy to outputs that are statistically close to uniform. Randomness extraction has become a central and ubiquitous notion in complexity theory and theoretical computer science with innumerable applications and surprising and unifying connections to other notions. Cryptography, too, has greatly benefited from this notion. Cryptographic applications of randomness extractors range from the construction of pseudorandom generators from one-way functions to the design of cryptographic functionality from noisy and weak sources (including applications to quantum cryptography) to the more recent advances in areas such as leakage- and exposure-resilient cryptography, circular encryption, fully homomorphic encryption, etc. Randomness extractors have also found important cryptographic uses in practical applications, particularly for the construction of key derivation functions. In many of these applications, the defining property of randomness extractors, namely, statistical closeness of their output to a uniform distribution, can be relaxed and replaced with computational indistinguishability. Extractors that provide this form of relaxed guarantee are called ‘computational extractors’. In this talk I will cover some recent advances in the understanding and applicability of computational extractors with particular focus on their role in building key derivation functions. As a connection between this talk and the question ‘Is Cryptographic Theory Practically Relevant?’ see http://tools.ietf.org/html/rfc5869. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsThe obesity epidemic: Discussing the global health crisis dh539 Humanitarian CentreOther talksThe Productivity Paradox: are we too busy to get anything done? Grammar Variational Autoencoder The potential of the non-state sector:what can be learnt from the PEAS example Project Management HONORARY FELLOWS PRIZE LECTURE - Towards a silent aircraft Hornby Model Railways Throwing light on organocatalysis: new opportunities in enantioselective synthesis Asclepiadaceae Computing High Resolution Health(care) Protein Folding, Evolution and Interactions Symposium The ‘Easy’ and ‘Hard’ Problems of Consciousness Systems for Big Data Applications:Revolutionising personal computing |