Deterministic extractors for bit-fixing sources and exposure-resilient cryptography

No abstract is available for this paper.

• Publication year

  2003

• Venue

  44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.

• Publication date

  2003-10-11

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/SFCS.2003.1238184
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Deterministic extractors for bit-fixing sources by obtaining an independent seed

  2004cited by this paper
• Extracting randomness from generalized symbol-fixing and Markov sources

  2004cited by this paper
• Smaller explicit superconcentrators

  2003cited by this paper
• Recent Developments in Explicit Constructions of Extractors

  2002cited by this paper
• On Perfect and Adaptive Security in Exposure-Resilient Cryptography

  2001influential reference
• Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors

  2000cited by this paper
• Exposure-resilient cryptography

  2000cited by this paper
• Exposure-Resilient Functions and All-or-Nothing Transforms

  2000cited by this paper
• Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications

  2000cited by this paper
• Extracting randomness from samplable distributions

  2000cited by this paper
• Scramble All, Encrypt Small

  1999cited by this paper
• On the Security Properties of OAEP as an All-or-Nothing Transform

  1999cited by this paper
• Perfect information leader election in log*n+O(1) rounds

  1998cited by this paper
• All-or-Nothing Encryption and the Package Transform

  1997cited by this paper
• Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications

  1997cited by this paper
• Randomness is Linear in Space

  1996cited by this paper
• High-Bandwidth Encryption with Low-Bandwidth Smartcards

  1996cited by this paper
• Discrete groups, expanding graphs and invariant measures

  1994cited by this paper
• Discrete Groups

  1994cited by this paper
• Random Walks on Graphs: A Survey

  1993cited by this paper
• The influence of large coalitions

  1993influential reference
• On the bit extraction problem

  1992cited by this paper
• Isoperimetric Inequalities for Faces of the Cube and the Grid

  1990cited by this paper
• Exact Face-isoperimetric Inequalities

  1990cited by this paper
• Collective Coin Flipping

  1989cited by this paper
• How to recycle random bits

  1989cited by this paper
• Dispersers, deterministic amplification, and weak random sources

  1989cited by this paper
• Group representations in probability and statistics

  1988cited by this paper
• The influence of variables on Boolean functions

  1988cited by this paper
• Deterministic simulation in LOGSPACE

  1987cited by this paper
• Generating Quasi-random Sequences from Semi-random Sources

  1986cited by this paper
• The bit extraction problem or t-resilient functions

  1985cited by this paper
• Random walks, universal traversal sequences, and the complexity of maze problems

  1979cited by this paper
• Ramanujan Graphs

  1965cited by this paper

• Condense to Conduct and Conduct to Condense

  2025cites this paper
• Bit-Fixing Extractors for Almost-Logarithmic Entropy

  2025cites this paper
• New Pseudorandom Generators and Correlation Bounds Using Extractors

  2025influential citation
• Condensing and Extracting Against Online Adversaries

  2024cites this paper
• Two-Source and Affine Non-Malleable Extractors for Small Entropy

  2024cites this paper
• Cryptomite: A versatile and user-friendly library of randomness extractors

  2024cites this paper
• Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More

  2023cites this paper
• Efficient resilient functions

  2022cites this paper
• Affine Extractors for Almost Logarithmic Entropy

  2022cites this paper
• Recent Advances in Randomness Extraction

  2022cites this paper
• Lossless fuzzy extractor enabled secure authentication using low entropy noisy sources

  2021cites this paper
• Extractors for sum of two sources

  2021cites this paper
• Lattice-based remote user authentication from reusable fuzzy signature

  2021cites this paper
• On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing

  2021cites this paper
• Improved Extractors for Small-Space Sources

  2020cites this paper
• Explicit Designs and Extractors

  2020cites this paper
• How to Extract Useful Randomness from Unreliable Sources

  2020cites this paper
• Extractors for adversarial sources via extremal hypergraphs

  2020cites this paper
• A new framework for privacy-preserving biometric-based remote user authentication

  2020cites this paper
• Advances in Cryptology – EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part I

  2020influential citation
• Pseudorandom Constructions: Computing in Parallel and Applications to Edit Distance Codes

  2019cites this paper
• Average Bias and Polynomial Sources

  2019cites this paper
• Extractors for Small Zero-Fixing Sources

  2019influential citation
• Randomness Extractors and Space-Bounded Computation

  2018cites this paper
• 72 53 v 1 [ cs . C C ] 2 7 O ct 2 01 4 Deterministic Extractors for Additive Sources

  2018cites this paper
• Efficient, Reusable Fuzzy Extractors from LWE

  2017cites this paper
• Computing majority with low-fan-in majority queries

  2017cites this paper
• Leakage-resilient attribute based encryption in prime-order groups via predicate encodings

  2017cites this paper
• Bitcoin and Secure Computation with Money

  2017cites this paper
• Reusable Fuzzy Extractors for Low-Entropy Distributions

  2016cites this paper
• Extractors for Near Logarithmic Min-Entropy

  2016cites this paper
• Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates

  2016cites this paper
• Explicit two-source extractors and more

  2016cites this paper
• Randomness Extraction in AC0 and with Small Locality

  2016influential citation
• New Extractors for Interleaved Sources

  2016cites this paper
• Bitcoin Beacon

  2016cites this paper
• Leakage resilient CCA secure IBE with all-but-one lossy filter

  2016cites this paper
• Quantum random number generators

  2016cites this paper
• The Hilbert Function, Algebraic Extractors, and Recursive Fourier Sampling

  2016cites this paper
• Explicit two-source extractors and resilient functions

  2016influential citation
• Extractors for sumset sources

  2016cites this paper
• Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic Entropy

  2016cites this paper
• Dimension, pseudorandomness and extraction of pseudorandomness

  2016cites this paper
• C R ] 2 1 M ay 2 01 6 Bitcoin Beacon Iddo Bentov

  2016cites this paper
• Reusable Fuzzy Extractors via Digital Lockers

  2015cites this paper
• Attribute-Based Encryption Resilient to Auxiliary Input

  2015cites this paper
• CCA Secure PKE with Auxiliary Input Security and Leakage Resiliency

  2015cites this paper
• Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources

  2015cites this paper
• On Randomness Extraction in AC0

  2015influential citation
• End-to-End Verifiable Elections in the Standard Model

  2015influential citation
• True Random Number Generators Secure in a Changing Environment: Improved Security Bounds

  2015cites this paper
• Security of Linear Secret-Sharing Schemes against Mass Surveillance

  2015cites this paper
• Zero-Fixing Extractors for Sub-Logarithmic Entropy

  2015cites this paper
• Deterministic Extractors for Additive Sources: Extended Abstract

  2014influential citation
• Privacy Amplification in the Isolated Qubits Model

  2014cites this paper
• Key Derivation From Noisy Sources With More Errors Than Entropy

  2014cites this paper
• Key Derivation without Entropy Waste

  2014cites this paper
• Deterministic Coupon Collection and Better Strong Dispersers

  2014cites this paper
• Deterministic Extractors for Additive Sources

  2014cites this paper
• Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness

  2014influential citation
• Randomness extractors and data storage

  2014cites this paper
• Separate Random Number Generation from Correlated Sources

  2014cites this paper
• Cryptocurrencies Without Proof of Work

  2014influential citation
• Improved Average-Case Lower Bounds for DeMorgan Formula Size

  2013cites this paper
• Measures of Eciency for Secure Multiparty Computation

  2013cites this paper
• Randomness and Noise in Information Systems

  2013cites this paper
• The Computational Complexity of Randomness

  2013cites this paper
• Computational Fuzzy Extractors

  2013influential citation
• Sharpness of KKL on Schreier graphs

  2013cites this paper
• Measures of Efficiency for Secure Multiparty Computation

  2012cites this paper
• Variable-length extractors

  2012cites this paper
• Variable-Length Extractors : Efficiently Extracting Randomness from Weak Stochastic Processes

  2012cites this paper
• On Extractors and Exposure-Resilient Functions for

  2012cites this paper
• Linear Transformations for Randomness Extraction

  2012cites this paper
• A Cryptographic Treatment of the Wiretap Channel

  2012cites this paper
• Invertible Extractors and Wiretap Protocols

  2012influential citation
• Increasing the output length of zero‐error dispersers

  2012influential citation
• Two-source extractors for leaky sources

  2012cites this paper
• Improving the Hadamard extractor

  2012cites this paper
• Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors

  2012cites this paper
• Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity

  2012cites this paper
• Efficiently Extracting Randomness from Imperfect Stochastic Processes

  2012cites this paper
• Extractors and Lower Bounds for Locally Samplable Sources

  2011cites this paper
• How to leak on key updates

  2011cites this paper
• From affine to two-source extractors via approximate duality

  2011cites this paper
• On Resilient and Exposure-Resilient Functions

  2011cites this paper
• A New Approach to Affine Extractors and Dispersers

  2011cites this paper
• Applications of Derandomization Theory in Coding

  2011cites this paper
• Secure Message Transmission by Public Discussion: A Brief Survey

  2011cites this paper
• Extractors for Circuit Sources

  2011cites this paper
• Polarization and randomness extraction

  2011cites this paper
• Linear extractors for extracting randomness from noisy sources

  2011cites this paper
• An Introduction to Randomness Extractors

  2011cites this paper
• Achieving Leakage Resilience through Dual System Encryption

  2011cites this paper
• Improved Constructions of Three Source Extractors

  2011cites this paper
• Secure Message Transmission With Small Public Discussion

  2010cites this paper
• On extractors and exposure-resilient functions for sublogarithmic entropy

  2010influential citation
• Efficient Public-Key Cryptography in the Presence of Key Leakage

  2010cites this paper
• Sparse graph codes for compression, sensing, and secrecy

  2010cites this paper
• Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction

  2010cites this paper