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 get this service 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).

05:21 [Pub][ePrint] Solving a $6120$-bit DLP on a Desktop Computer, by Faruk G\\\"olo\\u{g}lu and Robert Granger and Gary McGuire and Jens Zumbr\\\"agel

  In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. In particular, we demonstrate a practical DLP break in the finite field of $2^{6120}$ elements, using just a single core-month.

05:21 [Pub][ePrint] Maliciously Circuit-private FHE, by Rafail Ostrovsky and Anat Paskin-Cherniavsky and Beni Paskin-Cherniavsky

  We present a framework for constructing compact FHE (fully homomorphic encryption) which is circuit-private in the malicious setting. That is, even if both maliciously formed public key and cyphertext are used, encrypted outputs only reveal the evaluation of the circuit on some well-formed input $x^*$.

Previous literature on FHE only considered semi-honset circuit privacy.

Circuit-private FHE schemes have direct applications to computing on encrypted data. In that setting, one party (a receiver) holding an input $x$ wishes to learn the evaluation of a circuit $C$ held by another party (a sender). The goal is to make receiver\'s work sublinear (and ideally independent) of $\\mathcal{C}$, using a 2-message protocol.

Maliciously circuit-private FHE immediately gives rise to such a protocol which is secure against malicious receivers.

05:21 [Pub][ePrint] Lattice-Based Group Signatures with Logarithmic Signature Size, by Fabien Laguillaumie and Adeline Langlois and Benoit Libert and Damien Stehle

  Group signatures are cryptographic primitives where users can

anonymously sign messages in the name of a population they belong

to. Gordon et al. (Asiacrypt 2010) suggested the first realization of group signatures based on lattice assumptions in the random oracle model. A significant drawback of their scheme is its linear signature size in the cardinality $N$ of the group. A recent extension proposed by Camenisch et al. (SCN 2012) suffers from the same overhead. In this paper, we describe the first lattice-based group signature schemes where the signature and public key sizes are essentially logarithmic in $N$ (for any fixed security level). Our basic construction only satisfies a relaxed definition of anonymity (just like the Gordon et al. system) but readily extends into a fully anonymous group signature (i.e., that resists adversaries equipped with a signature opening

oracle). We prove the security of our schemes in the random oracle

model under the SIS and LWE assumptions.

05:21 [Pub][ePrint] Bypassing Passkey Authentication in Bluetooth Low Energy, by Tomas Rosa

  This memo describes new cryptographic weakness of the passkey-based pairing of Bluetooth Low Energy (also known as Bluetooth Smart). The vulnerability discussed here extends the set of possible attacking scenarios that were already elaborated before by Mike Ryan at Shmoocon 2013.

Instead of the passive sniffing attack on pairing secrets, we show how an active fraudulent Responder can gracefully bypass passkey authentication, despite it being possibly based on even one-time generated PIN.

05:21 [Pub][ePrint] MinimaLT: Minimal-latency Networking Through Better Security, by W. Michael Petullo and Xu Zhang and Jon A. Solworth and Daniel J. Bernstein and Tanja Lange

  Minimal Latency Tunneling (MinimaLT) is a new network protocol that provides ubiquitous encryption for maximal confidentiality, including protecting packet headers. MinimaLT provides server and user authentication, extensive Denial-of-Service protections, and IP mobility while approaching perfect forward secrecy. We describe the protocol, demonstrate its performance relative to TLS and unencrypted TCP/IP, and analyze its protections, including its resilience against DoS attacks [56]. By exploiting the properties of its cryptographic protections, MinimaLT is able to eliminate three-way handshakes and thus create connections faster than unencrypted TCP/IP.

06:59 [Job][New] Professor / Associate Professor in Information Security, Queensland University of Technology, Brisbane, Australia


The Queensland University of Technology (QUT) in Brisbane, Australia, is seeking to appoint a Professor or Associate Professor to play a senior leadership role in integrating research and teaching in the Information Security Discipline. The successful applicant will have an outstanding research publication and external funding track record. Women, Indigenous Australians and Torres Strait Islander people are strongly encouraged to apply.

The Information Security discipline undertakes research and teaching in the areas of cryptography, network security and digital forensics. The discipline group continues the 25 year pedigree of information security research excellence at QUT, and has a strong track record of success in competitive research funding, high quality publications and international collaboration.

03:02 [Job][New] Ph.D. scholarship in cryptographic protocols, Norwegian University of Science and Technology (NTNU), Trondheim, Norway

  A PhD research fellowship position within cryptographic protocols is available at the Department of Telematics (ITEM) at the Faculty of Information Technology, Mathematics and Electrical Engineering (IME), Norwegian University of Science and Technology (NTNU). The project will investigate the security of protocols for authenticated key exchange using reductionist security models. The focus will be on key exchange protocols currently in use in real world networks.

21:02 [Job][New] Junior Professorship (W1), Carl von Ossietzky University Oldenburg

  The Institute for Mathematics at the Carl von Ossietzky University invites applications for a Junior Professorship in Explicit Methods in Number Theory and Algebra (W 1) starting as soon as possible. The initial appointment will be for a duration of three years. Provided that her or his performance is thereafter evaluated positively, employment may be extended for three more years.

Appointment requirements are governed by Paragraph 30 Section 2 of the Lower Saxony Education Act (Niedersächsisches Hochschulgesetz). The successful applicant will be required to conduct research and teach in the area named above.

The job advertisement is intended for outstanding researchers in the area of Algebra/Number Theory. Knowledge in the following areas is desired: Algebraic Number Theory/Geometry, Computeralgebra, or applications thereof, e.g. Cryptography or Coding Theory.

Interested candidates should submit the usual (CV, publication record, research statement, teaching statement) to the Carl von Ossietzky University Oldenburg, Prof. Dr. Astrid Fischer, Institute for Mathematics, 26111 Oldenburg, Germany. A copy of the application in pdf-format should be sent to traute.lampke (at) Deadline for applications is 27-May-2013 (post-marked).

20:56 [Event][New] CryptoBG*2013: CryptoBG*2013 Summmer School - Cryptology and Cyber Resilience

  Submission: 10 June 2013
Notification: 30 June 2013
From July 14 to July 21
Location: Oryahovitsa, Bulgaria
More Information:

20:55 [Event][New] TrustED 2013: Third International Workshop on Trustworthy Embedded Devices

  Submission: 22 July 2013
Notification: 20 August 2013
From November 4 to November 4
Location: Berlin, Germany
More Information:

04:10 [Event][New] WESS 2013: 8th Workshop on Embedded Systems Security

  Submission: 1 July 2013
Notification: 12 August 2013
From October 3 to October 3
Location: Montreal, Canada
More Information: