• Publications
  • Influence
Semantics of programming languages - structures and techniques
Semantics of Programming Languages exposes the basic motivations and philosophy underlying the applications of semantic techniques in computer science. It introduces the mathematical theory ofExpand
CommanderSong: A Systematic Approach for Practical Adversarial Voice Recognition
Novel techniques are developed that address a key technical challenge: integrating the commands into a song in a way that can be effectively recognized by ASR through the air, in the presence of background noise, while not being detected by a human listener. Expand
A Reference Model for Requirements and Specifications
A new form of refinement is introduced, which is pivotal to defining the desired soundness and consistency properties precisely and represents it in higher-order logic and some of its key mathematical ramifications are determined. Expand
Dynamic Searchable Encryption via Blind Storage
A new dynamic SSE scheme is presented that is simpler and more efficient than existing schemes while revealing less information to the server than prior schemes, achieving fully adaptive security against honest-but-curious servers. Expand
Semantic Domains
  • Carl A. Gunter, D. Scott
  • Computer Science, Mathematics
  • Handbook of Theoretical Computer Science, Volume…
  • 2 January 1991
Publisher Summary This chapter discusses the foundations of semantic domains in an elementary way. It describes a simple class of ordered structures and discusses the idea of fixed points ofExpand
PLAN: a packet language for active networks
This paper has successfully applied the PLAN programming environment to implement an IP-free internetwork and provides a guarantee that PLAN programs use a bounded amount of network resources. Expand
Leaky Cauldron on the Dark Land: Understanding Memory Side-Channel Hazards in SGX
The research identifies 8 potential attack vectors of Intel SGX, and highlights the common misunderstandings about SGX memory side channels, demonstrating that high frequent AEXs can be avoided when recovering EdDSA secret key through a new page channel and fine-grained monitoring of enclave programs can be done through combining both cache and cross-enclave DRAM channels. Expand
Formal verification of standards for distance vector routing protocols
This work shows how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols, and develops verification techniques suited to routing protocols generally. Expand
Privacy APIs: access control techniques to analyze and verify legal privacy policies
This paper describes techniques to formalize regulatory privacy rules and how to exploit this formalization to analyze the rules automatically and validate the usefulness of the formalism by using the SPIN model checker to verify properties that distinguish the two versions of HIPAA. Expand
Property Inference Attacks on Fully Connected Neural Networks using Permutation Invariant Representations
This paper develops techniques that reduce the complexity of the inference of global properties of the training data, such as the environment in which the data was produced, or the fraction of the data that comes from a certain class, as applied to white-box Fully Connected Neural Networks (FCNNs). Expand