default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnka Blanchard
Person information
- affiliation: University of Lorraine, France
- affiliation (PhD 2019): Paris Diderot University, IRIF, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c16]Enka Blanchard, Levi Gabasova:
Minimalist approaches to enforce privacy by design in surveys. RoCHI 2023- 2022
- [j5]Enka Blanchard
, Ryan Robucci, Ted Selker, Alan T. Sherman:
Phrase-verified voting: Verifiable low-tech remote boardroom voting: How We Voted on Tenure & Promotion Cases during the Pandemic. Cryptologia 46(1): 67-101 (2022) - [j4]Enka Blanchard:
Client-Side Hashing for Efficient Typo-Tolerant Password Checkers. Int. J. Syst. Softw. Secur. Prot. 13(1): 1-24 (2022) - [c15]Enka Blanchard, Antoine Gallais, Emmanuel Leblond, Djohar Sidhoum-Rahal, Juliette Walter:
An Analysis of the Security and Privacy Issues of the Neovote Online Voting System. E-Vote-ID 2022: 1-18 - [c14]Enka Blanchard, David Duvivier, Christophe Kolski, Sophie Lepreux:
Towards a Framework for Detecting Temporary Obstacles and Their Impact on Mobility for Diversely Disabled Users. HCI (34) 2022: 475-488 - [c13]Ted Selker, Enka Blanchard:
Improving the usability and security of mail-in ballots. RoCHI 2022: 80-83 - 2021
- [j3]Enka Blanchard, Giuseppe Longo:
From axiomatic systems to the Dogmatic gene and beyond. Biosyst. 204: 104396 (2021) - [c12]Enka Blanchard:
Cripping Assistive Tech Design: How the Current Disability Framework Limits Our Ability to Create Emancipatory Technology. SOHOMA 2021: 377-388 - [i3]Enka Blanchard, Ryan Robucci, Ted Selker, Alan T. Sherman:
Phrase-Verified Voting: Verifiable Low-Tech Remote Boardroom Voting. CoRR abs/2103.07180 (2021) - 2020
- [c11]Enka Blanchard, Ted Selker, Florentin Waligorski:
Towards an Empirical Cost Model for Mental Password Algorithms. CHI Extended Abstracts 2020: 1-8 - [c10]Enka Blanchard, Ted Selker, Levi Gabasova, Eli Sennesh:
Cue-Pin-Select, a Secure Mental Password Manager. COMPSAC 2020: 418-428 - [c9]Enka Blanchard, Siargey Kachanovich:
Usable Everlasting Encryption using the Pornography Infrastructure (Fast Abstract). COMPSAC 2020: 1082-1083 - [c8]Enka Blanchard:
Making More Extensive and Efficient Typo-Tolerant Password Checkers. COMPSAC 2020: 1581-1588 - [c7]Enka Blanchard, Ted Selker:
Origami Voting: A Non-cryptographic Approach to Transparent Ballot Verification. Financial Cryptography Workshops 2020: 273-290 - [i2]Enka Blanchard, Ted Selker, Alan T. Sherman:
Boardroom Voting: Verifiable Voting with Ballot Privacy Using Low-Tech Cryptography in a Single Room. CoRR abs/2007.14916 (2020)
2010 – 2019
- 2019
- [b1]Enka Blanchard:
Usability: low tech, high security. (Utilisabilité: haute sécurité en basse technologie). Sorbonne Paris Cité, France, 2019 - [c6]Nikola K. Blanchard, Siargey Kachanovich, Ted Selker, Florentin Waligorski:
Reflexive Memory Authenticator: A Proposal for Effortless Renewable Biometrics. ETAA@ESORICS 2019: 104-121 - [c5]Nikola K. Blanchard, Leila Gabasova, Ted Selker:
Consonant-Vowel-Consonants for Error-Free Code Entry. HCI (29) 2019: 19-37 - [c4]Enka Blanchard, Xavier Coquand, Ted Selker:
Moving to Client-Side Hashing for Online Authentication. STAST 2019: 140-156 - [i1]Nikola K. Blanchard, Eldar Fischer, Oded Lachish, Felix Reidl:
Longest paths in 2-edge-connected cubic graphs. CoRR abs/1903.02508 (2019) - 2018
- [j2]N. K. Blanchard:
Building Trust for Sample Voting. Int. J. Decis. Support Syst. Technol. 10(4): 50-64 (2018) - [c3]Nikola K. Blanchard, Clément Malaingre, Ted Selker:
Improving security and usability of passphrases with guided word choice. ACSAC 2018: 723-732 - [c2]Nikola K. Blanchard, Ted Selker:
Improving voting technology is hard: the trust-legitimacy-participation loop and related problems. STAST 2018: 4:1-4:8 - 2017
- [c1]N. K. Blanchard, Nicolas Schabanel:
Dynamic Sum-Radii Clustering. WALCOM 2017: 30-41 - 2014
- [j1]Johann A. Makowsky, Elena V. Ravve, N. K. Blanchard:
On the location of roots of graph polynomials. Eur. J. Comb. 41: 1-19 (2014)
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-07-09 22:04 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:
