Multi-source non-malleable extractors and applications

DOI10.1007/978-3-030-77886-6_16zbMATH Open1479.94322OpenAlexW3171398872MaRDI QIDQ2056748FDOQ2056748

Authors: Vipul Goyal, Akshayaram Srinivasan, Chenzhi Zhu 

Publication date: 8 December 2021

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

Recommendations

• Nonmalleable extractors and codes, with their many tampered extensions
• Non-malleable extractors and codes, with their many tampered extensions
• Improved non-malleable extractors, non-malleable codes and independent source extractors
• Non-malleable extractors: new tools and improved constructions
• Nonmalleable extractors with short seeds and applications to privacy amplification

zbMATH Keywords

network extractor protocolsoverlapping joint tampering model

Mathematics Subject Classification ID

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

Cites Work

• Non-malleable codes
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Capacity of non-malleable codes
• Extractors with weak random seeds
• Non-malleable extractors and codes, with their many tampered extensions
• Non-malleable secret sharing for general access structures
• 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
• Non-malleable secret sharing
• Title not available (Why is that?)
• Improved non-malleable extractors, non-malleable codes and independent source extractors
• Textbook non-malleable commitments
• 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
• New independent source extractors with exponential improvement
• An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
• Low error efficient computational extractors in the CRS model
• Correlated-source extractors and cryptography with correlated-random tapes
• Extractors for adversarial sources via extremal hypergraphs
• Explicit two-source extractors and resilient functions
• Distributed Computing

Cited In (7)

• Title not available (Why is that?)
• Non-malleable extractors: new tools and improved constructions
• Extractors: low entropy requirements colliding with non-malleability
• On the round complexity of black-box secure MPC
• Improved computational extractors and their applications
• Round-optimal black-box MPC in the plain model
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056748)