IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
06 November 2018
University of Luxembourg
Job PostingThe APSIA team, led by Prof. Peter Y. A. Ryan, is part of the SnT and is a dynamic and growing research group, over 20 strong, performing cutting edge research in information assurance, cryptography, and privacy. The group specializes in the mathematical modelling of security mechanisms and systems, especially crypto protocols (classical and quantum), and socio-technical systems. The group is particularly strong in verifiable voting systems.
For further information you may check: www.securityandtrust.lu and https://wwwen.uni.lu/snt/research/apsia.
Ref: R-STR-5004-00-B
Fixed Term Contract 2 years (CDD), full-time 40 hrs/week
Number of positions: 1
Start date: Late 2018/early 2019 upon agreement.
Your Role
The successful candidate will contribute to the research goals of the APSIA group. The APSIA Group specializes in the design and analysis of secure systems:
Cryptographic Protocols
Quantum Cryptographic Protocols
Cryptographic Algorithms and Primitives
Verifiable Voting Schemes
Socio-Technical Analysis of Security
Privacy Enhancing Technologies
but applications are also welcome in
post-quantum crypto
FinTech
Distributed Ledger Technologies
The tasks associated with the role include:
Contributing to the group’s research directions.
Disseminating results through scientific publications
Coordinating research projects and delivering outputs
Help preparing new research proposals
Providing guidance to PhD and MSc students
Opportunities to do some teaching will be available.
Closing date for applications: 30 November 2018
Contact: Peter Y A Ryan, peter.ryan (at) uni.lu
More information: http://emea3.mrted.ly/1ztz4
ING Bank
Job PostingThe Blockchain program is also responsible for identifying and piloting the most promising use cases. To do so, we constantly scope the environment for relevant opportunities, actively engage with and educate the organization about the technology’s potential as well as researching trends within the industry. This allows us to have a comprehensive approach in our delivery of business value.
We are looking for an eager collaborator to support the management of the program. Your main tasks that you will be performing are:
•Produce software solutions based on Distributed Ledger technology;
•Research actively latest development in the cryptography and DLT space;
•Implementing improvements to existing DL technologies;
•Assess and deep dive on various ledger technologies.
Relevant stakeholders: you will be working with the DLT team, and reporting to the Chapter lead.
Your personal profile:
•Master’s degree in Computer Science.
•Curious by nature, willing to experiment.
•Ability to think from a business perspective when considering alternatives.
•Excellent team player.
•Intrinsic motivation for blockchain (i.e. some prior knowledge).
•Fast learner
•Knowledge of Kotlin / Solidity / Go is a plus
Must be proficient in at least one of the skills below (and motivation and basic-knowledge in the other).
You will be fully part of an enthusiastic multi-disciplinary team that has a willingness to help you grow and learn as much as possible throughout your position.
Closing date for applications: 30 March 2019
Contact: Stanley Waccary
Business manager Innovation
Stanley.Waccary (at) ing.com
More information: https://www.ing.jobs/Nederland/Vacatures/Vacature/DLT-Development-Engineer-Cryptography-1.htm?org=searchresult
Cambridge Quantum Computing Limited
Job PostingKey Requirements
A degree in Mathematics or other quantitative disciplines such as Physics or Computer Science with a strong mathematical component.
A Passion for approaching complex problems with the goal to design and deliver novel practical solutions.
Experience writingelegant, functional and well tested code in languagessuch as python, matlab, C/C++ etc.
The ability to understand technical and advanced material and translate this into code.
DesirableRequirements
Interest in the Blockchain and its protocols, Several Existing Cryptocurrencies, FinTech, mining, “proof of work” concept etc.
Some elementary knowledge of quantum computing (what is it, why in theory it can compromise cyber security in several aspects of our day to day life)
All candidates must be eligible to live and work in the UK.
The successful candidate will be compensated with a competitive salary and will join the company’s attractive share option and bonus scheme.
Closing date for applications: 1 December 2018
DarkMatter - Abu Dhabi
Job PostingAs a Senior Cryptography Engineer - Cloud Engineer, you will:
- Design, implement and deploy cryptographic algorithms tailored for a cloud environment.
- Conduct research and development in differential privacy, secret sharing, multi-party secure computation and fully homomorphic encryption.
- Perform security assessments of crypto-primitives, cryptosystems and cloud security solutions at the theoretical and implementation level.
- Work closely with the other teams in the organization to design and deploy safe cloud-based solutions .
- Be involved in the integration of developed cryptosystems within DarkMatter products.
- Enjoy all the cultural, educational and travel opportunities Abu Dhabi offers
To bring your dream to life, you’ll need:
- PhD degree in Cryptography, Applied Cryptography, Information Theory and Mathematics or Computer Science.
- Extensive experience developing in various programming languages.
- A desire to innovate in the UAE
Closing date for applications: 17 February 2019
Contact: Mehdi Messaoudi
Sourcing Specialist - Recruitment
More information: https://careers.darkmatter.ae/jobs/senior-cryptography-engineer-cloud-engineer-abu-dhabi-united-arab-emirates
Technische Universität Darmstadt, Germany
Job PostingThe ENCRYPTO group is member of the Center for Research in Security and Privacy (CRISP) and the profile area Cybersecurity at TU Darmstadt (CYSEC). We develop methods and tools for protecting privacy in applications. See https://encrypto.de for details.
The candidate will do cutting-edge research on techniques for protecting privacy in applications such as cryptographic protocols that scale to real-world problem sizes, including secure multi-party computation and private information retrieval.
The candidate is expected to have a completed Master (or equivalent) degree with excellent grades in IT security, computer science, electrical engineering, mathematics, or a closely related field. Solid knowledge in IT security, applied cryptography, efficient algorithms, circuit design, and excellent programming skills are required. Additional knowledge in cryptographic protocols, parallel computing, compiler construction, programming languages, and software engineering is a plus.
Review of applications starts immediately until the position is filled.
Please consult the webpage given below for more details and how to apply.
Closing date for applications:
Contact: Prof. Thomas Schneider
More information: https://encrypto.de/jobs/CRISP2
02 November 2018
Daniel J. Bernstein, Tanja Lange, Chloe Martindale, Lorenz Panny
ePrint ReportYuzhao Cui, Qiong Huang, Jianye Huang, Hongbo Li , Guomin Yang
ePrint Report01 November 2018
Liliya Akhmetzyanova, Cas Cremers, Luke Garratt, Stanislav V. Smyshlyaev
ePrint ReportAhmad Al Badawi, Jin Chao, Jie Lin, Chan Fook Mun, Sim Jun Jie, Benjamin Hong Meng Tan, Xiao Nan, Khin Mi Mi Aung, Vijay Ramaseshan Chandrasekhar
ePrint ReportPan Dongxue, Li Hongda, Ni Peifang
ePrint ReportTanping Zhou, Ningbo Li, Xiaoyuan Yang, Yiliang Han, Wenchao Liu
ePrint ReportJothi Rangasamy, Lakshmi Kuppusamy
ePrint ReportDavid Bernhard, Véronique Cortier, Pierrick Gaudry, Mathieu Turuani, Bogdan Warinschi
ePrint Report Individual verifiability: a voter is convinced that a ballot confirmed as coming from the voter contains his intended vote Ballot verifiability: all ballots that are confirmed contain correct votes Eligibility uniqueness: there are no two distinct entries in the list of confirmed ballots which correspond to the same voter Confirmed as intended: if a confirmed ballot is on the bulletin board for some voter, then that ballot records that voters voting intention Universal verifiability: any party can verify that the votes on this board were tallied correctly
The analyses employ the currently well-established approach used within the scientific community. Specifically, they rely on mathematical abstractions for the adversary and for the system under analysis, as well as mathematical formulations of the properties to be established.
Mathematical proofs are then used to establish that (under certain assumptions) the security properties hold. We provide two types of analysis (which differ in the level of abstraction at which they operate). Part I contains a pen-and-paper computational/cryptographic analysis. Part II describes an automated symbolic analysis.
Broadly speaking, both the symbolic and the computational analyses conclude that CH-Vote satisfy the desired security properties under several assumptions. The assumptions include, for example, computational assumptions (which mathematical problems are assumed to be hard), trust assumptions (which parties, if any, are assumed to behave honestly and what are parties assume to know before they interact with the system).
Besides the concrete mathematical statements the analyses led to a number of recommendations which aim to improve the security. Part III concludes with a number of recommendations which reflect assumptions made in the analyses and weaknesses that were identified. The recommendations also sum up the results of a (light) code review of the code available via GitHub 1 commit 9b0e7c9fcd409, from April 2017.
Giuseppe Persiano, Kevin Yeo
ePrint ReportWe consider $(\epsilon, \delta)$-Differentially Private RAM, a weakening of ORAM that only protects individual operations and seems better suited for use in data analysis on outsourced databases. As differentially private RAM has weaker security than ORAM, there is hope that we can bypass the $\Omega(\log(n/c))$ bandwidth lower bounds for ORAM by Larsen and Nielsen [CRYPTO 18] for storing an array of $n$ entries and a client with $c$ bits of memory. We answer in the negative and present an $\Omega(\log(n/c))$ bandwidth lower bound for privacy budgets of $\epsilon = O(1)$ and $\delta \le 1/3$.
The information transfer technique used for ORAM lower bounds does not seem adaptable for use with the weaker security guarantees of differential privacy. Instead, we prove our lower bounds by adapting the chronogram technique to our setting. To our knowledge, this is the first work that uses the chronogram technique for lower bounds on privacy-preserving storage primitives.