IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
08 August 2017
Xinping Zhou, Carolyn Whitnall, Elisabeth Oswald, Degang Sun, Zhu Wang
ePrint ReportMasahiro Yagisawa
ePrint ReportMelissa Chase, Ran Gilad-Bachrach, Kim Laine, Kristin Lauter, Peter Rindal
ePrint ReportYang Xie, Ankur Srivastava
ePrint ReportUniversity of Wollongong, Australia
Job PostingThis position will conduct research in the project of “Internet of Things and Blockchain Security”. It is expected that you will be research active in the area of cyber security, and are equipped with sufficient experience in publishing research outcomes in the top forums.
You will be prompted to respond to the selection criteria as part of the online application process, based on the position description available at the link below. You will be able to save your application at any time and submit at a later date if required, you will only be able to do this before the closing date of the position.
For further information about this position, please contact Head of School and the Director of Institute of Cybersecurity and Cryptology, Professor Willy Susilo on +61 2 4221 5535 or wsusilo at uow dot edu dot au
Closing date for applications: 14 September 2017
Contact: Professor Willy Susilo
More information: https://jobs.uow.edu.au/careersection/ext/jobdetail.ftl?job=170831&tz=GMT%2B10%3A00
07 August 2017
Monash University (Faculty of Information Technology), Melbourne, Australia
Job PostingCandidates must have good English (e.g. IELTS 6.5 with all bands at least 6.0) PLUS an excellent background in at least one of the following areas:
- Applied Cryptography
- Database
- Blockchain
Applicants please send your CV AND publication record to Joseph Liu at joseph.liu(at)monash.edu
Only shortlisted candidates will be contacted.
Closing date for applications: 31 December 2017
Contact: Joseph Liu
More information: http://users.monash.edu.au/~kailiu/
Monash University (Faculty of Information Technology), Melbourne, Australia
Job PostingApplicants should have a PhD and strong background in applied cryptography, especially in post-quantum cryptography. Knowledge in blockchain is an advantage. Applicants with very strong background in blockchain only will also be considered.
Interested candidates should send a CV and a research statement to Joseph Liu at joseph.liu(at)monash.edu
Selection of applications will start immediately.
Closing date for applications: 31 December 2017
Contact: Joseph Liu
Subhadeep Banik, Sumit Kumar Pandey, Thomas Peyrin, Yu Sasaki, Siang Meng Sim, Yosuke Todo
ePrint ReportGIFT is a very simple and clean design that outperforms even SIMON or SKINNY for round-based implementations, making it one of the most energy efficient ciphers as of today. It reaches a point where almost the entire implementation area is taken by the storage and the Sboxes, where any cheaper choice of Sbox would lead to a very weak proposal. In essence, GIFT is composed of only Sbox and bit-wiring, but its natural bitslice data flow ensures excellent performances in all scenarios, from area-optimised hardware implementations to very fast software implementation on high-end platforms.
We conducted a thorough analysis of our design with regards to state-of-the-art cryptanalysis, and we provide strong bounds with regards to differential/linear attacks.
Carsten Baum, Vadim Lyubashevsky
ePrint ReportAll known approaches for such lattice-based zero-knowledge proofs are not very practical because they involve a basic protocol that needs to be repeated many times in order to achieve negligible soundness error. In the amortized setting, where one needs to give zero-knowledge proofs for many equations for the same function $f$, the situation is more promising, though still not yet fully satisfactory. Current techniques either result in proofs of knowledge of $x$'s that are exponentially larger than the $x$'s actually used for the proof (i.e. the \emph{slack} is exponential), or they have polynomial slack but require the number of proofs to be in the several thousands before the amortization advantages ``kick in''.
In this work, we give a new approach for constructing amortized zero-knowledge proofs of knowledge of short solutions over polynomial rings. Our proof has small polynomial slack and is practical even when the number of relations is as small as the security parameter.
Fabrice Boudot
ePrint ReportPaulo S. L. M. Barreto, Shay Gueron, Tim Gueneysu, Rafael Misoczki, Edoardo Persichetti, Nicolas Sendrier, Jean-Pierre Tillich
ePrint ReportXavier Bultel, Manik Lal Das, Hardik Gajera, David Gérault, Matthieu Giraud, Pascal Lafourcade
ePrint ReportDaniel Apon, Congwon Cho, Karim Eldefrawy, Jonathan Katz
ePrint ReportWe first analyze an FE proposed by Fuller et al. (Asiacrypt 2013) based on the learning-with-errors (LWE) assumption, and show that it is not reusable. We then show how to adapt their construction to obtain a weakly reusable FE. We also show a generic technique for turning any weakly reusable FE to a strongly reusable one, in the random-oracle model. Finally, we give a direct construction of a strongly reusable FE based on the LWE assumption, that does not rely on random oracles.
Ahto Buldas, Matthias Geihs, Johannes Buchmann
ePrint ReportDavid A. Basin, Andreas Lochbihler, S. Reza Sefidgar
ePrint ReportBy basing our framework on a conservative extension of higher-order logic and providing sufficient automation support, the resulting proofs are trustworthy and comprehensible, and the framework is extensible and widely applicable. We evaluate our framework by formalizing different game-based proofs from the literature and comparing the results with existing formal-methods tools.