default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPoorvi L. Vora
Person information
- affiliation: George Washington University, Washington, D.C., USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Reham Almukhlifi
, Poorvi L. Vora:
Linear Cryptanalysis of Reduced-Round Simeck Using Super Rounds. Cryptogr. 7(1): 8 (2023)- [c32]Oliver Broadrick, Poorvi L. Vora, Filip Zagórski:
PROVIDENCE: a Flexible Round-by-Round Risk-Limiting Audit. USENIX Security Symposium 2023: 6753-6770 - 2022
- [c31]Oliver Broadrick, Sarah Morin, Grant McClearn, Neal McBurnett, Poorvi L. Vora, Filip Zagórski:
Simulations of Ballot Polling Risk-Limiting Audits. Financial Cryptography Workshops 2022: 351-365 - [i16]Oliver Broadrick, Poorvi L. Vora, Filip Zagórski:
PROVIDENCE: a Flexible Round-by-Round Risk-Limiting Audit. CoRR abs/2210.08717 (2022) - [i15]Reham Almukhlifi, Poorvi L. Vora:
Linear Cryptanalysis of Reduced-Round Simeck Using Super Rounds. IACR Cryptol. ePrint Arch. 2022: 1731 (2022) - 2021
- [j17]Sarah A. Alzakari, Poorvi L. Vora:
Partly-Pseudo-Linear Cryptanalysis of Reduced-Round Speck. Cryptogr. 5(1): 1 (2021) - [c30]Filip Zagórski, Grant McClearn, Sarah Morin, Neal McBurnett, Poorvi L. Vora:
Minerva- An Efficient Risk-Limiting Ballot Polling Audit. USENIX Security Symposium 2021: 3059-3076 - 2020
- [j16]Reham Almukhlifi, Poorvi L. Vora:
Linear Cryptanalysis of Reduced-Round Simon Using Super Rounds. Cryptogr. 4(1): 9 (2020) - [c29]Sarah A. Alzakari, Poorvi L. Vora:
Linear and Partly-Pseudo-Linear Cryptanalysis of Reduced-Round SPARX Cipher. ATIS 2020: 108-121 - [c28]Sarah Morin, Grant McClearn, Neal McBurnett, Poorvi L. Vora, Filip Zagórski:
A Note on Risk-Limiting Bayesian Polling Audits for Two-Candidate Elections. Financial Cryptography Workshops 2020: 337-344 - [i14]Filip Zagórski, Grant McClearn, Sarah Morin, Neal McBurnett, Poorvi L. Vora:
The Athena Class of Risk-Limiting Ballot Polling Audits. CoRR abs/2008.02315 (2020) - [i13]Reham Almukhlifi, Poorvi L. Vora:
Linear Cryptanalysis of Reduced-Round SIMON Using Super Rounds. IACR Cryptol. ePrint Arch. 2020: 290 (2020) - [i12]Sarah A. Alzakari, Poorvi L. Vora:
Linear and Partly-Pseudo-Linear Cryptanalysis of Reduced-Round SPARX Cipher. IACR Cryptol. ePrint Arch. 2020: 978 (2020)
2010 – 2019
- 2019
- [c27]Hua Wu, Poorvi L. Vora, Filip Zagórski:
PrivApollo - Secret Ballot E2E-V Internet Voting. Financial Cryptography Workshops 2019: 299-313 - [i11]Poorvi L. Vora:
Risk-Limiting Bayesian Polling Audits for Two Candidate Elections. CoRR abs/1902.00999 (2019) - 2017
- [c26]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:
Public Evidence from Secret Ballots. E-VOTE-ID 2017: 84-109 - [i10]Josh Benaloh, Matthew Bernhard, J. Alex Halderman, Ronald L. Rivest, Peter Y. A. Ryan, Philip B. Stark, Vanessa Teague, Poorvi L. Vora, Dan S. Wallach:
Public Evidence from Secret Ballots. CoRR abs/1707.08619 (2017) - 2016
- [c25]Dawid Gawel, Maciej Kosarzecki, Poorvi L. Vora, Hua Wu, Filip Zagórski:
Apollo - End-to-End Verifiable Internet Voting with Recovery from Vote Manipulation. E-VOTE-ID 2016: 125-143 - [i9]Dawid Gawel, Maciej Kosarzecki, Poorvi L. Vora, Hua Wu, Filip Zagórski:
Apollo - End-to-end Verifiable Internet Voting with Recovery from Vote Manipulation. IACR Cryptol. ePrint Arch. 2016: 1037 (2016) - 2015
- [i8]Josh Benaloh, Ronald L. Rivest, Peter Y. A. Ryan, Philip B. Stark, Vanessa Teague, Poorvi L. Vora:
End-to-end verifiability. CoRR abs/1504.03778 (2015) - 2014
- [i7]Kerry A. McKay, Poorvi L. Vora:
Analysis of ARX Functions: Pseudo-linear Methods for Approximation, Differentials, and Evaluating Diffusion. IACR Cryptol. ePrint Arch. 2014: 895 (2014) - 2013
- [c24]Filip Zagórski, Richard Carback, David Chaum, Jeremy Clark, Aleksander Essex, Poorvi L. Vora:
Remotegrity: Design and Use of an End-to-End Verifiable Remote Voting System. ACNS 2013: 441-457 - [c23]Tyler Kaczmarek, John Wittrock, Richard Carback, Alex Florescu, Jan Rubio, Noel Runyan, Poorvi L. Vora, Filip Zagórski:
Dispute Resolution in Accessible Voting Systems: The Design and Use of Audiotegrity. VoteID 2013: 127-141 - [i6]Filip Zagórski, Richard Carback, David Chaum, Jeremy Clark, Aleksander Essex, Poorvi L. Vora:
Remotegrity: Design and Use of an End-to-End Verifiable Remote Voting System. IACR Cryptol. ePrint Arch. 2013: 214 (2013) - 2011
- [j15]Sumit Joshi, Yuan Sun, Poorvi L. Vora:
Price Discrimination and Privacy: a Note. IGTR 13(1): 83-92 (2011) - [c22]David Chaum, Alex Florescu, Mridul Nandi, Stefan Popoveniuc, Jan Rubio, Poorvi L. Vora, Filip Zagórski:
Paperless Independently-Verifiable Voting. VoteID 2011: 140-157 - 2010
- [j14]Stefan Popoveniuc, Poorvi L. Vora:
Secure Electronic Voting - A Framework. Cryptologia 34(3): 236-257 (2010) - [j13]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:
Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. IEEE Trans. Inf. Forensics Secur. 5(1): 194 (2010) - [c21]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:
Scantegrity Mock Election at Takoma Park. Electronic Voting 2010: 45-61 - [c20]Mridul Nandi, Stefan Popoveniuc, Poorvi L. Vora:
Stamp-It: A Method for Enhancing the Universal Verifiability of E2E Voting Systems. ICISS 2010: 81-95 - [c19]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:
Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy. USENIX Security Symposium 2010: 291-306 - [c18]Stefan Popoveniuc, John Kelsey, Andrew Regenscheid, Poorvi L. Vora:
Performance Requirements for End-to-End Verifiable Elections. EVT/WOTE 2010 - [i5]Kerry A. McKay, Poorvi L. Vora:
Pseudo-Linear Approximations for ARX Ciphers: With Application to Threefish. IACR Cryptol. ePrint Arch. 2010: 282 (2010)
2000 – 2009
- 2009
- [j12]David Chaum, Benjamin Hosp, Stefan Popoveniuc, Poorvi L. Vora:
Accessible Voter-Verifiability. Cryptologia 33(3): 283-291 (2009) - [j11]Ronald L. Rivest, David Chaum, Bart Preneel, Aviel D. Rubin, Donald G. Saari, Poorvi L. Vora:
Guest editorial: special issue on electronic voting. IEEE Trans. Inf. Forensics Secur. 4(4): 593-596 (2009) - [j10]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:
Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. IEEE Trans. Inf. Forensics Secur. 4(4): 611-627 (2009) - [c17]Yuan Sun, Poorvi L. Vora:
From eBay's second chance offer to B2B service pricing: Similarity and challenges. SOLI 2009: 288-290 - 2008
- [j9]David Chaum, Aleksander Essex, Richard Carback, Jeremy Clark, Stefan Popoveniuc, Alan T. Sherman, Poorvi L. Vora:
Scantegrity: End-to-End Voter-Verifiable Optical-Scan Voting. IEEE Secur. Priv. 6(3): 40-46 (2008) - [j8]Benjamin Hosp, Poorvi L. Vora:
An information-theoretic model of voting systems. Math. Comput. Model. 48(9-10): 1628-1645 (2008) - 2007
- [j7]Poorvi L. Vora:
An Information-Theoretic Approach to Inference Attacks on Random Data Perturbation and a Related Privacy Measure. IEEE Trans. Inf. Theory 53(8): 2971-2977 (2007) - [i4]Benjamin Hosp, Poorvi L. Vora:
An Information-Theoretic Model of Voting Systems. Frontiers of Electronic Voting 2007 - [i3]Darakhshan J. Mir, Poorvi L. Vora:
Related-Key Statistical Cryptanalysis. IACR Cryptol. ePrint Arch. 2007: 227 (2007) - [i2]David Chaum, Jeroen van de Graaf, Peter Y. A. Ryan, Poorvi L. Vora:
Secret Ballot Elections with Unconditional Integrity. IACR Cryptol. ePrint Arch. 2007: 270 (2007) - 2006
- [c16]Poorvi L. Vora, Rahul Simha, Jonathan Stanton:
A performance ratings framework for the evaluation of electronic voting systems: project highlights: exploratory research. DG.O 2006: 460-461 - [c15]Poorvi L. Vora, Darakhshan J. Mir:
Related-Key Linear Cryptanalysis. ISIT 2006: 1609-1613 - [c14]Sumit Joshi, Yuan Sun, Poorvi L. Vora:
Randomization as a strategy for sellers during price discrimination, and impact on bidders' privacy. WPES 2006: 73-76 - 2005
- [c13]Lillie Coney, Joseph Lorenzo Hall, Poorvi L. Vora, David A. Wagner:
Towards a privacy measurement criterion for voting systems. DG.O 2005: 287-288 - [c12]Sumit Joshi, Yuan Sun, Poorvi L. Vora:
The privacy cost of the second-chance offer. WPES 2005: 97-106 - [i1]Poorvi L. Vora:
David Chaum's Voter Verification using Encrypted Paper Receipts. IACR Cryptol. ePrint Arch. 2005: 50 (2005) - 2004
- [j6]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:
Evaluation of voting systems. Commun. ACM 47(11): 144 (2004) - [c11]Cormac Herley, Poorvi L. Vora, Shawn Yang:
Detection and deterrence of counterfeiting of valuable documents. ICIP 2004: 2423-2426 - [c10]Poorvi L. Vora:
Information Theory and the Security of Binary Data Perturbation. INDOCRYPT 2004: 136-147 - 2003
- [c9]Ian Dickinson, Dave Reynolds, Dave Banks, Steve Cayzer, Poorvi L. Vora:
User Profiling with Privacy: A Framework for Adaptive Information Agents. AgentLink 2003: 123-151 - 2001
- [j5]K. Gopalakrishnan, Nasir D. Memon, Poorvi L. Vora:
Protocols for Watermark Verification. IEEE Multim. 8(4): 66-70 (2001) - [j4]Poorvi L. Vora, Joyce E. Farrell, Jerome D. Tietz, David H. Brainard:
Image capture: simulation of sensor responses from hyperspectral images. IEEE Trans. Image Process. 10(2): 307-316 (2001) - [j3]Poorvi L. Vora:
Inner products and orthogonality in color recording filter design. IEEE Trans. Image Process. 10(4): 632-642 (2001) - 2000
- [c8]Nasir D. Memon, Poorvi L. Vora, Boon-Lock Yeo, Minerva M. Yeung:
Distortion-bounded authentication techniques. Security and Watermarking of Multimedia Contents 2000: 164-175
1990 – 1999
- 1999
- [c7]Poorvi L. Vora:
Robust Watermarking Using Argument Modulation. PICS 1999: 290-294 - 1998
- [c6]Poorvi L. Vora, Cormac Herley:
Trade-offs between Color Saturation and Noise Sensitivity in Image Sensors. ICIP (1) 1998: 196-200 - 1997
- [j2]Poorvi L. Vora, H. Joel Trussell:
Mathematical methods for the design of color scanning filters. IEEE Trans. Image Process. 6(2): 312-320 (1997) - [j1]Poorvi L. Vora, H. Joel Trussell:
Mathematical methods for the analysis of color scanning filters. IEEE Trans. Image Process. 6(2): 321-327 (1997) - [c5]Poorvi L. Vora, Michael Harville, Joyce E. Farrell, Jerome D. Tietz, David H. Brainard:
Image capture: synthesis of sensor responses from multispectral images. Color Imaging: Device-Independent Color, Color Hard Copy, and Graphic Arts 1997: 2-11 - 1996
- [c4]Bhaskar Bhumkar, Poorvi L. Vora, Bindu Chandna, K. Shankar:
A set theoretic approach to image reconstruction from projections. ICIP (2) 1996: 737-740 - 1995
- [c3]Poorvi L. Vora, H. Joel Trussell, Lawrence S. Iwan:
Design results for a set of thin film color-scanning filters. Device-Independent Color Imaging 1995: 70-75 - 1992
- [c2]H. Joel Trussell, Poorvi L. Vora:
On the accuracy of scanning colour images. ICASSP 1992: 161-164
1980 – 1989
- 1988
- [c1]H. Joel Trussell, Poorvi L. Vora:
Bounds on restoration quality using a priori information. ICASSP 1988: 1758-1761
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
