International Association for Cryptologic Research

International Association
for Cryptologic Research

The International Association for Cryptologic Research (IACR) is a non-profit scientific organization whose purpose is to further research in cryptology and related fields. Cryptology is the science and practice of designing computation and communication systems which are secure in the presence of adversaries.

Updates on the COVID-19 situation are shown on the IACR news channel.



Photo: John Wiley User:Jw4nvc - Santa Barbara, California [CC BY 3.0], via Wikimedia Commons

Crypto 2021
15 - 19 August 2021
Santa Barbara, USA

Photo: Qaalvin [CC BY 3.0], via Wikimedia Commons

Eurocrypt 2021
17 - 21 October 2021
Zagreb, Croatia
Asiacrypt 2021
5 - 9 December 2021
Singapore, Singapore

Photo: GraphicCycle [CC BY-SA 4.0], via Wikimedia Commons

Cryptographic Hardware and Embedded Systems
14 - 18 September 2020
Virtual Event, Anywhere on Earth

Photo: Pixabay

Public Key Cryptography
10 - 13 May 2021
Edinburgh, UK

Photo:, CC0 Public Domain

Theory of Cryptography Conference
8 - 11 November 2021
Raleigh, United States

Photo: by Kenny Paterson

Real World Crypto Symposium
10 - 12 January 2022
Amsterdam, The Netherlands

Photo: John-Mark Smith

Fast Software Encryption 2022
20 - 25 March 2022
Athens, Greece
More events...


Announcement icon

Announcement: PKC 2021 Conference May 10-13, 2021
Registration is free with IACR membership.

Job Posting icon

Job Posting: Cryptography Researcher — Zero Knowledge Virtual Machines
Ethereum Foundation (remote)

ePrint Report icon

ePrint Report: Masked Triples: Amortizing Multiplication Triples across Conditionals
David Heath, Vladimir Kolesnikov, Stanislav Peceny

ePrint Report icon

ePrint Report: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults
Justin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha

ePrint Report icon

ePrint Report: Autonomous Secure Remote Attestation even when all Used and to be Used Digital Keys Leak
Marten van Dijk, Deniz Gurevin, Chenglu Jin, Omer Khan, Phuong Ha Nguyen

ePrint Report icon

ePrint Report: Subfield Algorithms for Ideal- and Module-SVP Based on the Decomposition Group
Christian Porter, Andrew Mendelsohn, Cong Ling

More news...

Recent Awards

PKC Test-Of-Time Award, PKC 2003, An Identity-Based Signature from Gap Diffie-Hellman Groups

PKC Test-Of-Time Award, PKC 2004, An Efficient Signature Scheme from Bilinear Pairings and Its Applications

PKC Test-Of-Time Award, PKC 2005, A Verifiable Random Function with Short Proofs and Keys

IACR Test of Time Award, CRYPTO 2006, New Proofs for NMAC and HMAC: Security Without Collision-Resistance

IACR Test of Time Award, EUROCRYPT 2006, A Provable-Security Treatment of the Key-Wrap Problem

More awards...