Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications of eurocrypt 1996
Page
Title
1-9
Low-Exponent RSA with Related Messages
10-18
Generating EIGamal Signatures Without Knowing the Secret Key
19-32
On the Security of Two MAC Algorithms
33-48
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
49-59
A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring
60-71
Public Key Encryption and Signature Schemes Based on Polynomials over Zn
72-83
Multi-Autority Secret-Ballot Elections with Linear Work
84-95
Asymmetric Fingerprinting (Extended Abstract)
96-106
Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing
107-118
Efficient Multiplicative Sharing Schemes
119-130
Equivocable Oblivious Transfer
131-142
Short Discrete Proofs
143-154
Designated Verifier Proofs and Their Applications
155-165
Finding a Small Root of a Univariate Modular Equation
166-177
New Modular Multiplication Algorithms for Fast Modular Exponentiation
178-189
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
190-199
Publicly Verifiable Secret Sharing
200-211
Optimum Secret Sharing Scheme Secure against Cheating
212-223
The Security of the Gabidulin Public Key Cryptosystem
224-236
Non-Linear Approximations in Linear Cryptoanalysis
237-244
On the Difficulty of Software Key Escrow
245-255
An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
256-267
On the Existence of Secure Feedback Registers (Extended Abstract)
268-282
Fast Low Order Approximation of Cryptographic Functions
283-293
Construction of t-Resilient Functions over a Finite Alphabet
294-306
Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions
307-320
Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel
321-331
Session Key Distribution Using Smart Cards
332-343
On Diffie-Hellman Key Agreement with Short Exponents
344-353
On the Security of a Practical Identification Scheme
354-371
Robust Threshold DSS Signatures
372-386
New Convertible Undeniable Signature Schemes
387-398
Security Proofs for Signature Schemes
399-416
The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin