CONTENTS - Emerald

041624 `Comment | digital signature with 9t; n) shared veri cation based
on discrete logarithms'
WB Lee, CC Chang, Electronics Letters v 31 no 3 (2/2/95) pp 176{177; with reply by
L Harn
The authors show how to forge messages for a signature scheme of Harn, who
proposes a x for the problem in an attached reply.
041625 `A dynamic cryptographic key generation and information broadcasting
scheme in information systems'
HT Liaw, Computers and Security v 13 no 7 (94) pp 601{610
The author proposes a hierarchical key management scheme based on RSA which
enables each user to calculate the secret keys in use at lower levels in a lattice.
041626 `A New Public-Key Cipher Based Upon the Diophantine Equations'
CH Lin, CC Chang, RCT Lee, IEEE Transactions on Computers v 44 no 1 (Jan 95)
pp 13{19
The authors present a knapsack type system which is packaged in Diophantine
equation terminology.
041627 `Can Montgomery Parasites be Avoided? A Design Methodology
Based on Key and Cryptosystem Modi cations'
D Naccache, D M'Ra he, D Raphaeli, Designs, Codes and Cryptography v 5 no 1 (Jan
95) pp 73{80
If everyone is using Montgomery multiplication, then it makes sense to change the
de nitions of the common cryptographic algorithms slightly so that operand scaling
can be dispensed with. The details are set out for a number of popular public key
schemes.
041628 `How to prevent buying of votes in computer elections'
V Niemi, A Renvall, Asiacrypt 94 pp 141{148
Most electronic voting protocols su er from the problem that voters can prove
which way they voted; this makes it possible for votes to be bought or coerced. The
authors had previously proposed a system in which did not possess this property, but
which relied on a trusted third party; in this paper, they show how the candidates can
use secret sharing and multiparty computation techniques to remove this constraint.
041629 `Secure anonymous channel against active attack'
CPark, K Kurosawa, JW-ISC 95 pp 15{23
The authors consider means of countering an attackby P tzmann on an anonymous
channel.
041630 `An entrusted undeniable signature'
SJ Park, KH Lee, DH Won, JW-ISC 95 pp 120{133
The authors propose the concept of an entrusted undeniable signature: the signer
can con rm his signature to averi er without any help, but cannot run a disavowal
protocol without the help of a trusted third party (a court). This scheme is constructed
by the combination of undeniable signatures and zero-knowledge proofs.
041631 `A public-key cryptosystem and a digital signature scheme based
on the Lucas function analogue to discrete logarithms'
P Smith, C Skinner,Asiacrypt 94 pp 298{306
The authors propose basing ElGamal schemes on the corational group of GF (p 2 ),
and claim that these are much stronger than systems based on the rational group.
41