We prove a lower bound on the size of commitments and openings of algebraic vector commitment schemes with transparent public parameters in Maurer’s Generic Group Model with pairings, and give a pairing-based scheme that beats the lower bound for schemes without pairings.

Extending a Tamarin model of FIDO2 to capture inexperienced users making errors during protocol execution, together with a redefined model of agent compromise centred on the user’s view of the protocol.

An analysis of Single Sign-On implementations and deployments focusing on OpenID, uncovering an account-hijacking pattern on newspaper websites and a JSON-format-oracle attack against an identity provider library.

Digital signature schemes based on one-way or hash functions that can sign a predetermined number of messages: a lower bound on signature size in terms of that number, and the benefits of letting signatures depend on previously signed messages.