A Pseudorandom Generator from any One-way Function

Related Items

On the possibility of basing cryptography on $\mathsf{EXP}\ne \mathsf{BPP} $, A black-box approach to post-quantum zero-knowledge in constant rounds, One-way functions imply secure computation in a quantum world, \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments, Concurrent knowledge extraction in public-key models, Computational hardness of optimal fair computation: beyond Minicrypt, Cutting-edge cryptography through the lens of secret sharing, Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries, Perfect secure computation in two rounds, Constant-round leakage-resilient zero-knowledge from collision resistance, Adaptively secure distributed PRFs from LWE, Exploring crypto dark matter: new simple PRF candidates and their applications, Towards a unified approach to black-box constructions of zero-knowledge proofs, No time to hash: on super-efficient entropy accumulation, Mercurial commitments with applications to zero-knowledge sets, An optimally fair coin toss, Leakage-resilient cryptography from minimal assumptions, Garbling XOR gates ``for free in the standard model, More efficient DDH pseudorandom generators, A note on perfect correctness by derandomization, Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system, CCA-secure ABE using tag and pair encoding, On the bit security of cryptographic primitives, Fiat-Shamir and correlation intractability from strong KDM-secure encryption, A counterexample to the chain rule for conditional HILL entropy, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Hardness assumptions in the foundations of theoretical computer science, A thirty year old conjecture about promise problems, Secret-sharing for NP, Security levels in steganography -- insecurity does not imply detectability, Naor-Yung paradigm with shared randomness and applications, On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography, Discrete logarithm and minimum circuit size, Zero knowledge and circuit minimization, Encoding invariance in average case complexity, Quantum one-way permutation over the finite field of two elements, Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness, A general compiler for password-authenticated group key exchange protocol in the standard model, On constructing one-way permutations from indistinguishability obfuscation, Secure two-party computation via cut-and-choose oblivious transfer, Statistical concurrent non-malleable zero-knowledge from one-way functions, The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory, On the impossibility of cryptography with tamperable randomness, Hardness-preserving reductions via cuckoo hashing, Non-black-box simulation in the fully concurrent setting, revisited, Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs, The hunting of the SNARK, Public-coin parallel zero-knowledge for NP, Programmable hash functions and their applications, Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions, A new interactive hashing theorem, Security models and proof strategies for plaintext-aware encryption, Concurrent zero knowledge, revisited, Round-efficient black-box construction of composable multi-party computation, Computational fuzzy extractors, Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives, On the security of the WOTS-PRF signature scheme, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, A framework for non-interactive instance-dependent commitment schemes (NIC), When can limited randomness be used in repeated games?, Incremental deterministic public-key encryption, Efficient one-sided adaptively secure computation, Algorithmic rationality: game theory with costly computation, On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography, Avoiding simplicity is complex, Generating shorter bases for hard random lattices, Fourier concentration from shrinkage, Quantum cryptography, Simple extractors via constructions of cryptographic pseudo-random generators, Bounds on the efficiency of black-box commitment schemes, Sharp lower bounds on the extractable randomness from non-uniform sources, Reusable fuzzy extractors for low-entropy distributions, Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs, Constructing digitized chaotic time series with a guaranteed enhanced period, QUAD: A multivariate stream cipher with provable security, Comparing notions of computational entropy, Adaptively secure distributed PRFs from $\mathsf{LWE}$, A note on universal composable zero-knowledge in the common reference string model, On linear-size pseudorandom generators and hardcore functions, Cryptography in the multi-string model, Verifiable random functions: relations to identity-based key encapsulation and new constructions, New constructions of statistical NIZKs: dual-mode DV-NIZKs and more, Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?, Secure software leasing, Oblivious transfer is in MiniQCrypt, Handling expected polynomial-time strategies in simulation-based security proofs, Reducing complexity assumptions for statistically-hiding commitment, Upper and lower bounds on black-box steganography, Cryptography with constant input locality, Characterizing the existence of one-way permutations, Security analysis of NIST CTR-DRBG, Incompressible encodings, Adaptively secure constrained pseudorandom functions in the standard model, Chosen ciphertext security from injective trapdoor functions, Black-box use of one-way functions is useless for optimal fair coin-tossing, From non-adaptive to adaptive pseudorandom functions, Randomness vs time: Derandomization under a uniform assumption, Mining circuit lower bound proofs for meta-algorithms, Quantum commitments from complexity assumptions, Key-homomorphic pseudorandom functions from LWE with small modulus, One-Way Functions and (Im)perfect Obfuscation, The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO, Randomness Tests: Theory and Practice, An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers, Quantified Derandomization: How to Find Water in the Ocean, Extracting Computational Entropy and Learning Noisy Linear Functions, Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model, Unnamed Item, Pseudo-mixing Time of Random Walks, Cryptographic properties of the quantum hashing based on expander graphs, Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs, Non-adaptive universal one-way hash functions from arbitrary one-way functions, Efficient laconic cryptography from learning with errors, On differential privacy and adaptive data analysis with bounded space, Quantum commitments and signatures without one-way functions, Ring signatures with user-controlled linkability, NIZK from SNARGs, Pseudorandom (function-Like) quantum state generators: new definitions and applications, IBE with incompressible master secret and small identity secrets, Rate-1 incompressible encryption from standard assumptions, Enhancing privacy preservation and trustworthiness for decentralized federated learning, Group action key encapsulation and non-interactive key exchange in the QROM, Identity-based interactive aggregate signatures from lattices, New and improved constructions for partially equivocable public key encryption, Cumulatively all-lossy-but-one trapdoor functions from standard assumptions, Worst-case subexponential attacks on PRGs of constant degree or constant locality, Black-box separations for non-interactive classical commitments in a quantum world, From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments, Non-Black-Box Worst-Case to Average-Case Reductions Within $\mathsf{NP}$, Non-interactive universal arguments, Lattice signature with efficient protocols, application to anonymous credentials, One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions, When messages are keys: is HMAC a dual-PRF?, Paradigms for Unconditional Pseudorandom Generators, Succinct interactive oracle proofs: applications and limitations, Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication, New constructions of collapsing hashes, Lockable obfuscation from circularly insecure fully homomorphic encryption, Instantiability of classical random-oracle-model encryption transforms, Impossibilities in succinct arguments: black-box extraction and more, Cryptography with weights: MPC, encryption and signatures, Unnamed Item, Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths, Cryptography and cryptographic protocols, Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols, Построение генераторов случайных чисел с помощью вероятностных автоматов и “односторонних” функций, An Algebraic Approach to Nonmalleability, Efficient non-malleable commitment schemes, On the complexity of compressing obfuscation, FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime, Magic Adversaries Versus Individual Reduction: Science Wins Either Way, Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange, Privacy amplification with asymptotically optimal entropy loss, Efficient non-malleable commitment schemes, Pseudorandom generators without the XOR lemma, The truth behind the myth of the folk theorem, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Unnamed Item, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Easiness assumptions and hardness tests: Trading time for zero error, Semi-honest to Malicious Oblivious Transfer—The Black-Box Way, Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker, An Equivalence Between Zero Knowledge and Commitments, Four-state non-malleable codes with explicit constant rate, Simple and generic constructions of succinct functional encryption, Non-malleable vector commitments via local equivocability, The Grace of Quadratic Norms: Some Examples, Towards Key-Dependent Message Security in the Standard Model, Fine-grained cryptography revisited, The Complexity of Zero Knowledge, Minicrypt primitives with algebraic structure and applications, Unnamed Item, Boosting in the presence of noise, Unnamed Item, Constant-Round Nonmalleable Commitments from Any One-Way Function, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace, Pseudorandom Functions: Three Decades Later, The Many Entropies in One-Way Functions, Homomorphic Encryption, The Complexity of Differential Privacy, A Note on Perfect Correctness by Derandomization, Weak Zero-Knowledge beyond the Black-Box Barrier, A New Pseudorandom Generator from Collision-Resistant Hash Functions, Cryptography from Learning Parity with Noise, Condensed Unpredictability, Minimum Circuit Size, Graph Isomorphism, and Related Problems, Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge, Quantum Security Analysis via Smoothing of Renyi Entropy of Order 2, Limits on the Power of Indistinguishability Obfuscation and Functional Encryption, Fast Pseudorandom Functions Based on Expander Graphs, Pseudoentropy: Lower-Bounds for Chain Rules and Transformations, Receiver Selective Opening Security from Indistinguishability Obfuscation, Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions, Towards Non-Black-Box Separations of Public Key Encryption and One Way Function, Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint, The Chain Rule for HILL Pseudoentropy, Revisited, On Symmetric Encryption with Distinguishable Decryption Failures, Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy, Metric Pseudoentropy: Characterizations, Transformations and Applications, Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy, Gambling, Computational Information and Encryption Security, Information Theoretic Security for Encryption Based on Conditional Rényi Entropies, Modulus Computational Entropy, Authenticated Key Exchange and Key Encapsulation in the Standard Model, Collapse-Binding Quantum Commitments Without Random Oracles, Adaptive Oblivious Transfer and Generalization, Computational Security of Quantum Encryption, Error-Correcting Codes Against Chosen-Codeword Attacks, A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage, Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys, Computational fuzzy extractor from LWE, Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience, Unnamed Item, Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security, Circular security is complete for KDM security, Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks, Classical binding for quantum commitments, Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness, On derandomizing Yao's weak-to-strong OWF construction, Simple constructions from (almost) regular one-way functions, Simple and efficient batch verification techniques for verifiable delay functions, Non-malleable vector commitments via local equivocability, Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves, Bounded-Retrieval Model with Keys Derived from Private Data, Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure, An Improved Robust Fuzzy Extractor, On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets, Secret-Sharing Schemes: A Survey, On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes, On Randomness Extraction in Elliptic Curves, Quantum Commitments from Complexity Assumptions, Practical construction and analysis of pseudo-randomness primitives, Authenticating ad hoc networks by comparison of short digests, Quantum attacks on pseudorandom generators, Lower bounds for non-black-box zero knowledge, QUAD: A Practical Stream Cipher with Provable Security, Luby-Rackoff Ciphers from Weak Round Functions?, Minimum Circuit Size, Graph Isomorphism, and Related Problems, On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles, Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography, Lower Bounds on Assumptions Behind Indistinguishability Obfuscation, Homomorphic Evaluation Requires Depth, Perfect Structure on the Edge of Chaos, Cutting-Edge Cryptography Through the Lens of Secret Sharing, On Constructing One-Way Permutations from Indistinguishability Obfuscation, Contention in Cryptoland: Obfuscation, Leakage and UCE, Pseudorandom generators from regular one-way functions: new constructions with improved parameters, Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker, Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security, A note on the feasibility of generalised universal composability, On the complexity of constructing pseudorandom functions (especially when they don't exist), A unified approach to deterministic encryption: new constructions and a connection to computational entropy, An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations, On the Security Loss in Cryptographic Reductions, Key Agreement from Close Secrets over Unsecured Channels, A Leakage-Resilient Mode of Operation, Optimal Randomness Extraction from a Diffie-Hellman Element, A New Randomness Extraction Paradigm for Hybrid Encryption, On Constructing 1-1 One-Way Functions, Collision-Free Hashing from Lattice Problems, On Yao’s XOR-Lemma, Average Case Complexity, Revisited, Randomness and Computation, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, Fuzzy Signatures: Relaxing Requirements and a New Construction, $$P\mathop{ =}\limits^{?}NP$$, Naor-Yung Paradigm with Shared Randomness and Applications, On Statistically Secure Obfuscation with Approximate Correctness, Fine-Grained Cryptography, XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions, Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN, How to Use Indistinguishability Obfuscation: Deniable Encryption, and More, Unnamed Item, Unnamed Item, A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch, On Related-Secret Pseudorandomness, Constant-Round Interactive Proofs for Delegating Computation, Oblivious polynomial evaluation and oblivious neural learning, Learning DNF from random walks, Universal test for quantum one-way permutations, Garbled Circuits as Randomized Encodings of Functions: a Primer, The Complexity of Public-Key Cryptography