CONTENTS - Emerald

041607 `An E cient Electronic Payment System Protecting Privacy'
JL Camenisch, JM Piveteau, MA Stadler, ESORICS 94 pp 207{215
The authors propose a payment system based on anonymous accounts; customers
can set up new accounts under pseudonyms, and transfer money between accounts
under their control. This gives most of the practical advantages of digital cash, without
requiring the bank to store large amounts of data on coins in issue.
041608 `Conditionally Secure Secret Sharing Schemes with Disenrollment
Capability'
C Charnes, J Pieprzyk, R Safavi-Naini, Fairfax 94 pp 89{95
The authors describe a variant of Shamir's secret sharing scheme, which has been
given a disenrollment capability. Users have two shadows related by discrete logarithm
modulo a Mersenne prime.
041609 `Oblivious Signatures'
LD Chen, ESORICS 94 pp 161{172
Two signature schemes are proposed. In one of them, the recipient can choose to
get one message out of n signed, and in the other she can choose to get a message signed
with one out of n keys; in neither case will be signer know which was chosen. Both
of these schemes are quite e cient and are based on the Chaum-Pedersen signature
scheme.
041610 `Optimisation, tness and the knapsack cipher'
A Clark, E Dawson, H Bergen, ISITA 94 pp 257{261
This paper considers applying combinatorial optimization to cryptanalysis, and in
particular, using simulated annealing, genetic algorithms or tabu search tobreaking
knapsack ciphers. The conclusion is that such techniques are not suitable for large
knapsacks; although the search space might be reduced, they are slower in practice
than the alternatives.
041611 `On public-key cryptosystems based on linear codes: e ciency
and weakness'
EM Gabidulin, Cirencester 93 pp 17{31
The author had proposed a public key cryptosystem based on rank codes, but it
was broken by Gibson. In this paper, he proposes a modi cation which is claimed to
defeat the attack.
041612 `Modi ed key agreement protocol based on the digital signature
standard'
L Harn, Electronics Letters v 31 no 6 (16/3/95) pp 448{449
The author proposes a Di e Hellman variant with inbuilt DSS authentication. It
avoids the Nyberg-Rueppel attack byexchanging two keys at once and signing their
sum.
041613 `Meta-ElGamal signature schemes'
P Horster, H Petersen, M Michels, Fairfax 94 pp 96{107
The authors systematically enumerate a numberofvariants of the ElGamal signature
scheme. They present a total of thirty variants, a similar numberofschemes for
signing two messages at once, and six schemes for three messages. A similar analysis for
DSA shows ve variants which are e cient for signature validation and eight which are
e cient for veri cation; only one scheme | already proposed by Nyberg and Rueppel
| is common to both of these lists.
041614 `Meta Message Recovery and Meta Blind Signature Schemes
Based on the Discrete Logarithm Problem and Their Applications'
P Horster, H Petersen, M Michels, Asiacrypt 94 pp 185{196
Existing techniques to add message recovery to El-Gamal based signature schemes
39