Pages that link to "Item:Q1100894"
From MaRDI portal
The following pages link to One way functions and pseudorandom generators (Q1100894):
Displaying 50 items.
- On universal learning algorithms (Q287154) (← links)
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- The communication complexity of addition (Q519955) (← links)
- A note on Yao's theorem about pseudo-random generators (Q662183) (← links)
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
- On complete one-way functions (Q734307) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Time hierarchies for cryptographic function inversion with advice (Q843601) (← links)
- Query complexity in errorless hardness amplification (Q901934) (← links)
- Quantum lower bounds for the Goldreich-Levin problem (Q1045938) (← links)
- One-way functions and circuit complexity (Q1096587) (← links)
- One-way permutations in NC 0 (Q1108786) (← links)
- On the theory of average case complexity (Q1190984) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- Zeta functions, one-way functions, and pseudorandom number generators. (Q1362085) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Symmetry of information and one-way functions (Q1802066) (← links)
- Some consequences of the existnce of pseudorandom generators (Q1822961) (← links)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- One-way permutations and self-witnessing languages (Q1877694) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- On-line/off-line digital signatures (Q1912770) (← links)
- Feebly secure cryptographic primitives (Q1946841) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- The complexity of inverting explicit Goldreich's function by DPLL algorithms (Q1946844) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Hardness-preserving reductions via cuckoo hashing (Q2423841) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters (Q2513673) (← links)
- Pseudorandom sources for BPP (Q2641105) (← links)
- Advice lower bounds for the dense model theorem (Q2828224) (← links)
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← links)
- A New Pseudorandom Generator from Collision-Resistant Hash Functions (Q2890004) (← links)
- Monotone circuits: one-way functions versus pseudorandom generators (Q2913810) (← links)
- A Remark on One-Wayness versus Pseudorandomness (Q2914351) (← links)
- Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions (Q2945374) (← links)
- On the Security of the Winternitz One-Time Signature Scheme (Q3011927) (← links)
