ATProto Browser

Record data

{
  "uri": "at://did:plc:fwa55bujvdrwlwlwgqmmxmuf/app.bsky.feed.post/3loc5pbej2g2i",
  "cid": "bafyreicf7mbiyrwi6bmbyec6m2imp4qdlqvztbpeajtacol5ebacljbowe",
  "value": {
    "text": "Unbiasable Verifiable Random Functions from Generic Assumptions (Nicholas Brandt) ia.cr/2025/766",
    "$type": "app.bsky.feed.post",
    "embed": {
      "$type": "app.bsky.embed.images",
      "images": [
        {
          "alt": "Abstract. We present conceptually simple constructions of verifiable random functions (VRF) that fulfill strong notions of unbiasability recently introduced by Giunta and Stewart [EC:GS24]. VRFs with such strong properties were previously only known in the random oracle model or from the decisional Diffie–Hellman assumption with preprocessing. In contrast, our constructions are based on generic assumptions and are thus the first to be plausibly post-quantum secure. Moreover, our constructions fulfill several additional properties such as: • If the underlying VRF is aggregate, key-homomorphic or computable in NC¹, then so is our VRF. • For any verification key, the VRF output has almost the same min-entropy as the VRF input. Lastly, we outline a path towards a lattice-based VRF (without setup).\n",
          "image": {
            "$type": "blob",
            "ref": {
              "$link": "bafkreiemrbviejutrzervouiqc43dp6e3umkyztaooo25fd5f2kdn4d6aq"
            },
            "mimeType": "image/png",
            "size": 76749
          },
          "aspectRatio": {
            "width": 1200,
            "height": 800
          }
        }
      ]
    },
    "facets": [
      {
        "index": {
          "byteEnd": 96,
          "byteStart": 82
        },
        "features": [
          {
            "uri": "https://ia.cr/2025/766",
            "$type": "app.bsky.richtext.facet#link"
          }
        ]
      }
    ],
    "createdAt": "2025-05-03T20:14:31.432772Z"
  }
}