Automata, Languages, and Programming, Volume 32

adversary algorithm argument system assume assumption automata bits Boolean C₁ cellular automata ciphertext color commitment scheme competitive ratio complexity Computer Science concurrent zero-knowledge consider construction cryptographic cycle basis data structure defined definition denote deterministic directed graph edge efficient elements encryption exists fanout finite given graph G group signatures groupoid hash functions ICALP input integer interval label language latency Lemma length linear LNCS lower bound M₁ matrix monoid Nash equilibrium node obtain one-way functions optimal output pair parameter party planar graphs player polynomial price of anarchy problem proof protocol prove public key queries regular languages replacement paths result robot Section semigroup sequence shortest path signature scheme simulation simulation-sound Springer-Verlag steganography string subset synchronizers Theorem trapdoor commitment tree treewidth update vectors verifier vertex vertices zero-knowledge argument zero-knowledge proof