[DMANET] PhD Position on Foundational Cryptography at Chalmers (Gothenburg, Sweden)

We are looking for a PhD student to join the Crypto Team and Security Group at Chalmers with Christoph Egger as main supervisor. The position is fully funded for 5 years and comes with 20% teaching duties in the department. The Crypto Team currently has 2 faculty members, one Post-Doc and 4 PhD students and is embedded in the security group that captures a wide range of topics. Depending on the interests of the applicant, possible research topics include fine-grained and bounded space cryptography, realization of idealized models, relationship between cryptographic notions, and similar topics in foundational cryptography. Alternatively, a focus on formal methods for Cryptography is possible. One or two extended research visits are encouraged during the doctoral study. Applicants should have a strong interest in the mathematical analysis of algorithms in general and cryptography in particular. A master's degree in mathematics, computer science, or a related discipline is required. The working language in the department is English, and applicants are expected to be fluent both in written and spoken English. Swedish courses are available for interested students. Applications are due August 14 and should be submitted via https://www.chalmers.se/om-chalmers/arbeta-hos-oss/lediga-tjanster/? rmpage=apply&rmjob=15017[1] ## On the Topics + In **Bounded Space Cryptography** we are working with adversaries that are not restricted in their runtime but have limited memory and are trying to achieve basic cryptographic tasks that are secure against such adversaries. + **Idealized Models** are simplifications made in proofs for real-world cryptographic protocols. We often know that this is an oversimplification in general and can hide attacks. We are interested in studying under which circumstances the simplifications can be justified. + Cryptography relies on unproven assumptions like the hardness of factoring. Studying **Relations between Cryptographic Notions** asks the question of the type "If I can build public key encryption, can I also always have signature schemes?" and proves whether such statements are true or false. + **Formal Methods**we care about computer aid in verifying the correctness of proofs. Our tool, https://domino-prover.org/ is designed to aid in the development of complex cryptographic protocols like TLS -------- [1] https://www.chalmers.se/om-chalmers/arbeta-hos-oss/lediga-tjanster/? rmpage=apply&rmjob=15017&ref=academicpositions.com&utm_medium=talentech_publi shing&utm_source=academicpositions ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************