Arvind Narayanan | Princeton University (original) (raw)

Uploads

Papers by Arvind Narayanan

Abstract: While the Internet was conceived as a decentralized network, the most widely used web a... more Abstract: While the Internet was conceived as a decentralized network, the most widely used web applications today tend toward centralization. Control increasingly rests with centralized service providers who, as a consequence, have also amassed unprecedented amounts of data about the behaviors and personalities of individuals.

The ease of large-scale data collection. Before the growth of the Internet, collection of data fr... more The ease of large-scale data collection. Before the growth of the Internet, collection of data from individuals on a national or global scale was feasible only for governments and very large corporations. The infrastructure required for collecting and aggregating data was either in the form of a door-to-door survey as in a census, or a pervasive physical presence, such as a large supermarket chain collecting data on people's shopping habits.

Secret sharing is a very important primitive in cryptography and distributed computing. In this w... more Secret sharing is a very important primitive in cryptography and distributed computing. In this work, we consider computational secret sharing (CSS) which provably allows a smaller share size (and hence greater efficiency) than its information-theoretic counterparts. Extant CSS schemes result in succinct share-size and are in a few cases, like threshold access structures, optimal.

Abstract We study the problem of circuit obfuscation, ie, transforming the circuit in a way that ... more Abstract We study the problem of circuit obfuscation, ie, transforming the circuit in a way that hides everything except its input-output behavior. Barak et al. showed that a universal obfuscator that obfuscates every circuit class cannot exist, leaving open the possibility of special-purpose obfuscators.

Abstract We study techniques for identifying an anonymous author via linguistic stylometry, ie, c... more Abstract We study techniques for identifying an anonymous author via linguistic stylometry, ie, comparing the writing style against a corpus of texts of known authorship. We experimentally demonstrate the effectiveness of our techniques with as many as 100,000 candidate authors. Given the increasing availability of writing samples online, our result has serious implications for anonymity and free speech-an anonymous blogger or whistleblower may be unmasked unless they take steps to obfuscate their writing style.

We propose an efficient and robust Pay TV scheme for the case when there are a number of streams,... more We propose an efficient and robust Pay TV scheme for the case when there are a number of streams, as opposed to just one. In our model, the broadcast is divided into billing periods; during each billing period the entitlement of the users does not change. We achieve full flexibility with only a constant factor data redundancy. Our scheme has very little secure memory requirements and does not require the users' secure keys to be changed once they have been written into the secure memory.

Abstract We study privacy-preserving tests for proximity: Alice can test if she is close to Bob w... more Abstract We study privacy-preserving tests for proximity: Alice can test if she is close to Bob without either party revealing any other information about their location. We describe several secure protocols that support private proximity testing at various levels of granularity. We study the use of “location tags” generated from the physical environment in order to strengthen the security of proximity testing. We implemented our system on the Android platform and report on its effectiveness.

In the perfectly secure message transmission (PSMT) problem, two synchronized non-faulty players ... more In the perfectly secure message transmission (PSMT) problem, two synchronized non-faulty players (or processors), the Sender S and the Receiver R are connected by n wires (each of which facilitates 2-way communication); S has an ℓ-bit message that he wishes to send to R; after exchanging messages in phasesA phase is a send from S to R or from R\ bf R to S\ bf S or both simultaneously.