IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
19 November 2016
Warsaw, Poland, 11 September - 13 September 2017
Submission deadline: 30 April 2017
Notification: 30 June 2017
18 November 2016
Paderborn University, Germany
Postdoctoral Researcher in Cryptography
The position is full-time (100 %, pay scale 13 TV-L).
Responsibilities:
- Research in applied and theoretical cryptography and IT security, both independent and in cooperation with other members of the IT security working group
- Collaboration in a foundational research project on time-based cryptography, blockchain technology, and the development and security analysis of public-key encryption and witness encryption schemes
- Appropriate support in the fulfillment of the research and teaching tasks of the working group, e.g., by instruction of doctoral students in applied and theoretical cryptography
Requirements:
- Excellent doctoral degree in computer science, mathematics, or a related subject
- Strong background and publications in applied and theoretical cryptography
- Willingness and ability to perform excellent research and work independently and in a team
Applications from women and disabled people (in the sense of the German social law SGB IX) are particularly welcome and, in case of equal qualifications and experience, will receive preferential treatment according to state law (LGG).
Please note that only electronic applications can be considered.
Please send the usual application documents (CV, list of publications, list of references, earliest date available) with the index number ITS-0103 by 15.12.2016 to Ms. Carmen Buschmeyer (carmen (at) upb.de).
For further information, please contact Prof. Dr.-Ing. Tibor Jager (tibor.jager (at) upb.de).
Closing date for applications: 15 December 2016
Contact: tibor.jager (at) upb.de
University of Cincinnati
The University of Cincinnati is one of the leading research centers in post-quantum cryptography, and due to recent national initiatives, this program has great potential for continued growth and development.
The Department is dedicated to excellence in both research and teaching. We seek candidates with a doctorate (or equivalent foreign degree) in mathematics who will pursue an active research program that strengthens/complements the research activities in the Department, especially in the areas related to the research in post-quantum cryptography including multivariate/lattice-based public key cryptography, computational algebra/number theory, and interdisciplinary applied algebra/number theory in cryptography.
The Department has particular research strength and a record of external funding in post-quantum cryptography, and maintains a strong graduate program leading to MS and PhD degrees in pure and applied mathematics and statistics. The normal teaching load for research-active faculty is six credit hours per semester with a three credit hour reduction for new faculty in each of the first two years and a reduced service role.
Applications should be submitted via https://www.mathjobs.org/jobs/jobs/9407 & https://jobs.uc.edu/job/Cincinnati-Assistant-Professor-A&S-Mathematical-Sciences-OH-45201/372395300/ per the instructions in the ads there. Review of applications will begin Dec. 1, 2016, and continue until the position is filled. The appointment will begin on August 15, 2017.
The University of Cincinnati is an equal opportunity/affirmative action employer with a strong commitment to diversity.
Closing date for applications: 31 December 2016
Contact: Dr. Jintai Ding, Chair of the Search Committee, or Dr. Shuang Zhang, Head of the Department of Mathematical Sciences
More information: http://www.artsci.uc.edu/departments/math.html
University of Edinburgh
Closing date for applications: 15 January 2017
Contact: Aggelos Kiayias
Chair in Cyber Security and Privacy
University of Edinburgh
Informatics Forum, Office 5.16
10 Crichton St, Edinburgh
Midlothian EH8 9AB, United Kingdom
Tel. +44 (0) 131 6505129
E-mail. akiayias (at) inf.ed.ac.uk
More information: http://web.inf.ed.ac.uk/security-privacy/news/vacancy-in-security-and-privacy
University of South Florida
To learn more about the position and its application procedure, use the following link
http://www.math.usf.edu/about/29547/
Closing date for applications: 1 December 2016
University of South Florida
Required application materials include: a cover letter indicating the name(s) of potential postdoctoral mentor(s) from our existing faculty; a curriculum vita; a research statement; and at least three letters of recommendation, one of which should address the applicant\' s effectiveness as a teacher.
Applications must be submitted through the AMS MathJobs website https://www.mathjobs.org/jobs/USF/PDNT2017. Review of applications will continue until position is filled. However, preference will be given to those candidates who submit their application materials by January 8, 2017.
Questions about the application procedure may be sent to usf.postdoc.nt (at) gmail.com. Candidates are welcome to indicate if they are attending the 2017 joint mathematics meetings in Atlanta (Jan. 4th to Jan. 7th) where pre-interviews can be held. According to Florida Law, applications and meetings regarding them are open to the public.
USF is an Equal Opportunity/Equal Access Institution. For disability accommodations, contact Denise Marks at (813/974-9747), a minimum of five working days in advance.
Closing date for applications: 8 January 2017
Contact: Hiring committee (usf.postdoc.nt (at) gmail.com)
University of South Florida
Potential research topics include:
1) Algorithms for ideal lattices.
2) Post quantum cryptography.
3) Fully homomorphic encryption.
All applicants (US and international) are welcome. The deadline for an August 2017 start date is February 1rst 2017. Applicants should send their application material (CV and a 1 page research statement) through the email provided in this ad.
The successful candidate will have to submit a separate application to the maths department graduate program by Feb. 1rst 2017. General instructions for applying to the maths graduate program of the USF can be found here: http://math.usf.edu/grad/apply/.
The conditions are:
a) 3 years of funding.
b) Stipend of $16,000 per year.
c) Teaching duties 5h/week.
d) Tuition waiver.
Please contact me if you are interested.
Closing date for applications: 20 January 2017
Contact: Jean-François Biasse (usf.phd.crypto (at) gmail.com)
16 November 2016
Chunsheng Gu
Thomas Unterluggauer, Mario Werner, Stefan Mangard
This paper builds on this observation and shows that the re-keying countermeasure does not only protect the secret key, but also induces another DPA vulnerability that allows for plaintext recovery. Namely, the frequent re-keying in leakage-resilient streaming modes causes constant plaintexts to be attackable through first-order DPA. Similarly, constant plaintexts can be revealed from re-keyed block ciphers using templates in a second-order DPA. Such plaintext recovery is particularly critical whenever long-term key material is encrypted and thus leaked. Besides leakage-resilient encryption, the presented attacks are also relevant for a wide range of other applications in practice that implicitly use re-keying, such as multi-party communication and memory encryption with random initialization for the key. Practical evaluations on both an FPGA and a microcontroller support the feasibility of the attacks and thus suggest the use of cryptographic implementations protected by mechanisms like masking in scenarios that require data encryption with multiple keys.
Group Signatures with Linking-Based Revocation: A Pragmatic Approach for Efficient Revocation Checks
Daniel Slamanig, Raphael Spreitzer, Thomas Unterluggauer
Haruna Higo, Keisuke Tanaka, Akihito Yamada, Kenji Yasunaga
Sergey Gorbunov, Dhinakaran Vinayagamurthy
In this work, we present a construction of functional encryption in a hardware assisted model of computation. We prove the security of our construction under the simulation-based definition. We present an implementation of our construction and show essential evaluation results, which demonstrate that our construction is very practical. In our evaluation, key-generation, encryption and decryption take around $1$, $22$ and $140$ milliseconds for linear regression programs over 4 million sample points. Our construction is motivated by the recent advances in processors that enable creation of encrypted memory containers.
Rex Fernando, Peter M. R. Rasmussen, Amit Sahai
We can also apply our defense to a recent extension of attacks by Chen et al (ePrint 2016) on obfuscation in the context of GGH13 construction.
There are four submission windows per year for ToSC. The current submission window (issue #3 of ToSC) closes on November 23.
For more information, see the call for Papers or submission server:
http://www.nuee.nagoya-u.ac.jp/labs/tiwata/fse2017/Cfp.pdf
https://secure.iacr.org/websubrev/fse17_3/submit/
President:
** Christian Cachin: 467
Vice President:
** Greg Rose: 457
Treasurer:
** Brian LaMacchia: 460
Secretary:
** Joppe Bos: 337
Jacob Schuldt: 258
Directors:
** Bart Preneel: 314
** Shai Halevi: 278
** Francois-Xavier Standaert: 246
Trancrède Lepoint: 214
Sasha Boldyreva: 206
Martijn Stam: 198
Pierre-Alain Fouque: 187
Svetla Nikova: 151
Vladimir Kolesnikov: 105
Election verification data can be found at: https://vote.heliosvoting.org/helios/e/IACR2016
Congratulations to the newly elected officers & directors, and sincere thanks to all candidates and voters.
Paris, France, 30 April 2017
Submission deadline: 12 December 2016
Notification: 20 January 2017
Les Diablerets, Switzerland, 14 January - 20 January 2017
15 November 2016
15 November - 31 December 2017
Submission deadline: 15 May 2017
Newcastle University, Newcastle upon Tyne, UK
We ask questions like: How can we digitally sign and prove properties of complex data structures, without disclosing further information about them? How can we certify entire topologies of computer systems, while maintaining the confidentiality of the system\'s blueprint?
The project would benefit from experience with anonymous credential systems, especially based on Camenisch-Lysyanskaya (CL) signatures (IDEMIX) or from experience with the Trusted Computing Platform and Direct Anonymous Attestation (DAA).
The position is part of the EU Horizon2020 Project PrismaCloud, allowing for collaboration with a range of European partners. It is fixed term for 2 years and is full time.
As part of your application, please provide a CV and covering letter which details your prior experience in cryptography, especially in relation to anonymous credential systems or authenticated data structures.
The School of Computing Science of Newcastle University has been nominated by the Times Higher Education (THE) as one of the top-100 computer science departments in the world. It is recognized as an UK Academic Centre of Excellence in Cyber Security Research.
The School of Computer Science is committed to promoting equality and diversity, including the Athena SWAN charter for promoting women’s careers in STEMM subjects (science, technology, engineering, mathematics and medicine) in higher education. The School received a Bronze Award in 2015 for their commitment to the representation of women in the workplace and we welcome all candidates to apply for this post. Appointment will always be made on merit.
Closing date for applications: 30 November 2016
Contact: For informal enquiries please contact the Project Leader, Dr Thomas Gross – Thomas.gross (at) ncl.ac.uk
More information: https://vacancies.ncl.ac.uk/ViewVacancyV2.aspx?enc=mEgrBL4XQK0+ld8aNkwYmK3koijWkp/Jg9UuOnmhkrRKz1TfJg9ldMS2T4v+qPpXgeebG
Abu Dhabi, UAR, 2 April 2017
Submission deadline: 20 January 2017
Notification: 15 February 2017