Here you can see all recent updates to the IACR webpage. These updates are also available:
10 August 2020
University of Cologne, Department of Mathematics and Computer Science, Cologne, GermanyJob Posting
The successful candidate has a proven track record of high-quality scientific publications in one of, but not limited to, the following areas:
- Cryptography and its protocols
- Quantum and post-quantum cryptography
- Software security
- Security of embedded systems
- Security of the Internet of Things and of cyber physical systems
- Security of autonomous systems and related technologies
Please apply with the usual documents (curriculum vitae, list of publications and teaching activities, copies of certificates of academic examinations and appointments) via the University of Cologne’s Academic Job Portal (https://professorships.uni-koeln.de) no later than September 22, 2020. Your application should be addressed to the Dean of the Faculty of Mathematics and Natural Sciences.
For further details please find complete job announcement in the Academic Job Portal of the University.
Closing date for applications:
Contact: Dean of the Faculty of Mathematics and Natural Sciences, Prof. Dr. Paul H. M. van Loosdrecht (email: email@example.com)
More information: https://professorships.uni-koeln.de
Real World Crypto
RWC 2021 will be held Jan 11-13 in Amsterdam.
University of St. Gallen, SwitzerlandJob Posting
Research area: Research areas include but are not limited to:
- Verifiable computation
- Secure Multi Party Computation
- Privacy-preserving authentication
- Cryptographic primitives
- Differential privacy
- A Ph.D. degree in Computer Science, Applied Mathematics or a relevant field
- 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
Starting date: Fall 2020 or by mutual agreement
Closing date for applications:
Contact: Prof. Katerina Mitrokotsa
National Cheng Kung University, TaiwanJob Posting
Closing date for applications:
Contact: Prof. Tony Q.S. Quek (email: firstname.lastname@example.org)
04 August 2020
TalTech, Centre for HW Security; Tallinn, EstoniaJob Posting
Requirements for postdoctoral research position: Having a PhD degree is mandatory for this position but candidates close to the completion of a PhD are also highly encouraged to apply. The ideal candidate should have a track record in the topic or in a closely related field, as well as in-depth knowledge of digital IC design tools (genus, innovus, design compiler, ICC, etc.)
General conditions: Funding for this position is project-based and is already in place. Candidates with adequate backgrounds will be invited to interview over Skype. This position has an immediate start date (but a future start date can be arranged given the current situation w/ coronavirus). Salary is commensurate with experience.
How to apply: Please submit your CV to Prof. Pagliarini by email (email@example.com) using the subject ‘PQC postdoc position’.
Closing date for applications:
Contact: Samuel Pagliarini (firstname.lastname@example.org)
More information: https://ati.ttu.ee/~spagliar/
Nathan Manohar, Peter Manohar, Rajit ManoharePrint Report
We present HABIT, a contact tracing system using a wearable hardware device designed specifically with the goals of public health officials in mind. Unlike current approaches, we use a dedicated hardware device instead of a phone app for proximity detection. Our use of a hardware device allows us to substantially improve the accuracy of proximity detection, achieve strong security and privacy guarantees that cannot be compromised by remote attackers, and have a more usable system, while only making our system minimally harder to deploy compared to a phone app in centralized organizations such as hospitals, universities, and companies.
The efficacy of our system is currently being evaluated in a pilot study at Yale University in collaboration with the Yale School of Public Health.
Eli Ben-Sasson, Lior Goldberg, David GurevichePrint Report
With an Appendix by Jean-Charles Faugere and Ludovic Perret of CryptoNext Security.
Vijaya Ramachandran, Elaine ShiePrint Report
In this paper, we initiate the study of parallel data oblivious algorithms on realistic multicores, best captured by the binary fork-join model of computation. We first show that data-oblivious sorting can be accomplished by a binary fork-join algorithm with optimal total work and optimal (cache-oblivious) cache complexity, and in O(log n log log n) span (i.e., parallel time) that matches the best-known insecure algorithm. Using our sorting algorithm as a core primitive, we show how to data-obliviously simulate general PRAM algorithms in the binary fork-join model with non-trivial efficiency. We also present results for several applications including list ranking, Euler tour, tree contraction, connected components, and minimum spanning forest. For a subset of these applications, our data-oblivious algorithms asymptotically outperform the best known insecure algorithms. For other applications, we show data oblivious algorithms whose performance bounds match the best known insecure algorithms.
Complementing these asymptotically efficient results, we present a practical variant of our sorting algorithm that is self-contained and potentially implementable. It has optimal caching cost, and it is only a log log n factor off from optimal work and about a log n factor off in terms of span; moreover, it achieves small constant factors in its bounds.
Johannes Mittmann, Werner SchindlerePrint Report
We formulate and analyse a two-dimensional Markov process, from which we deduce relevant stochastic properties of Barretts multiplication algorithm within modular exponentiation algorithms. This allows to transfer the timing attacks and local timing attacks (where a second side-channel attack exhibits the execution times of the particular modular squarings and multiplications) on Montgomerys multiplication algorithm to attacks on Barretts algorithm. However, there are also differences. Barretts multiplication algorithm requires additional attack substeps, and the attack efficiency is much more sensitive to variations of the parameters. We treat timing attacks on RSA with CRT, on RSA without CRT, and on Diffie-Hellman, as well as local timing attacks against these algorithms in the presence of basis blinding. Experiments confirm our theoretical results.
31 July 2020
Vienna, Austria, 11 February - 13 February 2021Event Calendar
Submission deadline: 14 September 2020
Notification: 12 November 2020
Fabrice Benhamouda, Tancrède Lepoint, Michele Orrù, Mariana RaykovaePrint Report
Manuel Barbosa, Bernardo Ferreira, João Marques, Bernardo Portela, Nuno PreguiçaePrint Report
In this paper we present the first formal cryptographic treatment of CRDTs, as well as proposals for secure implementations. We start by presenting a security notion that is compatible with standard definitions in cryptography. We then describe new privacy-preserving CRDT protocols that can be used to help secure distributed cloud-backed applications, including NoSQL geo-replicated databases. Our proposals are based on standard CRDTs, such as sets and counters, augmented with cryptographic mechanisms that allow operations to be performed on encrypted data.
Our proposals are accompanied with formal security proofs and implement and integrate them in AntidoteDB, a geo-replicated NoSQL database that leverages CRDTs for its operations. Experimental evaluations based on the Danish Shared Medication Record dataset (FMK) exhibit the tradeoffs that our different proposals make and show that they are ready to be used in practical applications.
Runchao Han, Jiangshan Yu, Ren ZhangePrint Report
This paper focuses on the shard allocation protocols designed for permissionless networks. We start from formally defining the shard allocation protocol, including its syntax, correctness properties, and performance metrics. Then, we apply this framework to evaluate the shard allocation subprotocols of seven state-of-the-art sharded blockchains. Our evaluation shows that none of them is fully correct or achieves satisfactory performance. We attribute these deficiencies to their redundant security assumptions and their extreme choices between two performance metrics: self-balance and operability. We further prove a fundamental trade-off between these two metrics, and prove that shard allocation should be non-memoryless in order to parametrise this trade-off. Non-memorylessness specifies that each shard allocation does not only rely on the current and the incoming system states, but also previous system states. Based on these insights, we propose WORMHOLE, a non-memoryless shard allocation protocol that minimises security assumptions and allows parametrisation between self-balance and operability. We formally prove WORMHOLEs correctness, and show that WORMHOLE outperforms existing shard allocation protocols.
Philipp Schindler, Aljosha Judmayer, Markus Hittmeir, Nicholas Stifter, Edgar WeipplePrint Report
Doyoung Chung, Jooyoung Lee, Seungkwang Lee, Dooho choiePrint Report
Fei MengePrint Report
JongHyeok Lee, Dong-Guk HanePrint Report
30 July 2020
Nominations are due by September 24, 2020.
Information about nomination is available at https://iacr.org/elections/2020/announcement.html.
29 July 2020
Suyash Bagad, Saravanan VijayakumaranePrint Report
Colin O'FlynnePrint Report
The specific work appears relevant to several devices in the MPC55xx and MPC56xx series, which are automotive-focused PowerPC devices.