All of these publications are also listed as part of my research elsewhere on my website: voting [1,4,5], cryptanalysis [3,8] and privacy [2,6,7,9,10,16-20] research. Similarly with the invited presentations.
My formal training in communication theory motivates me to use information theory to understand security challenges.
My first attempt to do so was in research on inference attacks in database privacy, where I observed that data perturbation had the effect of a noisy channel, and hence that attacks would behave as error-correction codes . This observation enabled the application of classical information-theoretic results to upper bound the complexity of an attack in number of queries per bit of entropy [1,6]. While this work also shows that it is possible to determine protected data values to any desired accuracy with a constant cost per bit, and is hence an impossibility result wrt data protection, I prefer to view it as a calibration of the cost of an attack, and hence a measure of the privacy of the data perturbation scheme. This view of privacy led to a proposal on "variable privacy" [10,19,20].
The above approach can also be used to understand all cryptanalysis as channel communication, and attacks as efficient channel codes [3,8,11-15]. The cryptanalysis work is joint with thesis masters' student Darakhshan Mir (now a doctoral student at Rutgers).
With Coney, Hall and Wagner, I proposed a privacy measure for information leakage in voting systems . My doctoral student Ben Hosp has extended the use of entropy-related measures to measure the verifiability of voting systems, and applied his model to several voting system proposals [1,4,16].
- Ben Hosp and Poorvi L. Vora. An Information-Theoretic Model of Voting Systems. Mathematical and Computer Modelling. Special issue on: Mathematical Modeling of Voting Systems and Elections: Theory and Applications. Vol. 48, nos.9-10, pp. 1628-1645, Nov 2008.
- Poorvi L. Vora. An Information-Theoretic Approach to Inference Attacks on
Random Data Perturbation and a Related Privacy Measure. IEEE Trans. Info Theory, Vol. 53, No. 8, pp 2971-2977, August 2007.
- Poorvi L. Vora, Darakhshan Mir. Related-Key Linear Cryptanalysis. ISIT06.
- Ben Hosp, Poorvi L. Vora. "An Information-Theoretic Model of Voting Systems".
- Lillie Coney, Joseph L. Hall, Poorvi L. Vora, David Wagner.
Towards a Privacy Measurement Criterion for Voting Systems.
National Conference on Digital Government Research, Atlanta, May 2005.
- Poorvi Vora. Information Theory and the Security of Binary
Data Perturbation. pp 136-147, INDOCRYPT 2004.
Power Point Presentation.
- Poorvi Vora. The channel coding theorem and the security of
binary randomization, ISIT, pp.
306, 2003. (extended abstract)
- Technical Reports
- Darakhshan J. Mir and Poorvi L. Vora. Related-Key Statistical Cryptanalysis. Also available as Report 2007/227 in the cryptology eprint archive.
- Patents Granted
- "Probabilistic Privacy Protection", (with U. Vazirani and V. Knapp). US
6470299. Filed November 2, 2000. Issued October 22, 2002.
- Poorvi Vora. Towards a theory of variable privacy.
- Selected Invited Presentations
- Georgia Tech., April 2008
- Indian Institute of Sciences, Bangalore, India, December 2006
- Information Theory Seminar, University of Maryland, College Park, April 2006
- Hewlett-Packard Laboratories, Princeton, February 2006
- IBM Research, Hawthorne, February, 2006
- TAMI/PORTIA Workshop, MIT, 2006
- DIMACS/Portia Workshop on Privacy in Data Mining, Rutgers University, March 2004
- Security Group Seminar, Dept. of Computer Science, Stanford University, October 2002
- Microsoft Research, Silicon Valley, September 2002
- Microsoft Research, Redmond, September 2002
- Information Systems Seminar, Princeton University, March 2010