born in 1990. PhD, lecturer. Member of CCF. Her main research interest includes secure cloud storage
born in 1999. Master candidate. Her main research interest includes spatial data security. (chenjingjing5051@163.com)
born in 1964. PhD, professor, PhD supervisor. Senior member of CCF. His main research interests include cryptography and network security, trusted computing, and critical technologies in electronic commerence. (fczhou@mail.neu.edu.cn)
born in 1978. PhD, professor and PhD supervisor. Senior member of CCF. His research interests include cryptography and network security. (jianxu@mail.neu.edu.cn)
born in 1989. PhD. His main research interests include timing analysis in embedded systems, and machine learning and its various applications in renewable energy
To address the limitations in search expressiveness and the inadequacy of verification mechanisms in existing searchable encryption methods, we propose a verifiable Boolean searchable encryption scheme based on blockchain index (VBSE-BI). The scheme first constructs a security model supporting verifiable Boolean search, and based on this model, designs an incremental secure index construction method utilizing blockchain storage structures and achieves efficient search while ensuring the tamper-proof nature of the index structure. Moreover, the scheme introduces an efficient dynamic update mechanism for the secure index, effectively avoiding the significant storage and update overhead caused by auxiliary update structures. To meet the integrity verification requirements of Boolean searches, the scheme defines the unforgeability of Boolean search results and proposes a Boolean operation integrity verification algorithm based on bilinear map accumulators and the extended Euclidean algorithm. Security analysis demonstrates that VBSE-BI scheme can resist dynamic chosen keyword attacks in the random oracle model and satisfy unforgeability under the bilinear q-strong Diffie-Hellman assumption. Compared with similar schemes, VBSE-BI not only supports more expressive Boolean search statements but also significantly reduces the user’s computational complexity to log n (where n is the number of keywords). Experimental results show that by optimizing the verification algorithm, the scheme keeps the user’s verification time consistently low (1.0−1.8 s), accounting for only 9.98%−14.03% of the server-side computation time. These findings indicate that VBSE-BI is highly suitable for resource-constrained mobile devices, providing a solid theoretical foundation and efficiency assurance for the practical application of searchable encryption.
| 科 Family | 属数 Number of genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) | 属 Genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) |
|---|---|---|---|---|---|---|
| 鹅膏菌科Amanitaceae | 2 | 11 | 5.26 | 鹅膏菌属 Amanita | 10 | 4.78 |
| 小菇科 Mycenaceae | 2 | 12 | 5.74 | 丝盖伞属 Inocybe | 5 | 2.39 |
| 多孔菌科 Polyporaceae | 8 | 14 | 6.70 | 蜡蘑属 Laccaria | 5 | 2.39 |
| 红菇科 Russulaceae | 3 | 23 | 11.00 | 小皮伞属 Marasmius | 6 | 2.87 |
| 小菇属 Mycena | 11 | 5.26 | ||||
| 光柄菇属 Pluteus | 5 | 2.39 | ||||
| 红菇属 Russula | 17 | 8.13 | ||||
| 栓菌属 Trametes | 5 | 2.39 |