You have Guest access.
Log In
Louis C. Guillou and Jean-Jacques Quisquater
Front matter
1-12
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
13-23
Convergence in Differential Distributions
24-38
A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
39-49
On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity
50-63
Verifiable Signature Sharing
64-78
Server(Prover/Signer)-Aided Verification of Identity Proofs and Signatures
79-94
Counting the number of points on elliptic curves over finite fields: strategies and performances
95-105
An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p
106-120
A Block Lanczos Algorithm for Finding Dependencies over GF(2)
121-132
How to Break Another “Provably Secure” Payment System
133-146
Quantum Oblivious Mutual Identification
147-157
Securing Traceability of Ciphertexts — Towards a Secure Software Key Escrow System Extended Abstract
158-167
Secure Multiround Authentication Protocols
168-182
Verifiable Secret Sharing as Secure Computation
183-193
Efficient Secret Sharing Without a Mutually Trusted Authority Extended Abstract
194-208
General Short Computational Secret Sharing Schemes
209-219
Fair Blind Signatures
220-230
Ripping Coins for a Fair Exchange
231-247
Restrictive Binding of Secret-Key Certificates
248-262
Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers
263-273
Large Period Nearly deBruijn FCSR Sequences Extended Abstract
274-288
On Nonlinear Resilient Functions Extended Abstract
289-300
Combinatorial Bounds for Authentication Codes with Arbitration
301-310
New Hash Functions for Message Authentication
311-318
A 2—codes from universal hash classes
319-328
A New Identification Scheme Based on the Perceptrons Problem
329-340
Fast RSA-type Schemes Based on Singular Cubic Curves y 2 + axy ≡ x 3 (mod n )
341-355
Relationships among the Computational Powers of Breaking Discrete Log Cryptosystems
356-366
Universal Hash Functions & Hard Core Bits
367-381
Recycling Random Bits in Composed Perfect Zero-Knowledge
382-392
On the Matsumoto and Imai’s Human Identification Scheme
393-403
Receipt-Free Mix-Type Voting Scheme A practical solution to the implementation of a voting booth
404-409
Are Crypto-Accelerators Really Inevitable? 20 bit zero-knowledge in less than a second on simple 8-bit microcontrollers
413-416
Anonymous NIZK Proofs of Knowledge with Preprocessing
Back matter
C. P. Schnorr and H. H. Hörner
Luke O’Connor
Carlo Harpes, Gerhard G. Kramer and James L. Massey
Lidong Chen and Torben P. Pedersen
Matthew K. Franklin and Michael K. Reiter
Chae Hoon Lim and Pil Joong Lee
Reynald Lercier and François Morain
Damian Weber
Peter L. Montgomery
Birgit Pfitzmann, Matthias Schunter and Michael Waidner
Claude Crépeau and Louis Salvail
Yvo Desmedt
Christian Gehrmann
Rosario Gennaro and Silvio Micali
Wen-Ai Jackson, Keith M. Martin and Christine M. O’Keefe
Philippe Béguin and Antonella Cresti
Markus Stadler, Jean-Marc Piveteau and Jan Camenisch
Markus Jakobsson
Stefan Brands
Jovan Dj. Golić
Andrew Klapper and Mark Goresky
Xian-Mo Zhang and Yuliang Zheng
Kaoru Kurosawa and Satoshi Obana
Hugo Krawczyk
Jürgen Bierbrauer
David Pointcheval
Kenji Koyama
Kouichi Sakurai and Hiroki Shizuya
Mats Näslund
Giovanni Di Crescenzo
Chih-Hung Wang, Tzonelih Hwang and Jiun-Jang Tsai
Kazue Sako and Joe Kilian
David Naccache, David M’raïhi, William Wolfowicz and Adina di Porto
Stefano D’Amiano and Giovanni Di Crescenzo
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