IACR News
If you have a news item you wish to distribute, they should be sent to the communications secretary. See also the events database for conference announcements.
Here you can see all recent updates to the IACR webpage. These updates are also available:
09 March 2020
Manuel M. T. Chakravarty, Sandro Coretti, Matthias Fitzi, Peter Gazi, Philipp Kant, Aggelos Kiayias, Alexander Russell
Nir Drucker, Shay Gueron, Dusan Kostic
Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski
In the present article, we show that the Arakelov class group has more to offer. We start with the development of a new versatile tool: we prove that, subject to the Riemann Hypothesis for Hecke $L$-functions, certain random walks on the Arakelov class group have a rapid mixing property. We then exploit this result to relate the average-case and the worst-case of the Shortest Vector Problem in ideal lattices. Our reduction appears particularly sharp: for Hermite-SVP in ideal lattices of certain cyclotomic number fields, it loses no more than a $\tilde O(\sqrt n)$ factor on the Hermite approximation factor.
Furthermore, we suggest that this rapid-mixing theorem should find other applications in cryptography and in algorithmic number theory.
Akshima, David Cash, Francesca Falzon, Adam Rivkin, Jesse Stern
Lilya Budaghyan, Marco Calderini, Claude Carlet, Robert Coulter, Irene Villa
Olivier Blazy, Patrick Towa, Damien Vergnaud
08 March 2020
As a consequence of the COVID-19 crisis, the Greek Health ministry took on March 8 the decision to suspend all conference events for the next four weeks (the announcement in Greek can be found here.).
Under these force majeure circumstances, FSE 2020 is postponed.
More details will follow soon.
For any questions please contact the General Chairs at fse2020@iacr.org
07 March 2020
Brisbane, Australia, 16 July - 17 July 2020
Submission deadline: 24 April 2020
Notification: 4 May 2020
06 March 2020
Benjamin E. Diamond
Applying these techniques, we construct a protocol for the Anonymous Zether payment systemas proposed in Bünz, Agrawal, Zamani, and Boneh (FC'20)which improves upon the communication complexity attained by existing efforts. We describe an open-source, Ethereum-based implementation of our protocol.
Dana Dachman-Soled, Léo Ducas, Huijing Gong, Mélissa Rossi
While initially designed for side-channel information, our framework can also be used in other cases: exploiting decryption failures, or simply exploiting constraints imposed by certain schemes (LAC, Round5, NTRU), that were previously not known to (sligthly) benefit from lattice attacks.
We implement a Sage 9.0 toolkit to actually mount such attacks with hints when computationally feasible, and to predict their performances on larger instances. We provide several end-to-end application examples, such as an improvement of a single trace attack on Frodo by Bos et al (SAC 2018). Contrary to ad-hoc practical attacks exploiting side-channel leakage, our work is a generic way to estimate security loss even given very little side-channel information.
Myrto Arapinis, Mahshid Delavar, Mina Doosti, Elham Kashefi
Reham Almukhifi, Poorvi Vora
Jonathan Lee
Yaobin Shen, Hailun Yan, Lei Wang, Xuejia Lai
Sebastian Angel, Sampath Kannan, Zachary Ratliff
Geoffroy Couteau, Dominik Hartmann
Yaobin Shen, Chun Guo, Lei Wang
04 March 2020
Chalmers University of Technology, Sweden
Closing date for applications:
Contact: Katerina Mitrokotsa, aikmitr@chalmers.se
More information: https://www.chalmers.se/en/about-chalmers/Working-at-Chalmers/Vacancies/Pages/default.aspx?rmpage=job&rmjob=p8402
Algorand Inc
Closing date for applications:
Contact: Makena Stone
University of Edinburgh
Closing date for applications:
Contact: Interested persons please email with a cover letter and updated curriculum vitae to mkohlwei@ed.uk.ac. The position will be available until filled; only short-listed candidates will be notified.