I am a PhD candidate and computer security researcher at Stanford University, advised by Dan Boneh. My research interests include Computers Security and Systems, Mobile Security and Privacy, Applied Cryptography and Network and Web Security and Privacy. Previously, I worked in industry as a development team leader, independent contractor, and software engineer, mostly in the fields of networks, embedded software and security. My work has been covered by BBC, Wired, Engadget, KQED and other media outlets.
PhD candidate in Electrical Eng., 2017
MS in Electrical Eng., 2014
BSc in Electrical Eng., 2010
Technion Institute of Technology
Fri, Oct 7, 2016, In MobiCom 2016 In BlackHat Asia ‘17
Fri, Jan 1, 2016, CyberTech 2016
Fri, Jan 1, 2016, Hebrew University Systems Seminar
Sat, Aug 1, 2015,
In USENIX Security ‘15
Stanford Annual Security Workshop 2015
Bay Area Security Research Summit 2015
Sun, Feb 1, 2015, RSA Conference US 2015
Fri, Aug 1, 2014,
In USENIX Security ‘14
Black Hat EU 2014
The Faust compiler and the toolset provided along with it enable generating standalone synthesizers and plug-ins for various architectures. We noticed that while being a very useful tool for sound synthesis its VSTi plug-ins lack several critical features for practical usage in combination with music production software and digital audio workstations (DAW). We focus on the VST architecture as one that has been used traditionally and is supported by many tools and add several important features: polyphony, note history and pitch-bend support.
One of the challenges of real-time, performance critical multi-core systems is the efficient scheduling of executed tasks. The scheduling problem consists of assigning the tasks to the different cores and deciding upon the order of execution. A special case is heterogeneous multi-core platforms where the cost of execution varies among the different processors. In this paper we present static and dynamic scheduling approaches, discuss their pros and cons and demonstrate a dynamic deadline-oriented scheduling algorithm with a low processing footprint. We apply the two approaches to the OpenRadio real-time Wi-Fi platform operating at high rates and demonstrate obtaining of feasible schedules. Using our scheduling algorithm we examine implications of hardware parameters on wi-fi processing feasibility. We also propose several possible improvements to the dynamic scheduling algorithm.
We present a classical analysis of a mechanical oscillator subject to the radiation pressure force due to light circulating inside a driven optical cavity. Our analysis is related to the problem of cooling an optomechanical setup to degrees near the ground state of mechanical motion according to quantum theory. Achieving this could provide an insight into quantum phenomena occurring in macro-scale setups. Dynamical backaction based on optical radiation pressure could be employed to reduce thermally excited fluctuations. We review the motion equations system and its steady state solution. We also show numerical simulation results, demonstrating different motion modes of such optomechanical setup.