Bit-fixing extractors for almost-logarithmic entropy
From MaRDI portal
Cites work
- Affine extractors for almost logarithmic entropy
- Affine extractors over prime fields
- All-or-nothing encryption and the package transform
- Almost \(k\)-wise independence versus \(k\)-wise independence
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- An explicit two-source extractor with min-entropy rate near $4/9$
- Deterministic extractors for affine sources over large fields
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Efficient resilient functions
- Explicit directional affine extractors and improved hardness for linear branching programs
- Explicit non-malleable extractors, multi-source extractors, and almost optimal privacy amplification protocols
- Explicit Resilient Functions Matching Ajtai-Linial
- Explicit two-source extractors and resilient functions
- Exposure-resilient functions and all-or-nothing transforms
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Extractors and pseudorandom generators
- Extractors for a constant number of independent sources with polylogarithmic min-entropy
- Extractors for sum of two sources
- How to get more mileage from randomness extractors
- scientific article; zbMATH DE number 1722684 (Why is no real title available?)
- scientific article; zbMATH DE number 3147923 (Why is no real title available?)
- scientific article; zbMATH DE number 1256667 (Why is no real title available?)
- scientific article; zbMATH DE number 1418247 (Why is no real title available?)
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- scientific article; zbMATH DE number 7650110 (Why is no real title available?)
- Improved average-case lower bounds for DeMorgan formula size
- Improved two-source extractors, and affine extractors for polylogarithmic entropy
- Invertible Extractors and Wiretap Protocols
- Local correlation breakers and applications to three-source extractors and mergers
- Mining circuit lower bound proofs for meta-algorithms
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
- New independent source extractors with exponential improvement
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- On a class of error correcting binary group codes
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Simple extractors for all min-entropies and a new pseudorandom generator
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- The influence of large coalitions
- Three-source extractors for polylogarithmic min-entropy
- Towards optimal two-source extractors and Ramsey graphs
- Two source extractors for asymptotically optimal entropy, and (many) more
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- Zero-fixing extractors for sub-logarithmic entropy
This page was built for publication: Bit-fixing extractors for almost-logarithmic entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346863)
