IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
29 December 2016
University of Oxford
Job PostingCandidates must have an excellent background in mathematics, computer science or physics and the ability and willingness to work on inter-disciplinary research projects. Acquaintance with cryptography concepts and/or quantum algorithms as well as some programming skills will be considered as strong assets. Candidates must be able to obtain a DV security clearance prior to starting their D Phil; in particular they must be UK citizens.
There is a possibility to slightly extend the deadline below as long as the candidate can still obtain their DV clearance before September 2017. Please contact us informally if needed.
Closing date for applications: 6 January 2017
Contact: Christophe Petit, Ali El Kaafarani
More information: https://www.maths.ox.ac.uk/node/24010
University of Bergen, Norway
Job PostingThe prime objectives of this project are Boolean functions with optimal resistance to various cryptographic attacks (differential, linear, algebraic et al.) and their applications in discrete mathematics (such as commutative semifields, o-polynomials, difference sets, dual hyperovals, regular graphs, m-sequences, codes et al.).
For further information and for application for POSTDOC position see the webpage:
https://www.jobbnorge.no/en/available-jobs/job/132032/researcher-position-at-the-department-of-informatics
For further information and for application for PhD STUDENT positions see the webpage:
https://www.jobbnorge.no/en/available-jobs/job/132261/phd-position-in-boolean-functions-2-positions
All applicants are advised to apply also for the following open postdoc and PhD positions related to the whole Department of Informatics:
https://www.jobbnorge.no/en/available-jobs/job/132026/postdoctoral-fellow-in-informatics
https://www.jobbnorge.no/en/available-jobs/job/131983/research-fellow-phd-candidates-in-informatics-computer-science-3-positions
Closing date for applications: 15 February 2017
Contact: Dr. Lilya Budaghyan lilya.budaghyan (at) uib.no
28 December 2016
Eik List, Mridul Nandi
ePrint ReportLijing Zhou, Licheng Wang, Yiru Sun
ePrint ReportPing Zhang, Honggang Hu
ePrint ReportRoberto Avanzi
ePrint ReportIt is work in progress, and it has been for the good part of the last three years -- sadly, for various reasons no significant change has been made during the last twelve months.
However, it is also in a self-contained, useable, and relatively polished state, and for this reason I have decided to release this \textit{snapshot} onto the public as a service to the cryptographic community, both in order to obtain feedback, and also as a means to give something back to the community from which I have learned much.
At some point I will produce a final version -- whatever being a ``final version'' means in the constantly evolving field of block cipher design -- and I will publish it. In the meantime I hope the material contained here will be useful to other people.
Christoph Dobraunig, Eik List
ePrint ReportQi Cheng, Jincheng Zhuang
ePrint ReportAlan Szepieniec, Bart Preneel
ePrint ReportSumit Chakraborty
ePrint ReportMaria Isabel Gonzalez Vasco, Angel L. Perez del Pozo, Adriana Suarez Corona
ePrint ReportStuart Haber, William Horne, Miaomiao Zhang
ePrint ReportAs with several previous schemes for redactable signatures, we sign a sequence of randomized commitments that depend on the contents of the subdocuments of the document to be signed. In order to hide their number and location, we randomize their order, and mix them with a sequence of "dummy nodes" that are indistinguishable from commitment values. Our first scheme uses a data structure of size quadratic in the number of subdocuments, encoding all the precedence relations between pairs of subdocuments. By embedding these precedence relations in a smaller family of graphs, our second scheme is more efficient, with expected cost linear in the number of subdocuments in the document to be signed. We introduce a quantified version of the transparency property, precisely describing the uncertainty about the number of redacted subdocuments that is guaranteed by the two schemes.
We prove that our schemes are secure, i.e. unforgeable, private, and transparent, based on the security of collision-free hash functions, pseudorandom generators, and digital signature schemes. While providing such strong security, our scheme is also efficient, in terms of both computation and communication.
Ilaria Chillotti, Nicolas Gama, Louis Goubin
ePrint ReportWen-jie Lu, Shohei Kawasaki, Jun Sakuma
ePrint ReportJian Guo, Jérémy Jean, Ivica Nikolic, Yu Sasaki
ePrint ReportRui Zong, Xiaoyang Dong, Xiaoyun Wang
ePrint ReportRui Zong, Xiaoyang Dong
ePrint ReportYonatan Sompolinsky, Yoad Lewenberg, Aviv Zohar
ePrint ReportWe present SPECTRE, a new protocol for the consensus core of cryptocurrencies that remains secure even under high throughput and fast confirmation times. At any throughput, SPECTRE is resilient to attackers with up to 50\% of the computational power (up until the limit defined by network congestion and bandwidth constraints). SPECTRE can operate at high block creation rates, which implies that its transactions confirm in mere seconds (limited mostly by the round-trip-time in the network).
Key to SPECTRE's achievements is the fact that it satisfies weaker properties than classic consensus requires. In the conventional paradigm, the order between any two transactions must be decided and agreed upon by all non-corrupt nodes. In contrast, SPECTRE only satisfies this with respect to transactions performed by honest users. We observe that in the context of money, two conflicting payments that are published concurrently could only have been created by a dishonest user, hence we can afford to delay the acceptance of such transactions without harming the usability of the system. Our framework formalizes this weaker set of requirements for a cryptocurrency's distributed ledger. We then provide a formal proof that SPECTRE satisfies these requirements.
26 December 2016
Announcement
As a turbulent 2016 nears its end, I would like to give you an update of current IACR activities.
First, let me thank all organizers of the eight (!) IACR conferences in 2016. They are all volunteers and take up the tremendous work of creating an event with 100s of participants and a program selected from 100s of submissions. All conferences ran smoothly and left lasting impressions.
The most recent conference I attended was Asiacrypt in Hanoi, with 2^8 participants and the first cryptology conference of IACR in Vietnam. Asiacrypt has been organized by IACR since 2000; the earlier Asiacrypt/Auscrypt conferences were predecessors to the ownership by IACR. However, Vietnamese cryptanalysts discovered in the logo of Asiacrypt 2016 that the IACR has always been part of AsIACRypt.
After the 2016 election, the Board of Directors will see a couple of new faces for 2017 onward: Welcome, Francois-Xavier Standaert and Joppe Bos; and welcome again Shai Halevi and Brian LaMacchia! In their roles as General Chairs of 2018 conferences, also Orr Dunkelman (Eurocrypt), Tal Rabin (Crypto), and Josef Pieprzyk (Asiacrypt) will join the Board. And Kenny Paterson takes over from Ivan Damgaard as Editor-in-Chief of the Journal of Cryptology.
At the same time, let me thank the leaving Board members for their longstanding service to the IACR: Nigel Smart, Martijn Stam, Christof Paar, and David Pointcheval have contributed to the organization for several decades taken together. They will enjoy future events with less responsibilities.
One important development in 2016 has been the creation of the IACR Transactions on Symmetric Cryptology (ToSC). ToSC is published as gold open access and freely available, published in electronic form by the Ruhr University of Bochum, with Gregor Leander as Managing Editor. ToSC is now available at http://tosc.iacr.org. (Sorry, HTTPS-everywhere enthusiasts, we only have HTTP for this at the moment.) The FSE conference and ToSC operate as a journal/conference hybrid and papers published in ToSC are presented at FSE.
The dates and details of IACR's future events appear on the website as they become available. The minutes of the Board meetings and the summary presentations that I give at each Asia/Euro/Crypto conference are available on the website as well, under About > Documents.
I wish you all the best for 2017 and am looking forward to seeing many of you at the next conferences!
Christian Cachin
IACR President