There have been 1 completed talk and 1 topic suggestion tagged with encryption.
Voting with Homomorphic Encryption
Delivered by Sidhant Saraogi on Friday December 2, 2016
In light of the recently concluded Elections or as John Oliver would call it “A horifying glimpse at Satan's Pinterest Board 2016”, “The One who must not be named” has repeatedly insinuated that the elections have been rigged. Our humble aim, present a voting scheme where:
each voter casts exactly one ballot.
voting is anonymous.
We delve into two areas on our way to prove our goal :
Blind Signatures, which allow for anonymous voting
Pallier Cryptosystem, which gives us the ability to sum up the votes even though they have been encrypted thus allowing the election to be “publically audited”.
We might also, if time permit, talk about more modern systems of enabling fair elections that have even been implemented in real life.
This talk is based off Ron Rivest’s lecture, of which a summary is available.
Geographic Authentication Schemes
Users often choose passwords that are easy to remember but also easy to guess. Both textual and graphical passwords have failed to provide a viable solution to this usability-security tension. It thus remains a critical challenge in password research to design an authentication scheme that is resilient to guessing attacks while offering good memorability.
Possible reference materials for this topic include
Quick links: Google search, arXiv.org search, propose to present a talk
computer science encryption human-computer interaction security