IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
20 May 2019
Christian Majenz, Christian Schaffner, Jeroen van Wier
ePrint ReportMarc Joye
ePrint ReportROME, ITALY, 22 June - 25 June 2020
Event CalendarSubmission deadline: 9 September 2019
Notification: 20 January 2020
Haodong Jiang, Zhenfeng Zhang, Zhi Ma
ePrint ReportIn this paper, for KEM variants of the FO transformation, we show that a typical measurement-based reduction in the QROM from breaking standard OW-CPA (or IND-CPA) security of the underlying PKE to breaking the IND-CCA security of the resulting KEM, will inevitably incur a quadratic loss of the security, where ``measurement-based" means the reduction measures a hash query from the adversary and uses the measurement outcome to break the underlying security of PKE. In particular, all currently known security reductions in (TCC 2017 and Crypto 2018) are of this type, and our results suggest an explanation for the lack of progress in improving the reduction tightness in terms of the degree of security loss. We emphasize that our results do not expose any post-quantum security weakness of KEM variants of FO transformation.
Anamaria Costache, Kim Laine, Rachel Player
ePrint ReportDaniel J. Bernstein, Andreas Hülsing
ePrint ReportEloi de Cherisey, Sylvain Guilley, Olivier Rioul, Pablo Piantanida
ePrint ReportWard Beullens
ePrint Report-A solution to a system of quadratic polynomials
-A solution to an instance of the Permuted Kernel Problem
We then remove the helper from the protocol with a "cut-and-choose" protocol and we apply the Fiat-Shamir transform to obtain signature schemes with security proof in the QROM. We show that the resulting signature schemes, which we call the "MUltivarite quaDratic FIat-SHamir" scheme (MUDFISH) and the "ShUffled Solution to Homogeneous linear SYstem FIat-SHamir" scheme (SUSHSYFISH), are more efficient than existing signatures based on the MQ problem and the Permuted Kernel Problem. We also leverage the ZK-proof for PKP to improve the efficiency of Stern-like Zero Knowledge proofs for lattice statements.
Leon Botros, Matthias J. Kannwischer, Peter Schwabe
ePrint ReportAlan Kaminsky
ePrint Report19 May 2019
Michel Abdalla, Fabrice Benhamouda, Romain Gay
ePrint ReportSuhyeon Lee, Seungjoo Kim
ePrint Report16 May 2019
London, UK, 11 November 2019
Event CalendarSubmission deadline: 28 June 2019
Notification: 14 August 2019
15 May 2019
Centre for Quantum Technologies, Singapore
Job PostingThe position comes with an internationally competitive salary and generous support for travel. Moreover, there are ample opportunities to collaborate with excellent scientists both based at CQT/NUS and research visitors.
Closing date for applications: 31 October 2019
Contact: Divesh Aggarwal
Assistant Professor, NUS, and Principal Investigator, CQT (joint appointment)
divesh.aggarwal (at) gmail.com
CEA Saclay
Job PostingCEA background in these fields
==============================
CEA LIST has been a key leader in fully homomorphic encryption techniques https://github.com/CEA-LIST/Cingulata. In the context of FHE, machine learning applications appear as a killer application. Many key advances have yet to be considered to fully address machine learning applications using FHE technologies. Next technological barriers depend on the computational cost of the considered stage (training or inference) but the main approaches are: first to limit operators used in graph neural networks such that FHE associated computational cost is kept reasonable. Second FHE can be viewed as a building block, which could be activated in specific parts of the pipeline to ensure model or data privacy. CEA LIST is also very active in the field of randomization algorithms to ensure data privacy and robustness to adversarial attacks. Past works include PhD thesis of Anne Morvan and Rafael Pinot.
Closing date for applications: 15 June 2019
Contact: Cedric Gouy-Pailler (cedric.gouy-pailler (at) cea.fr) or Renaud Sirdey
More information: https://gouypailler.github.io/files/phdCryptoRobust.pdf
13 May 2019
Razvan Barbulescu, Nadia El Mrabet, Loubna Ghammam
ePrint ReportAfter estimating the practical security of an extensive list of families, we compute the complexity of the optimal Ate pairing at 128 and 192 bits of security. For some of the families the optimal Ate has never been studied before. We show that a number of families of embedding degree 9, 14 and 15 are very competitive with $BN$, $BLS12$ and $KSS16$ at 128 bits of security. We identify a set of candidates for 192 bits and 256 bits of security.