IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
28 March 2022
S. Dov Gordon, Carmit Hazay, Phi Hung Le
Antoine Urban, Matthieu Rambaud
To achieve this goal, we design a new approach with short threshold fully homomorphic (FHE) ciphertexts, which in turn impacts the computational complexity. The main building block of our technique is a threshold encryption scheme which is Ad-Hoc, i.e., which only takes as parameter $N$ public keys independently generated, equipped with a threshold shrinking mechanism into threshold FHE ciphertexts.
One ingredient of independent interest is a linear secret sharing over RLWE rings with arbitrary modulus. By contrast, previous threshold FHE required the modulus to be prime and at least as large as $N+1$.
Another significant advantage of this approach is that it also allows an arbitrary number of lightweight {external input owners} to feed their inputs in the computation by simply encrypting them with the Ad-Hoc scheme, then go offline.
We finally prove the impossibility of $1$-Broadcast-then-Asynchronous MPC for $N\leq 3t-4$, showing tightness of our $2$ broadcasts.
Hamidreza Khoshakhlagh
27 March 2022
Gachon University, Korea
Closing date for applications:
Contact: Professor Seong Oun Hwang (seongoun.hwang at gmail.com).
More information: https://ai-security.github.io/index_e.htm
FAU Erlangen-Nürnberg
10 PhD positions (m/f/d) (salary level 13 TV-L) in Computer Science (full time) and Law (part time, 75%)
within the Research Training Group 2475 „Cybercrime and Forensic Computing“ funded by the German Research Foundation (DFG) commencing on October 1, 2022. The Research Training Group aims to systematically analyse research questions arising from the interaction between computer science and criminal law. The principal investigators of this project offer expertise in the following areas:
- Computer security, digital forensic science
- Criminal law, criminal procedure
- Criminology
- Theoretical computer science (logic, semantics, automata)
- Pattern recognition, image processing, image forensics
- Cryptography
- Hardware-software-co-design
More information about the project can be found at https://cybercrime.fau.de Applicants should have an excellent academic record, hold an MSc, LL.M. or an equivalent university degree in computer science, law or related disciplines, and have the goal to finish a PhD degree within three years.
Founded in 1743 and situated at the heart of the Nuremberg Metropolitan Region, FAU is a strong research university with an international perspective and one of the largest universities in Germany. FAU’s outstanding research and teaching is reflected in top positions in both national and international rankings, as well as the high amount of DFG funding which its researchers are able to secure. FAU aims to increase the number of women in scientific positions. Female candidates are therefore particularly encouraged to apply. In case of equal qualifications, candidates with disabilities will take precedence. Please submit your complete application documents by 18.4.2022 to cybercrime-applications@fau.de. Please mention in your application at least two research areas from the above list which you are specifically interested in. Interviews will commence between 7. and 10.6.2022 in Erlangen.
Closing date for applications:
Contact: Felix Freiling (felix.freiling@fau.de) regarding positions in computer science and Dominique Schröder (dominique.schroeder@fau.de) regarding cryptography.
More information: https://www.cybercrime.fau.de/stellen-open-positions/
24 March 2022
Hanoï, Viêt Nam, 24 August - 30 August 2022
23 March 2022
TU Wien
Tasks:
- Deep interest in scientific problems and the motivation for independent and goal-oriented research
- Independent teaching or participation in teaching and supervision of students
- Ability to develop methods, concepts, as well as their realization and evaluation and the willingness to contribute in interdisciplinary scientific projects
- Participation in organizational and administrative tasks of the research unit and the faculty
- 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
- Continuing personal and professional education and flexible working hours
- Central location of workplace with very good accessibility (U1/U4 Karlsplatz)
- A creative environment in one of the most liveable cities in the world
- (B1 scale, 56.861,70 EUR per year before tax)
- Additional benefits for employees
Closing date for applications:
Contact: Matteo Maffei
More information: https://jobs.tuwien.ac.at/Job/179063
The Netherlands
- Lattice-based cryptography
- Privacy-preserving machine learning
- Privacy and applied cryptography
- Blockchain/smart contract security
- PhD in Computer Science, Information Security, Maths.
- Strongly related knowledge and backgrounds (e.g., research papers) of privacy-oriented cryptography (theory and/or practice).
- Professional in English (writing, speaking). Note Dutch is NOT required.
Closing date for applications:
Contact: Dr. S. Fu (shihui.fu@tudelft.nl)
SUTD, Singapore
Closing date for applications:
Contact: Prof. Jianying Zhou. Email: jianying_zhou (at) sutd.edu.sg
More information: http://jianying.space/
Temasek Labs, Nanyang Technological University, Singapore
Candidates 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
- 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
(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
Yehuda Lindell
In 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
Vadym Kliuchnikov, Kristin Lauter, Romy Minko, Christophe Petit, Adam Paetznick
Asep Muhamad Awaludin, Jonguk Park, Rini Wisnu Wardhani, Howon Kim
Riddhi Ghosal, Paul Lou, Amit Sahai
In 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).