In this work, we consider a scenario where two multiple-aperture legitimate nodes (Alice and Bob) communicate by means of Free-Space Optical (FSO) communication in the presence of a multipleaperture eavesdropper (Eve), which is subject to pointing errors. Two different schemes are considered depending on the availability of channel state information (CSI) at Alice: i) the adaptive scheme, where...

Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to be sure that Bob cannot learn her input, the result of her calculation, or perhaps even the function she is trying to compute. We describe a simple, efficie...

Prediction markets provide a unique and compelling way to sell and aggregate information, yet a good understanding of optimal strategies for agents participating in such markets remains elusive. To model this complex setting, prior work proposes a three stages game called the Alice Bob Alice (A-B-A) game – Alice participates in the market first, then Bob joins, and then Alice has a chance to pa...

Consider the following problem: Alice wishes to maintain her email using a storage-provider Bob (such as a Yahoo! or hotmail e-mail account). This storage-provider should provide for Alice the ability to collect, retrieve, search and delete emails but, at the same time, should learn neither the content of messages sent from the senders to Alice (with Bob as an intermediary), nor the search crit...

The level of difficulty of the first programming course students face has increased considerably when the switch from C++ to Java was made. In an effort to decrease attrition rates and to recruit more students to computer science, the Computer Science Department at California Lutheran University introduced CS0, the pre CS1 course. With restructuring of CS0, the 3D animation software Alice was c...

We study oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the pattern in which she accesses her data, with high probability, using a method that achieves O(1) amortized rounds of communication between her and Bob for ea...