Foteini Baldimtsi is an Assistant Professor in the Computer Science Department at George Mason University. She received her Ph.D. from Brown University in May 2014 and worked as a postdoctoral researcher in Boston University and University of Athens. Her research interests are in the areas of cryptography, security and data privacy with a special focus in electronic payments, Bitcoin and blockc...

Occlusions are one of the biggest obstacles to reliable tracking. While many existing algorithms perform well while the objects of interest are separated, they often swap object identities when multiple objects occlude one another. We focus on the problem of tracking multiple, nonrigid targets through severe occlusions. Our occlusion reasoning algorithm takes advantage of reliable separated obj...

Opaque predicates are a commonly used technique in program obfuscation, intended to add complexity to control flow and to insert dummy code or watermarks. We survey a number of methods to remove opaque predicates from obfuscated programs, hence defeating the intentions of the obfuscator. Our main contribution is an obfuscation technique that introduces opaque constant predicates that are provab...

AbstractPseudorandom quantum states (PRS) are efficiently constructible that computationally indistinguishable from being Haar-random, and have recently found cryptographic applications. We explore new definitions, properties applications of pseudorandom states, present the following contributions: 1. New Definitions: study variants function-like state (PRFS) generators, introduced by Ananth, Q...

Our aim in this paper is to show an example of the formalism we have developed to avoid the label-tensor-product-vector-space-formalism of quantum mechanics when dealing with indistinguishable quanta. States in this new vector space, that we call the Q-space, refer only to occupation numbers and permutation operators act as the identity operator on them, reflecting in the formalism the unobserv...

It is found that identical bosons (fermions) show a generalized bunching (antibunching) property in linear networks: the absolute maximum (minimum) of the probability that all N input particles are detected in a subset of K output modes of any nontrivial linear M-mode network is attained only by completely indistinguishable bosons (fermions). For fermions K is arbitrary; for bosons it is either...

This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, finitely supported multiset, finitely supported distribution, and measure functor, respectively. Expressivity means that logically indistinguishable states, satisfying the same formulas, are behaviourally indistinguishable. The...

The generation of coherent and indistinguishable single photons is a critical step for photonic quantum technologies in information processing and metrology. A promising system is the resonant optical excitation of solid-state emitters embedded in wavelength-scale three-dimensional cavities. However, the challenge here is to reject the unwanted excitation to a level below the quantum signal. We...

It is shown that generalized measurements, required for optimally discriminating between nonorthogonal joint polarization states of two indistinguishable photons, can be realized with the help of polarization-dependent twophoton absorption and by means of sum-frequency generation. Optimization schemes are investigated with respect to minimizing the error probability in inferring the states, as ...

Abstract: I show that there exists a class of inequalities between correlation functions of different orders of a chaotic electron field. These inequalities lead to the antibunching effect and are a consequence of the fact that electrons are fermions – indistinguishable particles with antisymmetric states. The derivation of the inequalities is based on the known form of the correlation function...