Pages that link to "Item:Q430823"
From MaRDI portal
The following pages link to More on average case vs approximation complexity (Q430823):
Displaying 15 items.
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Homomorphic Evaluation Requires Depth (Q2796133) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
- An iterative correction method for practically LPN solving (Q6576954) (← links)
- Immunizing backdoored PRGs (Q6582215) (← links)
