IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
04 February 2020
David Galindo, Jia Liu, Mihai Ordean, Jin-Mann Wong
ePrint ReportZhongxiang Zheng, Anyu Wang, Haining Fan, Chunhuan Zhao, Chao Liu, Xue Zhang
ePrint ReportMichael Davidson, Tyler Diamond
ePrint ReportRomain Gay
ePrint ReportDaniel Jost, Ueli Maurer
ePrint ReportIn this work, we propose a new type of composable security statement that evades the commitment problem by a specific instantiation of the concept of system specifications in the Constructive Cryptography (CC) framework, capturing the intersection of several interval-wise guarantees, each specifying the guarantees between two events. We develop the required theory within the CC framework and present the corresponding new composition theorem.
We present three applications of our notion. First, we show in the context of symmetric encryption with adaptive corruption how our notion naturally captures the expected confidentiality guarantee---the messages remain confidential until either party gets corrupted---and that it can be achieved by any standard semantically secure scheme (negating the need for non-committing encryption). Second, we present a composable formalization of commitments that is instantiable without a trusted setup like a CRS, and show its application to coin tossing over the telephone, one of the early intuitive applications of commitments. Third, we reexamine a result by Hofheinz, Matt, and Maurer [Asiacrypt'15] implying that IND-ID-CPA security is not the right notion for identity-based encryption, unmasking this claim as an unnecessary framework artifact.
Jonathan Takeshita, Matthew Schoenbauer, Ryan Karl, Taeho Jung
ePrint ReportSuvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs
ePrint Report\medskip
Our main construction is a DMWM for all $\mathbf{NP}$ relations, assuming sub-exponentially secure indistinguishability obfuscation ($i\mathcal{O}$), along with standard cryptographic assumptions. The DMWM construction relies on a CWM and a new primitive called Cumulative All-Lossy-But-One Trapdoor Functions (C-ALBO-TDF), both of which are in turn instantiated based on $i\mathcal{O}$ and other primitives. Our instantiation of a CWM is in fact a UWM; in turn, we show that a UWM implies Witness Encryption. Along the way to constructing UWM and C-ALBO-TDF, we also construct, from standard assumptions, Puncturable Digital Signatures and a new primitive called Cumulative Lossy Trapdoor Functions (C-LTDF). The former improves up on a construction of Bellare et al. (Eurocrypt 2016), who relied on sub-exponentially secure $i\mathcal{O}$ and sub-exponentially secure OWF.
\medskip
As an application of our constructions, we show how to use a DMWM to construct the first leakage and tamper-resilient signatures with a deterministic signer, thereby solving a decade old open problem posed by Katz and Vaikunthanathan (Asiacrypt 2009), by Boyle, Segev and Wichs (Eurocrypt 2011), as well as by Faonio and Venturi (Asiacrypt 2016). Our construction achieves the optimal leakage rate of $1 - o(1)$.
Chen-Dong Ye, Tian Tian, Fan-Yang Zeng
ePrint Report~~~We apply our method to analyse the security of Trivium. As a result, key-recovery attacks are preformed up to the 978-round Trivium and non-randomness is detected up to the 1108-round Trivium of its 1152 rounds both in the weak-key setting. All the results are the best known so far considering the number of rounds and could be experimentally verified. Hopefully, the new method would provide insights on conditional differential attacks and the security evaluation of Trivium.
Benjamin Y Chan, Elaine Shi
ePrint ReportElaine Shi
ePrint ReportDaniele Micciancio, Yuriy Polyakov
ePrint ReportWe present a unified framework that includes the original and extended variants of both FHEW and TFHE cryptosystems, and implement it in PALISADE using modular arithmetic. Our analysis shows that the main distinction between the cryptosystems is the bootstrapping procedure used: Alperin-Sherif--Peikert (AP) for FHEW vs. Gama--Izabachene--Nguyen--Xie (GINX) for TFHE. All other algorithmic optimizations in TFHE equally apply to both cryptosystems. We extend the GINX bootstrapping to ternary uniform and Gaussian secret distributions, which are included in the HE community security standard. Our comparison of the AP and GINX bootstrapping methods for different secret distributions suggests that the TFHE/GINX cryptosystem provides better performance for binary and ternary secrets while FHEW/AP is faster for Gaussian secrets. We make a recommendation to consider the variants of FHEW and TFHE cryptosystems based on ternary and Gaussian secrets for standardization by the HE community.
03 February 2020
ST Engineering-SUTD Cyber Security Laboratory -- Singapore University of Technology and Design
Job PostingThe ST Engineering-SUTD Cyber Security Laboratory @ SUTD looks for one Postdoctoral Fellow position and one Research Assistant position, for a project on the security of avionics systems with emphases on the aircraft data bus and network technologies.
Post-Doc
Requirements:- Ph.D. in Computer Science or related areas;
- Background in Security, Software Engineering, and/or Data Science;
- Track record of publications in high-quality journals and/or conferences;
- Good written/oral communication skills in English, and ability to work effectively in a collaborative team;
- Skills and experience in both analytical and empirical research;
- Programming skills in one or more of the following: Python, Java, C++;
- Interest to work in:
- Avionics data bus and network technologies
- Computer and network security
- Attack emulation
- Machine learning with application to intrusion detection
Research Assistant
Requirements:- Master degree in Computer Science or related areas;
- Strong programming skills in one or more of the following: Python, Java, C++;
- Familiarity with (i) applied software and/or systems security, and (ii) machine learning;
- Good written/oral communication skills in English, and ability to work effectively in a collaborative team;
- Interest to work in:
- Avionics data bus and network technologies
- Computer and network security
- Attack emulation
- Machine learning with application to intrusion detection
A full-time appointment will be offered for one year renewable. SUTD offers an internationally competitive salary that will be determined based on the applicant's experience and qualifications.
Closing date for applications:
Contact: Interested persons please email with a cover letter and updated curriculum vitae to cyberlab@sutd.edu.sg . Positions will be available until filled; only short-listed candidates will be notified.
Zama - Paris, France
Job PostingAbout
Our mission at Zama is to protect people’s privacy by preventing data breaches and surveillance.
Our first product is a deep learning framework that enables fast and accurate inference over encrypted data, without any changes to the neural network architecture.
We believe privacy-enabling technologies should benefit the widest possible community of developers and security researchers, which is why everything we create will be published and open-sourced.
Zama is founded by Pascal Paillier and Rand Hindi
Responsibilities
Requirements
Closing date for applications:
Contact: hello@zama.ai
More information: https://zama.ai/jobs/senior-researcher-cryptography/
Linköping University, Sweden
Job PostingClosing date for applications:
Contact: Prof Jeff.Yan@liu.se
Nanyang Technological University
Job PostingClosing date for applications:
Contact: Wang Huaxiong (hxwang@ntu.edu.sg)
OneSpan
Job PostingClosing date for applications:
Contact: Talent Acquisition (Julie Tinel). Thank you for applying via our website.
More information: https://grnh.se/b666606f1
Masaryk University, Faculty of Informatic - Brno, Czechia
Job PostingApplications due: March 1, 2020
Employment start date: By mutual agreement
This position is aimed to strengthen the work of the Centre for Research on Cryptography and Security (CRoCS - https://crocs.fi.muni.cz/) at the Faculty of Informatics. CRoCS works to improve security and privacy of real-world solutions through applied research (often in cooperation with industry) and advanced education of future security professionals. System security or network security focus are most desired, yet the abilities to work with a team of graduate students and faculty on research targeting top security/crypto conferences and to engage both undergraduate and graduate students in both educational and research exercises are most critical.
Masaryk University, the second largest university in Czech Republic, is one of the most respected institutions of higher education in Central Europe, with more than 30 000 students. Its Faculty of Informatics (FI) provides Computer Science education for 2 000 students and hosts almost 20 labs where researchers and students perform leading-edge research, often in cooperation with companies located in the science and technology park directly in the FI area.
Brno is a great place to live. As an international student city (1/5 of the population are students), there is always something to do and the Czech language isn’t a barrier. Brno, as one of the top student cities of the world, according to Quacquarelli Symonds, provides a great student experience: “The city gets extremely strong ratings for tolerance and inclusivity, and ease of getting around, while also scoring very well for both affordability and nightlife. Respondents praised the attractiveness of the city, as well as the large and friendly student community.”
Note - and if looking for a postdoc position, please consider https://www.muni.cz/en/about-us/careers/vacancies/52171.
Closing date for applications:
Contact: Vashek Matyas
More information: https://www.muni.cz/en/about-us/careers/vacancies/51351
Budapest, Hungary, 15 June - 17 June 2020
Event CalendarSubmission deadline: 2 February 2020
Notification: 30 March 2020
1 September 2020
Event CalendarSubmission deadline: 24 April 2020
Notification: 24 July 2020
Linz, Austria, 8 July - 10 July 2020
Event CalendarSubmission deadline: 28 February 2020
Notification: 24 April 2020