### Table 3. Hierarchical identity-based threshold ring signatures without random oracles.

2006

Cited by 1

### Table 5: Average performance (sec) for PG. No Rand Oracles Rand Oracles

2006

"... In PAGE 10: ... The total time to encrypt PG is given by E(PG). Table5 details the time required to perform the unopti- mized operations required to formulate PG. These values represent the encryption and decryption operations for SS and MNT elliptic curves with and without random oracles.... ..."

Cited by 9

### Table 5: Average performance (seconds) for PG. No Rand Oracles Rand Oracles

2006

"... In PAGE 14: ... The total time to encrypt PG is given by E(PG). Table5 details the time required to perform the unoptimized operations required to formulate PG. These values represent the encryption and decryption operations for SS and MNT elliptic curves with and without random oracles.... ..."

Cited by 9

### Table 1. Comparison of aggregate signature schemes. Signatures are by l signers; k is the output length of a collision resistant hash function; R.O. denotes if the security proof uses random oracles.

2006

"... In PAGE 14: ... The other uses ordinary RSA keys and can have pub- lic exponent e = 3 for fast verification, but requires key certification, like our scheme; we call this variant LMRS-2. We present the comparisons in Table1 . The size column gives signature length at the 1024-bit security level.... ..."

Cited by 11

### Table 1. Comparison of aggregate signature schemes. Signatures are by l signers; k is the output length of a collision resistant hash function; R.O. denotes if the security proof uses random oracles.

2006

"... In PAGE 14: ... The other uses ordinary RSA keys and can have pub- lic exponent e = 3 for fast verification, but requires key certification, like our scheme; we call this variant LMRS-2. We present the comparisons in Table1 . The size column gives signature length at the 1024-bit security level.... ..."

Cited by 11

### Table 3. Comparison of verifiably encrypted signature schemes. We let k be the output length of a collision resistant hash function. R.O. specifies whether the security proof uses random oracles.

2006

"... In PAGE 15: ... Table3 . The size column gives signature length at the 1024-bit security level.... ..."

Cited by 11

### Table 3. Comparison of verifiably encrypted signature schemes. We let k be the output length of a collision resistant hash function. R.O. specifies whether the security proof uses random oracles.

2006

"... In PAGE 14: ... [8] (BGLS). We present the comparisons in Table3 . The size column gives signature length at the 1024-bit security level.... ..."

Cited by 11

### Table 6: Comparison of Amounts of parallelism extracted from PASC version of code with the Enhanced simulator, with or without queuing of concurrent writes, for random graphs 6.4 How Much is Lost by Queuing Concurrent Writes

1995

"... In PAGE 29: ...Table 6: Comparison of Amounts of parallelism extracted from PASC version of code with the Enhanced simulator, with or without queuing of concurrent writes, for random graphs 6.4 How Much is Lost by Queuing Concurrent Writes Table6 shows results of running the Enhanced simulator using the PASC version of code, with and without queuing of concurrent writes. Recall that without queuing of concurrent writes this is our envisioned system.... ..."

### Table 1: Comparison of aggregate signature schemes. Signatures are by l signers; k is the output length of a collision resistant hash function; R.O. denotes if the security proof uses random oracles. Scheme R.O. Sequential Key Model Size Verification Signing

2006

"... In PAGE 13: ... The other uses ordinary RSA keys and can have public exponent e = 3 for fast verification, but requires key certification, like our scheme; we call this variant LMRS-2. We present the comparisons in Table1 . The size column gives signature length at the 1024- bit security level.... ..."

### Table 1: Comparison of aggregate signature schemes. Signatures are by l signers; k is the output length of a collision resistant hash function; R.O. denotes if the security proof uses random oracles. Scheme R.O. Sequential Key Model Size Verification Signing

in Abstract

2006

"... In PAGE 13: ... The other uses ordinary RSA keys and can have public exponent e = 3 for fast verification, but requires key certification, like our scheme; we call this variant LMRS-2. We present the comparisons in Table1 . The size column gives signature length at the 1024- bit security level.... ..."