### 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 I MICROBENCHMARK RESULTS FOR ZERO-KNOWLEDGE CLIENT PUZZLES.

### 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 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 1. Running time and size of communication on a 2.53GMz Intel Pentium 4 running RedHat Linux. Security parameters are lscript = 32, p = 1024 bits, and q = 160 bits.

2005

"... In PAGE 17: ...AM running RedHat Linux 9.0. We simulate the certificate holder and service provider on the same machine. With p of size 1024 bits and q of size 160 bits in the Pedersen commitment scheme, and lscript = 32, the performance of two zero-knowledge proof proto- cols and two OCBE protocols is summarized in Table1 . We compare the performance of GE-ZK and GE-OCBE on different attribute sizes in Table 2, lscript = 32 is roughly two-times expensive as lscript = 16.... ..."

Cited by 10

### Table 1: Interaction styles for proof step articulation

1996

Cited by 2

### Table 12: Axioms of Standard Concurrency.

"... In PAGE 17: ...n the previous sections, several axioms (e.g. SUM8, D1, TI1) from standard CRL which can be found in Appendix 1. A step in the proof is labelled with SC, which is an acronym for Standard Concurrency, in case one or more of the axioms given in Table12 of the appendix are applied. 1.... In PAGE 23: ...1.2 Axioms of Standard Concurrency In Table12 some axioms for the merge operators, known as the Standard Con- currency laws (see [BW90]) are presented. These axioms are derivable for closed process terms without recursion.... ..."

### Table 1: Actions in the proof of NP-hardness of S-concurrent executability

"... In PAGE 61: ... Moreover, we add an action which completely clears the database, such that every feasible permutation leads to the empty database. The actions and their descriptions are given in the Table1 below. There Ati;j = VAL(xk; 1) if the j-th literal of clause Ci is xk, and Ati;j = VAL(xk; 0) if it is :xk.... ..."

### Table 11: Challenges in concurrent engineering

"... In PAGE 10: ...able 10. Experienced problems with SigSys........................................................................ 37 Table11 .... In PAGE 72: ... In addition to several services provided by standard groupware, a system for collaborative engineering communities requires functions for dealing with many different challenges of concurrent engineering in VOs. Table11 gives an overview of the challenges identified by (Gronau, 2004). Figure 24: Categorization of collaborative engineering communities Collaborative Engineering Communities Indentity of participant Intensity of interaction anonymous nickname known authenticated information communication coordination co-operation collaboration Homepages Intranets Newsgroups Groupware Portals... ..."