for the ALICE TPC Collaboration. Received (received date) Revised (revised date) Using a test TPC, consisting of the ALICE TPC field cage prototype in combination with the final ALICE TPC readout and electronics, the energy loss distribution and resolution were measured for identified protons. The measurements were compared to theoretical calculations and good quantitative agreement was found w...

Bob died suddenly leaving his treasure to sister Alice. Eve will do anything to get it, so Alice hides the treasure together with Nipper, and promptly departs. Nipper is a low-cost RFID device that responds only to Alice’s calls— making it possible for Alice to locate the hidden treasure later (she is quite forgetful) when Eve is not around. We study the design of Nipper, the cryptographic mech...

Alice wants to communicate securely to Bob in the presence of an eavesdropper Eve. There are two resources available to facilitate this. First, Alice, Bob (and Eve) have access to dependent source observations. Secondly, there is a noisy broadcast channel from Alice to Bob and Eve. Under this general source and channel setup, we are interested in three classes of problems. First, what is the se...

A bit-commitment protocol involves two party: a sender (say Alice) and a receiver (say Bob). Alice has a classical string in mind, which she wants to communicate to Bob at a later time. In order to guarantee that she will not change her mind in the interim, Alice agrees to lock her commitment in a safe which she sends to Bob, but keeps the key of the safe. At the moment of truth, Alice unveils ...

This paper presents a price-searching model in which a source node (Alice) seeks friendly jammers that prevent eavesdroppers (Eves) from snooping legitimate communications by generating interference or noise. Unlike existing models, the distributed jammers also have data to send to their respective destinations and are allowed to access Alice's channel if it can transmit sufficient jamming powe...

Quantum resources can be more powerful than classical resources-a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two parties' inputs can be done with exponentially less communication with quantum messages than with classical ones. Here we consider a task between two players, Alice and Bob where quantum resources are infini...

Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum oblivious transfer protocols under a natural and demanding definition of what it means for Alice to cheat. Our lower bound is a smooth tradeoff between the probabil...

As AI continues to advance, human-AI teams are inevitable. However, progress in AI is routinely measured in isolation, without a human in the loop. It is crucial to benchmark progress in AI, not just in isolation, but also in terms of how it translates to helping humans perform certain tasks, i.e., the performance of human-AI teams. In this work, we design a cooperative game – GuessWhich – to m...

Identity-based decryption is an alternative to identity-based encryption, in which Alice encrypts a symmetric key for Bob under a trusted authority’s public key. Alice sends Bob the resulting ciphertext, which Bob can send to the trusted authority. The trusted authority provides Bob the symmetric key only upon verifying Bob’s identity. 1 Identity-Based Encryption Shamir introduced [7] the notio...