WCC 2003: Preliminary program
Monday March 24
| 9:00 - 10:30 -- Registration - Welcome Coffee and viennoiseries |
| 10:30 - 10:40 -- Welcome
|
10:40 - 11:30 -- Self-dual codes
- Self-dual extended group codes
C. Martinez-Peres and W. Willems
- Designs and self-dual codes with long shadows
C. Bachoc and P. Gaborit
|
11:30 - 12:50 -- Secret sharing
- Secret sharing schemes on sparse homogeneous access
structures with rank three
Jaume Martí-Farré and Carles Padró
- On Cheating Immune Secret Sharing
Paolo D'Arco, Wataru Kishimoto, and Douglas Stinson
- Applying General Access Structure to Metering Schemes
V. Nikov, S. Nikova, B. Preneel, J.Vandewalle
|
Lunch
|
14:30 - 15:25 -- Invited talk
Fast Gröbner Algebraic cryptanalysis of
HFE and Filter Generators
Jean-Charles Faugère, CNRS / Université Paris VI / INRIA, France.
|
Coffee break
|
15:55 - 17:35 -- Public-key (I)
- Cryptanalysis of a Provable Secure Additive and Multiplicative
Privacy Homomorphism
Feng Bao
- Polynomial Interpolation of Cryptographic Functions
Related to the Diffie-Hellman Problem
Eike Kiltz and Arne Winterhof
- Wrap Error Attack Against NTRUEncrypt
Tommi Meskanen and Ari Renvall
- Homomorphic public-key cryptosystems and encrypting boolean circuits
Dima Grigoriev, Ilia Ponomarenko
|
Tuesday March 25
9:45 - 10:40 -- Invited talk
Simplifying Secure Multi-Party Computation
Ueli Maurer, ETH Zürich, Switzerland
|
Coffee break
|
11:10 - 12:00-- Key-distribution scheme (Parallel)
- Unconditionally Secure Hierarchical Key Assignment Schemes
Alfredo De Santis, Anna Lisa Ferrara, and Barbara Masucci
- Provably secure non-interactive key distribution based on pairings
Regis Dupont and Andreas Enge
12:00 - 12:50 -- Authentication scheme (Parallel)
- Weak Collision Resistance for Variable Input Length Can
Imply Collision Resistance for Fixed
Input Length
Shoichi Hirose and Susumu Yoshida
- Entity Authentication Schemes Using Braid Word Reduction
Patrick Dehornoy, Marc Girault, Herve Sibert
|
11:10 - 12:25-- Combinatorial Coding (Parallel)
- On identification of sets of vertices in the triangular grid
Iiro Honkala and Tero Laihonen
- Codes and designs in Grassmannian spaces
Christine Bachoc
- Tilings of closed surfaces by Steiner triple systems
Faina Soloveva
|
Lunch
|
14:30 - 15:20 -- Perfect codes (Parallel)
- Kernels of q-ary 1-perfect codes
Kevin T. Phelps, Josep Rifa, Merce Villanueva
- Partial Reconstruction of perfect binary codes
A. Yu. Vasil'eva
15:20 - 16:10 -- Combinatorial Coding (Parallel)
- Some subsets of points in the plane associated to
truncated
Reed-Muller codes with good parameters
Ronan Quarez
- The Berlekamp-Massey Algorithm and Combinatorics
Ulrich Tamm
|
14:30 - 15:45 -- Signatures (Parallel)
- List Signature Schemes and Application to Electronic Voting
Sébastien Canard and Jacques Traoré
- On-line / off-line RSA-like
Marc Girault and Jean-Claude Pailles
- Fine-Grained Forward-Secure Signature Schemes without
Random Oracles
Jan Camenisch and Maciej Koprowski
|
Coffee break
|
16:40 - 17h55 -- Codes for public-key
- Transposed rank codes based on symmetric matrices
Ernst M. Gabidulin, Nina I. Pilipchuk
- On the number of irreducible Goppa codes
John A. Ryan and Patrick Fitzpatrick
- Recovering a parent code for subcodes of
maximal rank distance codes
Alexei Ourivski
|
Wednesday March 26
9:45 - 10:40 -- Invited talk
Decoding of low-rate Reed-Muller codes with polylogarithmic complexity
Ilya Dumer, University of California, Riverside.
|
Coffee break
|
11:10 - 12:50 -- Decoding, Error-correction
- Distance distribution of binary codes and the
error probability of decoding
Alexander Barg and Andrew McGregor
- Bounds on the error correction capacity of codes beyond
half the minimum distance
T. Helleseth, T. Klove, V. Levenshtein
- On the Complexity of Suboptimal Decoding for List
and Decision Feedback Schemes
J. Freudenberger and V. Zyablov
- Two-dimensional array codes correcting 2 x 2 clusters of errors
I.M. Boyarinov
|
Lunch
|
14:30 -- Social event: visit of Château de Versailles
|
19:30 -- Banquet
|
Thursday March, 27
9:45 - 10:40 -- Invited talk
Nonlinear Boolean Functions:
Recent Progress, Methods, and Perspectives
Hans Dobbertin, University of Bochum, Germany.
|
Coffee break
|
11:10 - 12:50 -- Algebraic coding and cryptographic functions (I)
- A Maiorana-McFarland type Construction for Resilient
Boolean Functions
on n variables (n Even) with Nonlinearity
$2^{n-1} - 2^{n/2} + 2^{n/2-2}$
Enes Pasalic and Subhamoy Maitra
- On the nonlinearity of boolean functions
Francois Rodier
- A case when three weights in a cyclic code is impossible
Gary McGuire
- Affinity of Permutations of $F_2^n$
Xiang-dong Hou
|
Lunch
|
14:30 - 15:45 -- Public-key (II) (Parallel)
- Fast Generation of Elliptic Curves with
Prime Order over $F_{p^{2^c}}$
Yasuyuki Nogami, Yoshitaka Morikawa
- A Randomized Efficient Algorithm for DPA Secure
Implementation of Elliptic Curve Cryptosystems
S. Agagliate, P. Guillot, O. Orcière
- An efficient semantically secure elliptic
curve cryptosystem based on KMOV
David Galindo, Sebastià Martin, Paz Morillo and Jorge L. Villar
|
14:30 - 15:45 -- Codes over rings (Parallel)
- The generalized Preparata codes over GF(2^l)
Kuzmin A.S., Markov V.T., Nechaev A.A. and Neljubin A. S.
- Negacyclic Codes of Even Length over $Z4$
Taher Abualrub, Marwan Abukhaled
- Repeated-root cyclic and negacyclic codes over a finite chain ring
Ana Salagean
|
Coffee break
|
16:15 - 17h30 -- Combinatorial coding, bound theory
- A coding theory bound and zero-sum square matrices
Noga Alon, Simon Litsyn, and Raphael Yuster
- Weighted ${\delta (p^3+1), \delta 3, p^3}$-minihypers
and related linear codes
meeting the Griesmer bound
S. Ferret
- Results on linear codes meeting the Griesmer bound from
results on t-fold (N-K)-blocking sets in PG(N,q)
S. Ferret, L. Storme, P. Sziklai, Zs. Weiner
|
Friday March 28
9:45 - 11:25 -- Algebraic coding and cryptographic functions (II)
- Trace representation and linear complexity of
binary e-th residue sequences
Zongdui Dai, Guang Gong, and Hong-Yeop Song
- An Algorithm for Checking Normality of Boolean Functions
Magnus Daum, Hans Dobbertin, Gregor Leander
- Normal and Non-Normal Bent Functions
Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor Leander
- Restrictions on Two-Weight Projective Linear Codes
Jay A. Wood
|
Coffee break
|
11:45 -- 13:00 Geometric Coding
- Geometrical cryptography
Laszlo Csirmaz and G.O.H. Katona
- An Explicit Construction of a Class of Good
Codes and Their Duals
San Ling, Ferruh Ozbudak, Chaoping Xing
- On the generalized Hamming weights of Hyperelliptic codes
Domingo Ramirez-Alzola
|
Lunch
|
Back to the Home Page of WCC 2003.
Last modification on March 7, 2003.