### Table 8.6. Hierarchy of Structure Preserving Dynamical Systems

### Table 8.6. Hierarchy of Structure Preserving Dynamical Systems

### Table 9. Results of Bayesian network learning with local structure preserving the global structure.

2003

Cited by 1

### Table 1: Proofs of security for signature schemes Signature Proof model assumption tight/loose

2004

"... In PAGE 3: ... Our proof of security of the mNR signature provides support for the claims in [1], where this signature was introduced, but the provided analysis included incorrect arguments. Table1 includes signature schemes that have been proven secure in various settings, to facilitate a comparison with the mNR: Table 1: Proofs of security for signature schemes Signature Proof model assumption tight/loose... ..."

Cited by 4

### Table 1: Proofs of security for signature schemes Signature Proof model assumption tight/loose

"... In PAGE 3: ... Our proof of security of the mNR signature provides support for the claims in [1], where this signature was introduced, but the provided analysis included incorrect arguments. Table1 includes signature schemes that have been proven secure in various settings, to facilitate a comparison with the mNR: Table 1: Proofs of security for signature schemes Signature Proof model assumption tight/loose... ..."

### Table 1 - Application Development Trends for Digital Signature (DS) Products

"... In PAGE 3: ... Because of the high liability associated with government transactions, most businesses are reluctant to use DS technology to process transactions with the government over the Internet. As shown in Table1 , the total number of applications differs significantly across the three modes of e-business, B2C, B2B, and B2G (p lt; .0001, Chi-squared test).... In PAGE 5: ...Page 98 has been extended to secure standard and mobile phone communication. As Table1 shows, only 10% of the applications identified in our sample belong to the B2C mode of e-business. For B2C commerce, customers still prefer to use a traditional signature rather than a DS.... In PAGE 5: ... Such products aim to accelerate business processes and improve business efficiency. As shown in Table1 , our study shows that 73% of the applications identified in our sample belong to the B2B mode of e-business. Applications of DS technology in the B2B mode have been implemented in almost all types of industries.... In PAGE 5: ... Encryption technology is being used in many B2B applications such as smart-card solutions, Secure Socket Layer (SSL), and other online authentication applications, mainly because it provides security and non-repudiation of the data. Recent market trends show that there is a considerable increase in the use of DS technology in the banking and finance sectors ( Table1 ). These applications range from encryption pin pads developed by Diebold to an e-pad ... In PAGE 6: ... The market has responded to this demand with a number of developments in DS technology. This can be observed from the comparative analysis ( Table1 ) of technological developments in DS technology across all three modes of e- business. 6.... ..."

### Table 6. Results of Mantel test (correlation coefficient r and p- value) to test for significant relationship between similarity structure of observed and predicted communities in ordination space. (Dis)similarity was measured as Euclidean distance applied to sample scores on the first two and four ordination axes, respectively.

"... In PAGE 7: ... Axis 3 of the predicted data is more clearly correlated with CLOUD, axis 4 with MEADOW, WET and REDOX. The Mantel test applied on the observed and pre- dicted data shows that the general pattern of similarity structure is preserved by the model ( Table6 ). The relationship is stronger for the first two axes compared to the first four axes.... ..."

### Table 3. Taskset with tight deadlines.

"... In PAGE 5: ... Compared to the energy con- sumption of the taskset with all devices in the powered up state at all times (1125 units), this results in energy savings of almost 50%. Table3 is an example of a taskset that is more I/O- intensive. Figures 7 and 8 show the corresponding task and device schedules.... ..."

### Table 4 shows our measurements for signature generation with plain RSA, DSA and Schnorr schemes which are form basis of TS- RSA, TS-DSA, and ASM, respectively. Table 5 shows the cost of signature generation in terms of key size, where t=3. In TS-RSA, the cost in generating a partial signature is almost the same as that of RSA signature generation, but we need extra cost to compute a0

"... In PAGE 6: ... As evident from the table, ASM is the best performer. Table4 : Signature Generation Costs of Basic Schemes in msecs (P3-977MHz) Key RSA DSA Schnorr 512 1.390 1.... In PAGE 8: ... In TS-RSA, verification of the threshold signature is ex- tremely high, due to the a0 -bounded offsetting algorithm mentioned earlier. The costs of signature generation and verification in DSA and Schnorr (on which TS-DSA and ASM are based) as listed in Table4 and Table 6 are comparable, however, ASM becomes more efficient than TS-DSA because of fewer rounds. For the dynamic threshold case, TS-RSA is slightly ahead of TS-DSA because, in the latter, a considerable amount of time is spent on updating the polynomials as a consequence of the changing threshold.... ..."

### Table 4 shows our measurements for signature generation with plain RSA, DSA and Schnorr schemes which are form basis of TS- RSA, TS-DSA, and ASM, respectively. Table 5 shows the cost of signature generation in terms of key size, where t=3. In TS-RSA, the cost in generating a partial signature is almost the same as that of RSA signature generation, but we need extra cost to compute a0

"... In PAGE 6: ... As evident from the table, ASM is the best performer. Table4 : Signature Generation Costs of Basic Schemes in msecs (P3-977MHz) Key RSA DSA Schnorr 512 1.390 1.... In PAGE 8: ... In TS-RSA, verification of the threshold signature is ex- tremely high, due to the a0 -bounded offsetting algorithm mentioned earlier. The costs of signature generation and verification in DSA and Schnorr (on which TS-DSA and ASM are based) as listed in Table4 and Table 6 are comparable, however, ASM becomes more efficient than TS-DSA because of fewer rounds. For the dynamic threshold case, TS-RSA is slightly ahead of TS-DSA because, in the latter, a considerable amount of time is spent on updating the polynomials as a consequence of the changing threshold.... ..."