International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) You can also receive updates via:

To receive your credentials via mail again, please click here.

You can also access the full news archive.

Further sources to find out about changes are CryptoDB, ePrint RSS, ePrint Web, Event calender (iCal).

09:17 [Pub][ePrint] A Simplified Combinatorial Treatment of Constructions and Threshold Gaps of Ramp Schemes, by Maura B. Paterson and Douglas R. Stinson

  We give easy proofs of some recent results concerning threshold gaps in ramp schemes. We then give a simplified and unified treatment of construction methods for ramp schemes using error-correcting codes. Finally, as an immediate consequence of these results, we provide a new explicit bound on the the minimum length of a code having a specified distance and dual distance.

09:17 [Pub][ePrint] A Low-Area Unified Hardware Architecture for the AES and the Cryptographic Hash Function Gr{\\o}stl, by Nuray At and Jean-Luc Beuchat and Eiji Okamoto and Ismail San and Teppei Yamazaki

  This article describes the design of an 8-bit coprocessor for the AES (encryption, decryption, and key expansion) and the cryptographic hash function Gr{\\o}stl on several Xilinx FPGAs. Our Arithmetic and Logic Unit performs a single instruction that allows for implementing AES encryption, AES decryption, AES key expansion, and Gr{\\o}stl at all levels of security. Thanks to a careful organization of AES and Gr{\\o}stl internal states in the register file, we manage to generate all read and write addresses by means of a modulo-128 counter and a modulo-256 counter. A fully autonomous implementation of Gr{\\o}stl and AES on a Virtex-6 FPGA requires 169 slices and a single 36k memory block, and achieves a competitive throughput. Assuming that the security guarantees of Gr{\\o}stl are at least as good as the ones of the other SHA-3 finalists, our results show that Gr{\\o}stl is the best candidate for low-area cryptographic coprocessors.

09:17 [Pub][ePrint] Secret Sharing and Secure Computing from Monotone Formulae, by Ivan Bjerre Damgård and Jonas Kölker and Peter Bro Miltersen

  We present a construction of log-depth formulae for various threshold functions based on atomic threshold gates of constant size. From this, we build a new family of linear secret sharing schemes that are multiplicative, scale well as the number of players increases and allows to raise a shared value to the characteristic of the underlying field without interaction. Some of these schemes are in addition strongly multiplicative. Our formulas can also be used to construct multiparty protocols from protocols for a constant number of parties. In particular we implement black-box multiparty computation over non-Abelian groups in a way that is much simpler than previously known and we also show how to get a protocol in this setting that is efficient and actively secure against a constant fraction of corrupted parties, a long standing open problem. Finally, we show a negative result on usage of our scheme for pseudorandom secret sharing as defined by Cramer, Damgård and Ishai.

09:17 [Pub][ePrint] Unconditionally-Secure Universally Composable Password-Based Key-Exchange based on One-Time Memory Tokens, by Özgür Dagdelen and Marc Fischlin

  We continue the recent trend in cryptography to study protocol design

in presence of tamper-proof hardware tokens. We present a very efficient

protocol for password-based authenticated key exchange based on the weak model of one-time memory tokens, recently introduced by Goldwasser et al. (Crypto~2008). Our protocol only requires four moves, very basic operations, and the sender to send $\\ell$ tokens in the first step for passwords of length $\\ell$. At the same time we achieve information-theoretic security in Canetti\'s universal composition framework (FOCS~2001) against adaptive adversaries (assuming reliable erasure), even if the tokens are not guaranteed to be transferred in an authenticated way, i.e., even if the adversary can read or substitute transmitted tokens (as opposed to many previous efforts).

06:59 [Event][New] DIMACS Workshop on Information-Theoretic Network Security

  Submission: 12 November 2012
From November 12 to November 14
Location: Piscataway, USA
More Information:

06:59 [Event][New] 3rd Bar-Ilan Winter School on Crypto: Bilinear Pairings in Cryptography

  From February 4 to February 7
Location: Tel-Aviv area, Israel
More Information:

06:58 [Job][New] two PhD positions, University of Luxembourg

  ****2 Ph.D. Positions in Computer Security (Ref: SNT-PhD-STAST-0512)****

The University of Luxembourg has two open Ph.D. positions at its

Interdisciplinary Centre for Security, Reliability and Trust (SnT)

( We are seeking Ph.D. candidates to

participate in the activities of the SaToSS

( and of the ApSIA (

research groups.

Project description:


The main objective of the Ph.D. project is to develop a formal

framework supporting modeling and analysis of socio-technical

components of information systems. We aim to develop strategies and

tools to detect and prevent attacks involving human, physical and

digital elements. One of the goals is to extend current methodology

for security protocol analysis, by taking human behavior and

properties of physical objects into account. This goal includes a

necessity of defining appropriate adversary models and identifying the

security properties relevant in a socio-technical context.

Applicant\'s profile:


* MSc in Computer Science or Mathematics

* A proven interest in security

* Strong background in formal methods or logics

* Good written and oral English skills

Start date: As soon as possible

06:57 [Job][New] Tenure track Assistant Professor, Digital Security, Radboud University Nijmegen

  The Digital Security group at the Radboud University Nijmegen has a

vacancy for a full-time assistant professorship (Universitair Docent

UD in Dutch).

General information

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 ( In Nijmegen the

Institute for Computing and Information Sciences runs Bachelor and

Master courses in Computer Science (Informatica) and Information

Science (Informatiekunde).

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.

00:17 [Pub][JoC] Enhancements of Trapdoor Permutations


Abstract  We take a closer look at several enhancements of the notion of trapdoor permutations. Specifically, we consider the notions of enhanced trapdoor permutation (Goldreich, Foundation of Cryptography: Basic Applications, 2004) and doubly enhanced trapdoor permutation (Goldreich, Computational Complexity: A Conceptual Perspective, 2011) as well as intermediate notions (Rothblum, A Taxonomy of Enhanced Trapdoor Permutations, 2010). These enhancements arose in the study of Oblivious Transfer and NIZK, but they address natural concerns that may arise also in other applications of trapdoor permutations. We clarify why these enhancements are needed in such applications, and show that they actually suffice for these needs.

  • Content Type Journal Article
  • Pages 1-29
  • DOI 10.1007/s00145-012-9131-8
  • Authors

    • Oded Goldreich, Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel
    • Ron D. Rothblum, Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel

    • Journal Journal of Cryptology
    • Online ISSN 1432-1378
    • Print ISSN 0933-2790

From: Wed, 12 Sep 2012 16:02:54 GMT

21:47 [Election] Nomination now open

  2012 Election

The 2012 election is being held to fill three of nine IACR Director positions. The election will again be run electronically and further information will be available on the IACR website.

Nominations Are Now Open

Nominations are due by September 25, 2012.

A nomination form is available at

Election of Directors

The three directors whose terms are expiring are

  • Thomas Berson
  • David Naccache
  • Serge Vaudenay

Election Committee

  • Josh Benaloh (Chair)
  • David Pointcheval (Returning Officer)
  • Greg Rose

16:48 [Event][New] MCCCC26: 26th Midwest Conference on Combinatorics, Cryptography and Computing

  Submission: 12 September 2012
From October 11 to October 13
Location: Cedar City, Utah, USA
More Information: