commit | d3b73824217e2300a94f9aa5f0f90e7575f3f300 | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Tue Dec 05 11:50:56 2023 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Tue Dec 05 11:50:56 2023 +0000 |
tree | a13d263ac4e39c976b0c912228d44557961dbedf | |
parent | b919e15703335864c428f26df5770ccfce4f7c20 [diff] | |
parent | 4fd15465c364df9b8a5976ca19a99cd11f9e200a [diff] |
Snap for 11178562 from 4fd15465c364df9b8a5976ca19a99cd11f9e200a to mainline-art-release Change-Id: I89b03d52e550e2ed66411e08421fa1328aa5922f
An anonymous counting token (ACT) scheme allows Clients to obtain blind signatures or MACs (aka tokens) on messages of their choice, while at the same time enabling Issuers to enforce rate limits on the number of tokens that a client can obtain for each message. Specifically,
This repository implements a variant of the scheme described in [1], which is secure in the random oracle model under the q-DDHI assumption (in a cyclic group) and the DCR assumption. The variant implemented here relaxes the proven soundness guarantee to the non-concurrent setting. It also assumes that the server generates its parameters correctly. Future versions will support server proofs for correct parameter generation.
This implementation also supports batched token issuance. Batched token issuance can have significant performance benefits as compared to individual token issuance.
[1] "Anonymous Counting Tokens." Fabrice Benhamouda, Mariana Raykova, Karn Seth.
This repository requires Bazel. You can install Bazel by following the instructions for your platform on the Bazel website.
Once you have installed Bazel you can clone this repository and run all tests that are included by navigating into the root folder and running:
bazel test //...
This is not an officially supported Google product. The code is provided as-is, with no guarantees of correctness or security.