


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Poorvi L. Vora
George Washington University, Washington, D.C., USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 66 matches
- 2023
- Reham Almukhlifi
, Poorvi L. Vora:
Linear Cryptanalysis of Reduced-Round Simeck Using Super Rounds. Cryptogr. 7(1): 8 (2023) - Oliver Broadrick, Poorvi L. Vora, Filip Zagórski:
PROVIDENCE: a Flexible Round-by-Round Risk-Limiting Audit. USENIX Security Symposium 2023: 6753-6770 - 2022
- 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 - Oliver Broadrick, Poorvi L. Vora, Filip Zagórski:
PROVIDENCE: a Flexible Round-by-Round Risk-Limiting Audit. CoRR abs/2210.08717 (2022) - Reham Almukhlifi, Poorvi L. Vora:
Linear Cryptanalysis of Reduced-Round Simeck Using Super Rounds. IACR Cryptol. ePrint Arch. 2022: 1731 (2022) - 2021
- Sarah A. Alzakari
, Poorvi L. Vora:
Partly-Pseudo-Linear Cryptanalysis of Reduced-Round Speck. Cryptogr. 5(1): 1 (2021) - 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
- Reham Almukhlifi
, Poorvi L. Vora:
Linear Cryptanalysis of Reduced-Round Simon Using Super Rounds. Cryptogr. 4(1): 9 (2020) - Sarah A. Alzakari, Poorvi L. Vora:
Linear and Partly-Pseudo-Linear Cryptanalysis of Reduced-Round SPARX Cipher. ATIS 2020: 108-121 - 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 - 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) - Reham Almukhlifi, Poorvi L. Vora:
Linear Cryptanalysis of Reduced-Round SIMON Using Super Rounds. IACR Cryptol. ePrint Arch. 2020: 290 (2020) - Sarah A. Alzakari, Poorvi L. Vora:
Linear and Partly-Pseudo-Linear Cryptanalysis of Reduced-Round SPARX Cipher. IACR Cryptol. ePrint Arch. 2020: 978 (2020) - 2019
- Hua Wu, Poorvi L. Vora, Filip Zagórski
:
PrivApollo - Secret Ballot E2E-V Internet Voting. Financial Cryptography Workshops 2019: 299-313 - Poorvi L. Vora:
Risk-Limiting Bayesian Polling Audits for Two Candidate Elections. CoRR abs/1902.00999 (2019) - 2017
- 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 - 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
- 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 - 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
- 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
- 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
- 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 - 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 - 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
- Sumit Joshi, Yuan Sun, Poorvi L. Vora:
Price Discrimination and Privacy: a Note. IGTR 13(1): 83-92 (2011) - 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
- Stefan Popoveniuc, Poorvi L. Vora:
Secure Electronic Voting - A Framework. Cryptologia 34(3): 236-257 (2010) - 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) - 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 - Mridul Nandi
, Stefan Popoveniuc, Poorvi L. Vora:
Stamp-It: A Method for Enhancing the Universal Verifiability of E2E Voting Systems. ICISS 2010: 81-95
skipping 36 more matches
loading more results
failed to load more results, please try again later

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.
retrieved on 2025-02-13 10:59 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint