On the public citation graph
One way functions and pseudorandom generators
0 signed · 232 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1975.tb02040.xopenalex-snapshot
The Wire-Tap Channel
inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_6openalex-snapshot
Comparison of Two Pseudo-Random Number Generators
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/s0019-9958(84)80060-1openalex-snapshot
Randomness conservation inequalities; information and independence in mathematical theories
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/tit.1972.1054893openalex-snapshot
Class of constructive asymptotically good algebraic codes
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1145/357353.357357openalex-snapshot
On the generation of cryptographically strong pseudorandom sequences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.3240030206openalex-snapshot
Sparse pseudorandom distributions
inferred← citeshttps://doi.org/10.1006/jagm.1998.0952openalex-snapshot
Design of Practical and Provably Good Random Number Generators
inferred← citeshttps://doi.org/10.1006/jcss.2001.1763openalex-snapshot
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
inferred← citeshttps://doi.org/10.1006/jcss.2001.1780openalex-snapshot
Randomness vs Time: Derandomization under a Uniform Assumption
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_12openalex-snapshot
On the Existence of Pseudorandom Generators
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_4openalex-snapshot
Everything Provable is Provable in Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_12openalex-snapshot
Sparse Pseudorandom Distributions
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_24openalex-snapshot
On-Line/Off-Line Digital Signatures
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_42openalex-snapshot
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
inferred← citeshttps://doi.org/10.1007/11426639_6openalex-snapshot
On Robust Combiners for Oblivious Transfer and Other Primitives
inferred← citeshttps://doi.org/10.1007/11586821_8openalex-snapshot
Hash Based Digital Signature Schemes
inferred← citeshttps://doi.org/10.1007/11590156_2openalex-snapshot
Computational Complexity Since 1980
inferred← citeshttps://doi.org/10.1007/11682462_52openalex-snapshot
Hardness Amplification Via Space-Efficient Direct Products
inferred← citeshttps://doi.org/10.1007/11683858_2openalex-snapshot
Query Complexity of Quantum Biased Oracles
inferred← citeshttps://doi.org/10.1007/11787006_20openalex-snapshot
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
inferred← citeshttps://doi.org/10.1007/11818175_2openalex-snapshot
On the Power of the Randomized Iterate
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_22openalex-snapshot
Efficient Amplification of the Security of Weak Pseudo-random Function Generators
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_34openalex-snapshot
The Sum of PRPs Is a Secure PRF
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_26openalex-snapshot
Practical Construction and Analysis of Pseudo-Randomness Primitives
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_25openalex-snapshot
Uniform Results in Polynomial-Time Security
inferred← citeshttps://doi.org/10.1007/3-540-51734-0_53openalex-snapshot
Towards representation independence in PAC learning
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_75openalex-snapshot
Symmetry of information and one-way functions
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_80openalex-snapshot
Constructions of feebly-one-way families of permutations
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_130openalex-snapshot
My favorite ten complexity theorems of the past decade
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_61openalex-snapshot
Pseudorandom generators and the frequency of simplicity
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_149openalex-snapshot
On the query complexity of sets
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_14openalex-snapshot
Using hard problems to derandomize algorithms: An incomplete survey
inferred← citeshttps://doi.org/10.1007/978-0-585-27366-2_9openalex-snapshot
The Probably Approximately Correct (PAC) and Other Learning Models
inferred← citeshttps://doi.org/10.1007/978-1-4612-3774-7_4openalex-snapshot
Complete Representations for Learning from Examples
inferred← citeshttps://doi.org/10.1007/978-3-030-03332-3_18openalex-snapshot
Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_16openalex-snapshot
The Function-Inversion Problem: Barriers and Opportunities
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_9openalex-snapshot
From FE Combiners to Secure MPC and Back
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_12openalex-snapshot
Super-Linear Time-Memory Trade-Offs for Symmetric Encryption
inferred← citeshttps://doi.org/10.1007/978-3-031-07085-3_20openalex-snapshot
On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_12openalex-snapshot
A Tight Computational Indistinguishability Bound for Product Distributions
inferred← citeshttps://doi.org/10.1007/978-3-031-68388-6_16openalex-snapshot
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-68394-7_8openalex-snapshot
On Central Primitives for Quantum Cryptography with Classical Communication
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_137openalex-snapshot
Randomness and Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-319-12475-9_20openalex-snapshot
How to Use Pseudorandom Generators in Unconditional Security Settings
inferred← citeshttps://doi.org/10.1007/978-3-319-13039-2_6openalex-snapshot
Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-29360-8_2openalex-snapshot
RankSynd a PRNG Based on Rank Metric
inferred← citeshttps://doi.org/10.1007/978-3-319-57048-8_3openalex-snapshot
Pseudorandom Functions: Three Decades Later
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_26openalex-snapshot
On the Complexity of Compressing Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_5openalex-snapshot
Complete Classification of Bilinear Hard-Core Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_18openalex-snapshot
Derandomization in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_28openalex-snapshot
Chernoff-Type Direct Product Theorems
inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_20openalex-snapshot
Magnifying Computing Gaps Establishing Encrypted Communication over Unidirectional Channels (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_33openalex-snapshot
Saving Private Randomness in One-Way Functions and Pseudorandom Generators
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_34openalex-snapshot
Degradation and Amplification of Computational Hardness
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_4openalex-snapshot
Basing Weak Public-Key Cryptography on Strong One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-95972-4_14openalex-snapshot
Chaos-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_8openalex-snapshot
Proofs of Retrievability via Hardness Amplification
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_9openalex-snapshot
Security Amplification for Interactive Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_14openalex-snapshot
A Feebly Secure Trapdoor Function
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_21openalex-snapshot
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_35openalex-snapshot
Extractors Using Hardness Amplification
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_46openalex-snapshot
Constructive Proofs of Concentration Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_2openalex-snapshot
General Hardness Amplification of Predicates and Puzzles
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_11openalex-snapshot
The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-21969-6_23openalex-snapshot
On the Security of the Winternitz One-Time Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_22openalex-snapshot
Three XOR-Lemmas — An Exposition
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_34openalex-snapshot
On Security Preserving Reductions – Revised Terminology
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_32openalex-snapshot
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_58openalex-snapshot
Query Complexity in Errorless Hardness Amplification
inferred← citeshttps://doi.org/10.1007/978-3-642-27954-6_12openalex-snapshot
A New Pseudorandom Generator from Collision-Resistant Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_21openalex-snapshot
Hardness Preserving Constructions of Pseudorandom Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_41openalex-snapshot
The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_3openalex-snapshot
Hardness Preserving Reductions via Cuckoo Hashing
inferred← citeshttps://doi.org/10.1007/978-3-642-38980-1_21openalex-snapshot
Fast and Maliciously Secure Two-Party Computation Using the GPU
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_14openalex-snapshot
Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters
inferred← citeshttps://doi.org/10.1007/978-3-642-45628-2_4openalex-snapshot
Verlusttolerante elektronische Brieftaschen
inferred← citeshttps://doi.org/10.1007/978-3-662-46706-0_15openalex-snapshot
The Indistinguishability of the XOR of $$k$$ Permutations
inferred← citeshttps://doi.org/10.1007/978-3-662-47989-6_16openalex-snapshot
Efficient Pseudorandom Functions via On-the-Fly Adaptation
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_6openalex-snapshot
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_17openalex-snapshot
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_10openalex-snapshot
Simultaneous Secrecy and Reliability Amplification for a General Channel Model
inferred← citeshttps://doi.org/10.1007/978-981-15-0818-9_9openalex-snapshot
Post-Quantum Pseudorandom Functions from Mersenne Primes
inferred← citeshttps://doi.org/10.1007/bf00189263openalex-snapshot
Pseudorandom generators and the frequency of simplicity
inferred← citeshttps://doi.org/10.1007/bf00196911openalex-snapshot
One-way permutations on elliptic curves
inferred← citeshttps://doi.org/10.1007/bf01275486openalex-snapshot
BPP has subexponential time simulations unlessEXPTIME has publishable proofs
inferred← citeshttps://doi.org/10.1007/bf02254791openalex-snapshot
On-line/off-line digital signatures
inferred← citeshttps://doi.org/10.1007/bfb0052227openalex-snapshot
On the foundations of modern cryptography
inferred← citeshttps://doi.org/10.1007/s00037-015-0117-4openalex-snapshot
Query Complexity in Errorless Hardness Amplification
inferred← citeshttps://doi.org/10.1007/s00037-016-0136-9openalex-snapshot
Non-interactive proofs of proximity
inferred← citeshttps://doi.org/10.1007/s00037-019-00190-7openalex-snapshot
Simulation Theorems via Pseudo-random Properties
inferred← citeshttps://doi.org/10.1007/s00037-026-00296-9openalex-snapshot
A Technique for Hardness Amplification Against $$\textsf{AC}^0$$
inferred← citeshttps://doi.org/10.1007/s00145-002-0007-1openalex-snapshot
Efficient Amplification of the Security of Weak Pseudo-Random Function Generators
inferred← citeshttps://doi.org/10.1007/s00145-002-0116-xopenalex-snapshot
A Note on Negligible Functions
inferred← citeshttps://doi.org/10.1007/s00145-006-0346-4openalex-snapshot
Completeness in Two-Party Secure Computation: A Computational View
inferred← citeshttps://doi.org/10.1007/s00145-007-9009-3openalex-snapshot
Practical Construction and Analysis of Pseudo-Randomness Primitives
inferred← citeshttps://doi.org/10.1007/s00145-008-9029-7openalex-snapshot
Chernoff-Type Direct Product Theorems
inferred← citeshttps://doi.org/10.1007/s00145-018-9293-0openalex-snapshot
Hardness-Preserving Reductions via Cuckoo Hashing
inferred← citeshttps://doi.org/10.1007/s00145-022-09431-5openalex-snapshot
On the Complexity of Compressing Obfuscation
inferred← citeshttps://doi.org/10.1007/s001459900037openalex-snapshot
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
inferred← citeshttps://doi.org/10.1007/s00224-011-9354-3openalex-snapshot
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography
inferred← citeshttps://doi.org/10.1007/s00493-014-3078-3openalex-snapshot
The communication complexity of addition
inferred← citeshttps://doi.org/10.1007/s10958-009-9403-5openalex-snapshot
Time hierarchies for cryptographic function inversion with advice
inferred← citeshttps://doi.org/10.1007/s10958-012-1103-xopenalex-snapshot
Feebly secure cryptographic primitives
inferred← citeshttps://doi.org/10.1007/s10958-012-1104-9openalex-snapshot
Circuit complexity of linear functions: gate elimination and feeble security
inferred← citeshttps://doi.org/10.1007/s10958-012-1105-8openalex-snapshot
The complexity of inverting explicit Goldreich’s function by DPLL algorithms
inferred← citeshttps://doi.org/10.1007/s10958-013-1397-3openalex-snapshot
A complete one-way function based on a finite rank free $ \mathbb{Z}\times \mathbb{Z} $ -module
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90204-mopenalex-snapshot
Symmetry of information and one-way functions
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90028-jopenalex-snapshot
Prediction-preserving reducibility
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90020-jopenalex-snapshot
Almost everywhere high nonuniform complexity
inferred← citeshttps://doi.org/10.1016/b978-1-55860-146-8.50024-2openalex-snapshot
Composite Geometric Concepts and Polynomial Predictability
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.09.002openalex-snapshot
New stream ciphers based on elliptic curve point multiplication
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.01.016openalex-snapshot
Quantum lower bounds for the Goldreich–Levin problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.013openalex-snapshot
Pseudorandom generators from regular one-way functions: New constructions with improved parameters
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00117-8openalex-snapshot
On universal learning algorithms
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00068-0openalex-snapshot
One-way permutations and self-witnessing languages
inferred← citeshttps://doi.org/10.1016/s0065-2458(09)01204-2openalex-snapshot
Chapter 4 A Status Report on the P Versus NP Question
inferred← citeshttps://doi.org/10.1023/a:1023634616182openalex-snapshot
The Tale of One-Way Functions
inferred← citeshttps://doi.org/10.1090/s1061-0022-09-01079-6openalex-snapshot
Algebraic cryptography: new constructions and their security against provable break
inferred← citeshttps://doi.org/10.1109/18.50372openalex-snapshot
A fair protocol for signing contracts
inferred← citeshttps://doi.org/10.1109/18.556672openalex-snapshot
A new paradigm for public key identification
inferred← citeshttps://doi.org/10.1109/18.61123openalex-snapshot
Error-correcting codes for list decoding
inferred← citeshttps://doi.org/10.1109/18.841170openalex-snapshot
How to turn loaded dice into fair coins
inferred← citeshttps://doi.org/10.1109/ccc.2000.856746openalex-snapshot
Easiness assumptions and hardness tests: trading time for zero error
inferred← citeshttps://doi.org/10.1109/ccc.2005.16openalex-snapshot
On Constructing Parallel Pseudorandom Generators from One-Way Functions
inferred← citeshttps://doi.org/10.1109/ccc.2007.15openalex-snapshot
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
inferred← citeshttps://doi.org/10.1109/ccc.2010.18openalex-snapshot
The Program-Enumeration Bottleneck in Average-Case Complexity Theory
inferred← citeshttps://doi.org/10.1109/focs.2006.13openalex-snapshot
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification
inferred← citeshttps://doi.org/10.1109/focs.2009.62openalex-snapshot
A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems
inferred← citeshttps://doi.org/10.1109/focs.2012.51openalex-snapshot
Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls
inferred← citeshttps://doi.org/10.1109/focs.2013.84openalex-snapshot
Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers
inferred← citeshttps://doi.org/10.1109/focs.2018.00023openalex-snapshot
PPP-Completeness with Connections to Cryptography
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00009openalex-snapshot
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00014openalex-snapshot
Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00068openalex-snapshot
Tight Quantum Time-Space Tradeoffs for Function Inversion
inferred← citeshttps://doi.org/10.1109/fscs.1990.89550openalex-snapshot
Security preserving amplification of hardness
inferred← citeshttps://doi.org/10.1109/sct.1989.41813openalex-snapshot
Almost everywhere high nonuniform complexity
inferred← citeshttps://doi.org/10.1109/sct.1991.160263openalex-snapshot
BPP has subexponential time simulations unless EXPTIME has publishable proofs
inferred← citeshttps://doi.org/10.1109/sct.1994.315805openalex-snapshot
Space lower-bounds for pseudorandom-generators
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21917openalex-snapshot
On the existence of pseudorandom generators
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21919openalex-snapshot
Homogeneous measures and polynomial time invariants
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63485openalex-snapshot
Lower bounds for pseudorandom number generators
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267749openalex-snapshot
Towards a computational theory of statistical tests
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492584openalex-snapshot
Hard-core distributions for somewhat hard problems
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646120openalex-snapshot
New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646126openalex-snapshot
Does parallel repetition lower the error in computationally sound protocols?
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743524openalex-snapshot
Randomness vs. time: de-randomization under a uniform assumption
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238187openalex-snapshot
List-decoding using the XOR lemma
inferred← citeshttps://doi.org/10.1109/tpwrd.2009.2036181openalex-snapshot
Efficient Secure Group Communications for SCADA
inferred← citeshttps://doi.org/10.1109/tsipn.2022.3233193openalex-snapshot
SecDT: Privacy-Preserving Outsourced Decision Tree Classification Without Polynomial Forms in Edge-Cloud Computing
inferred← citeshttps://doi.org/10.1109/wsc.1989.718716openalex-snapshot
About Polynomial-Ttime "Unpredictable" Generators
inferred← citeshttps://doi.org/10.1134/s0032946009020082openalex-snapshot
On complete one-way functions
inferred← citeshttps://doi.org/10.1137/0222069openalex-snapshot
On the Existence of Pseudorandom Generators
inferred← citeshttps://doi.org/10.1137/05063605xopenalex-snapshot
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
inferred← citeshttps://doi.org/10.1137/070683994openalex-snapshot
Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification
inferred← citeshttps://doi.org/10.1137/080721820openalex-snapshot
On the Power of the Randomized Iterate
inferred← citeshttps://doi.org/10.1137/080734030openalex-snapshot
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
inferred← citeshttps://doi.org/10.1137/09077299xopenalex-snapshot
New Direct-Product Testers and 2-Query PCPs
inferred← citeshttps://doi.org/10.1137/1.9781611973105.46openalex-snapshot
The communication complexity of addition
inferred← citeshttps://doi.org/10.1137/1.9781611975482.61openalex-snapshot
XOR Codes and Sparse Learning Parity with Noise
inferred← citeshttps://doi.org/10.1137/19m1276650openalex-snapshot
List-Decoding with Double Samplers
inferred← citeshttps://doi.org/10.1137/20m1321231openalex-snapshot
Nondeterministic Quasi-Polynomial Time is Average-Case Hard for \(\textsf{ACC}\) Circuits
inferred← citeshttps://doi.org/10.1137/20m1364886openalex-snapshot
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
inferred← citeshttps://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferred← citeshttps://doi.org/10.1140/epjqt/s40507-023-00200-2openalex-snapshot
Multi-bit quantum random number generator from path-entangled single photons
inferred← citeshttps://doi.org/10.1142/9789812562494_0012openalex-snapshot
DERANDOMIZATION: A BRIEF OVERVIEW
inferred← citeshttps://doi.org/10.1142/s0129054111009124openalex-snapshot
ON THE CIRCUIT-SIZE OF INVERSES
inferred← citeshttps://doi.org/10.1142/s0218196715400019openalex-snapshot
Semigroups and one-way functions
inferred← citeshttps://doi.org/10.1145/100216.100269openalex-snapshot
One-way functions are necessary and sufficient for secure signatures
inferred← citeshttps://doi.org/10.1145/100216.100273openalex-snapshot
Public-key cryptosystems provably secure against chosen ciphertext attacks
inferred← citeshttps://doi.org/10.1145/1007352.1007395openalex-snapshot
Completeness in two-party secure computation
inferred← citeshttps://doi.org/10.1145/1060590.1060595openalex-snapshot
On uniform amplification of hardness in NP
inferred← citeshttps://doi.org/10.1145/1060590.1060678openalex-snapshot
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
inferred← citeshttps://doi.org/10.1145/1132516.1132571openalex-snapshot
Can every randomized algorithm be derandomized?
inferred← citeshttps://doi.org/10.1145/130385.130388openalex-snapshot
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
inferred← citeshttps://doi.org/10.1145/1374376.1374460openalex-snapshot
Uniform direct product theorems
inferred← citeshttps://doi.org/10.1145/1536414.1536435openalex-snapshot
New direct-product testers and 2-query PCPs
inferred← citeshttps://doi.org/10.1145/168304.168372openalex-snapshot
Amplification of weak learning under the uniform distribution
inferred← citeshttps://doi.org/10.1145/2090236.2090275openalex-snapshot
Marginal hitting sets imply super-polynomial lower bounds for permanent
inferred← citeshttps://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferred← citeshttps://doi.org/10.1145/2676659openalex-snapshot
Advice Lower Bounds for the Dense Model Theorem
inferred← citeshttps://doi.org/10.1145/2688073.2688079openalex-snapshot
Non-Interactive Proofs of Proximity
inferred← citeshttps://doi.org/10.1145/301250.301296openalex-snapshot
Security-preserving hardness-amplification for any regular one-way function
inferred← citeshttps://doi.org/10.1145/3188745.3188870openalex-snapshot
Multi-collision resistance: a paradigm for keyless hash functions
inferred← citeshttps://doi.org/10.1145/3335741.3335755openalex-snapshot
How to play any mental game, or a completeness theorem for protocols with honest majority
inferred← citeshttps://doi.org/10.1145/3406325.3451132openalex-snapshot
Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma
inferred← citeshttps://doi.org/10.1145/3519935.3520051openalex-snapshot
Robustness of average-case meta-complexity via pseudorandomness
inferred← citeshttps://doi.org/10.1145/3618260.3649603openalex-snapshot
An Efficient Quantum Parallel Repetition Theorem and Applications
inferred← citeshttps://doi.org/10.1145/3717823.3718258openalex-snapshot
Strong XOR Lemma for Information Complexity
inferred← citeshttps://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions
inferred← citeshttps://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferred← citeshttps://doi.org/10.1145/76738.76799openalex-snapshot
About polynomial-time “unpredictable” generators
inferred← citeshttps://doi.org/10.1504/ijcnds.2009.027598openalex-snapshot
A new hardware efficient stream cipher based on hash functions
inferred← citeshttps://doi.org/10.1515/9780823295708-025openalex-snapshot
CHAPTER NOTES AND REFERENCES
inferred← citeshttps://doi.org/10.1515/9783110203738.455openalex-snapshot
Chapter 8 Notes and References
inferred← citeshttps://doi.org/10.1515/gcc.2009.1openalex-snapshot
A Complete Public-Key Cryptosystem
showing the first 200 of 221 · page through all 221
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.