The following pages link to Cryptography in $NC^0$ (Q5757454):
Displaying 49 items.
- A dichotomy for local small-bias generators (Q315550) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Local expanders (Q1653336) (← links)
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
- Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
- Incremental deterministic public-key encryption (Q1747660) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
- On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back (Q2799090) (← links)
- On the One-Way Function Candidate Proposed by Goldreich (Q2828220) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Candidate One-Way Functions Based on Expander Graphs (Q3088178) (← links)
- A Candidate Counterexample to the Easy Cylinders Conjecture (Q3088184) (← links)
- A Framework with Randomized Encoding for a Fast Privacy Preserving Calculation of Non-linear Kernels for Machine Learning Applications in Precision Medicine (Q3297645) (← links)
- Statistical Randomized Encodings: A Complexity Theoretic View (Q3448769) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
- Interleaved Group Products (Q4634030) (← links)
- (Q4638056) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- (Q5009532) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- (Q5090982) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- Cryptography with Updates (Q5738983) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Fine-grained cryptography revisited (Q5918348) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5918800) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
- Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\) (Q6113103) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- On sequential functions and fine-grained cryptography (Q6652975) (← links)
- Robust additive randomized encodings from IO and pseudo-non-linear codes (Q6653025) (← links)
