Pages that link to "Item:Q4978054"

The following pages link to Improved non-malleable extractors, non-malleable codes and independent source extractors (Q4978054):

Displaying 35 items.

• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
• Low error efficient computational extractors in the CRS model (Q2055616) (← links)
• Multi-source non-malleable extractors and applications (Q2056748) (← links)
• Non-malleability against polynomial tampering (Q2102059) (← links)
• Non-malleable secret sharing against bounded joint-tampering attacks in the plain model (Q2102060) (← links)
• Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
• Improved computational extractors and their applications (Q2129010) (← links)
• Practical continuously non-malleable randomness encoders in the random oracle model (Q2149829) (← links)
• Continuously non-malleable secret sharing for general access structures (Q2175937) (← links)
• Interactive non-malleable codes (Q2175939) (← links)
• Privacy amplification from non-malleable codes (Q2179398) (← links)
• Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← links)
• Distinct degrees and homogeneous sets (Q2680569) (← links)
• Distinct degrees in induced subgraphs (Q3298155) (← links)
• Non-malleable codes and extractors for small-depth circuits, and affine functions (Q4978056) (← links)
• Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs (Q4997309) (← links)
• (Q5009548) (← links)
• (Q5028366) (← links)
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
• (Q5091780) (← links)
• (Q5092448) (← links)
• (Q5121891) (← links)
• Nonmalleable Extractors and Codes, with Their Many Tampered Extensions (Q5129235) (← links)
• Non-malleable extractors: new tools and improved constructions (Q5368742) (← links)
• Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed (Q5757458) (← links)
• (Q5875499) (← links)
• Continuously non-malleable codes with split-state refresh (Q5915916) (← links)
• Four-state non-malleable codes with explicit constant rate (Q5918866) (← links)
• (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
• Continuously non-malleable codes against bounded-depth tampering (Q6175984) (← links)
• Non-malleable fuzzy extractors (Q6547975) (← links)
• Efficiently testable circuits without conductivity (Q6582213) (← links)
• Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)
• Complexity theory. Abstracts from the workshop held June 2--7, 2024 (Q6671624) (← links)