ArticlePloS one2026
BAAR: A framework for blockchain-based anonymous and revocable user authentication scheme.
Article in PloS one, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Blockchain-based systems increasingly require authentication mechanisms that simultaneously preserve user privacy, support accountability, and enable efficient credential revocation. However, most existing anonymous authentication schemes rely on pairing-based cryptography which introduce high computational overhead and limit deploy ability on widely adopted blockchain platforms such as Ethereum. This paper presents BAAR, a Blockchain-based Anonymous and Revocable authentication framework designed entirely within the discrete logarithm setting over the secp256k1 elliptic curve. BAAR integrates Pedersen vector commitments, Schnorr-based zero-knowledge proofs, and a Merkle-tree-based dynamic accumulator to support anonymous and unlinkable authentication with selective attribute disclosure and public, auditable revocation. Authentication and proof verification are performed off-chain, while the blockchain maintains only a compact revocation state, significantly reducing on-chain computation and gas costs. A formal security analysis demonstrates unforgeability, unlinkability, attribute privacy, and revocation soundness under standard cryptographic assumptions in the random oracle model. A prototype implementation on Ethereum confirms that BAAR achieves low gas consumption, logarithmic-time revocation, and scalable performance with respect to both the number of users and attributes. These results indicate that BAAR provides a practical balance between strong privacy guarantees and deploy ability, making it suitable for real-world blockchain-based identity and access-control systems.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.