### Table 1: Comparison of HIBE protocols Secure in sID/s+ID Model. protocol security id public max pvt decryption

"... In PAGE 8: ... However, the actual details for these applications will be a little different from what is mentioned in [4]. A comparison of the features of G1 with the BB-HIBE and the BBG-HIBE is given in Table1 for h-level HIBEs. Here the column decryption subkey size denotes the number of elements of the private key which is actually required for decryption.... ..."

### Table 1: Dependency of parameters of our fs-HIBE, MHIBE, and fs-BE schemes on the total number N of time periods, the length h of an ID-tuple, the number m of ID-tuples in an identity-set in MHIBE, the total number E of fs-BE users and the number r of actual revoked users in fs-BE scheme. Key generation time of fs-HIBE and MHIBE is the time to generate secret keys for a child node by the parent. Key generation time of fs-BE scheme is the running time of Reg algorithm.

2004

"... In PAGE 5: ... The formal definitions and proofs of the scheme are given in the paper. The complexities of various parameters in our fs-HIBE scheme are summarized in Table1 and are discussed in Section 6.... In PAGE 17: ...The complexities of various parameters of our MHIBE scheme are shown in Table1 in Section 6. 6 Discussions We analyze the complexity of our fs-HIBE scheme, the generalized MHIBE scheme, and the fs- BE scheme in Table 1 showing running time complexities and key sizes.... In PAGE 17: ...The complexities of various parameters of our MHIBE scheme are shown in Table 1 in Section 6. 6 Discussions We analyze the complexity of our fs-HIBE scheme, the generalized MHIBE scheme, and the fs- BE scheme in Table1 showing running time complexities and key sizes. Key generation time of fs-HIBE and MHIBE is the time to generate secret keys for a child node by the parent.... ..."

Cited by 13

### Table 1: Dependency of parameters of our fs-HIBE, MHIBE, and fs-BE schemes on the total number N of time periods, the length h of an ID-tuple, the number m of ID-tuples in an identity-set in MHIBE, the total number E of fs-BE users and the number r of actual revoked users in fs-BE scheme. Key generation time of fs-HIBE and MHIBE is the time to generate secret keys for a child node by the parent. Key generation time of fs-BE scheme is the running time of Reg algorithm.

2004

"... In PAGE 5: ... The formal definitions and proofs of the scheme are given in the paper. The complexities of various parameters in our fs-HIBE scheme are summarized in Table1 and are discussed in Section 6.... In PAGE 17: ...The complexities of various parameters of our MHIBE scheme are shown in Table1 in Section 6. 6 Discussions We analyze the complexity of our fs-HIBE scheme, the generalized MHIBE scheme, and the fs- BE scheme in Table 1 showing running time complexities and key sizes.... In PAGE 17: ...The complexities of various parameters of our MHIBE scheme are shown in Table 1 in Section 6. 6 Discussions We analyze the complexity of our fs-HIBE scheme, the generalized MHIBE scheme, and the fs- BE scheme in Table1 showing running time complexities and key sizes. Key generation time of fs-HIBE and MHIBE is the time to generate secret keys for a child node by the parent.... ..."

Cited by 13

### Table 1: Dependency of parameters of our fs-HIBE, MHIBE, and fs-BE schemes on the total number N of time periods, the length h of an ID-tuple, the number m of ID-tuples in an identity-set in MHIBE, the total number E of fs-BE users and the number r of actual revoked users in fs-BE scheme. Key generation time of fs-HIBE and MHIBE is the time to generate secret keys for a child node by the parent. Key generation time of fs-BE scheme is the running time of Reg algorithm.

"... In PAGE 5: ... The formal definitions and proofs of the scheme are given in the paper. The complexities of various parameters in our fs-HIBE scheme are summarized in Table1 and are discussed in Section 6.... In PAGE 17: ...The complexities of various parameters of our MHIBE scheme are shown in Table1 in Section 6. 6 Discussions We analyze the complexity of our fs-HIBE scheme, the generalized MHIBE scheme, and the fs- BE scheme in Table 1 showing running time complexities and key sizes.... In PAGE 17: ...The complexities of various parameters of our MHIBE scheme are shown in Table 1 in Section 6. 6 Discussions We analyze the complexity of our fs-HIBE scheme, the generalized MHIBE scheme, and the fs- BE scheme in Table1 showing running time complexities and key sizes. Key generation time of fs-HIBE and MHIBE is the time to generate secret keys for a child node by the parent.... ..."

### Table 1. kuhnian and lakatosian visions to the emergence of the agent-orientation.

"... In PAGE 12: ... The protective belt of the agent-orientation research program would be characterized by the evolution towards a methodology of SE allowing to develop very important projects implying an intensive implication of the users (see for exam- ple [Wautelet05, Do03, Faulkner05]). Table1 presents a summary of the opposition between the kuhnian and the lakato- sian epistemologies applied to the emergence of agent-orientation. The kuhnian epistemology : the paradigm Critics of the kuhnian epistemology The lakatosian epistemology : the research program Emergence of Knowledge : Crisis or Problem shift ? Existence of a meth- odological crisis al- lowing the emer- gence of a new para- digm.... ..."

### Table 1. Comparison of Target Systems TMR Prototype A TMR Prototype B TMR Prototype C

1996

"... In PAGE 1: ... An im- plementation is in progress for a third Tandem prototype ma- chine (Duplex Prototype C), which is based on the Tandem ServerNet architecture[1]. A brief comparison of the three machines is given in Table1 . Because these machines are prototypes, the results are not necessarily representative of production systems.... ..."

Cited by 34

### Table 1. Comparison of Target Systems TMR Prototype A TMR Prototype B TMR Prototype C

1996

"... In PAGE 1: ... An im- plementation is in progress for a third Tandem prototype ma- chine (Duplex Prototype C), which is based on the Tandem ServerNet architecture[1]. A brief comparison of the three machines is given in Table1 . Because these machines are prototypes, the results are not necessarily representative of production systems.... ..."

Cited by 34

### Table 1. Open SGI/CRAY Computing System Model Quan #

### Table 1. OPEN SGI/CRAY HIGH PERFORMANCE COMPUTING SYSTEM

"... In PAGE 5: ... Configuration at Los Alamos The High Performance Computing Environment at Los Alamos includes SGI/Crays and HPSS in both the secure and open networks. As shown in Table1 , the open SGI/Crays are configured as nodes with n x 32 MIPS R10K processors, where n=1-4, for a total of 768 processors and 192 GB of memory. As shown in Table 2, the secure SGI/Crays are configured as nodes with 64 MIPS R10K processors for a total of 1024 processors and 256 GB of memory.... ..."