IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
23 March 2022
Temasek Labs, Nanyang Technological University, Singapore
Job PostingCandidates should ideally have already completed, or be close to completing a Master’s (with relevant experience) or PhD degree in mathematics, computer science, electrical engineering, or related disciplines, with track record in R&D (publications in international journals and conferences).
You will be joining a dynamic group performing research on embedded security. The research focus of the current roles are:
1. Hardware forensics with focus on vulnerability assessment in commercial and industrial devices.
2. Physical attack and countermeasures for novel cryptographic primitives
3. Micro-architectural attacks
This position is available from May 2022. TL offers competitive salary package plus other benefits.
Review of applications will start immediately until position is filled.
Interested candidates should send their detailed CVs, cover letter and references.
Closing date for applications:
Contact: Shivam Bhasin, Principal Investigator: sbhasin (at) ntu.edu.sg
STMicroelectronics
Job Posting- Develop effective (security, latency, silicon area/code size costs), countermeasures against side-channel and fault attacks, by working in conjunction with SW and HW designers
- Contribute to the definition of effective post-quantum public key cryptographic implementations
- Deploy security expertise and help ST product divisions shape the right security solutions for their products (ICs).
- Stay on top of security needs and state-of-the-art evolution, anticipating/identifying solutions and partners, developing or making available the security competences and IPs that will be needed by the Company in a 3-5 years time frame.
- An extensive background in mathematics and public key cryptography
- Knowledge of state-of-the-art side-channel and fault attacks and related countermeasures
- Teamwork, networking, customer-orientation & communication skills
- Motivation for bridging research outcomes and product design
- Experience in embedded SW design or HW design is a plus
Closing date for applications:
Contact: Matteo BOCCHI (matteo.bocchi@st.com), Ruggero SUSELLA (ruggero.susella@st.com)
More information: https://stcareers.talent-soft.com/job/job-security-engineer-m-f_18168.aspx
22 March 2022
Ran Canetti, Palak Jain, Marika Swanberg, Mayank Varia
ePrint Report(1) We formulate an ideal functionality that captures end-to-end secure messaging, in a setting with PKI and an untrusted server, against an adversary that has full control over the network and can adaptively and momentarily compromise parties at any time and obtain their entire internal states. In particular our analysis captures the forward and backwards secrecy properties of Signal and the conditions under which they break. (2) We model the various components of Signal (PKI and long-term keys, backbone "asymmetric ratchet", epoch-level symmetric ratchets, authenticated encryption) as individual ideal functionalities that are analysed separately and then composed using the UC and Global-State UC theorems. (3) We use the Random Oracle Model to model non-committing encryption for arbitrary-length messages, but the rest of the analysis is in the plain model based on standard primitives. In particular, we show how to realize Signal's key derivation functions in the standard model, from generic components, and under minimalistic cryptographic assumptions.
Our analysis improves on previous ones in the guarantees it provides, in its relaxed security assumptions, and in its modularity. We also uncover some weaknesses of Signal that were not previously discussed.
Our modeling differs from previous UC models of secure communication in that the protocol is modeled as a set of local algorithms, keeping the communication network completely out of scope. We also make extensive, layered use of global-state composition within the plain UC framework. These innovations may be of separate interest.
Tingting Guo, Peng Wang
ePrint ReportYehuda Lindell
ePrint ReportIn our presentation, we do not assume that all parties begin with the message to be signed, the identities of the participating parties and a unique common session identifier, since this is often not the case in practice. Rather, the parties achieve consensus on these parameters as the protocol progresses.
Sergey Agievich
ePrint ReportVadym Kliuchnikov, Kristin Lauter, Romy Minko, Christophe Petit, Adam Paetznick
ePrint ReportAsep Muhamad Awaludin, Jonguk Park, Rini Wisnu Wardhani, Howon Kim
ePrint ReportRiddhi Ghosal, Paul Lou, Amit Sahai
ePrint ReportIn this work, we build the first NIZK argument for $\mathsf{NP}$ from the LWE assumption that does not rely on parallel repetition. Instead, we show how to make use of the more efficient ``MPC in the Head'' technique for building an underlying honest-verifier protocol upon which to apply the Fiat-Shamir paradigm. The key to making this possible is a new construction of CI hash functions from LWE, using efficient algorithms for polynomial reconstruction as the main technical tool.
We stress that our work provides a new and more efficient ``base construction'' for building LWE-based NIZK arguments for $\mathsf{NP}$. Our protocol can be the building block around which other efficiency-focused bootstrapping techniques can be applied, such as the bootstrapping technique of Gentry et al. (Journal of Cryptology 2015).
Makoto Habu, and Kazuhiko Minematsu, Tetsu Iwata
ePrint ReportSamir Jordan Menon, David J. Wu
ePrint ReportPatrick Longa
ePrint ReportClémence Bouvier, Anne Canteaut, Léo Perrin
ePrint ReportKathrin Hövelmanns, Andreas Hülsing, Christian Majenz
ePrint ReportENS Lyon
Job PostingWe are looking for candidates with a strong record related to any of the above topics. Starting date and duration are flexible. To apply, please send your CV, a motivation letter and names of at least two persons who can provide reference letters.
Closing date for applications:
Contact: damien.stehle@ens-lyon.fr, alain.passelegue@ens-lyon.fr, benoit.libert@ens-lyon.fr
More information: https://www.ens-lyon.fr/LIP/AriC/crypto
20 March 2022
BITS Pilani Goa, India, 6 January - 8 January 2023
Event CalendarSubmission deadline: 15 July 2022
Notification: 15 September 2022
Virtual event, Anywhere on Earth, 26 September - 27 September 2022
Event CalendarSubmission deadline: 27 May 2022
Notification: 29 July 2022
TU Darmstadt
Job PostingTopics of particular interest include (but are not limited to):
- Leakage/tamper resilient cryptography
- Cryptography for blockchains and cryptocurrencies
- Multiparty computation & threshold cryptography
- Decentralized finance
- Completed Master's degree (or equivalent) at a top university with excellent grades in computer science, mathematics or a similar area.
- Strong mathematical and/or algorithmic/theoretical CS background
- Good knowledge of cryptography. Knowledge in concepts of provable security is a plus.
- Fluent written and verbal communication skills in English
Closing date for applications:
Contact: Sebastian Faust (office.cac@cysec.de)
More information: https://www.informatik.tu-darmstadt.de/cac/cac/index.en.jsp
JAIPUR, India, 8 December - 11 December 2022
Event CalendarSubmission deadline: 30 June 2022
Notification: 1 August 2022
18 March 2022
Award
The Test-of-Time award for Asiacrypt 2007 is awarded to: Faster Addition and Doubling on Elliptic Curves, by Daniel J. Bernstein and Tanja Lange, for introducing efficient elliptic curve addition formulae in the context of Edwards forms of elliptic curves.
The Test-of-Time award for Crypto 2007 is awarded to: Deterministic and Efficiently Searchable Encryption, by Mihir Bellare, Alexandra Boldyreva and Adam O'Neill, for placing searchable encryption on a rigorous footing, leading to a huge interest in this field in applications.
The Test-of-Time award for Eurocrypt 2007 is awarded to: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries, by Yehuda Lindell and Benny Pinkas, for providing the first implementable protocol for actively secure variants of Yao's protocol, and thus paving the way to more practical constructions.
For more information, see https://www.iacr.org/testoftime.
Congratulations to all winners!