### Table 2: 10% of the gates included in five Black Boxes circuit in out #nodes detected errors #nodes implementation peak during check run time

2001

"... In PAGE 5: ... In a second experiment we varied the generation of partial imple- mentations of our first experiment to obtain 5 different Black Boxes instead of one. Results are given in Table2 . Memory consumption and run times are about in the same range compared to the first ex- periment with the exception of circuit C880 where time and mem- ory consumption for output and input exact checks increase (about 2Since in the case of one Black Box the input exact check is exact, an average of 91% detected errors means, that for the remaining 9% of the cases our circuit modification described above did not really insert an error into the partial implementation, i.... ..."

Cited by 17

### Table 2: 10% of the gates included in five Black Boxes circuit in out #nodes detected errors #nodes implementation peak during check run time

"... In PAGE 5: ... In a second experiment we varied the generation of partial imple- mentations of our first experiment to obtain 5 different Black Boxes instead of one. Results are given in Table2 . Memory consumption and run times are about in the same range compared to the first ex- periment with the exception of circuit C880 where time and mem- 2Since in the case of one Black Box the input exact check is exact, an average of 91% detected errors means, that for the remaining 9% of the cases our circuit modification described above did not really insert an error into the partial implementation, i.... ..."

### Table 1: MD5 on a one BlackBox

"... In PAGE 6: ... The difference between these solutions consists in the number of BlackBoxes avail- able in the Caronte architecture. Table1 shows the exe- cution time of a 512-bit block elaboration on a system with only one BlackBox, that means that it is necessary to recon- figure before each round, with a fixed reconfiguration time of 40 ms. Table 1: MD5 on a one BlackBox... ..."

### Table 2: 40% of the gates included in one Black Box circuit in out #nodes detected errors #nodes implementation peak during check run time

2001

"... In PAGE 12: ... In a second experiment we varied our method to generate partial implementations: the number of gates to be included in a Black Box was changed from 10% to 40%. The results are given in Table2 . We can observe that the improvement in accuracy for the more exact checks compared to the less exact checks is slightly larger in this scenario.... ..."

Cited by 17

### TABLE III BLACK-BOX BEHAVIOR OF NG, CI, AND CT

### Table 1: Comparison of the main construction of this paper to previous Public-Key Traitor Tracing Schemes. Note that BB stands for Black-Box, and BB-Confirmation stands for the black-box confirmation method of [3] that requires exponential-time. The parameters used in the table are n=# of users, r=# of revocations. Note that unlimited means that any polynomial number of users (in the security parameter) can be supported.

2003

"... In PAGE 2: ... None of the previous public-key traitor tracing schemes with revocation capability [20, 22, 9, 10] possessed this crucial property. In Table1 we compare our construction to previ- ous public-key schemes. 2.... ..."

Cited by 2

### TABLE I ANALYSIS WITH PACKETS AS BLACK BOXES

1986

Cited by 166

### Table 1. Black Box Performance for Prime Fields

"... In PAGE 14: ... The genus 3 black box performs roughly 1.8 million group operations per second ( Table1 ), and the CPU time per curve is about 20 seconds on a 2.5 GHz AMD Athlon-64.... ..."

Cited by 1

### Table 2: Average number of black box probes

2000

"... In PAGE 8: ... Nowwe interpolate each corresponding polynomial under di#0Berent embedded algorithms on a relatively large modulus 100003. Table2 lists the average number of blackbox probes needed after ten runs. Both Newton and Ben-Or#2FTiwari thresholds are set to one by default.... ..."

Cited by 13