### Table 4: An example of chameleon hash generation based on claw-free permutations

### Table 8: Rating procedure followed in the tests.

"... In PAGE 31: ... The EuroNCAP rating variable has been introduced in the analysis with such purpose. As EuroNCAP rates each test individually to give a final rating to the car, the rating procedure followed by EuroNCAP (EuroNCAP 2004) has been applied in this point, with some remarks (* and **, see Table8 ) to the whole set of tests. Table 8: Rating procedure followed in the tests.... ..."

### Table 3 Total Labor Force Participation (%)

"... In PAGE 8: ... The data show, however, that Japan had fewer such persons to draw on than other countries. Overall labor force participation rates ( Table3 ) were higher in Japan in 1969 (65.6%) than in France (55.... ..."

### Table 4: Weekday Duration Choice, Adults 18-65 pursuing all four primary activities (home, work, shop, other)

"... In PAGE 22: ... Furthermore, a number of variables are dummy variables describing a range of value, one class of the dummy for each variable (for instance one of the four seasons) is suppressed for a similar reason. The model is estimated using the Alogit package (Daly 1993) Table4 presents the results of this weighted logit analysis. The largest part of the explanatory value of the model falls on the activity specific constants.... In PAGE 47: ...Page: 48 Table4 : Continued (Summary Statistics) Summary Statistics Value N 752 Likelihood with zero coefficients -375297 Likelihood with constants only -281194 Final value of likelihood -276186 Rho-Squared w.... ..."

### Table 2. Time Gain Using Zero-Forced Lattices

"... In PAGE 7: ... Finally, the extrapolation line for NTRU 107 in [3] is log(T ) 0:1339N ? 2:9983; which leads to an optimal r = 16. We collect all of this information in Table2 , which also gives the gain, the probability that a randomly chosen LZF will be a winning lattice, and the expected time T (in MIPS-years) to nd and break a winning zero- forced lattice. (The corresponding times for standard NTRU lattices are given in... ..."

### Table 1. Proven lower bounds on security in the random-oracle model relative to roots (for RSA) or factorization (for Rabin/Williams). 1996 Bellare/Rogaway proved tight security for RSA and outlined a proof for unstructured Rabin/Williams, but specifically prohibited principal Rabin/ Williams and required large B. 1999 Kurosawa/Ogata claimed tight security for principal B = 0 Rabin/Williams (starred entries in the table), but the Kurosawa/Ogata proof has a fatal flaw and the theorem appears unsalvageable. 2003 Katz/Wang introduced a new proof allowing B as small as 1 for claw-free permutation pairs, but claw-free permutation pairs are not general enough to cover Rabin/Williams. This paper generalizes the Katz/Wang idea to cover Rabin/ Williams, and introduces a new security proof covering fixed unstructured B = 0 Rabin/Williams.

2008

Cited by 3