CiteSeerX — Table search results — keywords cryptography

Results 1 - 10 of 1,764

Table 3: Cryptography Primitive Attacks

in A Survey on Attacks and Countermeasures in Mobile Ad Hoc Networks

by Bing Wu, Jianmin Chen, Jie Wu, Mihaela Cardei

"... In PAGE 3: ...etection system (IDS). But other attacks such as DoS cannot be made stealth. Some attacks are non-cryptography related, and others are cryptography primitive attacks. Table3 shows cryptography primitive attacks and some examples. For the rest of the section, we present a survey of security attacks in MANET following the order of the protocol stacks.... ..."

Table 2: Comparison on cryptography problems.

in Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers

by Renato Bruni, Andrea Santori

Table 3. Performance measurements of cryptography primitives (ms)

in SAOTS: A New Efficient Server Assisted Signature Scheme for Pervasive Computing

by Kemal Bicakci, Nazife Baykal 2003

"... In PAGE 10: ... This is why the delay is smaller in SAOTS although the message transmitted is larger. Table3 gives the performance measurements of cryptography primitives on two platforms used and Table 4 summarizes our findings of the experiments. Table 3.... ..."

Cited by 4

Table 1. Cryptography techniques in e-voting.

in BALLOT-CANCELLATION SCHEME IN E-VOTING SYSTEM

by unknown authors

"... In PAGE 3: ... To achieve a receipt-freeness, they used schemes of [12] and [18]. Table1 shows cryptography techniques in e-voting system. 1) Benaloh et al.... ..."

Table 9: Analysis of new constructs for asymmetric cryptography.

in Static validation of security protocols

by Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson 2005

"... In PAGE 22: ... 8.2 Extensions to the Control Flow Analysis The additional rules for the control ow analysis are in Table9 and are very similar to the corresponding rules (2), (3) and (5) in Table 2. The only di er- ences occur in the rule for asymmetric decryption: the values V0, V 0 0 are actually a pair of public/private keys, required by the condition fV0; V 0 0g = fm+; m g, and the consequent check for 1 i j, that the values Vi are pointwise included in the values in #i.... ..."

Cited by 16

Table 7: Semantic rules for asymmetric cryptography.

in Static validation of security protocols

by Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson 2005

"... In PAGE 24: ... The additional rules for congruence are: ( m)0 0; ( n)( m)P ( m)( n)P; ( n)( m)P ( m)( n)P; ( m)(P j Q) P j ( m)Q, if m+; m 62 fn(P). The new reduction rules are in Table7 . The rule (A-Res) is quite standard.... ..."

Cited by 16