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.

翻译：我们提出了一种通过重写单调布尔电路为更简单等价形式的方法来优化它们。我们总共使用了六种启发式算法：爬山法、模拟退火法及其变体，这些算法基于电路的逻辑公式表示进行操作。我们的主要动机是提升布尔电路属性基加密（ABE）方案的性能。因此，我们展示了启发式算法如何改进布尔电路ABE系统。同时，我们通过实验评估了这些启发式算法的性能，既包括作为布尔电路独立优化方法的表现，也包括在ABE系统内部的效果。