Results 1 - 10 of 45,364

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

in Efficient Zero-Knowledge Watermark Detection with Improved Keywords Robustness to Sensitivity Attacks ∗
by Juan Ramón, Troncoso-pastoriza Fernando Pérez-gonzález, Juan Ramón Troncoso-pastoriza, O Pérez-gonzález
"... 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.

in Non-Invasive Methods for Host Certification
by Patrick Traynor, Michael Chien, Scott Weaver, Boniface Hicks, Patrick Mcdaniel

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 .

in unknown title
by unknown authors 2006

Table 1. Service requests statistics. Requests Predicates Arguments

in Ontology-based constraint recognition for free-form service requests
by Muhammed J. Al-muhammed, David W. Embley 2007
"... In PAGE 8: ...xamples of what not to ask (e.g. not at 10:00 am or after 3:00 pm and not not at 9:00 am ). Table1 shows the number of requests and the number of included predicates and constant values in these requests. We received a total of 31 requests, which included a total of 548 constraints and a total of 170 constant values.... ..."
Cited by 4

Table 3. Round constant schedule.

in A meet-in-the-middle collision attack against the new FORK
by Markku-juhani O. Saarinen
Cited by 1

Table 3. Round constant schedule.

in A meet-in-the-middle collision attack against the new FORK
by Markku-juhani O. Saarinen
Cited by 1

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

in How to Convert Any Digital Signature Scheme Into a Group Signature Scheme
by Holger Petersen

TABLE 6 - Constants Module Access Programs Name Type Arguments Description

in Generating A Test Oracle From Program Documentation
by Dennis Peters

TABLE 6 - Constants Module Access Programs Name Type Arguments Description

in TITLE: Generating a Test Oracle From Program Documentation
by Dennis Peters, B. Eng, Supervisor Dr, David L. Parnas

TABLE 6 - Constants Module Access Programs Name Type Arguments Description

in TITLE: Generating a Test Oracle From Program Documentation
by Dennis Peters, B. Eng, Supervisor Dr, David L. Parnas
Results 1 - 10 of 45,364