scispace - formally typeset
S

Shweta Shinde

Researcher at University of California, Berkeley

Publications -  30
Citations -  1531

Shweta Shinde is an academic researcher from University of California, Berkeley. The author has contributed to research in topics: Trusted Computing & POSIX. The author has an hindex of 14, co-authored 30 publications receiving 1057 citations. Previous affiliations of Shweta Shinde include ETH Zurich & National University of Singapore.

Papers
More filters
Proceedings ArticleDOI

Data-Oriented Programming: On the Expressiveness of Non-control Data Attacks

TL;DR: This paper builds 3 end-to-end attacks to bypass randomization defenses without leaking addresses, to run a network bot which takes commands from the attacker, and to alter the memory permissions, demonstrating how the expressiveness offered by DOP significantly empowers the attacker.
Proceedings ArticleDOI

Keystone: an open framework for architecting trusted execution environments

TL;DR: Keystone is presented---the first open-source framework for building customized TEEs, which builds reusable TEE core primitives from these abstractions while allowing platform-specific modifications and flexible feature choices.
Proceedings ArticleDOI

Panoply: Low-TCB Linux Applications With SGX Enclaves.

TL;DR: A new system called PANOPLY is presented which bridges the gap between the SGX-native abstractions and the standard OS abstractions which feature-rich, commodity Linux applications require and enables much stronger security in 4 real-world applications — including Tor, OpenSSL, and web services — which can base security on hardware-root of trust.
Proceedings ArticleDOI

Preventing Page Faults from Telling Your Secrets

TL;DR: This paper shows that the page fault side-channel has sufficient channel capacity to extract bits of encryption keys from commodity implementations of cryptographic routines in OpenSSL and Libgcrypt -- leaking 27% on average and up to 100% of the secret bits in many case-studies.
Proceedings ArticleDOI

A model counter for constraints over unbounded strings

TL;DR: This work presents a new approach to model counting for structured data types, specifically strings, that can model count for constraints specified in an expressive string language efficiently and precisely, thereby outperforming previous finite-size analysis tools.