NetNews Usenet Archive 1992 #27/NN_1992_27.iso/spool/sci/crypt/4849

Internet Message Format | 1992-11-15 | 7.8 KB

Xref: sparky sci.crypt:4849 comp.theory:2430 alt.security:4821 sci.math:15023
Newsgroups: sci.crypt,comp.theory,alt.security,sci.math
Path: sparky!uunet!munnari.oz.au!metro!cs.uow.edu.au!yuliang
From: [e-mail] (Yuliang Zheng)
Subject: papers accepted for AUSCRYPT '92
Message-ID: <[e-mail]>
Organization: Dept of Computer Science, Wollongong University, Australia
Date: Mon, 16 Nov 1992 03:07:40 GMT
Lines: 290





   A U S C R Y P T' 9 2   S C H E D U L E


***************************************************************
Monday, 14th December 1992

Session 1
AUTHENTICATION AND SECRET SHARING I

(9.00-9.50)
Threshold cryptography (invited talk)
Y. Desmedt (University of Wisconsin-Milwaukee, US),

(9.50-10.10)
Authentication codes with perfect protection,
L. Tombak, R. Safavi-Naini (University of Wollongong, Australia)

(10.10-10.30)
Practical proven secure authentication with arbitration
Y. Desmedt (University of Wisconsin-Milwaukee, US),
J. Seberry (university of Wollongong, Australia)



Session 2
AUTHENTICATION AND SECRET SHARING II

(11.00-11.20)
Authentication codes under impersonation attack,
R. Safavi-Naini, L. Tombak (University of Wollongong, Australia)

(11.20-11.40)
Cumulative arrays and geometric secret sharing schemes,
W.A. Jackson (Royal Holloway and Bedford New College, UK),
K.M. Martin (University of Adelaide, Australia)

(11.40-12.00)
Nonperfect secret sharing schemes,
W. Ogata, K. Kurosawa (Tokyo Institute of Technology, Japan)

(12.00-12.20)
A construction of practical secret sharing schemes
using linear block codes,
M. Bertilsson, I. Ingemarsson (Linkoping University, Sweden)



Session 3
SIGNATURES AND HASHING ALGORITHMS

(13.40-14.00)
HAVAL --- a one-way hashing algorithm with variable length of output,
Y. Zheng, J. Pieprzyk, J. Seberry (University of Wollongong, Australia)

(14.00-14.20)
On the power of memory in the design of collision
resistant hash functions,
B. Preneel, R. Govaerts, J. Vandewalle (Katholieke Univesiteit
Leuven, Belgium)

(14.20-14.40)
A practical digital multisignature scheme based on discrete logarithms,
T. Hardjono (ATR Communication Research, Japan),
Y. Zheng (University of Wollongong, Australia)

(14.40-15.00)
Group-oriented undeniable signature schemes without
the assistance of a mutually trusted party,
L. Harn (University of Missouri-Kansas City, US),
S. Yang (University of Science and Technology of China, PRC)



Session 4
THEORY OF S-BOXES

(15.30-15.50)
Highly nonlinear 0-1 balanced Boolean functions satisfying
strict avalanche criterion,
X.M. Zhang, J. Seberry (University of Wollongong, Australia)

(15.50-16.10)
Linear nonequivalence versus nonlinearity,
C. Charnes, J. Pieprzyk University of Wollongong, Australia)

(16.10-16.30)
Constructing large cryptographically strong S-boxes,
J. Detombe, S. Tavares (Queen's University, Canada)



***************************************************************
Tuesday, 15th December 1992

Session 5
CRYPTANALYSIS

(9.00-9.50)
Wire tape channel (invited talk)
V. Korjik (Bronch-Bruevitch Technical Communications University,
St Petersburg, Russia)

(9.50-10.10)
Cryptanalysis of LOKI91,
L.R. Knudsen (Aarhus University, Denmark)

(10.10-10.30)
Cryptanalysis of summation generator,
E. Dawson (Queensland University of Technology, Australia)



Session 6
PROTOCOLS I

(11.00-11.20)
Secure addition sequence and its application
on the server aided secret computation protocols,
C.S. Laih, S.M. Yen (National Cheng Kung University, Taiwan)

(11.20-11.40)
Subliminal channels for signature transfer and their
application to signature distribution schemes,
K. Sakurai (Mitsubishi Electric Co., Japan),
T. Itoh (Tokyo Institute of Technology, Japan)

(11.40-12.00)
A practical secret voting scheme for large scale elections,
A. Fujioka, T. Okamoto, K. Ohta (NTT, Japan)

(12.00-12.20)
Privacy for multi-party protocols,
T. Satoh, K. Kurosawa (Tokyo Institute of Technology, Japan)



Session 7
PROTOCOLS II

(13.30-13.50)
New protocols for electronic money,
J.C. Pailles (SEPT, France)

(13.50-14.10)
Modeling and analyzing cryptographic protocols using Petri nets,
B.B. Nieh, S.E. Tavares (Queen's University, Canada)

(14.10-14.30)
On verifiable implicit asking protocols for RSA computation,
T. Matsumoto, H. Imai (Yokohama National University, Japan),
C-S. Laih, S-M. Yen (National Cheng Kung University, Taiwan)

(14.30-14.50)
Modified Maurer-Yacobi's scheme and its applications,
C.H. Lim, P.J. Lee (Pohang Institute of Science and Technology, Korea)



Session 8 SEQUENCES

(15.20-15.40)
The vulnerability of geometric sequences based on
fields of odd characteristic,
A. Klapper (University of Manitoba, Canada)

(15.40-16.00)
A fast cryptographic checksum algorithm based on stream ciphers,
X. Lai, R.A. Rueppel, J. Woollven (R^3 Security Engineering,
Switzerland)

(16.00-16.20)
An approach to the initial state reconstruction of a clock-controlled
shift register based on a novel distance measure,
M. Mihaljevic (University of Belgrade, Yugoslavia)

(16.20-16.40)
Construction of m-ary de-Bruijn sequences,
J.H. Yang, Z.D. Dai (Academia Sinica, China)



***************************************************************
Wednesday, 16th December 1992

Session 9
PSEUDORANDOMNESS

(9.00-9.50)
Information technology security standards (invited talk)
J. Snare (Telecom Research Laboratories, Australia)

(9.50-10.10)
Non-interactive generation of shared pseudorandom sequences,
M. Cerecedo, T. Matsumoto, H. Imai (Yokohama National University, Japan)

(10.10-10.30)
A generalized description of DES-based and Benes-based
permutation generators,
M. Portz (RWTH Aachen, Germany)



Session 10
ODDS AND ENDS

(11.00-11.20)
Prime generation with the Demytko-Miller-Trbovich algorithm,
L. Condie (University of New England, Australia)

(11.20-11.40)
Construction of feebly-one-way families of permutations,
A.P. Hiltgen (Swiss Federal Institute of Technology, Switzerland)

(11.40-12.00)
On bit correlations among preimages of "many to one" one-way functions,
K. Sakurai (Mitsubishi Electric Co., Japan),
T. Itoh (Tokyo Institute of Technology, Japan)

(12.00-12.20)
A fast cascade exponentiation algorithm and its
application on cryptography,
S.M. Yen, C.S. Laih (National Cheng Kung University, Taiwan)



Session 11
PUBLIC KEY CRYPTOGRAPHY I

(13.30-14.20)
Public key generation --- state-of-the-art (invited talk)
P. Landrock (Aarhus University, Denmark)

(14.20-14.40)
The design of a conference key distribution system,
C.C. Chang (National Chung Cheng University, Taiwan),
T.C. Wu (National Chiao Tung University, Taiwan),
C.P. Chen (National Chung Cheng University, Taiwan)

(14.40-15.00)
Public-key cryptosystem based on the discrete logarithm problem,
L. Harn (University of Missouri-Kansas City, US),
S. Yang (University of Science and Technology of China, PRC)



Session 12
PUBLIC KEY CRYPTOGRAPHY II

(15.30-15.50)
Elliptic curves over Fp suitable for cryptosystems,
A. Miyaji (Matsushita Electric Industrial Co., Japan)

(15.50-16.10)
New public-key cryptosystems based on factorization of finite groups,
M. Qu, S.A. Vanstone (University of Waterloo, Canada)

(16.10-16.30)
The probability distribution of the Diffie-Hellman key,
C.P. Waldvogel, J.L. Massey
(Swiss Federal Institute of Technology, Switzerland)

(16.30-16.50)
A modular unit based on systolic arrays,
J. Sauerbrey (Technische Universitat Munchen, Germany)

(16.50-17.10)
A comparison of key distribution patterns
constructed from circle geometries,
C.M. O'Keefe (University of Adelaide, Australia)

***************************************************************

For more information, please contact

     Auscrypt'92 Secretary
     Office of Educational Services
     Queensland University of Technology
     G.P.O. Box 2434
     Brisbane, QLD 4001
     Australia

     Fax:   [phone]
     Phone: [phone]
     Email: [e-mail] (Ed Dawson)  or
            [e-mail]   (Bill Caelli)