IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
14 January 2016
NEC Laboratories Europe, Heidelberg, Germany
Candidates should have excellent communication skills and a deep technical background in:
- Security protocols, applied cryptography, and privacy enhancing technologies
- Software development including proven experience with programming languages, such as Java or C/C++
- Excellent understanding of Linux as a development platform; Experience with OpenStack is a plus.
NEC Laboratories in Heidelberg, Germany, provides an excellent working environment supporting individual creativity as well as strong teamwork. English is the working language in the Laboratories. The position is initially limited to two years. Please send your CV and preferably two recommendation letters and a sample code from a past project that you have been involved in electronically via the applications web system http://www.neclab.eu/staffapplication/ with reference to [1512-190-SEC].
Closing date for applications: 29 February 2016
Contact: Amardeo Sarma, General Manager. Phone +49 6221 4342-0
More information: http://www.neclab.eu/jobs.htm
Thomas P. Jakobsen, Jesper Buus Nielsen, Claudio Orlandi
In our setting there are a number of clients $C_1,\ldots,C_n$ with inputs $x_1,\ldots,x_n$. The clients want to delegate a secure computation of $f(x_1,\ldots,x_n)$ to a set of untrusted workers $W_1,\ldots,W_m$. We want do so in such a way that as long as there is at least one honest worker (and everyone else might be actively corrupted) the following holds: * the privacy of the inputs is preserved; * output of the computation is correct (in particular workers cannot change the inputs of honest clients).
We propose a solution where the clients' work is minimal and the interaction pattern simple (one message to upload inputs, one to receive results), while at the same time reducing the overhead for the workers to a minimum. Our solution is generic and can be instantiated with any underlying reactive MPC protocol where linear operations are ``for free''. In contrast previous solutions were less generic and could only be instantiated for specific numbers of clients/workers.
wentan Yi, Shaozhen Chen
Tal Moran, Ilan Orlov
Compared to a proof-of-work, a PoST requires less energy use, as the ``difficulty'' can be increased by extending the time period over which data is stored without increasing computation costs. Our definition is very similar to ``Proofs of Space'' [ePrint 2013/796, 2013/805] but, unlike the previous definitions, takes into account amortization attacks and storage duration. Moreover, our protocol uses a very different (and simpler) technique, making use of the fact that we explicitly allow a space-time tradeoff.
13 January 2016
Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Kuesters, Daniel Rausch
This paper solves the non-responsiveness problem and its negative consequences by proposing a framework for universal composability with responsive environments and adversaries. In a nutshell, when a protocol or functionality sends what we call a restricting message to the adversary/environment, the latter must provide a valid response before any other protocol/functionality is activated. Hence, protocol designers can declare requests for meta-information to be restricting in order to guarantee that such requests are answered immediately, and hence, they do not have to worry about modeling artefacts resulting from such requests not being answered immediately. Our concepts apply to all existing models for universal composability, we provide formal theorems for the IITM model and discuss it the UC and GNUC models.
Frederik Armknecht, Daisuke Moriyama, Ahmad-Reza Sadeghi, Moti Yung
Janaka Alawatugoda
12 January 2016
Antonio de la Piedra
Sedat Akleylek, Nina Bindel, Johannes Buchmann, Juliane Krämer, Giorgia Azzurra Marson
Jos Wetzels, Wouter Bokslag
Jos Wetzels, Wouter Bokslag
Henry Corrigan-Gibbs, Dan Boneh, Stuart Schechter
Abhishek Chakraborty, Debdeep Mukhopadhyay
Khoongming Khoo, Eugene Lee, Thomas Peyrin, Siang Meng Sim
We provide in this article the first human-readable proof on the minimal number of active Sboxes in the related-key model for AES-128, without any help from a computer. More precisely, we show that any related-key differential paths for AES-128 will respectively contain at least 0, 1, 3 and 9 active Sboxes for 1, 2, 3 and 4 rounds. Our proof is tight, not trivial, and actually exhibits for the first time the interplay between the key state and the internal state of an AES-like block cipher with an AES-like key schedule. As application example, we leverage our proofs to propose a new key schedule, that is not only faster (a simple permutation on the byte positions) but also ensures a higher number of active Sboxes than AES-128's key schedule. We believe this is an important step towards a good understanding of efficient and secure key schedule designs.
Patrick McCorry, Siamak F. Shahandashti, Feng Hao
Yalin Chen1, Jue-Sam Chou*2, I - Chiung Liao3
11 January 2016
Piešťany, Slovakia, 22 June - 24 June 2016
Submission deadline: 15 April 2016
Notification: 15 May 2016
The TCC Test of Time award was introduced in 2015. It recognizes outstanding papers, published in the Theory of Cryptography Conference (TCC) at least eight years ago, making a significant contribution to the theory of cryptography, preferably with influence also in other area of cryptography, theory, and beyond. For more information about the Test of Time award, including information on nominating a paper, please see the page at http://www.iacr.org/workshops/tcc/awards.html
10 January 2016
Graduate School of Engineering, Osaka University, Japan
Specially Appointed Assistant Professor (Full-Time): 1
The positions will primarily focus on JST CREST Project on \"The Security Infrastructure Technology for Integrated Utilization of Big Data\" at Graduate School of Engineering, Osaka University (Research Director, Prof. Atsuko Miyaji. Launch from October, 2014.)
2. Qualification:
- Ph.D. in cryptography, network and system security or data science is required.
- Specialized knowledge in information security area is required.
- English language ability sufficient to fulfill one’s work duties.
A primary objective of this position is to promote to establish a platform for big data collection, analysis and utilization in a secure and privacy-preserving manner such as secure data management, privacy-preserving data mining and secure data utility.
4. Period of Employment:
As early as possible (no later than April 1, 2016) – March 31, 2017
(Renewal of the contract might be possible. At longest, up to March 31, 2019.)
5. Application Documents Required:
Applicants must submit the following items:
- CV (photograph attached).
- A list of candidate’s experienced research activities and accomplishments in reversed chronological order according to the following categories: international journal publications, reviewed international conference papers, domestic journal and conference publications, and others such as editorship for international journals and membership of conference program committees.
- Statement of your previous research and future plans for research and education activities.
- A list of names and contact information (mailing address, e-mail, telephone and fax numbers) from three referees.
- Recommendation letters from three referees above.
- Hard copies of at most 5 most significant publications.
- Other supporting documents if you think they are necessary.
Closing date for applications: 25 January 2016
Contact: (By postal mail EMS) Atsuko Miyaji, Professor
Department of Information and Communications Technology, Graduate School of Engineering, Osaka University
2-1 Yamadaoka, Suita, Osaka Prefecture 565-0871, JAPAN
*Write "Application Forms for CREST Research fellow" on the envelope in red ink.
(By e-mail) crest-inf (at) crypto-cybersec.comm.eng.osaka-u.ac.jp
(Phone) +81-6-6879-7714
More information: http://bigdata.comm.eng.osaka-u.ac.jp/index.en.html