HackerTube.dev

Theory and Practice of Cryptography

Google TechTalks · 73.5K views · 2007-12-21 · 1:32:08

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

A Google Tech Talk by Steve Weis that introduces modern cryptography and its use in practice and at Google. It covers proofs of security and security definitions and a special topic. HN commenters treat it as a talk on verifiable electronic voting.

On Hacker News

HN keeps pointing to it as a long, fascinating talk on cryptographic, verifiable voting whenever e-voting security comes up.

Recommended by 5 HN people across 7 months · HN mentions 2011–2019

Topics

Search by tags

What people said

kaoD · 2016-11 · Strong recommendation

I can't believe this talk hasn't been posted yet! Theory and Practice of Cryptography: Verifying Elections with Cryptography [VIDEO] This is probably one of the homomorphic schemes mentioned in TFA. It's very old (2007-ish?) and the state of the art probably advanced, but it's very interesting and addresses a number of points that are not cared for in TFA (like secret ballots verifiable by the voter but impossible to prove to anyone else).

Read the original HN comment ↗
bubblethink · 2019-02 · Recommendation

>The central issue with electronic voting is that it's opaque to observers. There was this interesting talk years ago. [VIDEO] Does anyone in the space have a more up to date reference on where things are at ?

Read the original HN comment ↗
grzm · 2017-01 · Recommendation

Going back to my original comment, widespread faith that the voting process is safe is just as important as whether it actually is. Casting doubt on the process without really solid evidence undermines this faith. By no means do I want to be Pollyannaish about this: it's too important. Which is why I want to see improvements in the voting process. If voting integrity is something you feel particularly strongly about (I certainly do), I encourage to look into the work that's already out there. The 2000 election spurred a lot of research. Some good starting points are: Ronald L. Rivest MIT Auditability and Verifiability of Elections ACM-IEEE talk March 16, 2016 [LINK] --- Ben Adida Google Tech Talks December 19, 2007 Theory and Practice of Cryptography: Verifying Electiosns with Cryptography [VIDEO]

Read the original HN comment ↗

Sources

Video by Google TechTalks, played through YouTube.

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks
  • SaaS & AI candidates: Topic keywords do not match
  • Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources