### Table 2: Zero-knowledge subproofs and their communication complexity.

"... In PAGE 12: ... also developed a ZK watermark detection protocol for ST-DM in [23]. 3 Zero-Knowledge Subproofs The proofs that are employed in the previous zero-knowledge detectors and in the Generalized Gaussian one are shown in Table2 with their respective communication complexity, which has been calculated... ..."

### Table 4.1: Three private set protocols compared in different security settings. ROM stands for Random Oracle Model , NIZK for Non-Interactive Zero Knowledge , and UC for Universally Composable .

2006

### TABLE I MICROBENCHMARK RESULTS FOR ZERO-KNOWLEDGE CLIENT PUZZLES.

### Table 1. Honest veri er Zero-Knowledge-Proof Proof9LOGEQ Theorem 1 (following [Scho93]) The protocol in table 1 is a witness indis- tinguishable proof of knowledge of xi satisfying yi xi (mod p) and z xi (mod p) for some i 2 [1 : n]: Proof 1: 1. Completeness: The following equivalences hold by construction of the proof: i = 1 : s1 x1c1+k1 yc1 1 r1 (mod p); s1 x1c1+k1 zc1t1 (mod p); i 2 : si ki yci i kiy?ci i

### Table 6: Non-interactive ad hoc trials

1995

"... In PAGE 12: ... 4 In a few cases this resulted in the #0Cnal query containing less than the speci#0Ced number of terms. 5 Note that the average precision, R#7Bprecision and recall #0Cgures in Table6 are arti#0Ccially low because we used the full set of disks... ..."

Cited by 83

### Table 6.4: Workload for non-interactive applications

1999

Cited by 1

### Table 6 shows the running time for the three non-interactive

### Table 1 presents some results regarding the computational cost of cell-level and fluid-level simulations. Both the NIST simulator and FluidSim were compiled using the same development tools and run on the same architecture (a PowerPC-based computer); moreover, the NIST simulator was executed in non-interactive mode, so as to optimize its performance. Table 1 Example 2: results on simulation efficiency

### Table 3: Statistics for the number of pairs of non-interacting requests over 30 random and optimal permutations.

2004

"... In PAGE 4: ... We also compute the average number of pairs of non-interacting requests over 30 permutations evaluated as best known values by Genitor. The results of the pairwise sensitivity test are summarized in Table3 . The second column Total Pairs represents the total number of request pairs in the permutation (if there are n requests, the number in this column is n(n 1)=2).... ..."

Cited by 6

### Table 3: Statistics for the number of pairs of non-interacting requests over 30 random and optimal permutations.

2004

"... In PAGE 4: ... We also compute the average number of pairs of non-interacting requests over 30 permutations evaluated as best known values by Genitor. The results of the pairwise sensitivity test are summarized in Table3 . The second column Total Pairs represents the total number of request pairs in the permutation (if there are D2 requests, the number in this column is D2B4D2 A0 BDB5BPBE).... ..."

Cited by 6