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.
vacancy for a full-time assistant professorship (Universitair Docent
UD in Dutch).
Research in the group covers a range of topics including correctess
and security of software, smartcards and RFID, design and analysis of
security protocols, applied crypto, privacy and anonimity, quantum
logic and computing. Members of the group are also active in the
broader societal issues surrounding security & privacy, and regulary
carry out commercial contract research to apply and inspire high
quality academic research.
The group runs a joint Master programme in Computer Security in
collaboration with the universities of Twente and Eindhoven, named the
Kerckhoffs Institute (www.kerckhoffs-institute.org). In Nijmegen the
Institute for Computing and Information Sciences runs Bachelor and
Master courses in Computer Science (Informatica) and Information
For this position we are looking for the best candidate in the broader
field of security, who can be a good addition to the group and has
good synergy with ongoing research in the group, who is a team player,
and who can teach computer security to a broad range of students.
Applicants must hold a 2.1 Honours Degree (or equivalent) in Electrical and Electronic Engineering/Computer Science/Mathematics or a related discipline and hold, or be about to obtain, a PhD in a relevant subject.
Further information and the application process are available at the University’s job vacancies website (see link below under Research Fellow, Ref: 12/102270)
203 B. T. ROAD, KOLKATA - 7OO 108
The R. C. Bose Centre for Cryptology and Security at Indian Statistical Institute is looking for suitable candidates from Indian nationals in the following academic positions.
Lecturers are not part of the regular faculty cadre in the institute.
Appointment at this level may be made as Lecturer-cum-Post Doctoral Fellow on contractual basis to enable bright young researchers with a Ph.D. degree to teach and earn experience in a premier institution.
Appointment of lecturers will be purely on temporary basis for a maximum period of 3 (three) years.
Assistant, Associate and Full Professors:
These are permanent positions. One should have a Ph.D. with first class or equivalent in the appropriate branch in the preceeding degrees with a very good academic record throughout and at least three, six and ten years (respectively) of industrial/research/teaching experience, excluding however, the experience gained while pursuing Ph.D.
The gross emolument in this position is approximately INR 80,000/-,
1,05,000/-, 1,20,000/- (respectively) per month at this point of time and it is expected to increase at a rate of 6% in each year.
This advertisement is primarily for candidates with strong background in the area of cryptology and data security. However, candidates with
background in computer science, mathematics, or statistics with interest in the area of cryptology and data security are also encouraged to apply.
Suitable relaxations may be granted for outstanding and reserved
(SC, ST, OBC, PH) candidates.
Interested candidates may send the resume by email to coec (at) isical.ac.in attached as a PDF file or by post to \\\"The Director, Indian Statistical Institute, 203 B T Road, Kolkata 700 108\\\". Documents, such as pre
In this paper, we present the first large-scale security analysis of ASIC implementations of the five most popular intrinsic electronic PUF types, including arbiter, ring oscillator, SRAM, flip-flop and latch PUFs. Our analysis is based on PUF data obtained at different operating conditions from $96$ ASICs housing multiple PUF instances, which have been manufactured in TSMC 65nm CMOS technology. In this context, we present an evaluation methodology and quantify the robustness and unpredictability properties of PUFs. Since all PUFs have been implemented in the same ASIC and analyzed with the same evaluation methodology, our results allow for the first time a fair comparison of their properties.
a new cryptographic signature primitive with some form of anonymity, and use the term domain-specific pseudonymous signatures. We then analyze the restricted identication solutions in terms of the formal
This paper gives the first formal exploration of plaintext awareness in the identity-based setting and, as initial work, proceeds in the random oracle model. The focus is laid mainly on identity-based key encapsulation mechanisms (IB-KEMs), for which the paper presents the first definitions of plaintext awareness, highlights the role of PA in proof strategies of INDCCA security, and explores relationships between PA and other security properties.
On the practical side, our work offers the first, highly efficient, general approach for building IB-KEMs that are simultaneously plaintext-aware and INDCCA-secure. Our construction is inspired by the Fujisaki-Okamoto (FO) transform, but demands weaker and more natural properties of its building blocks. This result comes from a new look at the notion of gamma-uniformity that was inherent in the original FO transform. We show that for IB-KEMs (and PK-KEMs) this assumption can be replaced with a weaker computational notion, which is in fact implied by one-wayness. Finally, we give the first concrete IB-KEM scheme that is PA and INDCCA-secure by applying our construction to a popular IB-KEM and optimizing it for better performance.
As part of our proof, we formulate a game-based definition of encryption security allowing adaptive corruptions of keys and certain forms of adaptive key-dependent plaintext attack, along with other common forms of CCA2 attack. We prove that (with assumptions similar to above,) security under this game is implied by IND-CCA2 security. This also characterizes a provably benign form of cyclic encryption which can be achieved under standard notions of encryption security, which may be of independent interest.
I am really attached to the IACR and know its important role in promoting cryptography research. I've participated to several IACR PCs and will serve as co-GC of FSE'13. I will work on maintaining the high standards of IACR events and ensure the concerns of all cryptography sub-communities are considered.
Statement: The IACR is my home research community, and I'd like to give back. My priorities are: (1) High quality research and its effective dissemination, (2) mentoring, (3) dialogue with related research communities, industry, standards and funding agencies.
I have served the IACR since 1983 as Secretary, Treasurer, President, and Director. During that time we created conferences, workshops, literature, and community. Our present challenges include balance and tolerance in our evolving community. I know where we have been; I know where we are going. Please vote for me.
As an IACR member for more than a decade, I seek the opportunity to serve the community as a director. If elected, I'd like to help improve existing services provided by IACR, offer new services such as the organization of schools in cryptology, and promote worldwide dissemination of cryptologic research.
In gratitude for my decade in this vibrant community, my stewardship would, inter alia, promulgate open scholarly dissemination, facilitate balanced global outreach and participation, and explore mutually beneficial cross-community partnerships -- progressing carefully, always honoring the continuity of traditions that define us. Best decisions are consensual through meeting of the minds.
detection (CED) is used to protect AES against DFA. However, we emphasize that conventional CED assumes a uniform distribution of faults, which is not a valid assumption in the context of DFA. In contrast, we show practical examples which highlight that an attacker
can inject specific and exploitable faults, thus threatening existing CED. This paper brings to the surface a new CED approach for cryptography, aimed at providing provable security by detecting all possible DFA-exploitable faults, which is a small subset of the entire fault space. We analyze the fault coverage of conventional CED against DFA-exploitable faults, and we find that the fault coverage of most of these techniques are significantly lower than
the one they claimed. We stress that for security, it is imperative that CED should provide 100% fault coverage for DFA-exploitable faults. We further propose an invariance-based CED which provides 100% provable security against all known DFA of AES.