Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sujata Garera

dblp:00/3678 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Systems and software security · 33% Hardware security and side channels · 33% Cryptographic protocols and secure computation · 25%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security › software integrity
software integrity verification
0.112009
Detecting code alteration by creating a temporary memory bottleneck · IEEE Trans. Inf. Forensics Secur. 2009
Cryptographic protocols and secure computation › electronic voting
electronic voting security
0.112007
An independent audit framework for software dependent voting systems · CCS 2007
Authentication and access control › user authentication
challenge-response authentication
0.012009
Detecting code alteration by creating a temporary memory bottleneck · IEEE Trans. Inf. Forensics Secur. 2009

Methods — techniques the papers use, named apart from their topics

timing analysis · 0.1cache-memory timing · 0.1system virtualization · 0.1image recognition · 0.1
YearPublicationVenuePosition
2009 Detecting code alteration by creating a temporary memory bottleneck
abstract
We develop a new technique whereby a poll worker can determine whether the software executing on electronic voting machines on election day has been altered from its factory version. Our generalized approach allows a human, using a known challenge-response pair, to detect attacks that involve modification or replacement of software on a computer based on the time it takes the computer to provide a correct response to a challenge. We exploit the large difference between main memory access times and cache memory access or CPU clock cycle times to significantly increase the time required to compute the right response when the software has been changed.
Ryan W. Gardner, Sujata Garera, Aviel D. Rubin
IEEE Trans. Inf. Forensics Secur.2
2007 An independent audit framework for software dependent voting systems
abstract
The electronic voting machines known as Direct Recording Electronic (DRE), that are used in many states in the US have been shown to contain security vulnerabilities [16, 9, 3]. One of the problems is that the elections held on these machines cannot be independently audited. In this paper we address this issue by designing a new all-electronic independent audit framework for DRE voting systems. Our framework leverages system virtualization concepts and image recognition techniques to maintain an audit of the vote totals. The architecture we present is a step towards meeting the software independence requirements as defined by Rivest et al. [21, 2]. We have implemented a prototype using the Diebold Accuvote TS DRE voting software and the XEN hypervisor and demonstrate that our system can achieve a robust election audit with negligible overhead.
Sujata Garera, Aviel D. Rubin
CCS1