|
The occasional drink and poster session (part one)
Efficient Protocols from Homomorphic Threshold Cryptography | Ivan Damgård, Ronald Cramer, Jesper Buus Nielsen, Mads Jurik |
Elliptic Curve Systems Too Risky? Or TRoublesome? | Arjen K. Lenstra |
The Schoof-Elkies-Atkin algorithm in characteristic 2 - The Previous world record | Frederik Vercauteren |
A New Record in point counting on elliptic curves | Pierrick Gaudry |
A new tool for non-intrusive analysis of smart cards based on electro-magnetic emissions. The SEMA and DEMA methods | Jean-Jacques Quisquater, David Samyde |
On the Soundness of Girault's Scheme | Fabrice Boudot |
The NESSIE Call for Cryptographic Algorithms | Eli Biham |
FPGA Implementation of Modular Exponentiation Using Montgomery Method | Elena Trichina |
One-round secure computation and secure Autonomous Mobile Agents | Christian Cachin, Jan Camenisch, Joe Kilian, Joy Müller |
The occasional drink and poster session (part two)
Braid Group Cryptosystem, the Arithmetic Key Agreement Protocol | Jim Hughes |
Update on UMAC Fast Message Authentication | Phil Rogaway |
Small generic hardcore subsets for the discrete logarithm: short secret DL-keys | Clauss P. Schnorr |
A popular protocol whose security decreases as key size increases | David Naccache |
Necessary and Sufficient Assumptions for Non-Interactive Zero-Knowledge Proofs of Knowledge for all NP relations | Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano |
A proven secure tracing algorithm for the optimal KD traitor tracing Scheme | Kaoru Kurosawa, Mike Burmester, Yvo Desmedt |
Efficient Algorithms for Differential Probability modulo 2n and Related Problems | Helger Lipmaa, Shiho Moriai |
On the Soundness of Girault's Scheme | [pdf] | Fabrice Boudot |
One-Round Secure Computation and Secure Autonomous Mobile Agents | [txt] | Christian Cachin, Jan Camenisch, Joe Kilian, Joy Müller |
Efficient Multiparty Computation from Homomorphic Threshold Cryptography | [pdf] | Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen |
Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes | [pdf] | Ivan Damgård, Mads Jurik |
Necessary and Sufficient Assumptions for Non-Interactive Zero-Knowledge Proofs of Knowledge for all NP relations | [pdf] | Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano |
Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs | [pdf] | Giovanni Di Crescenzo |
A metric space of test distributions for DPA and SZK proofs | [pdf] | C.T.J. Dodson, S.M. Thompson |
On the Equivalence Classes of Certain Stream Ciphers | [pdf] | Luis Javier Garcia-Villalba, M.C. Rodriguez-Palanquex |
Security for an auxiliary human memory | [pdf] | Jukka A. Koskinen |
A proven secure tracing algorithm for the optimal KD traitor tracing scheme | [pdf] | Kaoru Kurosawa, Mike Burmester, Yvo Desmedt |
Quantum random number generation | Jaroslav Hruby | |
Linear key predistribution schemes | [pdf] | Carles Padro, Ignacio Gracia, Sebastia, Martin, Paz Morillo |
Small generic hardcore subsets for the discrete logarithm: short secret DL-keys | [pdf] | C.P. Schnorr |
Pseudo-random exponentiation using the LIM-LEE method | [pdf] | C.P. Schnorr |
FPGA Implementation of Modular Exponentiation Using Montgomery Method | [pdf] | Elena Trichina |
The Schoof-Elkies-Atkin algorithm in characteristic 2 – The Previous world record | [pdf] | Frederik Vercauteren |
Eurocrypt 2000 is organized by the members of the COSIC research group. Copyright © 2000, Katholieke Universiteit Leuven, ESAT/COSIC This page is maintained by Joris Claessens and Wim Moreau. Last modified on May 29, 2000. |