IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
15 February 2023
Xinxin Gong, Yonglin Hao, Qingju Wang
Hisham S. Galal, Amr M. Youssef
Marloes Venema
In this work, we present the first compiler for attribute-based encryption schemes that supports such extensions. To this end, we generalize the definitions of pair encodings and the symbolic property. With our compiler, we flexibly instantiate any pair encodings that satisfy this new notion of the symbolic property in any pairing-friendly groups, and generically prove the resulting scheme to be selectively secure. To illustrate the effectiveness of our new compiler, we give several new multi-authority and hash-based constructions.
Soundes Marzougui, Ievgan Kabin, Juliane Krämer, Thomas Aulbach, Jean-Pierre Seifert
We accomplish the attack on FrodoKEM, a lattice-based KEM and third-round alternate candidate. We execute it on a Cortex-M4 board equipped with an STM32F4 micro-controller clocked at different frequencies.
Reyhaneh Rabaninejad, Alexandros Bakas, Eugene Frimpong, Antonis Michalas
Jianwei Li, Michael Walter
Alessandro Budroni, Erik Mårtensson
Chloé Hébant, David Pointcheval, Robert Schädlich
Joakim Brorsson, Bernardo David, Lorenzo Gentile, Elena Pagnin, Paul Stankovski Wagner
Kaizhan Lin, Jianming Lin, Shiping Cai, Weize Wang, Chang-An Zhao
In this paper, we present several new techniques to compress the public key of M-SIDH. Our method to compress the key is reminiscent of public-key compression in SIDH/SIKE, including torsion basis generation, pairing computation and discrete logarithm computation. We also prove that compressed M-SIDH is secure if M-SIDH is secure.
Experimental results showed that our approach fits well with compressed M-SIDH. It should be noted that most techniques proposed in this paper could be also utilized into other SIDH-like protocols.
14 February 2023
Nominations for the 2023 Test-of-Time award (for papers published in 2008) will be accepted until Feb 15, 2023.
https://iacr.org/testoftime
RWC 2023 will take place in Tokyo, Japan on March 27-29 2023.
The registration site is now open:
https://rwc.iacr.org/2023/registration.php
Kyoto, Japan, 19 June - 22 June 2023
Submission deadline: 20 March 2023
Notification: 19 April 2023
13 February 2023
Virtual event, Anywhere on Earth, 19 June - 22 June 2023
Submission deadline: 1 March 2023
Notification: 9 April 2023
Centre for Secure Information Technologies (CSIT), Queen’s University Belfast, UK
Applicants must have at least a 2:1 Honours Degree in Electrical and Electronics Engineering, Computer Science, Mathematics or closely related discipline.
International studentships are also available.
Closing date for applications:
Contact: Dr. Ayesha Khalid
More information: https://www.qub.ac.uk/courses/postgraduate-research/phd-opportunities/lightweight-post-quantum-cryptography-on-modern-opensource-riscv-processors.html
Centre for Secure Information Technologies (CSIT), Queen’s University Belfast, UK
Applicants must have at least a 2:1 Honours Degree in Electrical and Electronics Engineering, Computer Science, Mathematics or closely related discipline.
International studentships are also available.
Closing date for applications:
Contact: Dr. Ayesha Khalid
More information: https://www.qub.ac.uk/courses/postgraduate-research/phd-opportunities/fault-tolerant-post-quantum-cryptography-systems-for-satellite-communications.html
University of Waterloo, Waterloo, Ontario, Canada
The Department of Combinatorics and Optimization at the University of Waterloo invites applications from qualified candidates for a 1.5-year position as a Cryptographic Research Architect on the Open Quantum Safe project (https://openquantumsafe.org/).
This position is available immediately in Professor Stebila’s research group. You will be working with a world-wide team of researchers and developers from academia and industry on the Open Quantum Safe project. You will have the opportunity to push the boundaries of applied post-quantum cryptography and contribute to various open-source projects. You will help integrate new post-quantum cryptographic algorithms into the liboqs open-source library, and design and implement techniques for evaluating and benchmarking these cryptographic algorithms in a variety of contexts.
The field of post-quantum cryptography is rapidly evolving, and you will need to track ongoing changes to algorithms due to peer review and advances by researchers via the the NIST Post-Quantum Cryptography project forum. In addition to algorithm research, tasks cover all aspects of the software development lifecycle and include design, programming cryptographic algorithms, integrating other cryptographic implementations into the liboqs framework, integrating liboqs into 3rd party open-source projects, testing, benchmarking and documentation. You may be asked to take an ownership role in coordinating the development of various sub-component of the Open Quantum Safe project.
The appointment will be a full-time position for 18 months with the possibility of extension, pending on research funding. The salary range is $80,000–$115,000/year and commensurate with experience.
All qualified candidates are encouraged to apply; however, Canadian citizens and permanent residents will be given priority.
For more information on the position and how to apply, please see https://openquantumsafe.org/team/open-positions
Closing date for applications:
Contact: Douglas Stebila (dstebila@uwaterloo.ca)
More information: https://openquantumsafe.org/team/open-positions
Chalmers University of Technology
The position is fully funded for five years with possible extensions for parental or sick leave, and an attractive salary. The position is linked to a project funded by the Swedish research council focusing on the security and efficiency of progressive verification for cryptographic schemes. If you think this sounds cool, follow the link below and apply!
Applicants are expected to hold an MSc degree in Mathematics and/or Computer Science. Knowledge of cryptographic primitives and information security is preferable, but not mandatory. Only applications via the official portal will be considered.
Closing date for applications:
Contact: For more information check out:
- The official ad: https://www.chalmers.se/en/about-chalmers/work-with-us/vacancies/?rmpage=job&rmjob=11434&rmlang=UK
- Elena's webpage: https://epagnin.github.io
More information: https://www.chalmers.se/en/about-chalmers/work-with-us/vacancies/?rmpage=job&rmjob=11434&rmlang=UK
Leuphana University Lüneburg, Institute of Information Systems
Closing date for applications:
Contact: Leuphana Universität Lüneburg Personal und Recht / Bewerbungsmanagement Code: WiMi Network Science Universitätsallee 1 21335 Lüneburg bewerbung@leuphana.de
University of St.Gallen, Switzerland
Key Responsibilities:
- The post-doctoral fellow is expected to perform exciting and challenging research in the area of information security and cryptography including the design of provably secure cryptographic protocols.
- The post-doctoral fellow shall be involved in the supervision of PhD and master students
- The post-doctoral researcher is expected to have a PhD degree in Computer Science, Engineering or Mathematics and a strong background in theoretical computer science and cryptography
- Have an excellent publication record in top venues Competitive research record in cryptography or information security
- Strong mathematical and algorithmic CS background
- Good skills in programming is beneficial
- Excellent written and verbal communication skills in English
Please apply asap.
Closing date for applications:
Contact:
Eriane Breu, eriane.breu@unisg.ch (Administrative matters)
Prof. Katerina Mitrokotsa, katerina.mitrokotsa@unisg.ch (Research related questions)
More information: https://jobs.unisg.ch/offene-stellen/postdoc-fellow-in-cryptography-information-security-m-w-d/c35410fb-40bb-41f2-b298-8be150d8f9b6