2023/05/22 by Alexandru Ioniţă, Ionita, Alexandru, D. Madhina Banu +3
Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptographic Implementations and Security #Cryptography and Data Security #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.2305.13008
openalex publication_date 2023/05/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose a method of optimizing monotone Boolean circuits by re-writing them in a simpler, equivalent form. We use in total six heuristics: Hill Climbing, Simulated Annealing, and variations of them, which operate on the representation of the circuit as a logical formula. Our main motivation is to improve performance in Attribute-Based Encryption (ABE) schemes for Boolean circuits. Therefore, we show how our heuristics improve ABE systems for Boolean circuits. Also, we run tests to evaluate the performance of our heuristics, both as a standalone optimization for Boolean circuits and also inside ABE systems.