Bounds on restoration quality using a priori information. - H. Joel Trussell; Poorvi L. Vora (ICASSP, 1988)

On the accuracy of scanning colour images. - H. Joel Trussell; Poorvi L. Vora (ICASSP, 1992)

Design results for a set of thin film color-scanning filters. - Poorvi L. Vora; H. Joel Trussell; Lawrence S. Iwan (Device-Independent Color Imaging, 1995)

A set theoretic approach to image reconstruction from projections. - Bhaskar Bhumkar; Poorvi L. Vora; Bindu Chandna; K. Shankar (ICIP (2), 1996)

Image capture: synthesis of sensor responses from multispectral images. - Poorvi L. Vora; Michael Harville; Joyce E. Farrell; Jerome D. Tietz; David H. Brainard (Color Imaging: Device-Independent Color, Color Hard Copy, and Graphic Arts, 1997)

Mathematical methods for the design of color scanning filters. - Poorvi L. Vora; H. Joel Trussell (IEEE Trans. Image Process., 1997)

Mathematical methods for the analysis of color scanning filters. - Poorvi L. Vora; H. Joel Trussell (IEEE Trans. Image Process., 1997)

Trade-offs between Color Saturation and Noise Sensitivity in Image Sensors. - Poorvi L. Vora; Cormac Herley (ICIP (1), 1998)

Robust Watermarking Using Argument Modulation. - Poorvi L. Vora (PICS, 1999)

Distortion-bounded authentication techniques. - Nasir D. Memon; Poorvi L. Vora; Boon-Lock Yeo; Minerva M. Yeung (Security and Watermarking of Multimedia Contents, 2000)

Protocols for Watermark Verification. - K. Gopalakrishnan 001; Nasir D. Memon; Poorvi L. Vora (IEEE Multim., 2001)

Inner products and orthogonality in color recording filter design. - Poorvi L. Vora (IEEE Trans. Image Process., 2001)

Image capture: simulation of sensor responses from hyperspectral images. - Poorvi L. Vora; Joyce E. Farrell; Jerome D. Tietz; David H. Brainard (IEEE Trans. Image Process., 2001)

User Profiling with Privacy: A Framework for Adaptive Information Agents. - Ian Dickinson; Dave Reynolds; Dave Banks; Steve Cayzer; Poorvi L. Vora (AgentLink, 2003)

Detection and deterrence of counterfeiting of valuable documents. - Cormac Herley; Poorvi L. Vora; Shawn Yang (ICIP, 2004)

Information Theory and the Security of Binary Data Perturbation. - Poorvi L. Vora (INDOCRYPT, 2004)

Evaluation of voting systems. - Poorvi L. Vora; Ben Adida; Ren Bucholz; David Chaum; David L. Dill; David R. Jefferson; Douglas W. Jones; William Lattin; Aviel D. Rubin; Michael Ian Shamos; Moti Yung (Commun. ACM, 2004)

Towards a privacy measurement criterion for voting systems. - Lillie Coney; Joseph Lorenzo Hall; Poorvi L. Vora; David A. Wagner 001 (DG.O, 2005)

The privacy cost of the second-chance offer. - Sumit Joshi; Yuan Sun 015; Poorvi L. Vora (WPES, 2005)

David Chaum's Voter Verification using Encrypted Paper Receipts. - Poorvi L. Vora (IACR Cryptol. ePrint Arch., 2005)

A performance ratings framework for the evaluation of electronic voting systems: project highlights: exploratory research. - Poorvi L. Vora; Rahul Simha; Jonathan Stanton (DG.O, 2006)

Related-Key Linear Cryptanalysis. - Poorvi L. Vora; Darakhshan J. Mir (ISIT, 2006)

Randomization as a strategy for sellers during price discrimination, and impact on bidders' privacy. - Sumit Joshi; Yuan Sun 015; Poorvi L. Vora (WPES, 2006)

Secret Ballot Elections with Unconditional Integrity. - David Chaum; Jeroen van de Graaf; Peter Y. A. Ryan; Poorvi L. Vora (IACR Cryptol. ePrint Arch., 2007)

Related-Key Statistical Cryptanalysis. - Darakhshan J. Mir; Poorvi L. Vora (IACR Cryptol. ePrint Arch., 2007)

An Information-Theoretic Approach to Inference Attacks on Random Data Perturbation and a Related Privacy Measure. - Poorvi L. Vora (IEEE Trans. Inf. Theory, 2007)

Scantegrity: End-to-End Voter-Verifiable Optical-Scan Voting. - David Chaum; Aleksander Essex; Richard Carback; Jeremy Clark; Stefan Popoveniuc; Alan T. Sherman; Poorvi L. Vora (IEEE Secur. Priv., 2008)

An information-theoretic model of voting systems. - Benjamin Hosp; Poorvi L. Vora (Math. Comput. Model., 2008)

From eBay's second chance offer to B2B service pricing: Similarity and challenges. - Yuan Sun 015; Poorvi L. Vora (SOLI, 2009)

Accessible Voter-Verifiability. - David Chaum; Benjamin Hosp; Stefan Popoveniuc; Poorvi L. Vora (Cryptologia, 2009)

Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. - David Chaum; Richard Carback; Jeremy Clark; Aleksander Essex; Stefan Popoveniuc; Ronald L. Rivest; Peter Y. A. Ryan; Emily Shen; Alan T. Sherman; Poorvi L. Vora (IEEE Trans. Inf. Forensics Secur., 2009)

Guest editorial: special issue on electronic voting. - Ronald L. Rivest; David Chaum; Bart Preneel; Aviel D. Rubin; Donald G. Saari; Poorvi L. Vora (IEEE Trans. Inf. Forensics Secur., 2009)

Scantegrity Mock Election at Takoma Park. - Alan T. Sherman; Richard Carback; David Chaum; Jeremy Clark; Aleksander Essex; Paul S. Herrnson; Travis Mayberry; Stefan Popoveniuc; Ronald L. Rivest; Emily Shen; Bimal Sinha; Poorvi L. Vora (Electronic Voting, 2010)

Stamp-It: A Method for Enhancing the Universal Verifiability of E2E Voting Systems. - Mridul Nandi; Stefan Popoveniuc; Poorvi L. Vora (ICISS, 2010)

Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy. - Richard Carback; David Chaum; Jeremy Clark; John Conway; Aleksander Essex; Paul S. Herrnson; Travis Mayberry; Stefan Popoveniuc; Ronald L. Rivest; Emily Shen; Alan T. Sherman; Poorvi L. Vora (USENIX Security Symposium, 2010)

Performance Requirements for End-to-End Verifiable Elections. - Stefan Popoveniuc; John Kelsey; Andrew Regenscheid; Poorvi L. Vora (EVT/WOTE, 2010)

Secure Electronic Voting - A Framework. - Stefan Popoveniuc; Poorvi L. Vora (Cryptologia, 2010)

Pseudo-Linear Approximations for ARX Ciphers: With Application to Threefish. - Kerry A. McKay; Poorvi L. Vora (IACR Cryptol. ePrint Arch., 2010)

Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. - David Chaum; Richard Carback; Jeremy Clark; Aleksander Essex; Stefan Popoveniuc; Ronald L. Rivest; Peter Y. A. Ryan; Emily Shen; Alan T. Sherman; Poorvi L. Vora (IEEE Trans. Inf. Forensics Secur., 2010)

Paperless Independently-Verifiable Voting. - David Chaum; Alex Florescu; Mridul Nandi; Stefan Popoveniuc; Jan Rubio; Poorvi L. Vora; Filip Zagórski (VoteID, 2011)

Price Discrimination and Privacy: a Note. - Sumit Joshi; Yuan Sun 015; Poorvi L. Vora (IGTR, 2011)

Dispute Resolution in Accessible Voting Systems: The Design and Use of Audiotegrity. - Tyler Kaczmarek; John Wittrock; Richard Carback; Alex Florescu; Jan Rubio; Noel Runyan; Poorvi L. Vora; Filip Zagórski (VoteID, 2013)

Remotegrity: Design and Use of an End-to-End Verifiable Remote Voting System. - Filip Zagórski; Richard Carback; David Chaum; Jeremy Clark; Aleksander Essex; Poorvi L. Vora (IACR Cryptol. ePrint Arch., 2013)

Analysis of ARX Functions: Pseudo-linear Methods for Approximation, Differentials, and Evaluating Diffusion. - Kerry A. McKay; Poorvi L. Vora (IACR Cryptol. ePrint Arch., 2014)

End-to-end verifiability. - Josh Benaloh; Ronald L. Rivest; Peter Y. A. Ryan; Philip B. Stark; Vanessa Teague; Poorvi L. Vora (CoRR, 2015)

Apollo - End-to-end Verifiable Internet Voting with Recovery from Vote Manipulation. - Dawid Gawel; Maciej Kosarzecki; Poorvi L. Vora; Hua Wu; Filip Zagórski (IACR Cryptol. ePrint Arch., 2016)

Public Evidence from Secret Ballots. - Matthew Bernhard; Josh Benaloh; J. Alex Halderman; Ronald L. Rivest; Peter Y. A. Ryan; Philip B. Stark; Vanessa Teague; Poorvi L. Vora; Dan S. Wallach (E-VOTE-ID, 2017)

PrivApollo - Secret Ballot E2E-V Internet Voting. - Hua Wu; Poorvi L. Vora; Filip Zagórski (Financial Cryptography Workshops, 2019)

Risk-Limiting Bayesian Polling Audits for Two Candidate Elections. - Poorvi L. Vora (CoRR, 2019)

A Note on Risk-Limiting Bayesian Polling Audits for Two-Candidate Elections. - Sarah Morin; Grant McClearn; Neal McBurnett; Poorvi L. Vora; Filip Zagórski (Financial Cryptography Workshops, 2020)

The Athena Class of Risk-Limiting Ballot Polling Audits. - Filip Zagórski; Grant McClearn; Sarah Morin; Neal McBurnett; Poorvi L. Vora (CoRR, 2020)

Linear Cryptanalysis of Reduced-Round Simon Using Super Rounds. - Reham Almukhlifi; Poorvi L. Vora (Cryptogr., 2020)

Linear and Partly-Pseudo-Linear Cryptanalysis of Reduced-Round SPARX Cipher. - Sarah A. Alzakari; Poorvi L. Vora (IACR Cryptol. ePrint Arch., 2020)

Minerva- An Efficient Risk-Limiting Ballot Polling Audit. - Filip Zagórski; Grant McClearn; Sarah Morin; Neal McBurnett; Poorvi L. Vora (USENIX Security Symposium, 2021)

Partly-Pseudo-Linear Cryptanalysis of Reduced-Round Speck. - Sarah A. Alzakari; Poorvi L. Vora (Cryptogr., 2021)

Simulations of Ballot Polling Risk-Limiting Audits. - Oliver Broadrick; Sarah Morin; Grant McClearn; Neal McBurnett; Poorvi L. Vora; Filip Zagórski (Financial Cryptography Workshops, 2022)

PROVIDENCE: a Flexible Round-by-Round Risk-Limiting Audit. - Oliver Broadrick; Poorvi L. Vora; Filip Zagórski (USENIX Security Symposium, 2023)

Linear Cryptanalysis of Reduced-Round Simeck Using Super Rounds. - Reham Almukhlifi; Poorvi L. Vora (Cryptogr., 2023)