Author image not provided
 Vanessa Joy Teague

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article8.00
Citation Count208
Publication count26
Publication years2001-2017
Available for download7
Average downloads per article295.57
Downloads (cumulative)2,069
Downloads (12 Months)339
Downloads (6 Weeks)37
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


26 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 26
Result page: 1 2

Sort by:

1 published by ACM
August 2017 ARES '17: Proceedings of the 12th International Conference on Availability, Reliability and Security
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 13,   Downloads (12 Months): 97,   Downloads (Overall): 97

Full text available: PDFPDF
Nowadays, contactless payments are becoming increasingly common as new smartphones, tablets, point-of-sale (POS) terminals and payment cards (often termed "tap-and-pay" cards) are designed to support Near Field Communication (NFC) technology. However, as NFC technology becomes pervasive, there have been concerns about how well NFC-enabled contactless payment systems protect individuals and ...
Keywords: contactless payments, mobile wallets, Near Field Communication, mobile payments, NFC technology

2 published by ACM
January 2017 ACSW '17: Proceedings of the Australasian Computer Science Week Multiconference
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 25,   Downloads (Overall): 25

Full text available: PDFPDF
We re-examine the 2012 local government elections in New South Wales, Australia. The count was conducted electronically using a randomised form of the Single Transferable Vote (STV). It was already well known that randomness does make a difference to outcomes in some seats. We describe how the process could be ...

3
November 2016 GameSec 2016: 7th International Conference on Decision and Game Theory for Security - Volume 9996
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Many verifiable electronic voting systems are dependent on voter-initiated auditing. This auditing allows the voter to check the construction of their cryptographic ballot, and is essential in both gaining assurance in the honesty of the constructing device, and ensuring the integrity of the election as a whole. A popular audit ...

4
September 2015 VoteID 2015: Proceedings of the 5th International Conference on E-Voting and Identity - Volume 9269
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 2

We show how to extend the Helios voting system to provide eligibility verifiability without revealing who voted which we call private eligibility verifiability. The main idea is that real votes are hidden in a crowd of null votes that are cast by others but are indistinguishable from those of the ...

5
September 2015 VoteID 2015: Proceedings of the 5th International Conference on E-Voting and Identity - Volume 9269
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

In the world's largest-ever deployment of online voting, the iVote Internet voting system was trusted for the return of 280,000 ballots in the 2015 state election in New South Wales, Australia. During the election, we performed an independent security analysis of parts of the live iVote system and uncovered severe ...

6 published by ACM
June 2015 ACM Transactions on Information and System Security (TISSEC): Volume 18 Issue 1, June 2015
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 12,   Downloads (12 Months): 138,   Downloads (Overall): 421

Full text available: PDFPDF
The Prêt à Voter cryptographic voting system was designed to be flexible and to offer voters a familiar and easy voting experience. In this article, we present our development of the Prêt à Voter design to a practical implementation used in a real state election in November 2014, called vVote. ...
Keywords: voting protocols, Verifiable electronic voting systems

7
April 2014 Journal of Information Security and Applications: Volume 19 Issue 2, April, 2014
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 0


8
August 2012 EVT/WOTE'12: Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
Publisher: USENIX Association
Bibliometrics:
Citation Count: 6

The Prêt à Voter cryptographic voting system was designed to be flexible and to offer voters a familiar and easy voting experience. In this paper we present a case study of our efforts to adapt Prêt à Voter to the idiosyncrasies of elections in the Australian state of Victoria. The ...

9
May 2012 PKC'12: Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We revisit <em>shuffling in public</em> [AW07a], a scheme which allows a shuffle to be precomputed. We show how to obfuscate a Paillier shuffle with <em>O</em> (<em>N</em> log 3.5 <em>N</em> ) exponentiations, leading to a very robust and efficient mixnet: when distributed over <em>O</em> (<em>N</em> ) nodes the mixnet achieves mixing ...
Keywords: homomorphic encryption, electronic voting, public key obfuscation

10
September 2011 VoteID'11: Proceedings of the Third international conference on E-Voting and Identity
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Research on mitigating vulnerabilities in electronic elections has focused mainly on developing cryptographic voting and counting schemes that satisfy strong mathematical requirements. However many practical problems with e-election systems in general cannot be solved by cryptology. In this paper we consider some of these practical problems by examining deficiencies that ...
Keywords: best practice, e-voting, failure-critical engineering, electronic elections, strong transparency

11
September 2011 VoteID'11: Proceedings of the Third international conference on E-Voting and Identity
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The literature abounds with discussions on the relative security merits of various voting systems, and on whether a move towards electronic voting is, from a security perspective, something to be encouraged or discouraged. Little has been said, however, on whether there would be unintended side-effects of changing the voting technology, ...

12
September 2010 ESORICS'10: Proceedings of the 15th European conference on Research in computer security
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

In this paper we revisit Pretty Good Democracy, a scheme for verifiable Internet voting from untrusted client machines. The original scheme was designed for first-past-the-post elections. Here, we show how Pretty Good Democracy can be extended to voting schemes in which the voter lists the candidates in their order of ...

13
August 2010 EVT/WOTE'10: Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
Publisher: USENIX Association
Bibliometrics:
Citation Count: 2

We consider the problem of verifiable parallel shuffling in which the same shuffle is simultaneously performed on two or more lists of input ciphertexts, each list encrypted under a different key. We present three parallelisations of shuffle proofs from different paradigms. The properties of each protocol are analyzed and contrasted, ...

14
December 2009 IEEE Transactions on Information Forensics and Security - Special issue on electronic voting: Volume 4 Issue 4, December 2009
Publisher: IEEE Press
Bibliometrics:
Citation Count: 10

There are many advantages to voting schemes in which voters rank all candidates in order, rather than just choosing their favorite. However, these schemes inherently suffer from a coercion problem when there are many candidates, because a coercer can demand a certain permutation from a voter and then check whether ...
Keywords: cryptography, single transferrable vote (STV), technology social factors, end-to-end verifiable elections, communication system security, preferential voting, Communication system security, instant runoff voting

15
August 2009 EVT/WOTE'09: Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Publisher: USENIX Association
Bibliometrics:
Citation Count: 5

Handling full permutations of the candidate list along with re-encryption mixes is rather difficult in Prêt à Voter but handling cyclic shifts is straightforward. One of the versions of Prêt à Voter that uses Paillier encryption allows general permutations of candidates on the ballot, rather than just cyclic shifts. This ...

16
July 2008 EVT'08: Proceedings of the conference on Electronic voting technology
Publisher: USENIX Association
Bibliometrics:
Citation Count: 9

There are many advantages to voting schemes in which voters rank all candidates in order, rather than just choosing their favourite. However, these schemes inherently suffer from a coercion problem when there are many candidates, because a coercer can demand a certain permutation from a voter and then check whether ...

17
December 2007 ICPADS '07: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

We propose a protocol for a group of peers in a peer-to-peer network to securely generate an agreed random value without the use of a central authority. We can vary the security parameters to maintain security (to a desired probability) in the presence of a high percentage of corrupt and ...

18
May 2007 AINAW '07: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 6

The lack of a trusted central authority poses a unique security challenge to peer-to-peer networks. It must be assumed that some fraction of all peers in a network are corrupt and may collude to try to derive an advantage. Nonetheless, in some circumstances it is necessary to select a subset ...

19
January 2007 ACSC '07: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Publisher: Australian Computer Society, Inc.
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 137

Full text available: PDFPDF
Publish/subscribe networks provide an interface for publishers to perform many-to-many communication to subscribers without the inefficiencies of broadcasting. Each subscriber submits a description of the sort of content they are interested in, then the publish/subscribe system delivers any appropriate messages as they are published. Although publish/subscribe networks offer advantages over ...
Keywords: peer-to-peer, publish/subscribe, security, network protocol

20
January 2007 CATS '07: Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Publisher: Australian Computer Society, Inc.
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 1,   Downloads (12 Months): 4,   Downloads (Overall): 88

Full text available: PDFPDF
We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election's outcome. All voting schemes are potentially manipulable. However, some, such as the Single Transferable Vote (STV) scheme used in Australian elections, are resistant to manipulation because it is NP ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us