Demo Data from VLDB 2026 / reviewers in the wild / expert
Gurchetan S. Grewal
dblp:118/7444
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 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
1 paper |
Cryptographic protocols and secure computation · 91% Usable security · 9% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › electronic voting
coercion resistance |
0.2 | 1 | 2013 | Caveat Coercitor: Coercion-Evidence in Electronic Voting · IEEE Symposium on Security and Privacy 2013 |
Cryptographic protocols and secure computation
electronic voting |
0.2 | 1 | 2013 | Caveat Coercitor: Coercion-Evidence in Electronic Voting · IEEE Symposium on Security and Privacy 2013 |
Cryptographic protocols and secure computation › electronic voting
verifiable voting |
0.2 | 1 | 2013 | Caveat Coercitor: Coercion-Evidence in Electronic Voting · IEEE Symposium on Security and Privacy 2013 |
Methods — techniques the papers use, named apart from their topics
formal definition · 0.2cryptographic protocol design · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Du-Vote: Remote Electronic Voting with Untrusted ComputersabstractDu-Vote is a new remote electronic voting protocol that eliminates the often-required assumption that voters trust general-purpose computers. Trust is distributed in Du-Vote between a simple hardware token issued to the voter, the voter's computer, and a server run by election authorities. Verifiability is guaranteed with high probability even if all these machines are controlled by the adversary, and privacy is guaranteed as long as at least either the voter's computer, or the server and the hardware token, are not controlled by the adversary. The design of the Du-Vote protocol is presented in this paper. A new non-interactive zero-knowledge proof is employed to verify the server's computations. Du-Vote is a step towards tackling the problem of internet voting on user machines that are likely to have malware. We anticipate that the methods of Du-Vote can be used in other applications to find ways of achieving malware tolerance, that is, ways of securely using platforms that are known or suspected to have malware. Gurchetan S. Grewal, Mark Ryan 0001, Liqun Chen 0002, Michael R. Clarkson |
CSF | 1 |
| 2013 | Caveat Coercitor: Coercion-Evidence in Electronic VotingabstractThe balance between coercion-resistance, election verifiability and usability remains unresolved in remote electronic voting despite significant research over the last few years. We propose a change of perspective, replacing the requirement of coercion-resistance with a new requirement of coercion-evidence: there should be public evidence of the amount of coercion that has taken place during a particular execution of the voting system. We provide a formal definition of coercion-evidence that has two parts. Firstly, there should be a coercion-evidence test that can be performed against the bulletin board to accurately determine the degree of coercion that has taken place in any given run. Secondly, we require coercer independence, that is the ability of the voter to follow the protocol without being detected by the coercer. To show how coercion-evidence can be achieved, we propose a new remote voting scheme, Caveat Coercitor, and we prove that it satisfies coercion-evidence. Moreover, Caveat Coercitor makes weaker trust assumptions than other remote voting systems, such as JCJ/Civitas and Helios, and has better usability properties. Gurchetan S. Grewal, Mark Ryan 0001, Sergiu Bursuc, Peter Y. A. Ryan |
IEEE Symposium on Security and Privacy | 1 |