Multi-source non-malleable extractors and applications

DOI10.1007/978-3-030-77886-6_16MaRDI QIDQ2056748zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

network extractor protocolsoverlapping joint tampering model

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(11)

• On the round complexity of black-box secure MPC
• Improved computational extractors and their applications
• scientific article; zbMATH DE number 1543340 (Why is no real title available?)
• scientific article; zbMATH DE number 6789272 (Why is no real title available?)
• Non-malleable extractors: new tools and improved constructions
• Extractors: low entropy requirements colliding with non-malleability
• Round-optimal black-box MPC in the plain model
• Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy
• Analysis of information reconciliation algorithms with randomness extractors in quantum key distribution post-processing
• Split-state non-malleable codes and secret sharing schemes for quantum messages
• On split-state quantum tamper detection

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)