IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
24 September 2017
Omer Paneth, Guy N. Rothblum
We show that ZTHE can suffice for powerful applications. Based on any ZTHE scheme that satisfies the additional properties of correctness on adversarial ciphertexts and multi-key homomorphism, we construct publicly verifiable non-interactive arguments for delegating computation. Such arguments were previously constructed from indistinguishability obfuscation or based on so-called knowledge assumptions. The arguments we construct are adaptively sound, based on an efficiently falsifiable assumption, and only make black-box use of the underlying cryptographic primitives.
We also show that a ZTHE scheme that is sufficient for our application can be constructed based on an efficiently-falsifiable assumption over so-called "clean" graded encodings.
Essam Ghadafi
Christian Cachin, Esha Ghosh, Dimitris Papadopoulos, Björn Tackmann
Our contribution is two-fold. First, we extend the recent hash&prove scheme of Fiore et al. (CCS 2016) to stateful computations that support arbitrary updates by the untrusted server, in a way that can be verified by the clients. We use this scheme to generically instantiate authenticated data types. Second, we describe a protocol for multi-client verifiable computation based on an authenticated data type, and prove that it achieves a computational version of fork linearizability. This is the strongest guarantee that can be achieved in the setting where clients do not communicate directly; it ensures correctness and consistency of outputs seen by the clients individually.
Núria Costa, Ramiro Martínez, Paz Morillo
Bernardo David, Rafael Dowsley, Mario Larangeira
Stefan Kölbl
In particular, we provide a broad comparison of the performance of cryptographic hash functions utilizing the cryptographic extensions and vector instruction set extensions available on modern microprocessors. This comes with several new implementations optimized towards the specific use case of hash-based signature schemes.
Further, we instantiate SPHINCS with these primitives and provide benchmarks for the costs of generating keys, signing messages and verifying signatures with SPHINCS on Intel Haswell, Intel Skylake, AMD Ryzen, ARM Cortex A57 and Cortex A72.
Roderick Bloem, Hannes Gross, Rinat Iusupov, Bettina Könighofer, Stefan Mangard, Johannes Winter
23 September 2017
Florida Atlantic University
--Post-Quantum Cryptography and Implementations
--Fully Homomorphic Encryption and Implementations
--Blockchain Security
--Information Quantum Computing (from Cryptography aspects)
--Authenticated Key exchange and TLS
We offer very competitive and generous packages. To apply, please send an email with your CV, transcripts, and IELTS/TOEFL and GRE scores. Students with strong Mathematics background are more than welcome to apply. Applicants with solid knowledge of operating systems, hardware/software implementations (FPGA, CPUs, ARM) skills will be given priority.
For more information please visit: https://faculty.eng.fau.edu/azarderakhsh/
Contact: Dr. Reza azarderakhsh, razarderakhsh{-a-t-}fau.edu
Closing date for applications: 31 December 2017
More information: https://faculty.eng.fau.edu/azarderakhsh/
TU Wien
Candidates can apply in any of the Faculty’s main research areas: Computer Engineering, Distributed and Parallel Systems, Logic & Computation, Media Informatics & Visual Computing, as well as Business Informatics (http://www.informatik.tuwien.ac.at/research).
The work contract is initially limited to six years. The candidate and TU Wien can agree upon a tenure evaluation, which when positive, opens the possibility to change the position to Associate Professor with an unlimited contract.
Duties include research in one of the Faculty’s main research areas (see above) as well as graduate and undergraduate teaching.
The TU Wien (Vienna University of Technology) is among the most successful technical universities in Europe and it is Austria’s largest scientific-technical research and educational institution. The Faculty of Informatics, one of the eight faculties at the TU Wien (Vienna University of Technology), has an excellent reputation and plays an active role in national and international research.
Application deadline: November 5, 2017
Closing date for applications: 5 November 2017
More information: http://www.informatik.tuwien.ac.at/vacancies
Beijing, China, 19 October - 20 October 2017
Submission deadline: 30 June 2017
Notification: 30 July 2017
21 September 2017
Information about proposing an affiliated event can be found at https://eurocrypt.iacr.org/2018/callforevents.html. Proposals are due October 24.
1 November 2018
Submission deadline: 31 October 2017
Sendai, Japan, 3 September - 5 September 2018
Virginia Tech
The successful candidate would be expected to collaborate with existing Virginia Tech ECE faculty with expertise covering hardware security, tamper-resistant secure implementations, secure embedded systems design, VLSI and System-on-Chip design, computer security, low-power and energy-efficient implementation of hardware and software, wireless systems, and RF IC design. Beyond the ECE department, the university has world-class research activities in machine learning, robotics, data analytics, integrated security, intelligent infrastructure, transportation, advanced manufacturing, and medical sciences.
The successful candidate will be expected to develop and maintain a nationally-recognized funded research program, teach undergraduate and graduate courses, and participate in department, college, and/or university service and outreach activities.
Closing date for applications: 15 December 2017
More information: http://listings.jobs.vt.edu/postings/79966
Laboratoire Hubert Curien, University of Lyon, Saint-Etienne, France
For a new project which addresses the problem of the security of True Random Number Generator (TRNG). We are looking for candidates with an outstanding Ph.D in applied mathematics and a strong publication record in this field. The main topic of the post-doc is to work on stochastic modeling of TRNG. Knowledge of French is not mandatory.
The Post-Doc position will start in December 2017 (flexible starting date), it is funded for 24 month.
To apply please send your detailed CV (with publication list), motivation for applying (1 page) and names of at least two people who can provide reference letters (e-mail).
Closing date for applications: 30 November 2017
Contact: Prof. Lilian BOSSUET lilian.bossuet(at)univ-st-etienne.fr
Laboratoire Hubert Curien, University of Lyon, Saint-Etienne, France
For a new project which addresses the problem of the security of True Random Number Generator (TRNG). We are looking for candidates with an outstanding Ph.D in hardware security and a strong publication record in this field. The main topic of the post-doc is to work on laser fault injection on TRNG. Knowledge of French is not mandatory.
The Post-Doc position will start in December 2017 (flexible starting date), it is funded for at least 24 month.
To apply please send your detailed CV (with publication list), motivation for applying (1 page) and names of at least two people who can provide reference letters (e-mail).
Closing date for applications: 30 November 2017
Contact: Prof. Lilian BOSSUET lilian.bossuet(at)univ-st-etienne.fr
20 September 2017
RWTH Aachen University, Germany
* Serious gaming in rising security awareness
* Privacy-enhancing technologies
* Machine Learning and anomolie detection
Closing date for applications: 17 October 2017
Contact: Ulrike Meyer, professor, Mies-van-der-Rohe Strasse 15, meyer (at) itsec.rwth-aachen.de
More information: http://www.itsec.rwth-aachen.de/job-offers
Singapore University of Technology and Design, Singapore
The project results will be validated using case studies, where block chain technologies, such as HyperLedger and Ethereum, are deployed in IoT and FinTech applications. This offers researchers a unique opportunity to conduct cutting-edge research and validate it in a realistic setting. Collaboration with several private and Government agencies in Singapore and abroad increases the chances of technology transfer and hence the research impact.
The project has been awarded funding, and selected candidates will be expected to join ASAP. Later joining dates could be negotiated.
We seek for postdocs with a background in:
- mathematics, economics, or game theory.
- software engineering, distributed systems, networking, financial engineering, or additive manufacturing.
- software engineering, formal methods, programming languages, software security, or software testing.
Strong candidates with background in other (related) areas will also be considered.
Selected candidates will have a unique opportunity to work closely with the developers of Ethereum and an international team of researchers located in Singapore and the Netherlands (TNO and TU Delft). SUTD offers internationally competitive salaries, medical and other benefits. All positions are for up to two years and could be negotiated.
Interested candidates should send an up-to-date curriculum vitae to Pawel Szalachowski, email: pawel (at) sutd.edu.sg
Closing date for applications:
18 September 2017
Ashokkumar C, M. Bhargav Sri Venkatesh, Ravi Prakash Giri, Bernard Menezes
Andrey Bogdanov, Philip S. Vejre
In this paper, we first investigate the validity of these fundamental assumptions when applied to DES. For the right key, we observe that strong linear approximations of DES have more than just one dominant trail and, thus, that the right keys are in fact inequivalent with respect to linear correlation. We therefore develop a new right-key model using Gaussian mixtures for approximations with several dominant trails. For the wrong key, we observe that the correlation of a strong approximation after the partial decryption with a wrong key still shows much non-randomness. To remedy this, we propose a novel wrong-key model that expresses the wrong-key linear correlation using a version of DES with more rounds. We extend the two models to the general case of multiple approximations, propose a likelihood-ratio classifier based on this generalisation, and show that it performs better than the classical Bayesian classifier.
On the practical side, we find that the distributions of right-key correlations for multiple linear approximations of DES exhibit exploitable asymmetries. In particular, not all sign combinations in the correlation values are possible. This results in our improved multiple linear attack on DES using 4 linear approximations at a time. The lowest computational complexity of $2^{38.86}$ DES evaluations is achieved when using $2^{42.78}$ known plaintexts. Alternatively, using $2^{41}$ plaintexts results in a computational complexity of $2^{49.75}$ DES evaluations. We perform practical experiments to confirm our model. To our knowledge, this is the best attack on DES.