Paper 2026/1003

A Blockchain-Based Access Control Scheme with Hidden Attributes and Policies Using Commitments and Zero-Knowledge Proofs

Yuanshao Liang, School of Electronic and Computer Engineering, Peking University, Shenzhen 518055, China
Hui Li, School of Electronic and Computer Engineering, Peking University, Shenzhen 518055, China
Wenhui Hu, China Mobile Internet Co., Ltd., Guangzhou 510000, China
Baocheng Yan, China Telecom Digital Intelligence Technology Co., Ltd., Room 1308, 13th Floor, East Tower, No. 33 Fuxing Road, Haidian District, Beijing 100036, China
Kedan Li, Department of Computer Science, University of Illinois Urbana-Champaign, Champaign, IL 61801, USA
Naixing Wu, China Unicom Shenzhen Branch, Shenzhen 518046, China
Abstract

Blockchain provides public verifiability for access control in Internet of Things (IoT) data sharing, but its transparency can expose requester attributes, access policies, and their satisfaction relations. Existing privacy-preserving approaches often protect only one side of the authorization decision or rely on pairing-based ABE/HVE, interactive homomorphic computation, or circuit-specific proof parameters. This paper proposes a blockchain-based access control scheme that verifies authorization over hidden, authenticated inputs using commitments and non-interactive zero-knowledge proofs. Requester attributes and access policies are encoded as vectors. Multiple attribute authorities sign requester-bound local commitments, while the data provider independently commits to the policy vector. The requester proves that the committed vectors satisfy the required inner-product relation through a linked commit-and-prove protocol using a Bulletproof inner-product argument. A smart contract verifies the authority evidence, commitment aggregation, and access proof while learning only the authorization result. We formally establish policy hiding, attribute hiding, and authenticated attribute integrity. The recursive inner-product argument makes the dominant per-request access-verification communication grow logarithmically with the vector dimension. We implement a Rust experimental prototype and make the source code, benchmark configurations, results, and plotting scripts publicly available. Experiments over vector dimensions from 16 to 512 quantify the communication and computation costs. At the largest evaluated dimension, the modeled access-verification record remains below 1 KB, while final decryption takes 0.103 ms. These results indicate that the scheme supports bilateral authorization privacy and public verifiability without pairing-based authorization or circuit-specific trusted setup.

Note: Source code and benchmark artifacts for the experimental protocol prototype are available at https://github.com/liangyuanshao/zk_vector_commitment_access_control. The repository documents the implemented protocol components and the current proof-simulation boundary.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
access controlblockchainnon-interactive zero-knowledge proofsvector commitmentsBulletproofs
Contact author(s)
lys @ stu pku edu cn
lih64 @ pkusz edu cn
huwenhui @ cimic chinamobile com
yanbc @ chinatelecom cn
kedanli2 @ illinois edu
wunx1 @ chinaunicom cn
History
2026-07-14: revised
2026-05-20: received
See all versions
Short URL
https://ia.cr/2026/1003
License
Creative Commons Attribution-NonCommercial-NoDerivs
CC BY-NC-ND

BibTeX

@misc{cryptoeprint:2026/1003,
      author = {Yuanshao Liang and Hui Li and Wenhui Hu and Baocheng Yan and Kedan Li and Naixing Wu},
      title = {A Blockchain-Based Access Control Scheme with Hidden Attributes and Policies Using Commitments and Zero-Knowledge Proofs},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1003},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1003}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.