IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
12 October 2016
B. Skoric, P.W.H. Pinkse, A.P. Mosk
ePrint ReportLiwei Zhang; A. Adam Ding; Yunsi Fei; Zhen Hang Jiang
ePrint Report10 October 2016
Marshall Ball, Tal Malkin, Mike Rosulek
ePrint ReportFor arithmetic circuits over the integers, our construction results in garbled circuits with {\em free} addition, weighted threshold gates with cost independent of fan-in, and exponentiation by a fixed exponent with cost independent of the exponent. For boolean circuits, our construction gives an {\em exponential} improvement over the state of the art for threshold gates (including AND/OR gates) of high fan-in.
Our construction can be efficiently instantiated with practical symmetric-key primitives (e.g., AES), and is proven secure under similar assumptions to that of the Free-XOR garbling scheme (Kolesnikov \& Schneider, ICALP 2008). We give an extensive comparison between our scheme and state-of-the-art garbling schemes applied to boolean circuits.
Pei Luo, Chao Luo, Yunsi Fei
ePrint ReportPei Luo, Yunsi Fei
ePrint ReportBahram Rashidi, Sayed Masoud Sayedi, Reza Rezaeian Farashahi
ePrint ReportAbu Dhabi, UAE, 2 April 2017
Event CalendarSubmission deadline: 1 December 2016
Notification: 15 January 2017
Florida Atlantic University, Boca Raton, Florida
Job PostingSpecific topics includes:
*Cryptographic Computations
*Post-quantum cryptography
*Fully Homomorphic Encryption
*Implementations on Software (Intel, AMD, ARM CPUs) using C/ASM and Hardware (FPGAs, ASIC) using VHDL/Verilog.
*Side-channel analysis and countermeasures
Please submit your CV, Transcripts and interest statement for consideration.
Closing date for applications: 15 November 2016
Contact: Dr. Reza Azarderakhsh, razarderakhsh*at-sign*fau.edu
07 October 2016
Eastern Michigan University, Department of Mathematics, Ypsilanti, MI, USA
Job PostingClosing date for applications: 1 January 2017
More information: http://agency.governmentjobs.com/emichedu/default.cfm
University College London
Job PostingUniversity College London is one of Europe\'s highest ranked universities and recognized by the EPSRC and GCHQ as an Academic Centre of Excellence in Cyber Security Research. The Department of Computer Science is ranked as the best in the UK and is located at UCL\'s main campus in the centre of London.
Closing date for applications: 6 November 2016
Contact: Applications must be made using UCL\'s online system. Questions about the position can be directed to Jens Groth - j.groth AT ucl.ac.uk
More information: http://www.cs.ucl.ac.uk/staff/J.Groth/openings.html
Boston, USA, 3 November - 4 November 2016
Event CalendarSubmission deadline: 4 October 2016
Notification: 6 October 2016
EPFL, Lausanne, Switzerland
Job PostingWe are specifically looking for a senior researcher to work on a project related to private authentication of people.
LASEC is active in research on cryptography and security. More specifically, our main interests span (but are not limited to) the following:
Cryptographic analysis
Design of cryptographic algorithms and protocols
Lightweight cryptography
Secure communication
Postquantum cryptography
Privacy preservation
Payment
Number theory and cryptography.
The selection of applicants will be made on a competitive basis.
Besides conducting top-quality research, postdocs are required to participate the the lab activities such as training students at all levels, running projects, fund raising, etc.
EPFL is a top-ranked research and teaching institution that attracts some of the best intellects in the world. EPFL offers excellent facilities, environment, and salaries. The EPFL campus is a multi cultural, idyllic spot overlooking Lake Geneva and facing the Alps.
Closing date for applications: 1 June 2017
Contact: Serge Vaudenay, job_lasec (at) epfl.ch
More information: http://lasec.epfl.ch
Goethe University Frankfurt, Frankfurt am Main , Germany
Job PostingTo strengthen our team we are looking for a committed,creative and flexible PhD candidate(male/female) with advanced professional knowledge in Information Technology and interest in the current development in business informatics.The environment of mobile systems and applications will give you valuable work experience in interdisciplinary and multinational projects with travel and project responsibility.Beside your project work and other activities at the chair, the preparation of your PhD thesis is in key.Our interdisciplinary environment with computer scientists and economists leads to synergies in our research and teaching,especially in IT Security, Identity Management and secure infrastructures in mobile environments.Our cooperation with our benefactor Deutsche Telekom provides extraordinary strategic and infrastructural opportunities.
Closing date for applications: 31 October 2016
Contact: Prof Dr. Kai Rannenberg
Theodor-W.-Adorno-Platz 460629
Frankfurt am Main, Germany
bewerbungen (at) m-chair.de
Tel. +49-69-798-34701
More information: https://m-chair.de/images/documents/career/Ausschreibung_wiss_Mat_Dekanatsstelle_2016.09.26_ENG.pdf
University of Erlangen-Nuremberg
Job Postingat the Department of Computer Science to be filled the earliest possible starting date for an initial period of three years. Depending on successful evaluation the appointment will be extended for another three years.
The successful candidate is expected to represent the field adequately in teaching and research. In particular, the candidate should have an independent research and teaching track record in one or more of the following areas:
- Provably secure cryptographic protocols
- Efficient provably secure multi-party computation(in terms of rounds/time)
- Cryptography in the context of digitalisation/Industry 4.0, especially cryptographic protocols for smart homes/smart living, energy and automation technology (e.g. based on RFID, hardware tokens, physical unclonable functions (PUFs))
- Efficient implementation of cryptographic algorithms on dedicated hardware (e.g. based on coding assumptions)
- Post-quantum secure cryptographic algorithms
We expect the successful applicant to become involved in interdisciplinary collaboration at Friedrich-Alexander-Universität Erlangen-Nürnberg and collaboration with Technische Hochschule Nürnberg Georg Simon Ohm as part of the Nuremberg Campus of Technology.
Prerequisites for the position are a university degree in computer science (or a related area), university level teaching experience, and a doctoral degree.
FAU is a family-friendly employer and is also responsive to the needs of dual career couples. In its pursuit of academic excellence, FAU is committed to equality of opportunity and to a proactive and inclusive approach, which supports and encourages all under-represented groups, promotes an inclusive culture and values diversity.
Please submit your complete application documents (CV, list of publications, list of lectures and courses taught, copies of certificates and degrees, list of third-party funding) online at https://berufungen.fau.de/ by 6.11.2016, addressed to the Dean of the Faculty of Engineering.
Closing date for applications: 6 November 2016
Contact:
Dean of the Faculty of Engineering
tf-dekanat (at) fau.de
Prof. Dr. Dominique Schröder
dominique.schroeder (at) fau.de
Taipei, Taiwan, 7 August - 10 August 2017
Event CalendarSubmission deadline: 27 January 2017
Notification: 7 April 2017
06 October 2016
Eindhoven, Netherlands, 29 May 2017
Event Calendar05 October 2016
Maciej Skorski
ePrint ReportInterestingly, with our proof we obtain quantitative improvements on the partition size by a factor equal to the graph density (in the tower heigh for strong regularity and in the exponent for weak regularity). In particular, we achieve best possible bounds for constant densities.
Lorenzo Grassi, Christian Rechberger
ePrint ReportIn this paper, we consider PRINCE, a widely analyzed block cipher proposed in 2012. After the identification of a 2.5 rounds subspace trail of PRINCE, we present several (truncated differential) attacks up to 6 rounds of PRINCE. This includes a very practical attack with the lowest data complexity of only 8 plaintexts for 4 rounds, which co-won the final round of the PRINCE challenge in the 4-round chosen-plaintext category. The attacks have been verified using a C implementation. Of independent interest, we consider a variant of PRINCE in which ShiftRows and MixLayer operations are exchanged in position. In particular, our result shows that the position of ShiftRows and MixLayer operations influences the security of PRINCE. The same analysis applies to follow-up designs inspired by PRINCE.
Craig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik
ePrint ReportIn this paper, we propose a range of new algorithms and techniques that accelerate SIDH public key-compression by more than an order of magnitude, making it roughly as fast as a round of standalone SIDH key exchange, while further reducing the size of the compressed public keys by approximately 13%. These improvements enable the practical use of compression, achieving public keys of only 330 bytes for the concrete parameters used to target 128 bits of quantum security and further strengthens SIDH as a promising post-quantum primitive.
Nir Bitansky, Omer Paneth, Huijia Lin
ePrint ReportOur main result is that, assuming LWE, {\em black-box constructions} of {\em sufficiently succinct} FE schemes from constant-degree graded encodings can be transformed to rely on a much better-understood object --- {\em bilinear groups}. In particular, under an {\em \"{u}ber assumption} on bilinear groups, the construction implies IO in the plain model. The result demonstrates that the exact level of ciphertext succinctness has a major impact on FE schemes based on constant-degree encodings. In particular, we draw a fine line between known FE constructions from constant-degree graded encodings, which just fall short of the required succinctness, and the holy grail of basing IO on better-understood assumptions.
In the heart of our result, are new techniques for removing ideal graded encoding oracles from FE constructions. Complementing the result, for weaker ideal models, namely the generic group model and the random oracle model, we show a transformation from {\em collusion-resistant} FE in either of the two models directly to FE (and IO) in the plain model, without assuming bilinear groups.