IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
16 July 2020
Albert Spruyt, Alyssa Milburn, Lukasz Chmielewski
To demonstrate that our attacks are practical, we first show that SPA can be used to recover RSA private exponents using FI attacks. Subsequently, we show the generic nature of our attacks by performing DPA on AES after applying FI attacks to several different targets (with AVR, 32-bit ARM and RISC-V CPUs), using different software on each target, and do so with a low-cost (i.e., less than $50) power fault injection setup. We call this technique Fault Correlation Analysis (FCA), since we perform CPA on fault probability traces. To show that this technique is not limited to software, we also present FCA results against the hardware AES engine supported by one of our targets. Our results show that even without access to the ciphertext (e.g., where an FI redundancy countermeasure is in place, or where ciphertext is simply not exposed to an attacker in any circumstance) and in the presence of jitter, FCA attacks can successfully recover keys on each of these targets.
Joachim Zahnentferner
Georgios Tsimos, Julian Loss, Charalampos Papamanthou
Lucas Barthelemy
Sayandeep Saha, Arnab Bag, and Debdeep Mukhopadhyay
Guilherme Perin, Lukasz Chmielewski, Lejla Batina, Stjepan Picek
Aein Rezaei Shahmirzadi, Amir Moradi
James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, Mark Zhandry
In this work, we suggest ADPs as a new framework for building general-purpose obfuscation and witness encryption. We provide evidence to suggest that constructions following our ADP-based framework may one day yield secure, practically feasible obfuscation.
As a proof-of-concept, we give a candidate ADP-based construction of indistinguishability obfuscation (iO) for all circuits along with a simple witness encryption candidate. We provide cryptanalysis demonstrating that our schemes resist several potential attacks, and leave further cryptanalysis to future work. Lastly, we explore practically feasible applications of our witness encryption candidate, such as public-key encryption with near-optimal key generation.
Emanuele Strieder, Christoph Frisch, Michael Pehl
Michele Ciampi, Nikos Karayannidis, Aggelos Kiayias, Dionysis Zindros
Keita Emura, Atsushi Takayasu, Yohei Watanabe
Klaus Kursawe
Linru Zhang, Xiangning Wang, Yuechen Chen, Siu-Ming Yiu
Technically, we develop a new notion: Inner-product hash proof system (IP-HPS). IP-HPS is a variant of traditional hash proof systems. Its output of decapsulation is an inner-product value, instead of the encapsulated key. We propose an IP-HPS scheme under DDH-assumption. Then we show how to make an IP-HPS scheme to tolerate $l'$-bit leakage, and we can achieve arbitrary large $l'$ by only increasing the size of secret keys. Finally, we show how to build a leakage-resilient IPFE in the BRM with leakage bound $l=\frac{l'}{n}$ from our IP-HPS scheme.
Jeroen Delvaux
Willy Susilo, Dung Hoang Duong, Huy Quoc Le, Josef Pieprzyk
Loïc Masure, Nicolas Belleville, Eleonora Cagli, Marie-Angela Cornelie, Damien Couroussé, Cécile Dumas, Laurent Maingault
Palash Sarkar, Subhadip Singha
Annapurna Valiveti, Srinivas Vivek
In this work, we propose a second-order secure randomised table compression scheme which works for any (n, m)-bit S-box. Our proposal is a variant of Vadnala's scheme that is not only secure but also significantly improves the time-memory trade-off. Specifically, we improve the online execution time by a factor of 2^(n-l). Our proposed scheme is proved 2-SNI secure in the probing leakage model. We have implemented our method for AES-128 on a 32-bit ARM Cortex processor. We are able to reduce the memory required to store a randomised S-box table for second-order AES-128 implementation to 59 bytes.
Sankhanil De, Ranjan Ghosh
13 July 2020
Tampere University
The Network and Information Security Group is currently looking for several motivated and talented researchers at all levels (PhD, PostDoc) to contribute to research projects related to applied cryptography, hardware security, security and privacy. The successful candidates will primarily be working on the following topics (but not limited to):
- Differential Privacy;
- Functional Encryption;
- Privacy-Preserving Analytics;
- Privacy-Preserving Machine Learning;
- Searchable Encryption and data structures enabling efficient search operations on encrypted data;
- Processing of encrypted data in outsourced and untrusted environments;
- Applying encrypted search techniques to Trusted Execution Environments;
- Revocable Attribute-Based Encryption schemes and their application to cloud services;
- IoT Security and Applications to Smart Cities;
- Side Channel Analysis (SCA);
- Machine Learning based SCA;
- Embedded security (e.g. ARM-based SoC);
- TEE security and development (e.g. TrustZone, Trusted Applications, etc.).
Programming skills is a must.
The positions are principa research-focused. Activities include:
- Conducting both theoretical and applied research;
- Design of secure and/or privacy-preserving protocols;
- Software development and validation;
- Reading and writing scientific articles;
- Presentation of the research results at seminars and conferences in Finland and abroad;
- Acquiring (or assisting in acquiring) further funding.
Successful candidates will be working in EU and industrial research projects. Topics will be spanning from the theoretical foundations of cryptography to the design and implementation of provable secure communication protocols with direct applications to smart cities, cloud computing and eHealth.
To apply please send the following:
- Your latest CV;
- A research statement (max 2 pages long);
- The three best papers you have co-authored.
Closing date for applications:
Contact:
- Billy Bob Brumley (Hardware Security and SCA): billy.brumley@tuni.fi
- Antonis Michalas (Provable Security and Privacy): antonios.michalas@tuni.fi
More information: https://research.tuni.fi/vision/open-positions-2020/