Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2021
Automated discovery of adaptive attacks on adversarial defenses
NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing SystemsArticle No.: 2057, Pages 26858–26870Reliable evaluation of adversarial defenses is a challenging task, currently limited to an expert who manually crafts attacks that exploit the defenses inner workings or approaches based on an ensemble of fixed attacks, none of which may be effective for ...
- research-articleNovember 2021
Learning to Explore Paths for Symbolic Execution
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications SecurityPages 2526–2540https://doi.org/10.1145/3460120.3484813Symbolic execution is a powerful technique that can generate tests steering program execution into desired paths. However, the scalability of symbolic execution is often limited by path explosion, i.e., the number of symbolic states representing the ...
- research-articleJuly 2020
Probabilistic Verification of Network Configurations
SIGCOMM '20: Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communicationPages 750–764https://doi.org/10.1145/3387514.3405900Not all important network properties need to be enforced all the time. Often, what matters instead is the fraction of time / probability these properties hold. Computing the probability of a property in a network relying on complex inter-dependent ...
- research-articleNovember 2019
Learning to Fuzz from Symbolic Execution with Application to Smart Contracts
CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications SecurityPages 531–548https://doi.org/10.1145/3319535.3363230Fuzzing and symbolic execution are two complementary techniques for discovering software vulnerabilities. Fuzzing is fast and scalable, but can be ineffective when it fails to randomly select the right inputs. Symbolic execution is thorough but slow and ...
- research-articleNovember 2019
zkay: Specifying and Enforcing Data Privacy in Smart Contracts
CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications SecurityPages 1759–1776https://doi.org/10.1145/3319535.3363222Privacy concerns of smart contracts are a major roadblock preventing their wider adoption. A promising approach to protect private data is hiding it with cryptographic primitives and then enforcing correctness of state updates by Non-Interactive Zero-...
-
- ArticleNovember 2018
Security Analysis of Smart Contracts in Datalog
Leveraging Applications of Formal Methods, Verification and Validation. Industrial PracticePages 316–322https://doi.org/10.1007/978-3-030-03427-6_24AbstractSmart contracts enable mutually untrusted entities to interact without relying on trusted third parties. Despite their potential, repeated security concerns have shaken the trust in handling billions of USD by smart contracts. To address this ...
- research-articleOctober 2018
Debin: Predicting Debug Information in Stripped Binaries
CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications SecurityPages 1667–1680https://doi.org/10.1145/3243734.3243866We present a novel approach for predicting debug information in stripped binaries. Using machine learning, we first train probabilistic models on thousands of non-stripped binaries and then use these models to predict properties of meaningful elements ...
- research-articleOctober 2018
DP-Finder: Finding Differential Privacy Violations by Sampling and Optimization
CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications SecurityPages 508–524https://doi.org/10.1145/3243734.3243863We present DP-Finder, a novel approach and system that automatically derives lower bounds on the differential privacy enforced by algorithms. Lower bounds are practically useful as they can show tightness of existing upper bounds or even identify ...
- research-articleOctober 2018
Securify: Practical Security Analysis of Smart Contracts
CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications SecurityPages 67–82https://doi.org/10.1145/3243734.3243780Permissionless blockchains allow the execution of arbitrary programs (called smart contracts), enabling mutually untrusted entities to interact without relying on trusted third parties. Despite their potential, repeated security concerns have shaken the ...
- ArticleAugust 2018
NetHide: secure and practical network topology obfuscation
Simple path tracing tools such as traceroute allow malicious users to infer network topologies remotely and use that knowledge to craft advanced denial-of-service (DoS) attacks such as Link-Flooding Attacks (LFAs). Yet, despite the risk, most network ...
- research-articleJune 2018
Inferring crypto API rules from code changes
PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 450–464https://doi.org/10.1145/3192366.3192403Creating and maintaining an up-to-date set of security rules that match misuses of crypto APIs is challenging, as crypto APIs constantly evolve over time with new cryptographic primitives and settings, making existing ones obsolete.
To address this ...
Also Published in:
ACM SIGPLAN Notices: Volume 53 Issue 4 Bayonet: probabilistic inference for networks
PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 586–602https://doi.org/10.1145/3192366.3192400Network operators often need to ensure that important probabilistic properties are met, such as that the probability of network congestion is below a certain threshold. Ensuring such properties is challenging and requires both a suitable language for ...
Also Published in:
ACM SIGPLAN Notices: Volume 53 Issue 4- ArticleApril 2018
Netcomplete: practical network-wide configuration synthesis with autocompletion
NSDI'18: Proceedings of the 15th USENIX Conference on Networked Systems Design and ImplementationPages 579–594Network operators often need to adapt the configuration of a network in order to comply with changing routing policies. Evolving existing configurations, however, is a complex task as local changes can have unforeseen global effects. Not surprisingly, ...
- research-articleOctober 2017
Synthesis of Probabilistic Privacy Enforcement
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications SecurityPages 391–408https://doi.org/10.1145/3133956.3134079Existing probabilistic privacy enforcement approaches permit the execution of a program that processes sensitive data only if the information it leaks is within the bounds specified by a given policy. Thus, to extract any information, users must manually ...
- research-articleJuly 2017
Test execution checkpointing for web applications
ISSTA 2017: Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and AnalysisPages 203–214https://doi.org/10.1145/3092703.3092710Test isolation is a prerequisite for the correct execution of test suites on web applications. We present Test Execution Checkpointing, a method for efficient test isolation. Our method instruments web applications to support checkpointing and exploits ...
- research-articleMarch 2017
Force Open
Digital Investigation: The International Journal of Digital Forensics & Incident Response (DIGITI), Volume 20, Issue SPages S75–S82https://doi.org/10.1016/j.diin.2017.01.009We present a novel approach for automatic repair of corrupted files that applies to any common file format and does not require knowledge of its structure. Our lightweight approach modifies the execution of a file viewer instead of the file data and ...
- research-articleDecember 2016
FASE: functionality-aware security enforcement
ACSAC '16: Proceedings of the 32nd Annual Conference on Computer Security ApplicationsPages 471–483https://doi.org/10.1145/2991079.2991116Dynamic information-flow enforcement systems automatically protect applications against confidentiality and integrity threats. Unfortunately, existing solutions cause undesirable side effects, if not crashes, due to unconstrained modification of run-...
- research-articleOctober 2016
Statistical Deobfuscation of Android Applications
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications SecurityPages 343–355https://doi.org/10.1145/2976749.2978422This work presents a new approach for deobfuscating Android APKs based on probabilistic learning of large code bases (termed "Big Code"). The key idea is to learn a probabilistic model over thousands of non-obfuscated Android applications and to use ...
- research-articleNovember 2014
Fail-Secure Access Control
CCS '14: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications SecurityPages 1157–1168https://doi.org/10.1145/2660267.2660307Decentralized and distributed access control systems are subject to communication and component failures. These can affect access decisions in surprising and unintended ways, resulting in insecure systems. Existing analysis frameworks however ignore the ...
- research-articleJuly 2013
Semi-valid input coverage for fuzz testing
ISSTA 2013: Proceedings of the 2013 International Symposium on Software Testing and AnalysisPages 56–66https://doi.org/10.1145/2483760.2483787We define semi-valid input coverage (SVCov), the first coverage criterion for fuzz testing. Our criterion is applicable whenever the valid inputs can be defined by a finite set of constraints. SVCov measures to what extent the tests cover the domain of ...