Talk Proposals

Here is a list of talk proposals (as of November 14) divided into broad categories

Cryptography (including Quantum Cryptography)

1. Janno Siim, Tartu U, An Efficient Pairing-Based Shuffle Argument
2. *Marek Sýs, Masaryk U, Factorization of widely used RSA moduli*
3. Michal Zajac, Tartu U, A Subversion-resistant SNARK
4. Mohammad Fawaz Yousef Anagreh, Tartu U, Accelerate Performance of Calculation for Elliptic Curve Cryptosystem Based on MOF by Parallel Computing
5. Bingsheng Zhang, Lancaster, Statement Voting and Liquid Democracy

MPC

1. Alisa Pankova, Cybernetica AS, Privacy-preserving duplication detection
2. Peeter Laud, Cybernetica AS, Secure Multiparty Sorting Protocols with Covert Privacy
3. Toomas Krips, Tartu U, Golden Section Numbers in Secure Multiparty Computation

Quantum Computation

1. Abuzer Yakaryilmaz, Latvia U, Magic coins are useful for small-space quantum machines
2. Aliya Khadieva, Latvia U, Reordering Method for Quantum and Classical Ordered Binary Decision Diagrams
3. Andris Ambainis, Latvia U, Quantum algorithms for trees of unknown structure
4. Jevgenijs Vihrovs, Latvia U, All Classical Adversary Methods are Equivalent for Total Functions
5. Kamil Khadiev, Latvia U, Quantum versus Classical Online Algorithms with Advice and Restricted Memory

Quantum Cryptography

1. Aleksandrs Belovs Latvia U Provably secure key establishment against quantum adversaries
2. Ehsan Ebrahimi, Tartu U, On Quantum Indifferentiability
3. Tore Vincent Carstens, Tartu U, On quantum indistinguishability under chosen plaintext attacks

Coding Theory

1. Ivo Kubjas, Tartu U, Two-Party Function Computation on the Reconciled Data
2. Vitaly Skachek, Tartu U, Constructions and Bounds for Batch Codes with Small Parameters
3. Yauhen Yakimenka, Tartu U, Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance

Semantics

1. Härmel Nestra, Tartu U, Double Applicative Functors
2. Hendrik Maarand, TTU, Certified Foata Normalization for Generalized Traces
3. Silvio Capobianco, TTU, Nonuniversality in Computation: a (non)-disproof of the Church-Turing thesis

Automata (and Related)

1. Hellis Tamm, TTU, Theoretical aspects of symbolic automata
2. Juhani Karhumäki, Turku U, Reachability via co-operating morphism
3. Maksims Dimitrijevs, Latvia U, Uncountable realtime probabilistic classes

Graph / Distributed Algorithms

1. Ivan Bliznets, Steklov IoM, Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
2. *Jukka Suomela, Aalto University, Understanding Computation via Computation*
3. Petteri Kaski, Aalto University, Delegatable and error-tolerant algorithms

Image Recognition

1. Egils Avots, Tartu U, Audio based emotion recognition in an uncontrolled environment
2. Fatemeh Noroozi, Tartu U, Audio-Visual Emotion Recognition in Video Clips

The Rest

1. Abdullah Makkeh, Tartu U, Bivariate Partial Information Decomposition: The Optimization Perspective
2. Ludmila Glinskih, Steklov IoM, Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs
3. Markus Whiteland, Turku U, On $k$-Abelian Equivalence Classes via Regularity