IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
02 May 2019
Nazarbayev University, Kazakhstan
Job PostingSuccessful candidates should hold a PhD in mathematics, statistics or in a related field and have excellent English-language communication skills and experience with Western higher education. Applicants for associate professor positions should have considerable experience in supervising students at the graduate level, possess strong teaching skills and experience, and a demonstrated rank-appropriate research accomplishment and service. Applicants for assistant professor level should demonstrate a potential for excellence in teaching, research, and service.
Position responsibilities include: teaching undergraduate and graduate level of courses (2-2 teaching load), supervision of graduate students, curricular and program development, ongoing engagement in professional and research activities, general program guidance and leadership, and other activities related to the intellectual and cultural environment of the university.
Nazarbayev University offers an attractive benefits package, including:
competitive compensation;
free housing based on family size and rank;
relocation allowance;
no-cost medical insurance, with global coverage;
educational allowance for children
air tickets to home country, twice per year
Closing date for applications: 31 May 2019
Contact: Applicants should send a detailed CV, teaching and research statements, and list of publications to sst.cv (at) nu.edu.kz
More information: http://sst.nu.edu.kz
Norwegian University of Science and Technology (NTNU), Trondheim, Norway
Job Posting- Tight security,
- Structure-preserving cryptography, and
- Lattice-based cryptography.
Candidates should be able to show their strong expertise in cryptography in form of publications at major crypto or security conferences. The position is for 2 years and the department may offer a twelve months extension for teaching. Knowledge of the Norwegian language is not mandatory for this position. The working language in the group is English. All students and people in the city (Trondheim) speak very good English.
More information is given in the following link and one can only apply this position through the same link: https://www.jobbnorge.no/en/available-jobs/job/169418/postdoctoral-fellowships-in-public-key-cryptography.
If you would like to have further information or any questions, please feel free to contact Jiaxin Pan.
Closing date for applications: 16 May 2019
Contact: Jiaxin Pan (jiaxin.pan at ntnu.no)
Norwegian University of Science and Technology (NTNU), Trondheim, Norway
Job PostingThe successful candidate in public-key cryptography will work with Jiaxin Pan who will start an Associate Professor position at the Department of Mathematical Sciences in fall 2019. Currently, topics of interest include (but not limited to):
- Tight security,
- Structure-preserving cryptography, and
- Lattice-based cryptography.
The successful candidate in cryptographic voting systems will work with Professor Kristian Gjøsteen at the Department of Mathematical Sciences. Topics of interest include (but not limited to):
- User confidence in cryptographic voting systems,
- Security proofs for such systems, and
- Long-term security, including post-quantum security.
The applicants should have a master’s degree in mathematics, or a master’s degree in computer science, communications technology or related areas, with a strong mathematical component. A background including experience with cryptography or computational complexity is desirable. Candidates completing their master degree in 2019 are encouraged to apply.
Norway needs candidates that can be security cleared. The PhD work itself does not require a security clearance, but candidates that can be security cleared may be preferred.
The positions are for 3 years. The Department may offer a twelve month extension as a teaching assistant. The candidates for the position must be fluent in English, both oral and written.
More information is given in the following links and one can only apply these positions through the corresponding links:
* https://www.jobbnorge.no/en/available-jobs/job/169454/doctoral-fellowship-in-public-key-cryptography
* https://www.jobbnorge.no/en/available-jobs/job/169452/phd-fellowship-in-cryptographic-voting
Closing date for applications: 16 May 2019
Contact: Jiaxin Pan (jiaxin.pan at ntnu.no) or Kristian Gjøsteen (kristian.gjosteen at ntnu.no)
Ulm University, Institute of Distributed Systems, Germany
Job PostingUlm University is a young research university with a focus on natural sciences, medicine and technology. Located in an economically strong region, the University with its more than 10,000 students offers a dynamic work environment with attractive networking and development prospects. The Institute of Distributed Systems is a leading research group in areas like automotive security and privacy engineering.
Closing date for applications: 30 June 2019
Contact: Interested candidates should send their application to vs-jobs (at) uni-ulm.de.
More information: https://www.uni-ulm.de/in/vs/
DarkMatter Group - Abu Dhabi
Job Posting- Analyze, evaluate and target any weaknesses security systems which range from single crypto-primitives to entire protocols, from classical ciphers to the newest lightweight or post-quantum schemes.
- Develop mathematical and statistical models to analyze and solve security data problems.
- Be involved in the analysis of developed cryptosystems within DarkMatter products.
- Collaborate with skillful software, hardware, and telecommunication engineers.
- Work closely with the secure communications team and other teams in the organization.
- Work with latest software and test your code on state-of-the-art High-Performance Devices.
- Conduct research in theoretical and practical cryptanalysis.
- Attend personalized in-house trainings with top cryptographers and international conferences and workshops.
*To bring your dream to life, you’ll need:
- PhD degree in Cryptography, Applied Cryptography, Information Theory and Mathematics, Computer Science or any relevant Engineering degree.
- Extensive experience in theoretical and practical cryptanalysis
Valuable publications in the field of cryptanalysis
- Extensive experience in performing side-channel attacks.
- Deep understanding of various hardware security vulnerabilities and threats.
Closing date for applications: 29 July 2019
Contact: Mehdi Messaoudi
Talent Acquisition Specialist
mehdi.messaoudi (at) darkmatter.ae
More information: https://boards.greenhouse.io/darkmatter/jobs/1090184
DarkMatter Group - Abu Dhabi
Job Posting- Design, implement and deploy quantum-safe cryptographic algorithms covering both but not limited to: key exchange algorithms and digital signature schemes.
- Conduct research and development in lattice-based, code-based or hash-based cryptosystems.
- Perform security assessments of either crypto-primitives or cryptosystems at the theoretical and implementation level.
- Work closely with the secure communications team and other teams in the organization to design end-to-end secure communication protocols using state-of-the art and customized cryptographic algorithms and primitives.
- Be involved in the integration of developed cryptosystems within DarkMatter products.
To bring your dream to life, you’ll need:
- PhD degree in Cryptography, Applied Cryptography, Information Theory and Mathematics or Computer Science.
- Extensive experience developing in various programming languages.
Closing date for applications: 29 August 2019
Contact: Mehdi Messaoudi
Talent Acquisition Specialist
mehdi.messaoudi (at) darkmatter.ae
More information: https://boards.greenhouse.io/darkmatter/jobs/1030431
Cosmian, Paris, France
Job PostingOur ambition is to solve the Private Data paradox: how to provide data intelligence to a rapidly rising data economy without compromising privacy.
Job Description
Your main responsibility will be to lead our cryptographic research and development. Cosmian implements the latest research in fully-homomorphic encryption, functional encryption and secure MPC, to provide better protection of privacy.
Your daily mission will include
- managing the collaborations with the academic and research worlds, working with some of the best world cryptographers including the crypto team from École Normale Supérieure Paris,
- understand how their latest research can be leveraged,
- design new implementation algorithms with Cosmian Rust/C++ developers,
- lead certification and/or patenting where appropriate,
- and more generally get our work known and recognized by a larger cryptography community.
The job is full-time and located in Paris, France. Remote work may be envisaged with specific requirements. The package includes stock options.
Required skills/qualifications
You must have a strong background in maths and in cryptography (Master and/or PhD) and must demonstrate
the ability to communicate complex ideas to a less maths-savvy audience.
A working command of French is not mandatory.
Closing date for applications: 1 October 2019
Contact: Bruno GRIEDER, bruno.grieder (at) cosmian.com, +33 6 33 27 46 85
or
Raphaël AUPHAN, raphael.auphan (at) cosmian.com
More information: https://cosmian.com/chief_scientist/
Pompeu Fabra University and Nokia Bell Labs
Job PostingWe are looking for highly motivated young researchers with a Master degree (or equivalent) in Computer Science, Engineering, Mathematics, Economics or related disciplines, willing to study and do research at the leading edge of blockchain technologies.
PhD students will be appointed for 36 months. All the fellowships provide a highly competitive remuneration package, complemented by mobility and family allowances (for eligible candidates).
The evaluation committee will assess candidates on a continuous basis until the positions are filled. First evaluation will be at the end of May , and afterwards regularly at the end of every month until all candidates are selected. Once evaluated will be contacted, and if pre-selected interviews will be arranged either via telco or by inviting you to one of the partners. Selected ESRs will be published on the website.
Closing date for applications:
Contact: bandit (at) upf.edu
More information: https://www.upf.edu/web/bandit
01 May 2019
Kaliningrad, Russia, 15 July - 19 July 2019
School29 April 2019
Jeju, South Korea, 21 August - 24 August 2019
Event CalendarSubmission deadline: 31 May 2019
Notification: 30 June 2019
Gandhinagar, India, 3 December - 7 December 2019
Event CalendarSubmission deadline: 30 June 2019
Notification: 1 August 2019
28 April 2019
Yue Qin, Chi Cheng, Jintai Ding
ePrint ReportAlexandra Boldyreva, Tianxin Tang, Bogdan Warinschi
ePrint ReportShan Chen, Samuel Jero, Matthew Jagielski, Alexandra Boldyreva, Cristina Nita-Rotaru
ePrint ReportJulien Lavauzelle, Julian Renner
ePrint Report27 April 2019
Aurore Guillevic, Simon Masson, Emmanuel Thomé
ePrint ReportGuangpu Gao, Dongdai Lin, Wenfen Liu , Yongjuan Wang
ePrint ReportHarsh Chaudhari, Arpita Patra, Ajith Suresh
ePrint ReportIn the semi-honest setting, our protocol requires communication of $2$ ring elements for a ring of integers modulo $2^l$ per multiplication gate during the online phase, attaining a per-party cost of less than one element. This is achieved for the first time in the regime of 3PC. In the malicious setting, our protocol requires communication of $4$ elements per multiplication gate during the online phase, beating the state-of-the-art protocol by $5$ elements. We boost the security of our protocols in the malicious setting to achieve fairness without affecting the stated online complexity.
We apply our techniques from $3$PC in the regime of secure server-aided machine-learning (ML) inference for a range of prediction functions-- linear regression, linear SVM regression, logistic regression, and linear SVM classification. Our setting considers a model-owner with trained model parameters and a client with a query, with the latter willing to learn the prediction of her query based on the model parameters of the former. The inputs and computation are outsourced to a set of three non-colluding servers. Our constructions catering to both semi-honest and the malicious world, invariably perform better than the existing constructions.
Jan Czajkowski, Christian Majenz, Christian Schaffner, Sebastian Zur
ePrint ReportSubsequently, we use our game-playing framework to prove quantum indifferentiability of the sponge construction, assuming a random internal function or a random permutation. Our results upgrade post-quantum security of SHA-3 to the same level that is proven against classical adversaries.
Florian Bourse, Olivier Sanders, Jacques Traoré
ePrint ReportIn this paper, we present new solutions for the problem of secure integer comparison in both of these settings. The underlying idea for both schemes is to avoid decomposing the integers in binary in order to improve the performances. Our fully homomorphic based solution is inspired by Bourse et al, and makes use of the fast bootstrapping techniques recently developpedto obtain scalability for large integers while preserving high efficiency. On the other hand, our solution to the original Millionaires' problem is inspired by the protocol of Carlton et al, based on partially homomorphic encryption. We tweak their protocol in order to minimize the number of interactions required, while preserving the advantage of comparing non-binary integers.
Both our techniques provide efficient solutions to the problem of secure integer comparison for large (even a-priori unbounded in our first scenario) integers with minimum interaction.