IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
20 October 2017
Nieuwpoort, Curaçao, 2 March 2018
Event CalendarSubmission deadline: 12 December 2017
Notification: 22 January 2018
Imperial College London
Job Posting- To start: as soon as possible.
- Studentship: Three untaxed stipend of £17K per annum and respectively 2 home/EU fees (at the UK/EU student rate only) provided by Imperial College London and 1 overseas fees provided by Nimiq.com.
With over 5 years of full-time blockchain expertise, a PhD degree and PostDoc from ETH Zurich, in the area of blockchain security, privacy and scalability, Dr. Arthur Gervais (www.arthurgervais.com) will be supervising the students directly. Arthur has authored 8+ influential peer-reviewed scientific articles on blockchain published at top-tier security conferences. Arthur has also shown how to convert scientific research into real-world products by providing the first automated formal verification tool for Ethereum based smart contracts (www.securify.ch).
The qualified candidate is encouraged to team up with other researchers at Imperial (e.g. researchers from Imperial business school) to collaborate on interdisciplinary research topics.
Applicants should have knowledge in one or more of:
- Security and Privacy
- Machine learning
- Data analysis and modelling
- Economics/finance (especially data economy)
- Mathematical finance, etc.
Closing date for applications: 1 April 2018
Contact: Applicants should send by email to Dr. Arthur Gervais (a.gervais (at) imperial.ac.uk) their CV, details of academic qualifications and a short statement of your motivation and experience.
More information: http://arthurgervais.com/BlockchainPhDAdvert.pdf
18 October 2017
Vadim Lyubashevsky
ePrint Report17 October 2017
Sahar Mazloom, S. Dov Gordon
ePrint ReportWe then demonstrate that this leakage is useful in a broad class of computations. We show that computations such as histograms, PageRank and matrix factorization, which can be performed in common graph-parallel frameworks such as MapReduce or Pregel, benefit from our relaxation. We implement a protocol for securely executing graph-parallel computations, and evaluate the performance on the three examples just mentioned above. We demonstrate marked improvement over prior implementations for these computations.
Armando Faz-Hern\'andez, Julio L\'opez, Eduardo Ochoa-Jim\'enez, Francisco Rodr\'iguez-Henr\'iquez
ePrint ReportDamian Poddebniak, Juraj Somorovsky, Sebastian Schinzel, Manfred Lochter, Paul Rösler
ePrint ReportIn this paper, we analyze the security of deterministic ECDSA and EdDSA signature schemes and show that the elimination of random number generators in these schemes enables new kinds of fault attacks. We formalize these attacks and introduce practical attack scenarios against EdDSA using the Rowhammer fault attack. EdDSA is used in many widely used protocols such as TLS, SSH and IPSec, and we show that these protocols are not vulnerable to our attack. We formalize the necessary requirements of protocols using these deterministic signature schemes to be vulnerable, and discuss mitigation strategies and their effect on fault attacks against deterministic signature schemes.
Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren
ePrint ReportWenquan Bi, Zheng Li, Xiaoyang Dong, Lu Li, Xiaoyun Wang
ePrint ReportIn this paper, we comprehensively explore the conditional cube attack on the small state (800-bit) River Keyak. Firstly, we find a new conditional cube variable which has a much weaker diffusion than Huang et al.'s, this makes the conditional cube attack possible for small state (800-bit) River Keyak. Then we find enough cube variables for 6/7-round River Keyak and successfully launch the key recovery attacks on 6/7-round River Keyak with the time complexity $2^{33}$ and $2^{49}$ respectively. We also verify the 6 and 7-round attack on a laptop. Finally, by using linear structure technique with our new conditional cube variable, we greatly increase the freedom degree to find more cube variables for conditional cube attacks as it is complex for 800-bit state to find enough cube variables for 8-round attack. And then we use the new variables by this new method to launch 8-round conditional cube attack with the time complexity $2^{81}$. These are the first cryptanalysis results on round-reduced River Keyak. Our attacks do not threaten the full-round (12) River Keyak.
Konstanz, Germany, 25 April - 27 April 2018
Event CalendarSubmission deadline: 30 November 2017
Notification: 24 January 2018
Indianapolis, USA, 13 June - 15 June 2018
Event CalendarSubmission deadline: 10 February 2018
Notification: 8 April 2018
16 October 2017
Election
You may vote as often as you wish now through November 16th using the Helios cryptographically-verifiable election system, but only your last vote will be counted.
Please see https://www.iacr.org/elections/eVoting/about-helios.html for a brief overview of how the Helios system works and https://www.iacr.org/elections/eVoting/ for information on the IACR decision to adopt Helios.
2017 members of the IACR (generally people who attended an IACR conference or workshop in 2016) should shortly receive voting credentials from system@heliosvoting.org sent to their email address of record with the IACR. Questions about this election may be sent to elections@iacr.org.
Information about the candidates can be found below and also at https://www.iacr.org/elections/2017/vote.html.
The IACR Election Committee
Tal Rabin (Chair)
Michel Abdalla (Returning Officer)
Bart Preneel
Candidates for Election in 2017
The candidates below are listed in alphabetical order.
Director (Select as many as desired. Top three vote recipients will be elected.)
- Masayuki Abe
I have been serving the Board of Directors for three years and am currently serving the School Committee and Asiacrypt Steering Committee. Many changes have been made over the years. I would like to support the trend and contribute to the community using my experience.- Candidate home page: http://www005.upp.so-net.ne.jp/nanacov/
- Longer statement: http://www005.upp.so-net.ne.jp/nanacov/
- Josh Benaloh
I have had the privilege of serving on the IACR Board for 17 years - as an officer, a conference chair, and a director. We have grown and addressed many challenges in those years, and we have many new challenges today. I seek the opportunity to continue working for the community.- Candidate home page: http://research.microsoft.com/~benaloh/
- Longer statement: http://research.microsoft.com/~benaloh/#iacr
- Tancrède Lepoint
As your IACR board member, I will (1) foster fruitful relations among our theoretical & practical researchers, industry, and standards, (2) improve the online services provided by the IACR (front- and back-end), and (3) further develop the open and international dissemination of our results and code.- Candidate home page: https://tlepoint.github.io/
- Longer statement: https://tlepoint.github.io/iacr-election-2017/
- Moti Yung
I like to continue supporting IACR's growth and increased excellence, to assure the special needs of individuals and all sub-communities (e.g., CHES, TCC). We need diversity of opinions, geographies, genders, and scientific areas, to assure continued success. Serving last term was a pleasure mixed with modest progress!- Candidate home page: None given
- Longer statement: None given
14 October 2017
Manchester, United Kingdom, 24 January 2018
Event CalendarSubmission deadline: 17 November 2017
Notification: 18 December 2017
13 October 2017
Eduard Hauck, Julian Loss
ePrint ReportJun Liu, Yupu Hu
ePrint ReportGabriel Gallin, Turku Ozlum Celik, Arnaud Tisserand
ePrint ReportSayandeep Saha, Dirmanto Jap, Sikhar Patranabis, Debdeep Mukhopadhyay, Shivam Bhasin, Pallab Dasgupta
ePrint ReportHerman Galteland, Kristian Gjøsteen
ePrint ReportAshish Choudhury, Arpita Patra, Divya Ravi
ePrint ReportTsunekazu Saito, Keita Xagawa, Takashi Yamakawa
ePrint ReportSanjam Garg, Akshayaram Srinivasan
ePrint ReportWe provide constructions for garbling arbitrary protocols based on standard computational assumptions on bilinear maps (in the common random/reference string model). Next, using garbled protocols we obtain a general compiler that compresses any arbitrary round multiparty secure computation protocol into a two-round UC secure protocol. Previously, two-round multiparty secure computation protocols were only known assuming witness encryption or learning-with errors. Benefiting from our generic approach we also obtain two-round protocols (i) for the setting of random access machines (RAM programs) while keeping the (amortized) communication and computational costs proportional to running times, (ii) making only a black-box use of the underlying group, eliminating the need for any expensive non-black-box group operations and (iii) satisfying semi-honest security in the plain model.
Our results are obtained by a simple but powerful extension of the non-interactive zero-knowledge proof system of Groth, Ostrovsky and Sahai [Journal of ACM, 2012].