Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Theory of Cryptography Conference

• Publication date

  2017-11-12

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-70503-3_8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Non-Malleable Codes

  2017cited by this paper
• Private Circuits III: Hardware Trojan-Resilience via Testing Amplification

  2016cited by this paper
• Block-wise Non-Malleable Codes

  2016cited by this paper
• Towards the Science of Security and Privacy in Machine Learning

  2016cited by this paper
• Auror: defending against poisoning attacks in collaborative deep learning systems

  2016cited by this paper
• Privacy with Imperfect Randomness

  2015cited by this paper
• Adaptively Secure Coin-Flipping, Revisited

  2015cited by this paper
• Is Feature Selection Secure against Training Data Poisoning?

  2015cited by this paper
• Recommendations for Randomness in the Operating System, or How to Keep Evil Children out of Your Pool and Other Random Facts

  2015cited by this paper
• On the Impossibility of Cryptography with Tamperable Randomness

  2014cited by this paper
• Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources

  2014influential reference
• Coin flipping of any constant bias implies one-way functions

  2014cited by this paper
• Security of Symmetric Encryption against Mass Surveillance

  2014cited by this paper
• Tamper Resilient Cryptography Without Self-Destruct

  2013cited by this paper
• The power of localization for efficiently learning linear separators with noise

  2013cited by this paper
• Tamper Resilient Circuits: The Adversary at the Gates

  2013cited by this paper
• Security analysis of pseudo-random number generators with input: /dev/random is not robust

  2013cited by this paper
• Poisoning Attacks against Support Vector Machines

  2012cited by this paper
• Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices

  2012cited by this paper
• Coin Flipping with Constant Bias Implies One-Way Functions

  2011cited by this paper
• On the Black-Box Complexity of Optimally-Fair Coin Tossing

  2011cited by this paper
• On the Computational Complexity of Coin Flipping

  2010cited by this paper
• The security of machine learning

  2010cited by this paper
• Boosting and Differential Privacy

  2010influential reference
• Stealthy poisoning attacks on PCA-based anomaly detectors

  2009cited by this paper
• ANTIDOTE: understanding and defending against poisoning of anomaly detectors

  2009cited by this paper
• Can machine learning be secure?

  2006cited by this paper
• Analysis of the Linux random number generator

  2006cited by this paper
• A model and architecture for pseudo-random generation with applications to /dev/random

  2005cited by this paper
• On the (im)possibility of cryptography with imperfect randomness

  2004influential reference
• Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering

  2004cited by this paper
• Recent Developments in Explicit Constructions of Extractors

  2002cited by this paper
• New Imperfect Random Source with Applications to Coin-Flipping

  2001influential reference
• PAC learning with nasty noise

  1999influential reference
• On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract)

  1997cited by this paper
• Learning in the presence of malicious errors

  1993influential reference
• Biased random walks

  1992cited by this paper
• Some extremal problems arising from discrete control processes

  1989cited by this paper
• Generating Quasi-random Sequences from Semi-random Sources

  1986influential reference
• Limits on the security of coin flips when half the processors are faulty

  1986cited by this paper
• Learning Disjunction of Conjunctions

  1985influential reference
• Unbiased bits from sources of weak randomness and probabilistic communication complexity

  1985cited by this paper
• A theory of the learnable

  1984cited by this paper

• Agnostic Learning under Targeted Poisoning: Optimal Rates and the Role of Randomness

  2025cites this paper
• PINE: Efficient Verification of a Euclidean Norm Bound of a Secret-Shared Vector

  2024cites this paper
• Threats to Training: A Survey of Poisoning Attacks and Defenses on Machine Learning Systems

  2022cites this paper
• On Optimal Learning Under Targeted Data Poisoning

  2022influential citation
• Robust learning under clean-label attack

  2021cites this paper
• Polynomial-Time Targeted Attacks on Coin Tossing for Any Number of Corruptions

  2021cites this paper
• Learning and Certification under Instance-targeted Poisoning

  2021cites this paper
• Property Inference from Poisoning

  2021cites this paper
• A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip

  2020influential citation
• Obliviousness Makes Poisoning Adversaries Weaker

  2020cites this paper
• On Robustness of the Normalized Subgradient Method with Randomly Corrupted Subgradients

  2020cites this paper
• Data Security for Machine Learning: Data Poisoning, Backdoor Attacks, and Defenses

  2020cites this paper
• Dataset Security for Machine Learning: Data Poisoning, Backdoor Attacks, and Defenses

  2020influential citation
• On the Power of Oblivious Poisoning Attacks

  2020cites this paper
• A Separation Result Between Data-oblivious and Data-aware Poisoning Attacks

  2020cites this paper
• Exploring the Landscape of Backdoor Attacks on Deep Neural Network Models

  2019cites this paper
• Ju l 2 01 9 Computational Concentration of Measure : Optimal Bounds , Reductions , and More Omid

  2019cites this paper
• Learning under p-tampering poisoning attacks

  2019cites this paper
• Label-Consistent Backdoor Attacks

  2019cites this paper
• A Complexity Theoretic Approach to Adversarial Machine Learning

  2019cites this paper
• Computational Concentration of Measure: Optimal Bounds, Reductions, and More

  2019cites this paper
• The Curse of Concentration in Robust Learning: Evasion and Poisoning Attacks from Concentration of Measure

  2018influential citation
• Can Adversarially Robust Learning Leverage Computational Hardness?

  2018cites this paper
• Learning under p-Tampering Attacks

  2018influential citation
• Multi-party Poisoning through Generalized p-Tampering

  2018influential citation
• Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources

  2018cites this paper
• Poison Frogs! Targeted Clean-Label Poisoning Attacks on Neural Networks

  2018cites this paper
• Universal Multi-Party Poisoning Attacks

  2018influential citation
• On the Impossibility of Cryptography with Tamperable Randomness

  2014cites this paper