2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness

    Atlanta, GA, 2009, Pages 617-626.

    Cited by: 36|Bibtex|Views6|Links
    EI WOS
    Keywords:
    cryptographic protocolsentropyprobability2-source extractorscomputable permutationMore(11+)

    Abstract:

    We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is the existence of an efficiently computable permutation $f$, such that for any source $X\in\{0,1\}^n$ with linear min-entropy, any circuit of size $\poly(n)$ cannot invert $...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments