IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
19 October 2020
Enis Ulqinaku, Hala Assal, AbdelRahman Abdou, Sonia Chiasson, Srdjan Čapkun
ePrint ReportLauren De Meyer, Elke De Mulder, Michael Tunstall
ePrint ReportGustavo Banegas, Daniel J. Bernstein, Iggy van Hoof, Tanja Lange
ePrint ReportFor an elliptic curve over a field of 2^n elements, this paper reduces the number of qubits to 7n+[log_2(n)]+9. At the same time this paper reduces the number of Toffoli gates to 48n^3+8n^(log_2(3)+1)+352n^2 log_2(n)+512n^2+O(n^(log_2(3))) with double-and-add scalar multiplication, and a logarithmic factor smaller with fixed-window scalar multiplication. The number of CNOT gates is also O(n^3). Exact gate counts are given for various sizes of elliptic curves currently used for cryptography.
Arne Deprez, Elena Andreeva, Jose Maria Bermudo Mera, Angshuman Karmakar, Antoon Purnal
ePrint ReportBarbara Gigerl, Vedad Hadzic, Robert Primas, Stefan Mangard, Roderick Bloem
ePrint ReportIn this paper, we overcome the current situation and present the first approach for co-design and co-verification of masked software implementations on CPUs. First, we present Coco, a tool that allows us to provide security proofs at the gate-level for the execution of a masked software implementation on a concrete CPU. Using Coco , we analyze the popular 32-bit RISC-V Ibex core, identify all design aspects that violate the security of our tested masked software implementations and perform corrections, mostly in hardware. The resulting secured Ibex core has an area overhead around 10%, the runtime of software on this core is largely unaffected, and the formal verification with Coco of an, e.g., first-order masked Keccak S-box running on the secured Ibex core takes around 156 seconds. To demonstrate the effectiveness of our suggested design modifications, we perform practical leakage assessments using an FPGA evaluation board.
Lichao Wu, Guilherme Perin, Stjepan Picek
ePrint ReportThis work proposes an automated way for deep learning hyperparameter tuning that is based on Bayesian Optimization. We build a custom framework denoted as AutoSCA that supports both machine learning and side-channel metrics. Our experimental analysis shows that Bayesian optimization performs well regardless of the dataset, leakage model, or neural network type. What is more, we find a number of neural network architectures outperforming state-of-the-art attacks. Finally, we note that random search, despite being considered not particularly powerful, manages to reach top performance for a number of considered settings. We postulate this happens since the datasets are relatively easy to break, and there are many neural network architectures reaching top performance.
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
ePrint ReportOblivious Parallel RAM (OPRAM) is a natural extension of ORAM to the (more realistic) parallel setting where several processors make concurrent accesses to a shared memory. It is known that any OPRAM must incur logarithmic work overhead and for highly parallel RAMs a logarithmic depth blowup (in the balls and bins model). Despite the significant recent advances, there is still a large gap: all existing OPRAM schemes incur a poly-logarithmic overhead either in total work or in depth.
Our main result closes the aforementioned gap and provides an essentially optimal OPRAM scheme. Specifically, assuming one-way functions, we show that any Parallel RAM with memory capacity~$N$ can be obliviously simulated in space $O(N)$, incurring only $O(\log N)$ blowup in (amortized) total work as well as in depth. Our transformation supports all PRAMs in the CRCW mode and the resulting simulation is in the CRCW mode as well.
18 October 2020
Intel Corp.
Job Posting
Responsibilities include the following:
- Drive a specific strategic cryptographic initiative across Intel
- Collaborate with internal stakeholders to contribute to other strategic objectives of Intel's Cryptography team
- Influence internal security policies and standards regarding cryptography and security
- Collaborate with other team members on internal research activities
- Perform cryptanalytical reviews of algorithms, protocols and implementations
- Track relevant state-of-the-art academic cryptographic research
- Guide and mentor the develop of junior engineers in the technical leadership pipeline
Minimum work experience requirements:
10+ years experience in cryptography/cryptographic implementation and an advanced degree in cryptography or related discipline; or 15+ years experience in cryptography/cryptographic implementation
Preferred qualifications:
- Experience with industrial security engineering, preferably significant contributions to large projects
- Knowledge of computer architecture, CPU, SoC, chipsets, BIOS, Firmware, Drivers, and other compute paradigms
- Very good understanding of side-channel attacks, including architectural and physical attacks
- Familiarity with hardware design toolsets, including RTL
- Familiarity and experience with software languages (C, C++, Java, Python, Go, etc.)
- Strong track record of contributions to the crypto community (papers in well-established conferences, patents, standards)
- Familiarity with latest developments in the area of post-quantum algorithms
Contact: David Wheeler (david.m.wheeler@intel.com)
More information: https://jobs.intel.com/ShowJob/Id/2616826/Principal-Engineer-Senior-Cryptographer
Centre for Wireless Communications, University of Oulu, Finland
Job PostingClosing date for applications:
Contact: Madhusanka Liyanage (madhusanka.liyanage@oulu.fi)
More information: https://sites.google.com/view/madhusanka/home
CISPA Helmholtz Center for Information Security
Job Posting- Machine learning security and privacy
- Biomedical privacy
- Misinformation detection
- A bachelor/master degree in Computer Science, Information Security, or Mathematics
- Excellent English (knowledge of German is not required)
- Good knowledge about machine learning/data mining
- Excellent programming skills
- Full-time working contract (12-month E13-level salary, ~2,400 euros per month)
- Excellent research environment
- Strong supervision
- CV
- Transcript
We also have positions for postdocs, if you are interested, please send an email with your CV to zhang@cispa.de as well.
Closing date for applications:
Contact: Yang Zhang
10 Ph.D. positions in doctoral college for Secure and Intelligent Human-Centric Digital Technologies
TU Wien, Austria
Job PostingAs part of the SecInt Doctoral College (SecInt-DK), TU Wien is offering ten positions as university assistant (Pre-Doc) for 4 years. Expected start: 01.01.2021.
Tasks:
- Collaboration on current research projects
- Deepening scientific knowledge
- Collaboration in academic teaching
- Writing a dissertation and publications
- Participation in regular events organized by the SecInt Doctoral College
- Completion of an internship with one of our international research partners
- Presentation of research results and participation in scientific event
The Research Projects: The SecInt Doctoral college offers 10 interdisciplinary research projects from the areas of Formal Methods, Security and Privacy, and Machine Learning, that are each supervised by at least two professors from the corresponding research areas. Additional details on the individual projects can be found at https://secint.visp.wien/projects.
We offer:
- Diverse and exciting tasks, with lots of interdisciplinary collaboration
- Continuing personal and professional education and flexible working hours
- Central location with very good accessibility in a city regularly ranked first worldwide for life quality
- Possibility of an internship with one of our international research partners
- Very competitive salary
Your profile:
- Completion of a master or diploma curriculum in computer science or another related field
- Experience in Mathematical Modeling, Computational Logic, Formal Methods, Security and Privacy, Robotics and/or Machine Learning
- Very good skills in English communication and writing.
- Readiness for interdisciplinary collaboration
- Team competences, problem-solving skills and innovative ability
A predoctoral researcher at TU Wien currently receives a minimum of EUR 2.196,75/month gross, 14 times/year for 30 hours/week and EUR 2.929,00/month for 40 hours/week (about EUR 28.675/year net). Relevant working experiences may increase the monthly income.
We look forward to receiving yo
Closing date for applications:
Contact: secint@visp.wien
More information: https://jobs.tuwien.ac.at/Job/136572
UConn, Computer Science and Engineering Dept.
Job PostingSeveral PhD positions in the domains of cryptography, computer security, privacy, and blockchain-based systems are available at the University of Connecticut (UConn), Computer Science and Engineering department, led by Prof. Ghada Almashaqbeh.
The positions provide a great opportunity for students with interest in interdisciplinary projects that combine knowledge from various fields towards the design of secure systems and protocols. We target real-world timely problems and aim to provide secure and practical solutions backed by rigorous foundations and efficient implementations/thorough performance testing. We are also interested in conceptual projects that contribute in bridging the gap between theory and practice of Cryptography. For more information about our current and previous projects please check https://ghadaalmashaqbeh.github.io/research/.
For interested students, please send your CV to ghada.almashaqbeh@uconn.edu and provide any relevant information about the topics you want to work on and the skills/related background you have.
Closing date for applications:
Contact: Ghada Almashaqbeh (ghada.almashaqbeh@uconn.edu)
More information: https://ghadaalmashaqbeh.github.io/
Iowa State University
Job PostingClosing date for applications:
Contact: Berk Gulmezoglu bgulmez@iastate.edu
More information: https://www.ece.iastate.edu/bgulmez/
Lund University, Sweden
Job Posting
Additional requirements: Very good oral and written proficiency in English. Publications in top conferences in the crypto and security community.
Closing date for applications:
Contact: Thomas johansson (thomas@eit.lth.se)
More information: https://lu.varbi.com/en/what:job/jobID:357480/type:job/where:4/apply:1
16 October 2020
Bernardo David, Rafael Dowsley
ePrint ReportOsman Biçer, Alptekin Küpçü
ePrint ReportFarid Elwailly
ePrint ReportNina Bindel, Douglas Stebila, Shannon Veitch
ePrint ReportIn this work, we demonstrate improved and new attacks exploiting key reuse in several LWE-based key exchange protocols. First, we show how to greatly reduce the number of samples required to carry out Fluhrer's attack and reconstruct the secret period of a noisy square waveform, speeding up the attack on DXL key exchange by a factor of over 200. We show how to adapt this to attack a protocol of Ding, Branco, and Schmitt (DBS) designed to be secure with key reuse, breaking the claimed 128-bit security level in under a minute. We also apply our technique to a second authenticated key exchange protocol of DBS that uses an additive MQV design, although in this case our attack makes use of ephemeral key compromise powers of the eCK security model, which was not in scope of the claimed BR-model security proof. Our results show that building secure authenticated key exchange protocols directly from LWE remains a challenging and mostly open problem.
Borja Gómez
ePrint ReportMichele Ciampi, Alexandru Cojocaru, Elham Kashefi, Atul Mantri
ePrint ReportTowards the positive results, we first introduce the notion of Oblivious Quantum Function Evaluation (OQFE). An OQFE is a two-party quantum cryptographic primitive with one fully classical party (Alice) whose input is (a classical description of a) quantum unitary, $U$, and a quantum party (Bob) whose input is a quantum state, $\psi$. In particular, Alice receives the classical output corresponding to the measurement of $U (\psi)$ while Bob receives no output. At the same time, the functionality guarantees that Bob remains oblivious to Alice's input $U$, while Alice learns nothing about $\psi$ more than what can be learned from the output of the computation. We present two concrete constructions, one secure against semi-honest parties and the other secure against malicious parties. Due to the no-go result mentioned above, we consider what is arguably the best possible notion obtainable in our model with respect to malicious adversaries: one-sided simulation security. This notion protects the input of one party (the quantum Bob) in the standard simulation-based sense, and protects the privacy of the other party's input (the classical Alice). We realize our protocol relying on the assumption of quantum secure injective homomorphic trapdoor one-way functions, which in turn rely on the learning with errors problem. As a result, we put forward a first, simple and modular construction of secure one-sided quantum two-party computation and quantum oblivious transfer over classical networks.