- Publications
- 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.
- Unpublished
- Poorvi Vora. Towards a theory of variable privacy.
Presentation
- Selected Invited Presentations
- Cryptanalysis
- 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
- Privacy
- 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
|