default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKim Ramchen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c7]Kim Ramchen, Chris Culnane, Olivier Pereira, Vanessa Teague:
Universally Verifiable MPC and IRV Ballot Counting. Financial Cryptography 2019: 301-319- 2018
- [i6]Chris Culnane, Olivier Pereira, Kim Ramchen, Vanessa Teague:
Universally Verifiable MPC with Applications to IRV Ballot Counting. IACR Cryptol. ePrint Arch. 2018: 246 (2018) - 2017
- [b1]Kim Ramchen:
Privacy preserving protocols for large distributed systems. University of Melbourne, Parkville, Victoria, Australia, 2017 - [i5]Kim Ramchen:
Detecting General Algebraic Manipulation Attacks. IACR Cryptol. ePrint Arch. 2017: 157 (2017) - 2016
- [i4]Justin Bedo, Thomas C. Conway, Kim Ramchen, Vanessa Teague:
Privately Matching k-mers. IACR Cryptol. ePrint Arch. 2016: 781 (2016) - 2015
- [c6]Venkata Koppula, Kim Ramchen, Brent Waters:
Separations in Circular Security for Arbitrary Length Key Cycles. TCC (2) 2015: 378-400 - 2014
- [c5]Kim Ramchen, Brent Waters:
Fully Secure and Fast Signing from Obfuscation. CCS 2014: 659-673 - [c4]Omkant Pandey, Kim Ramchen, Brent Waters:
Relaxed Two-to-One Recoding Schemes. SCN 2014: 57-76 - [i3]Omkant Pandey, Kim Ramchen, Brent Waters:
Relaxed Two-to-one Recoding Schemes. IACR Cryptol. ePrint Arch. 2014: 477 (2014) - [i2]Kim Ramchen, Brent Waters:
Fully Secure and Fast Signing from Obfuscation. IACR Cryptol. ePrint Arch. 2014: 523 (2014) - 2013
- [i1]Venkata Koppula, Kim Ramchen, Brent Waters:
Separations in Circular Security for Arbitrary Length Key Cycles. IACR Cryptol. ePrint Arch. 2013: 683 (2013) - 2012
- [c3]Udaya Parampalli
, Kim Ramchen, Vanessa Teague:
Efficiently Shuffling in Public. Public Key Cryptography 2012: 431-448 - 2010
- [c2]Kim Ramchen:
Parallel Shuffling and Its Application to Prêt à Voter. EVT/WOTE 2010
2000 – 2009
- 2009
- [j1]Josh Benaloh, Tal Moran, Lee Naish, Kim Ramchen, Vanessa Teague:
Shuffle-sum: coercion-resistant verifiable tallying for STV voting. IEEE Trans. Inf. Forensics Secur. 4(4): 685-698 (2009) - 2008
- [c1]Vanessa Teague, Kim Ramchen, Lee Naish:
Coercion-Resistant Tallying for STV Voting. EVT 2008
Coauthor Index
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.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
