Multi-source non-malleable extractors and applications

DOI10.1007/978-3-030-77886-6_16zbMath1479.94322OpenAlexW3171398872MaRDI QIDQ2056748

Chenzhi Zhu, Vipul Goyal, Akshayaram Srinivasan

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_16

zbMATH Keywords

network extractor protocolsoverlapping joint tampering model

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

On the round complexity of black-box secure MPC ⋮ Improved computational extractors and their applications ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Round-optimal black-box MPC in the plain model

Cites Work

• Unnamed Item
• Non-malleable secret sharing for general access structures
• Low error efficient computational extractors in the CRS model
• Correlated-source extractors and cryptography with correlated-random tapes
• Revisiting non-malleable secret sharing
• Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate
• Leakage resilient secret sharing and applications
• Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
• Capacity of non-malleable codes
• Extractors with weak random seeds
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Non-Malleable Codes
• Improved non-malleable extractors, non-malleable codes and independent source extractors
• An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
• Extractors for adversarial sources via extremal hypergraphs
• 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
• Non-malleable secret sharing
• Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
• Non-malleable extractors and codes, with their many tampered extensions
• Explicit two-source extractors and resilient functions
• Textbook non-malleable commitments
• Distributed Computing
• New independent source extractors with exponential improvement
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: Multi-source non-malleable extractors and applications