Privacy amplification and nonmalleable extractors via character sums

Keyphrases

• Active Adversary 40%
• Arbitrary Functions 20%
• Arithmetic Progressions 20%
• Asymptotically Optimal 20%
• Character Sums 100%
• Computational Power 20%
• Distribution of Prime numbers 20%
• Entropy Loss 20%
• Entropy Rate 100%
• Explicit Constructions 20%
• Extractor 60%
• Non-malleable 20%
• Non-malleable Extractors 100%
• Number of Bits 20%
• One-bit 20%
• Optimal Entropies 20%
• Polynomial Time 20%
• Privacy Amplification 100%
• Public Channel 20%
• Random Seed 20%
• Random Strings 20%
• Round numbers 20%
• Security Assurance 20%
• Strong Security 20%
• Two-input 20%
• Two-party 20%

Mathematics

• Arbitrary Function 50%
• Arithmetic Progression 50%
• Character Sum 100%
• Communicates 50%
• Distribution of Prime Numbers 50%
• Polynomial 100%
• Polynomial Time 50%
• Random String 50%
• Running Time 50%

Computer Science

• Arithmetic Progression 100%
• Computational Power 100%
• Polynomial Constant 100%
• Polynomial Time 100%