Poorvi Vora

Prof. Poorvi Vora


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 August 2020
Verified
Book Chapter
Closed access
PDF file
SMSarah Morin
Sarah Morin
GMGrant McClearn
Grant McClearn
NMNeal McBurnett
Neal McBurnett
PVPoorvi Vora
Poorvi Vora
FZFilip Zagórski
Filip Zagórski

22 July 2009 in Cryptologia
Verified
Journal Article
Closed access
DCDavid Chaum
David Chaum
BHBen Hosp
Ben Hosp
SPStefan Popoveniuc
Stefan Popoveniuc
PVPoorvi Vora
Poorvi Vora
All voter-verifiable voting schemes in the literature require that the voter be able to see and to mark. This paper describes modifications to the Prêt à Voter and PunchScan schemes so that a voter who can either see or hear, or both, independent of marking ability, may avail of voter-verifiability without revealing her vote. The modified systems would provide privacy and integrity guarantees that are currently available only to voters who can both see and mark.

9 February 2023 in Cryptography
Verified
Journal Article
Open access
PDF file
RAReham Almukhlifi
Reham Almukhlifi
PVPoorvi Vora
Poorvi Vora
The Simeck family of lightweight block ciphers was proposed by Yang et al. in 2015, which combines the design features of the NSA-designed block ciphers Simon and Speck. Previously, we proposed the use of linear cryptanalysis using super-rounds to increase the efficiency of implementing Matsui’s second algorithm and achieved good results on all variants of Simon. The improved linear attacks result from the observation that, after four rounds of encryption, one bit of the left half of the state of the cipher depends on only 17 key bits (19 key bits for the larger variants of the cipher). We were able to follow a similar approach, in all variants of Simeck, with an improvement in Simeck 32 and Simeck 48 by relaxing the previous constraint of a single active bit, using multiple active bits instead. In this paper we present improved linear attacks against all variants of Simeck: attacks on 19-rounds of Simeck 32/64, 28-rounds of Simeck 48/96, and 34-rounds of Simeck 64/128, often with the direct recovery of the full master key without repeating the attack over multiple rounds. We also verified the results of linear cryptanalysis on 8, 10, and 12 rounds for Simeck 32/64.

29 June 2010 in Cryptologia
Verified
Journal Article
Closed access
SPStefan Popoveniuc
Stefan Popoveniuc
PVPoorvi Vora
Poorvi Vora
We describe a single framework in which to view the end-to-end-independently-verifiable (E2E) polling-place voting systems with a mixnet back-end. We use the framework to invent new systems that combine front and back-ends from existing systems.

17 November 2009 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
RRRonald L. Rivest
Ronald L. Rivest
DCDavid Chaum
David Chaum
BPBart Preneel
Bart Preneel
ARAviel D. Rubin
Aviel D. Rubin
DSDonald G. Saari
Donald G. Saari
PVPoorvi Vora
Poorvi Vora
The 13 papers in this special issue focus on electronic voting.

17 February 2010 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
DCDavid Chaum
David Chaum
RCRichard T. Carback
Richard T. Carback
JCJeremy Clark
Jeremy Clark
AEAleksander Essex
Aleksander Essex
SPStefan Popoveniuc
Stefan Popoveniuc
PVPoorvi Vora
Poorvi Vora
In the above titled paper (ibid., vol. 4, no. 4, pp. 611-627, Dec. 09), due to a production error, the affiliations of two of the authors were listed incorrectly. The correct affiliations are presented here. Also, the name of the last author in the affiliations footnote was printed incorrectly. The correct name is P. Y. A. Ryan.