Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract)

No abstract is available for this paper.

• Publication year

  1984

• Venue

  IEEE Annual Symposium on Foundations of Computer Science

• Publication date

  1984-10-24

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/SFCS.1984.715945
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Independent unbiased coin flips from a correlated biased source—A finite state markov chain

  1984cited by this paper
• Coin flipping by telephone

  1984cited by this paper
• Coin flipping by telephone a protocol for solving impossible problems

  1983cited by this paper
• Probabilistic encryption & how to play mental poker keeping secret all partial information

  1982cited by this paper
• A simple secure pseudo-random number generator

  1982cited by this paper
• How to generate cryptographically strong sequences of pseudo random bits

  1982cited by this paper
• Theory and application of trapdoor functions

  1982cited by this paper
• On the generation of cryptographically strong pseudorandom sequences

  1981cited by this paper
• The Generation of Cryptographically Strong Pseudo-Random Sequences

  1981cited by this paper
• Random Variate Generation: A Survey.

  1980cited by this paper
• A General Approach for Generating Natural Random Variables

  1970cited by this paper

• Randomness from causally independent processes

  2025cites this paper
• Entropy extractor based high-throughput post-processings for True Random Number Generators

  2025cites this paper
• No Bound Randomness in Quantum Nonlocality

  2025cites this paper
• Multi-Source Randomness Extraction and Generation in the Random-Oracle Model

  2025cites this paper
• An efficient construction of Raz's two-source randomness extractor with improved parameters

  2025cites this paper
• Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics

  2024cites this paper
• Finite Device-Independent Extraction of a Block Min-Entropy Source against Quantum Adversaries

  2023influential citation
• Security of Hybrid Key Establishment using Concatenation

  2023cites this paper
• A Method of Cryptographically Strong Pseudorandom Sequences Generation Based on the Blender

  2023cites this paper
• Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions

  2022cites this paper
• An anomaly detecting blockchain strategy for secure IoT networks

  2022cites this paper
• Optimally-secure Coin-tossing against a Byzantine Adversary

  2021cites this paper
• No-signaling-proof randomness extraction from public weak sources

  2021cites this paper
• An ANN-Based Precision Compensation Method for Industrial Manipulators via Optimization of Point Selection

  2020cites this paper
• Real-time Processing System for a Quantum Random Number Generator

  2020cites this paper
• Practical No-Signalling proof Randomness Amplification using Hardy paradoxes and its experimental implementation

  2020cites this paper
• Computational Hardness of Collective Coin-Tossing Protocols

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

  2020cites this paper
• Security of Hybrid Key Encapsulation

  2020cites this paper
• Advances in quantum cryptography

  2019cites this paper
• Time-space lower bounds for two-pass learning

  2019cites this paper
• Randomness Extraction from Somewhat Dependent Sources

  2019cites this paper
• Variant Construction from Theoretical Foundation to Applications

  2019cites this paper
• Quantifying randomness from Bell nonlocality

  2019cites this paper
• Privacy-Preserving Distributed Learning with Secret Gradient Descent

  2019cites this paper
• Santha-Vazirani sources, deterministic condensers and very strong extractors

  2019influential citation
• On the Round Complexity of Randomized Byzantine Agreement

  2019cites this paper
• Quantum random number generators for industrial applications

  2018cites this paper
• An Explicit Non-Malleable Extraction Scheme for Quantum Randomness Amplification With Two Untrusted Devices

  2018cites this paper
• Generic randomness amplification schemes using Hardy paradoxes.

  2018cites this paper
• Novel Pseudorandom Number Generation Using Variant Logic Framework

  2018cites this paper
• Device-Independent Randomness Amplification and Privatization

  2017influential citation
• Extractor-based time-space lower bounds for learning

  2017cites this paper
• Amplifying the Randomness of Weak Sources Correlated With Devices

  2016influential citation
• Bitcoin Beacon

  2016cites this paper
• Certified randomness in quantum physics

  2016cites this paper
• Measurement dependence, limited detection and more: problems and applications of quantum nonlocality

  2016cites this paper
• Multiterminal Secrecy by Public Discussion

  2016cites this paper
• Applied cryptography, second edition : protocols, algorithms,and source code in C

  2015cites this paper
• Security analysis for pseudo-random number generators

  2015cites this paper
• No-signalling attacks and implications for (quantum) nonlocality distillation

  2015cites this paper
• Randomness amplification against no-signaling adversaries using two devices

  2015cites this paper
• Differential Indistinguishability: Cryptography with Imperfect Randomness

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

  2015influential citation
• Pseudo DNA Sequence Generation of Non-Coding Distributions Using Variant Maps on Cellular Automata

  2014cites this paper
• Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources

  2014influential citation
• Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions

  2014influential citation
• RANDOMNESS AMPLIFICATION WITHOUT MARKOV CONDITION

  2014cites this paper
• Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions

  2014cites this paper
• Foundations of Cryptography : List of References July 1989

  2014cites this paper
• Implementing Black hole Password EntryTechnique For Mitigating Shoulder-surfing Threat

  2014cites this paper
• Variant Map System to Simulate Complex Properties of DNA Interactions Using Binary Sequences

  2013cites this paper
• Entropy Analysis and System Design for Quantum Random Number Generators in CMOS Integrated Circuits

  2013cites this paper
• Randomness in

  2013cites this paper
• Lecture 3: Privacy and Weak Sources

  2013cites this paper
• Realistic noise-tolerant randomness amplification using finite number of devices

  2013cites this paper
• Certifiable quantum dice

  2012cites this paper
• Certifiable quantum dice: or, true random number generation secure against quantum adversaries

  2012cites this paper
• Certifiable Quantum Dice - Or, testable exponential randomness expansion

  2011cites this paper
• Free randomness can be amplified

  2011cites this paper
• The Complexity of Entangled Games

  2011cites this paper
• Pseudo random number generator using Elman neural network

  2011cites this paper
• Encryption with weakly random keys using a quantum ciphertext

  2011cites this paper
• List of Publications Related to This Thesis

  2010cites this paper
• Two-Source Extractors Secure Against Quantum Adversaries

  2010cites this paper
• A perfect random number generator

  2009cites this paper
• Vers des générateurs de nombres aléatoires uniformes et gaussiens à très haut débit

  2009cites this paper
• Randomized algorithms for reliable broadcast

  2009cites this paper
• Title: Complexity Classes Characterized by Semi-random Sources

  2007cites this paper
• Pseudorandomness and Combinatorial Constructions

  2006cites this paper
• Extracting Kolmogorov complexity with applications to dimension zero-one laws

  2006cites this paper
• Fault-Tolerant Distributed Computing in Full-Information Networks

  2006influential citation
• Randomness in Cryptography

  2006cites this paper
• Can every randomized algorithm be derandomized?

  2006cites this paper
• Kolmogorov extraction and resource-bounded zero-one laws

  2006cites this paper
• Randomized Quicksort and the Entropy of the Random Source

  2005cites this paper
• Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors

  2005influential citation
• Computational Complexity Since 1980

  2005cites this paper
• Distributed Computing with Imperfect Randomness

  2005cites this paper
• Generalized Strong Extractors and Deterministic Privacy Amplification

  2005cites this paper
• Efficient, perfect polynomial random number generators

  2004cites this paper
• Malicious cryptography - exposing cryptovirology

  2004cites this paper
• Extracting randomness using few independent sources

  2004influential citation
• The Importance of Reliable Randomness A Note on Random Number Generation and Combinatorial Sampling

  2003cites this paper
• Generating random numbers of prescribed distribution using physical sources

  2003cites this paper
• Commonly Used Distributions

  2003cites this paper
• Lecture 20: Boosting

  2002cites this paper
• Extractors and pseudorandom generators

  2001cites this paper
• Empirical Spectral Analysis of Random Number Generators

  2001cites this paper
• Lecture Notes on Cryptography

  2001influential citation
• Extractors and pseudo-random generators with optimal seed length

  2000cites this paper
• Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator

  1999cites this paper
• Extracting Randomness: A Survey and New Constructions

  1999cites this paper
• A Pseudorandom Generator from any One-way Function

  1999cites this paper
• Construction of extractors using pseudo-random generators (extended abstract)

  1999cites this paper
• Cryptanalytic Attacks on Pseudorandom Number Generators

  1998cites this paper
• Probabilistic Algorithms and Complexity Classes

  1998cites this paper
• Bit extraction, hard-core predicates and the bit security of RSA

  1998influential citation
• Explicit Or-dispersers with Polylogarithmic Degree 1

  1998cites this paper
• Zero-Error Information Theory

  1998influential citation