We consider combination circuit C and some its nodes that faults are detected on the last stages of circuit fabrication. Besides, injections of Trojan Circuits (TCs) in certain circuit C lines may be ...

Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently attracted much attention. Existing solutions suffer from either significant prover overhead (i.e., high ...

A key fact in the theory of Boolean functions f: {0, 1}n → {0, 1} is that they often undergo sharp thresholds. For example, if the function f: {0, 1}n → {0, 1} is monotone and symmetric under a ...