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:
05 March 2018
Yuval Marcus, Ethan Heilman, Sharon Goldberg
Julian Loss, Tal Moran
* We give the first generic compilers that combine BA protocols under different network and synchrony assumptions and preserve both the efficiency and robustness of their building blocks. Our constructions are simple and rely solely on a secure signature scheme.
* We prove that our constructions achieve optimal corruption bounds.
* Finally, we give the first efficient protocol for (binary) asynchronous byzantine agreement (ABA) which tolerates adaptive corruptions and matches the communication complexity of the best protocols in the static case.
Hagen Sparka, Florian Tschorsch, Björn Scheuermann
Aalborg University, Denmark
More information, at http://www.stillinger.aau.dk/vis-stilling/?vacancy=963578.
The applications are only to be submitted online at http://www.stillinger.aau.dk/vis-stilling/?vacancy=963578 by using the \"Apply online\" button at the end of the page.
Closing date for applications: 2 April 2018
Contact: You may obtain further information from Head of Department Søren Højsgaard, phone: +45 9940 8801, e-mail: sorenh (at) math.aau.dk.
More information: http://www.stillinger.aau.dk/vis-stilling/?vacancy=963578
04 March 2018
1 March - 15 June 2018
Submission deadline: 15 June 2018
01 March 2018
Azores, Portugal, 16 April - 20 April 2018
Submission deadline: 12 March 2018
Notification: 15 March 2018
Melbourne, Australia, 28 December - 30 December 2018
Submission deadline: 25 June 2018
Notification: 6 August 2018
Charlotte Bonte, Frederik Vercauteren
Masahiro Yagisawa
Zhengjun Cao, Lihua Liu
Jan-Pieter D'Anvers, Angshuman Karmakar Sujoy Sinha Roy, Frederik Vercauteren
Wei Dai, William Whyte, Zhenfei Zhang
Georg Fuchsbauer, Michele Orrù
Wei-Kai Lin, Elaine Shi, Tiancheng Xie
Finally, we optimize the IO efficiency of our oblivious algorithms for RAMs --- we show that even the $1$-bit special case of our algorithm can solve open questions regarding whether there exist oblivious algorithms for tight compaction and selection in linear IO.
Sandro Coretti, Yevgeniy Dodis, Siyao Guo
Unfortunately, both well-known attacks, e.g., based on rainbow tables (Hellman, IEEE Transactions on Information Theory '80), and more recent ones, e.g., against the discrete-logarithm problem (Corrigan-Gibbs and Kogan, EUROCRYPT '18), suggest that the concrete security bounds one obtains from such idealized proofs are often completely inaccurate if one considers non-uniform or preprocessing attacks in the standard model. To remedy this situation, this work
1) defines the auxiliary-input (AI) RPM/ICM/GGM, which capture both non-uniform and preprocessing attacks by allowing an attacker to leak an arbitrary (bounded-output) function of the oracle's function table;
2) derives the first non-uniform bounds for a number of important practical applications in the AI-RPM/ICM, including constructions based on the Merkle-Damgard and sponge paradigms, which underly the SHA hashing standards, and for AI-RPM/ICM applications with computational security; and
3) using simpler proofs, recovers the AI-GGM security bounds obtained by Corrigan-Gibbs and Kogan against preprocessing attackers, for a number of assumptions related to cyclic groups, such as discrete logarithms and Diffie-Hellman problems, and provides new bounds for two assumptions.
An important step in obtaining these results is to port the tools used in recent work by Coretti et al. (EUROCRYPT '18) from the ROM to the RPM/ICM/GGM, resulting in very powerful and easy-to-use tools for proving security bounds against non-uniform and preprocessing attacks.
Ben Smyth
Rhys Carlton, Aleksander Essex, Krzysztof Kapulkin
Jens-Matthias Bohli, Maria Isabel Gonzalez Vasco, Rainer Steinwandt
28 February 2018
Kaunas, Lithuania, 24 September - 26 September 2018
Submission deadline: 30 April 2018
Notification: 18 June 2018
Santa Barbara, USA, 19 August 2018
Submission deadline: 1 June 2018