Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also receive updates via:
To receive your credentials via mail again, please click here.
You can also access the full news archive.
These positions are remunerated pro rata at salary band E13 of the German public-sector wage agreement (TV-L E13). Candidates may combine these positions with one 0.25 FTE teaching assistantship each.
The successful candidates will participate in an area of the project which uses Computer Algebra techniques and their integration with SAT solvers to break cryptographic hardware primitives based on the information obtained from fault attacks. The interdisciplinary, state-of-the-art approach requires rigorous and broad-based mathematical knowledge and an openness towards computer science methods.
Detailed job requirements are listed in the link below.
Applicants interested in the positions should provide the following information in pdf format with the application:
- Motivation letter
- List of publications, mark your top 2
This position will be filled as soon as possible, late applications will be considered.
A Bloom filter represents a set S of elements approximately, by using fewer bits than a precise representation. The price for succinctness is allowing some errors: for any x in S it should always answer \'Yes\', and for any x not in S it should answer \'Yes\' only with small probability.
In the adversarial model, we consider both efficient adversaries (that run in polynomial time) and computationally unbounded adversaries that are only bounded in the amount of queries they can make. For computationally bounded adversaries, we show that non-trivial (memory-wise) Bloom filters exist if and only if one-way functions exist. For unbounded adversaries we show that there exists a Bloom filter for sets of size n and error eps, that is secure against t queries and uses only O(n*log(1/eps) + t) bits of memory. In comparison, n*log(1/eps) is the best possible under a non-adaptive adversary.
simple expressions. Direct use of the first operation\'s expression
seems less efficient than state-of-the-art elliptic curve
cryptography. The second expression seems mainly interesting
towards an elementary exposition about elliptic curve theory.
(PUF) on FPGAs is crucial and popular for its nice properties and easy
implementation. The compensated measurement based on the ratio of
two ring oscillators\' frequencies proves to be particularly effective to extract
entropy of process variations. However from two ring oscillators
only one bit entropy is extracted and RO PUFs will occupy numerous
resource with the size of private information increasing. Motivated by this
inefficient resource usage, we propose an elegant and efficient method to
extract at least 31 bits entropy from two ring oscillators on FPGAs by
utilizing the fine control of programmable delay lines (PDL). We call this
construction Further ROPUF (FROPUF). In this paper, we present in
detail how to take advantage of the underlying random process variation
which derives from the lookup tables (LUT) of two ring oscillators,
and show that the in-depth variation can be extracted by a similar second
order difference calculation. In addition, we reveal the consistency
of the evaluation results from Xilinx FPGAs (e.g. Virtex-5, Virtex-6,
Kintex-7) and those by simulation of FROPUF. The responses of our
new construction have a nominal bit-error-rate (BER) of 1.85% at 27
and FROPUF greatly promotes the number of entropy with equivalent
reliability of the general ROPUF.