IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
05 July 2021
Pieter Pauwels
ePrint ReportWenshuo Guo, Fang-Wei Fu
ePrint ReportVipul Arora, Ileana Buhan, Guilherme Perin, Stjepan Picek
ePrint ReportAurélien Vasselle, Hugues Thiebeauld, Philippe Maurine
ePrint ReportThis work makes use of mixture distributions to formalize this complexity, allowing us to explain the benefit of using a technique like Scatter, where different samples of the traces are aggregated into the same distribution. Some observations of the conditional mixture distributions are made in order to model the leakage in such context. From this, we infer local coherency of information held in the distribution as a general property of side-channel leakage in mixture distributions. This leads us to introduce how spatial analysis tools, such as Moran's Index, can be used to significantly improve non-profiled attacks compared to other techniques from the state-of-the-art. Exploitation of this technique is experimentally shown very promising, as demonstrated on two AES implementations including masking and shuffling countermeasures.
Alexandros Bakas, Antonis Michalas
ePrint ReportKalle Ngo, Elena Dubrova, Thomas Johansson
ePrint ReportAjeet Kumar, Subhamoy Maitra
ePrint Report03 July 2021
Università della Svizzera italiana (Lugano, Switzerland)
Job PostingCandidates must hold (or be close to the completion of) a master degree (for the PhD position) or a PhD degree (for the Post-Doc position), preferably in computer science, computer engineering, or electrical engineering. Prior experience in hardware design, software programming, and/or cryptography is an asset. The research work will involve contributing to international research projects.
Interested candidates should apply by sending an email with subject line “Application for Ph.D” or “Application for Post-Doc” to openposition@a.alari.ch including your CV, the name and the contact information of at least two references, the appropriate certificates, and a motivation letter that demonstrates your interest in and your qualifications for the positions.
Screening of applications will begin 15th July. Priority will be given to applications submitted by this date, but the position will remain open until filled.
Closing date for applications:
Contact: Inquiries can be sent to openposition@a.alari.ch
Robert Bosch GmbH - Corporate Research
Job Posting- As a PhD student in our research group, you will actively contribute to research and engineering projects at the intersection of cloud computing and privacy-enhancing technologies (PETs).
- Embedded in an international team of cloud and security experts, you will apply your knowledge of distributed systems and cloud technologies to design, implement and validate cloud native PET solutions as part of the Franco-German BMBF/MESRI-funded research project CRYPTECS.
- Your work consists of integrating state-of-the-art PETs (such as Secure Multiparty Computation, Trusted Execution Environments, and Differential Privacy) with distributed systems / computing concepts (such as distributed ledgers and parallel programming models) and cloud-native technologies (such as container orchestrators and serverless computing frameworks) at a conceptual and technical level.
- Thanks to your implementation skills, you will contribute to building a PET cloud stack that can be deployed in an industrial context. Through experimental use for real-world use cases in different domains such as Automotive AI and Internet of Things, you will close the feedback loop and gain valuable insights to improve your solutions. You will advance the state of the art in cloud-based PETs research and publish your results together with renowned researchers from the international CRYPTECS consortium.
- Education: Excellent Master's degree in computer science or related discipline with specialization in distributed systems, ideally combined with knowledge of security and privacy
- Personality: Positive team player, who is highly motivated, has an innovative mindset, is eager to learn new things, and is passionate about applied research and engineering
- Working Practice: Hands-on experience with software development beyond scientific prototypes, ideally in an open source context
- Experience: Knowledge in the area of cloud native technologies, ideally experience in PETs
- Languages: Fluent in English (written and spoken)
Closing date for applications:
Contact: Dr. Sven Trieflinger via Smart Recruiters (see https://smrtr.io/5YBmQ)
More information: https://www.bosch.com/research/know-how/success-stories/trustworthy-computing-data-sovereignty-while-connected/
Panther Protocol, Remote
Job PostingClosing date for applications:
Contact: Ramadan Ameen
More information: https://www.pantherprotocol.io
University of Birmingham
Job PostingThe University of Birmingham is one of the main UK research centers in Cyber security. The candidate will work with Dr. Christophe Petit and his team.
The ideal candidate should have a very strong background in cryptography or related area, including number theory, computer algebra, and quantum computing. Previous work on post-quantum cryptography is desirable, especially with lattice-based or code-based cryptography.
Closing date for applications:
Contact: Christophe Petit (C.Petit.1 at bham dot ac dot uk)
More information: https://bham.taleo.net/careersection/external/jobdetail.ftl?job=2100013X&tz=GMT%2B01%3A00&tzname=Europe%2FLondon
University of Birmingham
Job PostingThe University of Birmingham is one of the main UK research centers in Cyber security. The candidate will work with Dr. Christophe Petit and his team.
The ideal candidate should have a very strong background in cryptography or related area, including number theory, computer algebra, and quantum computing. P
Closing date for applications:
Contact: Christophe Petit (C.Petit.1 at bham dot ac dot uk)
More information: https://sits.bham.ac.uk/lpages/EPS003.htm
Yukawa Institute for Theoretical Physics, Kyoto University, Japan
Job PostingThe Quantum Information Group at Yukawa Institute for Theoretical Physics, Kyoto University, Japan is looking for a postdoctoral researcher to work on theory of quantum cryptography. (If you are interested in quantum cryptography, background of quantum information is not mandatory: people from ``non-quantum" cryptography are also highly welcomed.) Depending on the qualification, the title of research assistant professor can be given.
The starting date is negotiable (but ideally as soon as possible), and the contract is by the end of March 2024.
Interested candidates can apply by sending
CV
publication list
research statement
contact information of two referees
to the contact address below.
The deadline for applications is 7/31/2021.
For applying and for more information please contact:
Closing date for applications:
Contact: Tomoyuki Morimae, Associate Professor
Yukawa Institute for Theoretical Physics, Kyoto University, Japan
tomoyuki.morimae@yukawa.kyoto-u.ac.jp
01 July 2021
Seyit Camtepe, Jarek Duda, Arash Mahboubi, Pawel Morawiecki, Surya Nepal, Marcin Pawlowski, Josef Pieprzyk
ePrint ReportThe work investigates how to design a compcrypt algorithm using the ANS compression. First, we examine basic properties of ANS and show that a plain ANS with a hidden encoding table can be broken by statistical attacks. Next, we study ANS behaviour when its states are chosen at random. Our compcrypt algorithm is built using ANS with randomised state jumps and a sponge MonkeyDuplex encryption. Its security and efficiency are discussed. The design provides 128-bit security for both confidentiality and integrity/authentication. Our implementation experiments show that our compcrypt algorithm processes symbols with a rate up to 269 MB/s (with a slight loss of compression rate).
Panagiotis Chatzigiannis, Konstantinos Chalkias, Valeria Nikolaenko
ePrint ReportVasyl Ustimenko
ePrint ReportChristian Badertscher, Yun Lu, Vassilis Zikas
ePrint ReportDanilo Gligoroski
ePrint ReportHowever, we find that claims for the general applicability of his attack on the general Entropoid framework are misleading. Namely, based on the Theorem 1 in his report, which claims that for every entropic quasigroup $(G, *)$, there exists an Abelian group $(G, \cdot)$, commuting automorphisms $\sigma$, $\tau$ of $(G, \cdot)$, and an element $c \in G$, such that $x * y = \sigma(x) \cdot \tau(y) \cdot c$ the author infers that \emph{"all instantiations of the entropoid framework should be breakable in polynomial time on a quantum computer."}
There are two misleading parts in these claim: \textbf{1.} It is implicitly assumed that all instantiations of the entropoid framework would define entropic quasigroups - thus fall within the range of algebraic objects addressed by Theorem 1. \emph{We will show a construction of entropic groupoids that are not quasigroups}; \textbf{2.} It is implicitly assumed that finding the group $(G, \cdot)$, the commuting automorphisms $\sigma$ and $\tau$ and the constant $c$ \emph{would be easy for every given entropic operation} $*$ and its underlying groupoid $(G, *)$. However, the provable existence of a mathematical object \emph{does not guarantee an easy finding} of that object.
Treating the original entropic operation $* := *_1$ as a one-dimensional entropic operation, we construct multidimensional entropic operations $* := *_m$, for $m\geq 2$ and we show that newly constructed operations do not have the properties of $* = *_1$ that led to the recovery of the automorphism $\sigma$, the commutative operation $\cdot$ and the linear isomorphism $\iota$ and its inverse $\iota^{-1}$.
We give proof-of-concept implementations in SageMath 9.2 for the new multidimensional entropic operations $* := *_m$ defined over several basic operations $* := *_1$ and we show how the non-associative and non-commutative exponentiation works for the key exchange and digital signature schemes originally proposed in report 2021/469.
Willy Quach, Brent Waters, Daniel Wichs
ePrint Report-Pseudo-entropy functions from one-way functions.
-Deterministic leakage-resilient message-authentication codes and improved leakage-resilient symmetric-key encryption from one-way functions.
-Extractors for extractor-dependent sources from one-way functions.
-Selective-opening secure symmetric-key encryption from one-way functions.
-A new construction of CCA PKE from (exponentially secure) trapdoor functions and injective pseudorandom generators.
We also discuss a fascinating connection to distributed point functions.