Abstract is missing.
- On the Security of Beth s Identification Schemes against Active and Concurrent AdversariesGiovanni Di Crescenzo. 1-17 [doi]
- Steiner t-Designs for Large tMichael Huber. 18-26 [doi]
- New Spatial ConfigurationsHarald Gropp. 27-30 [doi]
- Construction of Large Constant Dimension Codes with a Prescribed Minimum DistanceAxel Kohnert, Sascha Kurz. 31-42 [doi]
- Invited Talk: Embedding Classical into Quantum ComputationRichard Jozsa. 43-49 [doi]
- A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased BasesAleksandrs Belovs, Juris Smotrovs. 50-69 [doi]
- An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg GroupsHari Krovi, Martin Rötteler. 70-88 [doi]
- Computing Equiangular Lines in Complex SpaceMarkus Grassl. 89-104 [doi]
- Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller AlgorithmSamuel Lundqvist. 105-125 [doi]
- Invited Talk: Decoding Cyclic Codes: The Cooper PhilosophyTeo Mora, Emmanuela Orsini. 126-127 [doi]
- Kernel Dimension for Some Families of Quaternary Reed-Muller CodesJaume Pernas, Jaume Pujol, Mercè Villanueva. 128-141 [doi]
- Coding-Based Oblivious TransferKazukuni Kobara, Kirill Morozov, Raphael Overbeck. 142-156 [doi]
- Protection of Sensitive Security Parameters in Integrated CircuitsDejan E. Lazich, Micaela Wuensche. 157-178 [doi]
- On Reconstruction of RC4 Keys from Internal StatesShahram Khazaei, Willi Meier. 179-189 [doi]