Pages that link to "Item:Q1028993"

The following pages link to Almost \(k\)-wise independence versus \(k\)-wise independence (Q1028993):

Displaying 19 items.

• Revisiting iterated attacks in the context of decorrelation theory (Q458736) (← links)
• On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices (Q857982) (← links)
• On the relationship between \(\varepsilon\)-biased random variables and \(\varepsilon\)-dependent random variables (Q1328759) (← links)
• Randomized OBDD-based graph algorithms (Q1625606) (← links)
• An extension of Kemperman's characterization on \(k\)-independence and its application (Q1645172) (← links)
• Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← links)
• Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
• Robust characterizations of \(k\)-wise independence over product spaces and related testing results (Q2856576) (← links)
• Simulating (log ^c <i>n</i> )-wise independence in NC (Q4302863) (← links)
• (Q4416890) (← links)
• Bounded independence vs. moduli (Q4636457) (← links)
• Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
• (Q5092448) (← links)
• The maximal probability that <i>k</i>‐wise independent bits are all 1 (Q5198667) (← links)
• (Q5875499) (← links)
• Almost \(k\)-wise independent sample spaces and their cryptologic applications (Q5950639) (← links)
• Deterministic Massively Parallel Connectivity (Q6069413) (← links)