### Table 2. Comparison of several bilinear pairing algorithms

2006

Cited by 3

### Table 1. Comparison of ID-based Ring Signature from Bilinear Pairings

2005

"... In PAGE 9: ... Before our proposal, the scheme that requires the least number of pairing operations is [4]. Table1 shows a summary of the efficiency of our proposed scheme. Taken into account the total cost of the signature generation and verification, we can see that our proposed scheme is the only scheme using a constant number of pairing operations, and with the least total amount of other operations.... ..."

Cited by 8

### Table 1: Efficiency comparison for ElGamal variants in terms of ciphertext size, where |g|, |mac|, and |M| are sizes for a group element, an authentication tag, and a plaintext, respectively. For concreteness, one can think of |mac| = 128. DBDH and square-DBDH means the decisional bilinear Diffie-Hellman assumption [14] and the decisional square bilinear Diffie-Hellman assumption [32], respectively. ciphertext size assumption security bilinear group

2006

"... In PAGE 15: ... This method does not require any additional assumption. 5 Comparison Here, we discuss comparison among ElGamal variants in terms of ciphertext size, and it is summarized in Table1 . So far, under the DDH assumption the Kurosawa-Desmedt scheme [33] is considered as the most efficient scheme, and its ciphertext overhead is two group elements and an authentication tag.... ..."

Cited by 2

### Table 1: Matrix of outsourcing opportunities

2001

"... In PAGE 4: ... In all these cases, the delegation of functions and resulting division of labor and cooperation between human, computational and/or physical agents are the main distinguishing feature. It is convenient to construct a matrix of our outsourcing opportunities ( Table1 ) representing the possible combinations of three types of agents within multi-agent genetic algorithms.... In PAGE 4: ...Table 1: Matrix of outsourcing opportunities In Table1 , the ordering of columns re ects the costs of performing the function of selection. Computation modeling is usually the cheapest way to evaluate solutions if it is applicable, hu- man subjective evaluation is more expensive, and, nally, real world experimentation is the most expensive way to evaluate a potential solution or idea.... In PAGE 4: ... Computation modeling is usually the cheapest way to evaluate solutions if it is applicable, hu- man subjective evaluation is more expensive, and, nally, real world experimentation is the most expensive way to evaluate a potential solution or idea. The structure of Table1 can be explained by the economic theoryand the concept of altermative costs. Why certain tasks t into certain cells? Apparently, this is a consequence of alternative costs... In PAGE 7: ... This approach was used in the application of HBGA that will be described in secotion 5. 5 HUMAN AGENTS As shown in Table1 , HBGA can be viewed as an extension of IGA. While IGA uses only human judgment, HBGA uses a balanced approach allowing and encouraging both judgment and creative potential of participants in the form of evaluation and recombination, correspondingly.... In PAGE 12: ... As a consequence, they allow adding and removing agents without interrupting the whole evolutionary process. There are many opportunities this approach o ers to us and our table of outsourcing opportu- nities ( Table1 ) and analysis of alternative costs is a good way to nding such opportunities where multi-agent GAs can be used successfully. Acknowledgments The author would like to thank the participants of the Free Knowledge Exchange who supported his research on HBGA, contributed the materials included in this paper and granted the right to publish them under the conditions of the Success Formula Community Agreement.... ..."

Cited by 2

### Table 1. Efficiency comparison

2005

"... In PAGE 11: ...tion schemes, implemented according to their original descriptions. Table1 sum- marises the number of relevant basic operations underlying several identity-based signcryption and signature schemes, namely, GT exponentiations, scalar point multiplications, and pairing evaluations, and compares the observed processing times (in milliseconds) for a supersingular curve of embedding degree k = 6 over F397, using implementations written in C++ and run on an Athlon XP 2 GHz. Subtleties in the algorithms determine somewhat different running times even when the operation counts for those algorithms are equal.... ..."

Cited by 10

### Table 4.4 summarizes these results and allows to compare the proposed algorithms and methods. Moreover, it allows to combine them to form an efficient and secure system.

in by

2006

### Table 1: Performance of Uncoupled Bilinear Programming Algorithm UBPA on Training Set

1993

"... In PAGE 11: ... These results are summarized in Tables 1 and 2 and in Figures 8 and 9. Table1 summarizes the training set performance on the uncoupled problems using UBPA 2.1.... ..."

Cited by 24

### Table 1: Performance of Uncoupled Bilinear Programming Algorithm UBPA on Training Set

1993

"... In PAGE 11: ... These results are summarized in Tables 1 and 2 and in Figures 8 and 9. Table1 summarizes the training set performance on the uncoupled problems using UBPA 2.1.... ..."

Cited by 24

### Table 1: Algorithm Efficiency

1991

Cited by 2

### Table 2 The efficiency of the algorithm

"... In PAGE 6: ... The sim- ulation method is the same as above and the degree of false alarm is equal to 5%. The discord detection rates from the simulation and analytical model are shown in Table2 . Notice that they are very close, which verifies the effectiveness of the proposed model.... ..."