IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
11 October 2022
TU Wien (Security and Privacy Research Unit)
Your profile:
- Completion of an appropriate doctorate and in-depth knowledge of the subject area
- An outstanding publication record in top security and privacy conferences
- Research background in one of the following topics: formal methods for security and privacy, blockchain technologies, intersection between machine learning and security or privacy, or web security
- Experience in teaching and publication activities as well as interest and pleasure in research and working with students
- Organisational and analytical skills as well as a structured way of working
- Excellent skills in English communication and writing, knowledge of German (level B2) or willingness to learn it in the first year.
We look forward to receiving your application until 10.11.2022. Applications are only processed online: https://jobs.tuwien.ac.at/Job/194015
Closing date for applications:
Contact: Univ.-Prof. Dr. Matteo Maffei
More information: https://jobs.tuwien.ac.at/Job/194015
Qualcomm Technologies, Inc. - Cork, Ireland
The internship program will skill up the candidate in developing side-channel analysis attacks in the context of post-quantum cryptography, including (but not limited to): literature exploration of most relevant algorithms, open problems, and industry vs. academy gaps; high-performance implementation of state-of-the-art attacks and addition feature to in-house tools.
Minimum qualifications
- Towards the end of M.Sc. or Ph.D. academic degree in Computer Engineering and/or Electrical (or physics) Engineering, or related field
- 6 months is the minimum period for internship program
- Basic knowledge in linear and abstract algebra
- Good knowledge in system-level programming languages (e.g., C, C++, Rust)
- Good communication skills, curiosity and enthusiasm, ability to work independently and willingness to learn
- Knowledge in cryptography and security-related topics (e.g., key management and authentication)
- Good understanding of SoC architecture, ASIC design, and/or hardware security
- Hands-on experience with: VHDL/Verilog, FPGA prototyping, lab equipment
Intern/co-op placement as part of Master/PhD program.
Closing date for applications:
Contact: Santos Merino del Pozo (sdelpozo@qti.qualcomm.com)
Inria Bordeaux
The ANR Project CIAO is looking for a one year postdoc on isogeny based cryptography. The researcher will be working on any area related to this topic: security, implementations, hash functions, key exchange, signature, VDF, higher dimensional isogenies...
The location will be at the Bordeaux Mathematical institute, in France.
https://www.math.u-bordeaux.fr/imb/spip.php?lang=fr
https://www.inria.fr/fr/centre-inria-universite-bordeaux
The application is open and should ideally be filled before April 2023, although an extension should be possible.
The postdoctoral researcher will be part of the LFANT team
https://lfant.math.u-bordeaux.fr/
who develops the Pari/GP software
https://pari.math.u-bordeaux.fr/
If you are interested, please send an email including your CV and a list of publications.
Closing date for applications:
Contact: Damien Robert
http://www.normalesup.org/~robert/pro/infos.html
King's College London
Closing date for applications:
Contact: Martin Albrecht
Barcelona, Spain, 15 February - 17 February 2023
Rabat, Morocco, 29 May - 31 May 2023
Submission deadline: 31 December 2022
Notification: 20 February 2023
10 October 2022
Wenwen Xia, Leizhang Wang, Geng Wang, Dawu Gu, Baocang Wang, Leizhang Wang, GengWang, Dawu Gu, Baocang Wang
Ritam Bhaumik, André Chailloux, Paul Frixons, María Naya Plasencia
Ward Beullens, Gregor Seiler
Bart Mennink
Huanhuan Chen, Yao Jiang Galteland, Kaitai Liang
Sebastian Ramacher, Daniel Slamanig, Andreas Weninger
In this work we set the goal to provide a single PPAKE model that captures privacy guarantees against different types of attacks, thereby covering previously proposed notions as well as so far not achieved privacy guarantees. In doing so, we obtain different "degrees" of privacy within a single model, which, in its strongest forms also capture privacy guarantees against powerful active adversaries. We then proceed to investigate (generic) constructions of AKE protocols that provide strong privacy guarantees in our PPAKE model. This includes classical Diffie-Hellman type protocols as well as protocols based on generic building blocks, thus covering post-quantum instantiations.
Timo Glaser, Alexander May
Tomoyuki Morimae, Takashi Yamakawa
(1) We define a weaker version of OWSGs, which we call weak OWSGs, and show that they are equivalent to OWSGs. It is a quantum analogue of the amplification theorem for classical weak one-way functions.
(2) (Bounded-time-secure) quantum digital signatures with quantum public keys are equivalent to OWSGs.
(3) Private-key quantum money schemes (with pure money states) imply OWSGs.
(4) Quantum pseudo one-time pad schemes imply both OWSGs and EFI pairs. For EFI pairs, single-copy security suffices.
(5) We introduce an incomparable variant of OWSGs, which we call secretly-verifiable and statistically-invertible OWSGs, and show that they are equivalent to EFI pairs.
Kai Hu, Thomas Peyrin
Unsurprisingly, HD/HDL attacks have the potential to be more effective than their simpler differential/DL counterpart. We provide three novel methods to detect possible HD/HDL distinguishers, including: (a) an estimation of the algebraic degree of the differential supporting function (DSF); (b) the higher-order algebraic transitional form (HATF); (c) experimental methods based on cube testers. With these methods, we greatly improve the distinguishing attacks on the 8-round Ascon permutation under the black-box model from $2^{130}$ to $2^{46}$. Also, we give a new zero-sum distinguisher for a full 12-round Ascon permutation with only $2^{55}$ time/data complexity, improving over the previous best one that requires $2^{130}$ calls (we make clear that this does not impact the full Ascon AEAD scheme). For the 4-round Ascon initialization, a deterministic 2nd order HDL distinguisher is proposed with only four nonces. Besides the distinguishers, the HATF technique allows us to handle the probabilistic HD/HDL properties of cryptographic primitives. This leads to a conditional HDL attack on 5-round Ascon initialization that can recover all the key bits, and performing 8 times faster than the conditional DL attack. To the best of our knowledge, this is the first theoretical work to propose a probabilistic HDL attack since it was first published.All our attacks in this paper apply to both Ascon-128 and Ascon-128a. We also give a conditional HD approximation for 130-round Grain v1 (reaching 5 more rounds than the previous best conditional differential approximation) and new 4-round deterministic HDL distinguishers for the Xoodoo permutation with only four chosen plaintexts. Finally, we applied our strategy to the ARX-based cipher ChaCha, obtaining 3.5-, 4- and 4.5-round distinguishers and again improving over the state-of-the-art. Our cryptanalyses do not threaten the security of the ciphers mentioned in this paper.
Trey Li
Sajin Sasy, Aaron Johnson, Ian Goldberg
In this work, we present fast, fully oblivious algorithms for compaction and shuffling. We implement and evaluate our designs to show that they are practical and outperform the state of the art. Our oblivious compaction algorithm, ORCompact, is always faster than the best alternative and can yield up to a 5x performance improvement. For oblivious shuffling, we provide two novel algorithms: ORShuffle and BORPStream. ORShuffle outperforms prior fully oblivious shuffles in all experiments, and it provides the largest speed increases—up to 1.8x—when shuffling a large number of small items. BORPStream outperforms all other algorithms when shuffling a large number of large items, with a speedup of up to 1.4x in such cases. It can obtain even larger performance improvements in application settings where the items to shuffle arrive incrementally over time, obtaining a speedup of as much as 4.2x. We additionally give parallel versions of all of our algorithms, prove that they have low parallel step complexity, and experimentally show a 5–6x speedup on an 8-core processor.
Finally, ours is the first work with the explicit goal of ensuring full obliviousness of complex functionalities down to the implementation level. To this end, we design Fully Oblivious Assembly Verifier (FOAV), a tool that verifies the binary has no secret-dependent conditional branches.
Nikolaos Makriyannis
On a technical level, we show the above by extending the proof technique of Canetti, Makriyannis, and Peled, recently generalized by Blokh, Makriyannis, and Peled (Manuscript’22) for arbitrary threshold-signature schemes, whereby the indistinguishability of the UC simulation is reduced to the unforgeability of the underlying signature scheme. Our results hold in the random oracle model under the discrete logarithm assumption.