Crate lox_library

source ·
Expand description

Implementation of a new style of bridge authority for Tor that allows users to invite other users, while protecting the social graph from the bridge authority itself.

We use CMZ14 credentials (GGM version, which is more efficient, but makes a stronger security assumption): “Algebraic MACs and Keyed-Verification Anonymous Credentials” (Chase, Meiklejohn, and Zaverucha, CCS 2014)

The notation follows that of the paper “Hyphae: Social Secret Sharing” (Lovecruft and de Valence, 2017), Section 4.

Modules

  • bridge_table
    The encrypted table of bridges.
  • cred
    The various credentials used by the system.
  • dup_filter
    Filter duplicate shows of credentials and open invitations by id (which will typically be a Scalar).
  • migration_table
    The migration table.
  • proto
    The protocol modules.

Structs

Enums

  • ExceededMaxBridgesError
    This error is thrown after the MAX_DAILY_BRIDGES threshold for bridges distributed in a day has been reached
  • NoAvailableIDError
    This error is thrown if the number of buckets/keys in the bridge table exceeds u32 MAX.It is unlikely this error will ever occur.
  • ReplaceSuccess
    ReplaceSuccess sends a signal to the lox-distributor to inform whether or not a bridge was successfully replaced

Constants

  • EXPIRY_DATE
  • MAX_DAILY_BRIDGES
    TODO: Decide on maximum daily number of invitations to be distributed
  • OPENINV_K
    Number of times a given invitation is ditributed
  • OPENINV_LENGTH
    An open invitation is a [u8; OPENINV_LENGTH] where the first 32 bytes are the serialization of a random Scalar (the invitation id), the next 4 bytes are a little-endian bucket number, and the last SIGNATURE_LENGTH bytes are the signature on the first 36 bytes.

Functions