IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
05 November 2021
University of Luxembourg
Job PostingYour Role...
In 2018, the NIST announced an initiative to standardize lightweight authenticated encryption schemes and hash functions in an open process with public evaluation. The mission of the APLICA project is to contribute to the evaluation of the third-round candidates and the eventually standardized algorithms by analyzing their theoretical and practical security properties. More concretely, APLICA will contribute to the development of new cryptanalytic techniques that can be applied to lightweight authenticated encryption algorithms and hash functions, and to the design and implementation of new countermeasures against side-channel attacks, in particular differential power analysis, that are suitable for resource-constrained IoT devices.
Your Profile...
Candidates must hold a Ph.D. degree (or obtain a Ph.D. degree before September 2020) in symmetric cryptography or a closely related field. Preference will be given to candidates with a strong publication record that includes at least one paper at an IACR-sponsored conference/workshop or one of the top-4 security conferences. Experience in software development for embedded systems and/or side-channel attacks is a plus. Candidates with an interest to conduct research in one of the following areas are particularly encouraged to apply:
Closing date for applications:
Contact: leonard.pireaux@uni.lu
More information: http://emea3.mrted.ly/2vbse
Technische Universität Wien (TU Wien)
Job PostingThe novel interdisciplinary Marie Skłodowska-Curie COFUND doctoral training programme
LogiCS@TUWien - Logics for Computer Science http://www.vcla.at/msca
co-funded by the European Commission, will offer 20 full-time PhD positions.The program is hosted by TU Wien, one of the most successful technical universities in Europe and the largest one in Austria. The Faculty of Informatics of TU Wien is a leading research and teaching institution which consistently ranks among the top 100 computer science faculties in the global Times Higher Education ranking. In the heart of Europe, Vienna has a distinguished history in mathematics, computer science, and logic research and offers one of the highest living standards in the world.
The doctoral positions are open to international high-potential early-stage researchers working on Logical Methods in Computer Science and their applications, including:
* Artificial Intelligence * Databases * Verification * Algorithms * Security * Cyber-Physical Systems
The programme provides a 4-year long doctoral training for international PhD candidates within an English-language curriculum. LogiCS@TUWien will run for 60 months and foresees the recruitment of 20 PhD candidates. The PhD candidates will be supervised by:
* Ezio Bartocci * Pavol Cerny * Agata Ciabattoni * Thomas Eiter * Robert Ganian * Georg Gottlob * Laura Kovács * Matteo Maffei * Magdalena Ortiz * Stefan Szeider * Georg Weissenbacher * Stefan Woltran * Florian Zuleger
Two calls will accomplish the recruitment of the 20 positions. The first call is now open, with an application deadline of December 30, 2021.
For details on how to apply, see http://www.vcla.at/msca/apply or watch the video at https://youtu.be/Aq0JGJ9eqzQ.
Closing date for applications:
Contact: If you have any questions about the application procedure, please contact us under: msca@vcla.at
More information: http://www.vcla.at/msca/apply
IBM, Poughkeepsie, NY
Job PostingJob Duties:
- Develop and support the Testing and Emulation of IBM Cryptographic Library in C (CLiC) code on various IBM platforms
- Safely implement cryptographic algorithms and optimize them for the various IBM systems
- Develop optimized code once and reuse in various software and firmware components
- Rapidly address customer demands for new or faster cryptographic capabilities
- Drive innovation in cryptographic development
- Consult hardware development teams on where to provide hardware acceleration
As a core member of the Cryptography Algorithm Development Group, you will
- Successfully deliver technical solutions
- Work and collaborate as part of one team with worldwide collaborators
- Understand the requirements and goals of the customer
- Participate in customer reviews and internal technical solution reviews
- Ensure feedback to all teams
- Customer(s)
- Chief Architect
- Crypto Firmware Team(s)
- Offering Management
Apply online: https://careers.ibm.com/job/14168444/applied-cryptographer-poughkeepsie-ny/?codes=IBM_CareerWebSite
Closing date for applications:
Contact: Baaba Kyerewaa Forster-Forson
More information: https://careers.ibm.com/job/14168444/applied-cryptographer-poughkeepsie-ny/?codes=IBM_CareerWebSite
02 November 2021
University of Waterloo, Department of Combinatorics and Optimization
Job PostingThe Department of Combinatorics and Optimization at the University of Waterloo invites applications for two tenure-track faculty positions at the rank of Assistant Professor. Associate or Full Professors with tenure will be considered in special cases that enhance the research and teaching profile of the department. We welcome candidates in the research areas of algebraic combinatorics, continuous optimization, cryptography, discrete optimization, and graph theory. Emphasis will be given to candidates in the areas of continuous optimization, discrete optimization, and cryptography.
A Ph.D. degree and evidence of excellence in research and teaching are required. Successful applicants are expected to maintain an active program of research, to attract and supervise graduate students, and to participate in undergraduate and graduate teaching.
The salary range for the position is $105,000 to $155,000. Negotiations beyond this salary range will be considered for exceptionally qualified candidates. The effective date of appointment is July, 1 2022.
Interested individuals should apply using the MathJobs site (https://www.mathjobs.org/jobs/list/18454). Applications should include a curriculum vitae, research and teaching statements, and up to three reprints/preprints. In addition, at least three reference letters should be submitted.
If you have any questions regarding the position, the application process, assessment process, or eligibility, please contact combopt@uwaterloo.ca or Jochen Koenemann, Chair, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1. The closing date for receipt of applications is December 1, 2021.
Closing date for applications:
Contact: Jochen Koenemann, Chair, Department of Combinatorics and Optimization (jochen@uwaterloo.ca)
More information: https://uwaterloo.ca/combinatorics-and-optimization/career-opportunities
TU Darmstadt, Germany
Job PostingJob description: You'll work in the research training group/doctoral college Privacy&Trust for Mobile Users funded by the German Research Foundation (DFG). In our subproject, we build cryptography-based private machine learning services for mobile applications and investigate their legal applicability (data protection) and economic feasibility in interdisciplinary collaborations. You conduct research, implement prototypes, and publish&present the results at top venues. You'll participate in teaching and supervise thesis students & student assistants.
We offer: We demonstrate that privacy is efficiently protectable in real-world applications via cryptographic protocols. Our open and international working environment facilitates excellent research in a sociable team. TU Darmstadt is a top research university for IT security, cryptography and CS in Europe. Darmstadt is a very international, livable and well-connected city in the Rhine-Main area around Frankfurt. Knowledge of German is beneficial, but not required, and TU Darmstadt offers corresponding support.
Your profile:
- Completed Master's degree (or equivalent) at a top university with excellent grades in IT security, computer science, or a similar area.
- Extensive knowledge in applied cryptography/IT security and very good software development skills. Knowledge in cryptographic protocols (ideally MPC) is a plus.
- Experience with/motivation for working with other disciplines, e.g., law or economics.
- Self-motivated, reliable, creative, can work independently, and want to do excellent research.
- Our working language is English: able to discuss/write/present scientific results in English. German is beneficial but not required.
Closing date for applications:
Contact: Thomas Schneider (application@encrypto.cs.tu-darmstadt.de)
More information: https://encrypto.de/2021-RTG-EN
01 November 2021
Asiacrypt
Registration is now open: https://asiacrypt.iacr.org/2021/registration.php
For questions please contact the General Chair: asiacrypt2021@iacr.org
29 October 2021
Sonia Belaïd, Matthieu Rivain, Abdul Rahman Taleb, Damien Vergnaud
ePrint ReportIn this paper, we generalize the random probing expansion approach by considering a dynamic choice of the base gadgets at each step in the expansion. This approach makes it possible to use gadgets with high number of shares --which enjoy better asymptotic complexity in the expansion framework-- while still tolerating the best leakage rate usually obtained for small gadgets. We investigate strategies for the choice of the sequence of compilers and show that it can reduce the complexity of an AES implementation by a factor $10$. We also significantly improve the asymptotic complexity of the expanding compiler by exhibiting new asymptotic gadget constructions. Specifically, we introduce RPE gadgets for linear operations featuring a quasi-linear complexity as well as an RPE multiplication gadget with linear number of multiplications. These new gadgets drop the complexity of the expanding compiler from quadratic to quasi-linear.
Jelizaveta Vakarjuk, Nikita Snetkov, Jan Willemson
ePrint ReportChris Brzuska, Sabine Oechsner
ePrint ReportAbubakr Abdulgadir, Kamyar Mohajerani, Viet Ba Dang, Jens-Peter Kaps, Kris Gaj
ePrint ReportLuke Beckwith, Duc Tri Nguyen, Kris Gaj
ePrint ReportHyeonbum Lee, Jae Hong Seo
ePrint ReportXianrui Qin, Cailing Cai, Tsz Hon Yuen
ePrint ReportNext, we give a generic construction of blind ECDSA based on an additive homomorphic encryption and a corresponding zero-knowledge proof. Our concrete instantiation is about 40 times more bandwidth efficient than the blind ECDSA in AsiaCCS 2019.
After that, we give the first formal proof of one-more unforgeability for blind ECDSA, under a new model called algebraic bijective random oracle. The security of our generic blind ECDSA relies on the hardness of a discrete logarithm-based interactive assumption and an assumption of the underlying elliptic curve.
Finally, we analyze the hardness of the ECDSA-ROS problem in the algebraic bijective random oracle model.
Apheris, Berlin, Germany
Job PostingAs a Privacy and Cryptography Engineer at Apheris, your primary focus will be driving development of privacy and cryptographic modules in our product core and push it to customers together with a team of great software engineers and data scientists. You will be working on challenging deep tech projects closely together with customers from various industries with a focus on Healthcare, Pharma and Sustainability. With your engineering expertise, you will be responsible for meeting project and product goals and act accordingly to upcoming bottlenecks. You will design and build new features and enhance our product core with innovative technologies, participate in code reviews, and promote engineering best practices in our tech team. We empower you to be a major contributor to the success of projects, customer’s satisfaction, and the advancement of our product core.
What you will do- Implement privacy and cryptographic modules into our product in a secure, robust and scalable way
- Be a hands-on engineering contributor and promote best practices in our tech team
- Contribute to the writing of scientific whitepapers, Jupyter Notebook tutorials and blog posts about privacy and cryptographic algorithms and their usage in our product
- Contribute to team deliverables following an agile methodology and participate in retrospective sessions to continuously improve the teams’ way of working
- Master or PhD in Computer Science, Mathematics or Cryptography, or equivalent practical experience
- 3 or more years of relevant work experience
- Expert coding skills in Python, including common data science and ML libraries. Further languages are a plus (e.g.,R, C, C++, Go, Rust)
- Solid understanding of privacy technologies and machine learning
- ...
Closing date for applications:
Contact: See link to full text of the job description
More information: https://apheris.jobs.personio.de/job/492987?_pc=222318
Microsoft Research, Redmond, WA
Job PostingThe Cryptography and Privacy Research Group is hiring interns for the summer of 2022. We are seeking strong candidates to work with our renowned researchers on various topics. We are particularly interested in privacy-preserving ML, privacy and transparency techniques for digital identity systems and public key infrastructures, account/identity/password recovery, and web privacy/security, including fraud detection and prevention. We encourage all PhD students with relevant technical background in any of these topics to apply as soon as possible, as we will start interviewing immediately.
For summer internships, we typically work closely with Microsoft product groups (Teams, Edge, to name a few) to bring research ideas to real life. The internships often involve prototyping the research results, so a strong candidate is expected to have some proficiency in programming and interest in working alongside our engineers.
More information and application at https://careers.microsoft.com/us/en/job/1195145/Research-Intern-Privacy-and-Cryptography
Closing date for applications:
Contact: Kim Laine (kim.laine@microsoft.com)
KIT, Karlsruhe, Germany
Job PostingClosing date for applications:
Contact: Thorsten Strufe and Javier Parra-Arnau
More information: https://ps.tm.kit.edu/english/200.php
KIT, Karlsruhe, Germany
Job PostingClosing date for applications:
Contact: Thorsten Strufe
More information: https://ps.tm.kit.edu/english/200.php
27 October 2021
Canterbury, United Kingdom, -
Event CalendarSubmission deadline: 21 March 2022
Notification: 6 June 2022
Giesecke+Devrient Mobile Security GmbH, Munich, Germany
Job PostingG+D Mobile Security is looking for a Cryptography Engineer (m/f/d) for its Cryptology department at its Munich Headquarters as soon as possible
Job description:
- Secure implementation of cryptographic algorithms and security relevant OS components for smart cards in assembler
- Optimization regarding run time and memory consumption
- Design and implementation of countermeasures to defend against hardware related attacks against smart cards
- Analysis of the results of side-channel attacks and derivation of effective countermeasures
- Background in mathematics, computer science or electronic engineering
- Ideally PhD in cryptography or 3+ years experience in cryptography or related area
- Programming skills in assembler for 8/16/32 bit embedded microcontrollers
- Ideally experience in embedded security and side-channel-attacks
- High level of responsibility and exciting projects
- Working in an international security technology company
- Very flexible working hours and home office possibilities
- Wide range of training and further education opportunities
- Attractive family benefits such as a summer holiday camp for children
- Other benefits such as an own sports club and a canteen subsidized by the employer
https://careers.gi-de.com/job/Munich-Kryptologen-%28mfd%29-81677/723297801/
Closing date for applications:
Contact: Dr. Harald Vater (Harald.Vater (at) gi-de.com)
University of the West of England
Job PostingClosing date for applications:
Contact: Essam Ghadafi (Essam.Ghadafi@uwe.ac.uk)
More information: https://www.uwe.ac.uk/research/postgraduate-research-study/how-to-apply/studentship-opportunities/iot-over-wireless-networks