You have Guest access.
Log In
D. Barstow, W. Brauer, P. Brinch Hansen, D. Gries, D. Luckham, C. Moler, A. Pnueli, G. Seegmüller, J. Stoer and N. Wirth, et al.
Front matter
3-10
Key Agreements Based on Function Composition
11-19
Security of Improved Identity-based Conference Key Distribution Systems
23-33
Subliminal-free Authentication and Signature Extended Abstract
35-49
Zero-Knowledge Proofs of Identity and Veracity of Transaction Receipts
51-55
Authentication Codes with Multiple Arbiters Extended Abstract
57-75
Some Constructions for Authentication - Secrecy Codes
77-84
Efficient Zero-Knowledge Identification Scheme for Smart Cards
87-95
A Smart Card Implementation of the Fiat-Shamir Identification Scheme
97-106
Manipulations and Errors, Detection and Localization
107-122
Privacy Protected Payments — Realization of a Protocol That Guarantees Payer Anonymity
123-128
A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory
129-156
A Generalized Birthday Attack
159-166
An Interactive Data Exchange Protocol Based on Discrete Exponentiation
167-176
Anonymous and Verifiable Registration in Databases
177-182
Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA
183-188
Passports and Visas Versus IDs Extended Abstract
191-209
The Probabilistic Theory of Linear Complexity
211-223
A Probabilistic Primality Test Based on the Properties of Certain Generalized Lucas Numbers
225-232
On the Construction of Random Number Generators and Random Function Generators
235-243
Factorization of Large Integers on a Massively Parallel Computer
245-250
A Fast Modular Arithmetic Algorithm Using a Residue Table Extended Abstract
251-255
Fast Exponentiation in GF (2n)
257-264
Fast RSA-Hardware: Dream or Reality?
267-274
Properties of the Euler Totient Function Modulo 24 and Some of Its Cryptographic Implications
275-280
An Observation on the Security of McEliece’s Public-Key Cryptosystem
281-291
How to Break Okamoto’s Cryptosystem by Reducing Lattice Bases
293-299
Cryptanalysis of F.E.A.L.
301-314
Fast Correlation Attacks on Stream Ciphers Extended Abstract
317-324
A New Class of Nonlinear Functions for Running-key Generators Extended Abstract
325-330
Windmill Generators A generalization and an observation of how many there are
331-343
Lock-in Effect in Cascades of Clock-Controlled Shift-Registers
345-349
Proof of Massey’s Conjectured Algorithm
351-357
Linear Recurring m-Arrays
361-373
Substantial Number of Cryptographic Keys and Its Application to Encryption Designs
375-387
A Measure of Semiequivocation
389-401
Some New Classes of Geometric Threshold Schemes
405-414
A Universal Algorithm for Homophonic Coding
415-418
A New Probabilistic Encryption Scheme
419-453
Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption
455-467
Some Applications of Multiple Key Ciphers
Back matter
Rainer A. Rueppel
Kenji Koyama and Kazuo Ohta
Yvo Desmedt
Gustavus J. Simmons and George B. Purdy
Ernest F. Brickell and Doug R. Stinson
Marijke De Soete
Thomas Beth
Hans-Joachim Knobloch
Ph. Godlewski and P. Camion
Svein J. Knapskog
Louis C. Guillou and Jean-Jacques Quisquater
Marc Girault, Robert Cohen and 2)Mireille Campana
G. Agnew, R. Mullin and S. Vanstone
Jørgen Brandt, Ivan Bjerre Damgård and Peter Landrock
David Chaum
George I. Davida and Yvo G. Desmedt
Harald Niederreiter
Adina Di Porto and Piero Filipponi
C. P. Schnorr
James A. Davis and Diane B. Holdridge
Shin-ichi Kawamura and Kyoko Hirano
G. B. Agnew, R. C. Mullin and S. A. Vanstone
Frank Hoornaert, Marc Decroos, Joos Vandewalle and René Govaerts
Raouf N. Gorgui-Naguib and Satnam S. Dlay
P. J. Lee and E. F. Brickell
Brigitte Vallée, Marc Girault and Philippe Toffin
Bert den Boer
Willi Meier and Othmar Staffelbach
Shu Tezuka
B. J. M. Smeets and W. G. Chambers
William G Chambers and Dieter Gollmann
Cunsheng Ding
Dongdai Lin and Mulan Liu
Eiji Okamoto
Andrea Sgarro
Marijke De Soete and Klaus Vedder
Christoph G. Günther
He Jingmin and Lu Kaicheng
Tsutomu Matsumoto and Hideki Imai
Colin Boyd
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info