惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

MyScale Blog
MyScale Blog
Apple Machine Learning Research
Apple Machine Learning Research
H
Help Net Security
雷峰网
雷峰网
V
Visual Studio Blog
G
Google Developers Blog
Microsoft Azure Blog
Microsoft Azure Blog
Hugging Face - Blog
Hugging Face - Blog
爱范儿
爱范儿
IT之家
IT之家
Engineering at Meta
Engineering at Meta
Microsoft Security Blog
Microsoft Security Blog
aimingoo的专栏
aimingoo的专栏
大猫的无限游戏
大猫的无限游戏
M
MIT News - Artificial intelligence
月光博客
月光博客
A
About on SuperTechFans
B
Blog RSS Feed
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
The GitHub Blog
The GitHub Blog
N
Netflix TechBlog - Medium
J
Java Code Geeks
云风的 BLOG
云风的 BLOG
Blog — PlanetScale
Blog — PlanetScale

Cryptology ePrint Archive

Formalizing and Strengthening the Security Proof of NTOR Verifiable Anomaly and Similarity Detection Using Matrix Profile in Private Time-series Adaptor Signature Schemes with Deniable Presignatures Privacy Coins Under Viewing Key Compromise Adaptively-Secure Flexible and Identity-Based Broadcast Encryption from Decomposed LWE MERIDIAN: A Toroid-Inspired Permutation Block Cipher for Constrained Environments PPML Is More Vulnerable to Cryptanalytic Extraction Attacks Toward Practical Fair Data Exchange: Eliminating In-Circuit Public-Key Operations Fault Injection Attacks Against zkSTARKs Scale, Round, Break: Simple Leakage Attacks on Secret Sharing Schemes Private Delegation of (Non-)Membership Proof Updates in Cryptographic Accumulators Beyond Binary: crosscorrelation of Cubic, Quartic and Quintic Character Sequences ZEE200: Zero Knowledge for Everything and Everyone @ 200 KHz A Post-Quantum Accountable Sanitizable Signature Scheme Based on Unbalanced Oil and Vinegar Better Usability: Leakage-Resistant AEADs from Single-length Blockciphers TieredOMap: Skewness-Aware Oblivious Map From Rerandtopia to Interceptopia, the Anamorphic Encryption Saga Rises Non-Adaptive Programmable PRFs and Applications to Stacked Garbling Practical Post-Quantum Secure Publicly Verifiable Secret Sharing and Applications Mosaic: Practical Malicious Security for Garbled Circuits on Bitcoin Efficient Bootstrapping of Matrices in FHE Decomposing Multiplication: A Vertical Packing Approach for Faster TFHE Formal Verification, Integration and Physical Evaluation of Prime-Field Masking on Silicon New Techniques for Communication-Efficient Secure Comparison Protocols Pairing-Based Verifiable Shuffles with Logarithmic-Size Proofs Verifying Provenance of Digital Media: Security Analysis of C2PA and its Implementation EQuADiSE: Efficient Quantum-safe Adaptive Distributed Symmetric-key Encryption Oriole: Adaptively Secure Partially Non-Interactive Threshold Signatures from Lattices Secure and Updatable Single Password Authentication Panther: Robust Hybrid KEM Combiners via Structural Splicing
Batch-Puncturing Circuit CP-ABE (and More) from Lattices
Yongkang Lang, Xidian University · 2026-04-21 · via Cryptology ePrint Archive

Paper 2026/783

Batch-Puncturing Circuit CP-ABE (and More) from Lattices

Fangguo Zhang, Sun Yat-sen University

Jianghong Wei, State Key Laboratory of Mathematical Engineering and Advanced Computing

Xinyi Huang, Jinan University

Abstract

Puncturable attribute-based encryption ($\mathsf{PABE}$) not only supports fine-grained access control over encrypted data, but also enables users to revoke the decryption capability for specific messages by puncturing tags, thereby achieving fine-grained forward security. It finds wide applications in scenarios such as sharing government classified documents and personal health records. However, existing $\mathsf{PABE}$ schemes only support tag-by-tag puncturing, where each puncturing operation is done through key delegation, which causes the key size to grow with the number of punctured tags. This inefficiency makes $\mathsf{PABE}$ impractical in scenarios that require frequent puncturing or mass revocations. To address this limitation, it is crucial to support batch puncturing of tags, i.e., the decryption capability for messages associated with multiple tags can be revoked simultaneously via a single puncture. In this work, we construct a ciphertext-policy attribute-based encryption ($\mathsf{CPABE}$) scheme for circuits with batch-puncturing. Notably, the size of the punctured key in our scheme is independent of the number of punctured tags, as well as the size and depth of the circuits. This is achieved by leveraging the evasive learning with errors ($\mathsf{LWE}$) and tensor $\mathsf{LWE}$ assumptions. In addition, we observe that puncturable $\mathsf{CPABE}$ can be re-stated by dual-policy $\mathsf{ABE}$ ($\mathsf{DPABE}$) with key delegation, and generalize batch-puncturing $\mathsf{CPABE}$ to provide the first lattice-based construction of $\mathsf{DPABE}$ for circuits. Moreover, inspired by the observation of Agrawal and Yamada (Eurocrypt '20), we introduce the puncturing property into optimal broadcast encryption ($\mathsf{BE}$), capturing a new primitive called puncturable $\mathsf{BE}$, which allows the receiver to securely erase sensitive messages without communicating with the authority.

BibTeX

@misc{cryptoeprint:2026/783,
      author = {Yongkang Lang and Fangguo Zhang and Jianghong Wei and Xinyi Huang and Xiaofeng Chen},
      title = {Batch-Puncturing Circuit {CP}-{ABE} (and More) from Lattices},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/783},
      year = {2026},
      url = {https://eprint.iacr.org/2026/783}
}