International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding

Page	Title
1-16	Securing Threshold Cryptosystems against Chosen Ciphertext Attack
17-31	Auto-Recoverable Auto-Certifiable Cryptosystems
32-46	A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications
47-58	Equivalence of Counting the Number of Points on Elliptic Curve over the Ring Z_n and Factoring n
59-71	Breaking RSA May Not Be Equivalent to Factoring
72-84	Lower Bounds on Generic Algorithms in Groups
85-99	Improved Cryptanalysis of RC5
100-111	Cryptanalysis of the ANSI X9.52 CBCM Mode
112-126	Differential-Linear Weak Key Classes of IDEA
127-144	Divertible Protocols and Atomic Proxy Cryptography
145-157	Optimum Traitor Tracing and Asymmetric Schemes
158-170	On Finding Small Solutions of Modular Multivariate Polynomial Equations
171-183	Computing Discrete Logarithms with Quadratic Number Rings
184-200	Improved Algorithms for Isomorphisms of Polynomials
201-210	Visual Cryptanalysis
211-220	How to Improve an Exponentiation Black-Box
221-235	Speeding up Discrete Log and Factoring Based Schemes via Precomputations
236-250	Fast Batch Verification for Modular Exponentiation and Digital Signatures
251-265	A Formal Treatment of Remotely Keyed Encryption
266-280	Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible
281-293	The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers
294-307	A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption
308-318	A New Public-Key Cryptosystem as Secure as Factoring
319-333	Towards a Better Understanding of One-Wayness: Facing Linear Permutations
334-345	Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions?
346-360	Secure Communications in Minimal Connectivity Models
361-374	On the Foundations of Oblivious Transfer
375-390	Quorum-Based Secure Multi-party Computation
391-405	Strengthened Security for Blind Signatures
406-421	Generic Constructions for Secure and Efficient Confirmer Signature Schemes
422-436	Security Analysis of a Practical "on the fly" Authentication and Signature Generation
437-447	Universally Verifiable Mix-net with Verification Work Indendent of the Number of Mix-servers
448-461	A Practical Mix
462-474	On the Propagation Criterion of Degree l and Order k
475-488	Highly Nonlinear Balanced Boolean Functions with a Good Correlation-Immunity
489-499	Heuristic Design of Cryptographically Strong Balanced Boolean Functions
500-511	Secret Sharing Schemes with Bipartite Access Structure
512-526	Combinatorial Bounds for Broadcast Encryption
527-541	New Results on Multi-Receiver Authentication Codes
542-545	Specialized Integer Factorization
546-560	Security of an Identity-Based Cryptosystem and the Related Reductions
561-575	Easy Come - Easy Go Divisible Cash
576-590	Secure and Efficient Metering
591-606	Optimistic Fair Exchange of Digital Signatures (Extended Abstract)