Description
Book SynopsisPapers contained in this volume address a wide range of topics, from theoretical aspects of algebra, namely group theory, universal algebra and related areas, to applications in several different areas of computer science. From the computational side, the book aims to reflect the rapidly emerging area of algorithmic problems in algebra, their computational complexity and applications.
Table of Contents
- F. Bassino, C. Nicaud, and P. Weil, Generic properties of subgroups of free groups and finite presentations
- C. S. Chum and X. Zhang, A new multi-server scheme for private information retrieval
- C. S. Chum, B. Fine, A. I. S. Moldenhauer, G. Rosenberger, and X. Zhang, On secret sharing protocols
- M. E. Habeeb, A verifiable secret sharing scheme using non-abelian groups
- A. Kalka, Non-associative public-key cryptography
- A. Kalka and M. Teicher, Non-associative key establishment protocols and their implementation
- D. Konig, M. Lohrey, and G. Zetzsche, Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
- I. S. Moldenhauer, G. Rosenberger, and K. Rosenthal, On the Tits alternative for a class of finitely presented groups with a special focus on symbolic computations
- A. Sale, Geometry of the conjugacy problem in lamplighter groups
- A. Weiss, A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
- S. Yuan, Cryptographic hash functions from sequences of lifted Paley graphs.
