IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
18 November 2021
KU LEUVEN
Research group COSIC is looking for a PhD position on Secure Localisation Technologies
The goal of this PhD research is twofold.
Candidates must hold a master’s degree in electronics engineering or computer science, have good grades and have a keen interest in cryptography and system security. Prior expertise in physical layer security or radio propagation is a bonus.
Closing date for applications:
Contact: Please check the application procedure at https://www.esat.kuleuven.be/cosic/vacancies/ and send all requested documents to jobs-cosic@esat.kuleuven.be
More information: https://www.esat.kuleuven.be/cosic/vacancies/
CISPA Helmholtz Center for Information Security
The positions are fully funded and located at the CISPA Helmholtz Center for Information Security in Germany, one of the world’s top research institutions in the area of information security. The start dates for the positions are flexible and applications will be considered until the positions are filled.
For additional details and information on how to apply see https://karlwuest.github.io/positions
Closing date for applications:
Contact: Karl Wüst
More information: https://karlwuest.github.io/positions/
Zama, Paris, France
- discovering new cryptographic techniques to compute on encrypted data
- working with the engineering and product teams to implement his/her/their research into our products
- design robust tests and benchmarks to validate his/her/their research and its implementation
- review the latest published research, and inform the team on potential new applications
- work with the entire team to define the research and product roadmaps
- publishing papers, filing patents and presenting his/her/their work at academic conferences
- have a PhD in cryptography or equivalent
- have deep knowledge of homomorphic encryption
- have (optionally) knowledge of LWE hardness and security
- have (optionally) knowledge of machine learning
- be passionate about privacy and open source software
- have good written and oral communication skills
Closing date for applications:
Contact: Ilaria Chillotti (ilaria.chillotti(at)zama.ai)
More information: https://www.welcometothejungle.com/en/companies/zama/jobs/senior-researcher-cryptography_paris
Nanyang Technological University, Singapore
- tool aided cryptanalysis, such as MILP, CP, STP, and SAT
- machine learning aided cryptanalysis and designs
- privacy-preserving friendly symmetric-key designs
- quantum cryptanalysis
- provable security
- cryptanalysis against SHA-2, SHA-3, and AES
- threshold cryptography
Closing date for applications:
Contact: Asst Prof Jian Guo, guojian@ntu.edu.sg
More information: https://team.crypto.sg
University of Neuchatel, Switzerland
We are oferring a fully funded PhD scholarship for a student to join our group on reinforcement learning and decision making under uncertainty more generally, at the University of Neuchatel, Switzerland. We are particularly interested in candidates with a strong mathematical and research interest in the following fields e
- Theory of differential privacy.
- Algorithms for differentially private machine learning.
- Algorithms for fairness in machine learning.
- Interactions between machine learning and game theory.
- Inference of human models of fairness or privacy.
Overall, our group works on reinforcement learning, decision making under uncertainty, fairness and differential privacy. The student will also have the opportunity to visit and work with other group members at the University of Oslo, Norway and Chalmers University of Technology, Sweden.
- Starting date 1 Februrary 2022 or soon afterwards.
- Application deadline 30 November 2021.
Closing date for applications:
Contact: Christos Dimitrakakis
More information: https://sites.google.com/site/christosdimitrakakis/positions
17 November 2021
Karim Lounis, Mohammad Zulkernine
Viet Ba Dang, Kamyar Mohajerani, Kris Gaj
Kyungbae Jang, Gyeongju Song, Hyunjun Kim, Hyeokdong Kwon, Hyunji Kim, Hwajeong Seo
Amos Zheng, Marcos A. Simplicio Jr.
Sangeeta Chowdhary, Wei Dai, Kim Laine, Olli Saarikivi
Our work improves upon the EVA toolchain in several ways: changes to the Python front-end make writing PyEVA programs more natural, while a rework of EVA's C++ APIs makes writing new passes easier. We also implement two new optimizations, common subexpression elimination and reduction balancing, which we show allow users to write simpler and more modular PyEVA programs.
We argue that the abstraction EVA provides is insufficient to resolve some common usability challenges. For example, managing vectors of arbitrary size is non-trivial. To resolve these problems, we demonstrate how building a library of commonly used data structures and functions is simple in PyEVA. EVA's automation allows writing very concise code, which gets fused and optimized together with the user program. We create the beginnings of an EVA Extension Library (EXL), that provides vector and matrix classes and a collection of common statistical functions, to demonstrate the power of this approach.
Xavier Bultel
Nico Döttling, Vipul Goyal, Giulio Malavolta, Justin Raizes
Phil Hebborn, Baptiste Lambin, Gregor Leander, Yosuke Todo
Relations between Privacy, Verifiability, Accountability and Coercion-Resistance in Voting Protocols
Alisa Pankova, Jan Willemson
Nicolas Alhaddad, Sisi Duan, Mayank Varia, Haibin Zhang
This paper introduces an erasure coding proof (ECP) system, which allows the encoder to prove succinctly and non-interactively that an erasure-coded fragment is consistent with a constant-sized commitment to the original data block. Each fragment can be verified independently of the other fragments.
Our proof system is based on polynomial commitments, with new batching techniques that may be of independent interest. To illustrate the benefits of our ECP system, we show how to build the first AVID protocol with optimal message complexity, word complexity, and communication complexity.