Extracting Randomness from Extractor-Dependent Sources
© International Association for Cryptologic Research 2020. We revisit the well-studied problem of extracting nearly uniform randomness from an arbitrary source of sufficient min-entropy. Strong seeded extractors solve this problem by relying on a public random seed, which is unknown to the source. H...
Main Authors: | Dodis, Yevgeniy (Author), Vaikuntanathan, Vinod (Author), Wichs, Daniel (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer International Publishing,
2021-11-03T17:34:21Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Randomness extractors for independent sources and applications
by: Rao, Anup, 1980-
Published: (2008) -
Statistical zapr arguments from bilinear maps
by: Lombardi, Alex, et al.
Published: (2022) -
Leveled Fully Homomorphic Signatures from Standard Lattices
by: Gorbunov, Sergey, et al.
Published: (2017) -
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
by: Brakerski, Zvika, et al.
Published: (2021) -
Obfuscating Conjunctions under Entropic Ring LWE
by: Brakerski, Zvika, et al.
Published: (2017)