Writing

Campaigns

Trending

  • ProVerif 2.05: Automatic Cryptographic Protocol Verifier, User Manual and Tutorial
  • Ballot secrecy: Security definition, sufficient conditions, and analysis of Helios
  • TLS 1.3 for engineers: An exploration of the TLS 1.3 specification and OpenJDK's Java implementation
  • A foundation for secret, verifiable elections
  • Automated reasoning for equivalences in the applied pi calculus with barriers
  • Secret, verifiable auctions from elections
  • Formal analysis of privacy in Direct Anonymous Attestation schemes
  • Truncating TLS Connections to Violate Beliefs in Web Applications
  • Attacking and fixing Helios: An analysis of ballot secrecy
  • Election verifiability in electronic voting protocols

Drafts5

  • Annotated biography: Free & fair elections
  • Hooking up with Fiat-Shamir
  • Score-based decisions: Influence, freedom, legitimacy
  • Overcoming Arrow's impossibility: Honeybee sidestep
  • TLS 1.3 for engineers: An exploration of the TLS 1.3 specification and OpenJDK's Java implementation

Communication13

Web, mobile, and hardware standards fail catastrophically; I break them and prove the fixes, hardening the protocols billions trust. Read the essay ›

Web5Truncation, TLS 1.3, encrypted caching

  • The Transport Layer Security (TLS) Protocol Version 1.3
  • TLS 1.3 for engineers: An exploration of the TLS 1.3 specification and OpenJDK's Java implementation
  • CryptoCache: Network Caching with Confidentiality
  • Truncating TLS Connections to Violate Beliefs in Web Applications
  • Secure Authenticated Key Exchange with Revocation for Smart Grid

Hardware4DAA, eUICC, distance bounding

  • An Overview of GSMA's M2M Remote Provisioning Specification
  • Attacks against GSMA's M2M Remote Provisioning
  • Modelling and Analysis of a Hierarchy of Distance Bounding Attacks
  • Formal analysis of privacy in Direct Anonymous Attestation schemes

Cryptography4Non-malleable encryption, Fiat-Shamir

  • Hooking up with Fiat-Shamir
  • Non-malleable encryption with proofs of plaintext knowledge and applications to voting
  • Authentication with weaker trust assumptions for voting systems
  • Adapting Helios for provable ballot privacy

Governance24

Nations are adopting election systems unfit for purpose; I pondered the meaning of free and fair governance for twenty-one years, I have my answer, and a voting system that delivers. Read the essay ›

6Tutorials, the annotated biography, auctions, social choice

  • Annotated biography: Free & fair elections
  • Overcoming Arrow's impossibility: Honeybee sidestep
  • First-past-the-post suffices for ranked voting
  • A short introduction to secrecy and verifiability for elections
  • Secret, verifiable auctions from elections
  • A foundation for secret, verifiable elections

Privacy4Ballot secrecy, receipt-freeness, coercion resistance

  • Championing tally-then-decrypt secrecy
  • Ballot secrecy: Security definition, sufficient conditions, and analysis of Helios
  • Surveying definitions of coercion resistance
  • A critique of game-based definitions of receipt-freeness for voting

6Verifiability for legitimacy

  • Surveying definitions of election verifiability
  • Election Verifiability: Cryptographic Definitions and an Analysis of Helios, Helios-C, and JCJ
  • Cast-as-Intended: A Formal Definition and Case Studies
  • Surveying global verifiability
  • Mind the Gap: Individual- and universal-verifiability plus cast-as-intended don't yield verifiable voting systems
  • Election verifiability in electronic voting protocols

8Helios, Athena, IFL: attacked, repaired, built

  • Score-based decisions: Influence, freedom, legitimacy
  • Athena: A verifiable, coercion-resistant voting system with linear complexity
  • Exploiting re-voting in the Helios election system
  • Verifiability of Helios Mixnet
  • Attacking and fixing Helios: An analysis of ballot secrecy
  • A Fair and Robust Voting System by Broadcast
  • Replay attacks that violate ballot secrecy in Helios
  • A note on replay attacks that violate privacy in electronic voting schemes

Reasoning5

Software is unpredictable, sheer complexity kills intuition; to ensure safety I exhaustively rule out every failure. Read the essay ›

Reasoning5Observational equivalence, applied pi calculus, ProVerif

  • ProVerif 2.05: Automatic Cryptographic Protocol Verifier, User Manual and Tutorial
  • Automated reasoning for equivalences in the applied pi calculus with barriers
  • Automatically Checking Commitment Protocols in ProVerif without False Attacks
  • Applied pi calculus
  • Formal verification of cryptographic protocols with automated reasoning

Everything61

$ ls -t writing/ | column
2011Applied pi calculus · IOS Presspdf