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, Vaikuntanathan, Vinod, Wichs, Daniel |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Springer International Publishing
2021
|
Online Access: | https://hdl.handle.net/1721.1/137257 |
Similar Items
-
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) -
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
by: Brakerski, Zvika, et al.
Published: (2022) -
Boosting Batch Arguments and RAM Delegation
by: Kalai, Yael, et al.
Published: (2023)