IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
31 July 2020
Vienna, Austria, 11 February - 13 February 2021
Event CalendarSubmission deadline: 14 September 2020
Notification: 12 November 2020
Fabrice Benhamouda, Tancrède Lepoint, Michele Orrù, Mariana Raykova
ePrint ReportManuel Barbosa, Bernardo Ferreira, João Marques, Bernardo Portela, Nuno Preguiça
ePrint ReportIn this paper we present the first formal cryptographic treatment of CRDTs, as well as proposals for secure implementations. We start by presenting a security notion that is compatible with standard definitions in cryptography. We then describe new privacy-preserving CRDT protocols that can be used to help secure distributed cloud-backed applications, including NoSQL geo-replicated databases. Our proposals are based on standard CRDTs, such as sets and counters, augmented with cryptographic mechanisms that allow operations to be performed on encrypted data.
Our proposals are accompanied with formal security proofs and implement and integrate them in AntidoteDB, a geo-replicated NoSQL database that leverages CRDTs for its operations. Experimental evaluations based on the Danish Shared Medication Record dataset (FMK) exhibit the tradeoffs that our different proposals make and show that they are ready to be used in practical applications.
Runchao Han, Jiangshan Yu, Ren Zhang
ePrint ReportThis paper focuses on the shard allocation protocols designed for permissionless networks. We start from formally defining the shard allocation protocol, including its syntax, correctness properties, and performance metrics. Then, we apply this framework to evaluate the shard allocation subprotocols of seven state-of-the-art sharded blockchains. Our evaluation shows that none of them is fully correct or achieves satisfactory performance. We attribute these deficiencies to their redundant security assumptions and their extreme choices between two performance metrics: self-balance and operability. We further prove a fundamental trade-off between these two metrics, and prove that shard allocation should be non-memoryless in order to parametrise this trade-off. Non-memorylessness specifies that each shard allocation does not only rely on the current and the incoming system states, but also previous system states. Based on these insights, we propose WORMHOLE, a non-memoryless shard allocation protocol that minimises security assumptions and allows parametrisation between self-balance and operability. We formally prove WORMHOLEs correctness, and show that WORMHOLE outperforms existing shard allocation protocols.
Philipp Schindler, Aljosha Judmayer, Markus Hittmeir, Nicholas Stifter, Edgar Weippl
ePrint ReportDoyoung Chung, Jooyoung Lee, Seungkwang Lee, Dooho choi
ePrint ReportFei Meng
ePrint ReportJongHyeok Lee, Dong-Guk Han
ePrint Report30 July 2020
Election
Nominations are due by September 24, 2020.
Information about nomination is available at https://iacr.org/elections/2020/announcement.html.
29 July 2020
Suyash Bagad, Saravanan Vijayakumaran
ePrint ReportColin O'Flynn
ePrint ReportThe specific work appears relevant to several devices in the MPC55xx and MPC56xx series, which are automotive-focused PowerPC devices.
Mahender Kumar
ePrint ReportDavide Andreoletti, Omran Ayoub, Silvia Giordano, Massimo Tornatore, Giacomo Verticale
ePrint ReportDeepak Maram, Harjasleen Malvai, Fan Zhang, Nerla Jean-Louis, Alexander Frolov, Tyler Kell, Tyrone Lobban, Christine Moy, Ari Juels, Andrew Miller
ePrint ReportWhile decentralized identity promises to give users greater control over their private data, it burdens users with management of private keys, creating a significant risk of key loss. Existing and proposed approaches also presume the spontaneous availability of a credential-issuance ecosystem, creating a bootstrapping problem. They also omit essential functionality, like resistance to Sybil attacks and the ability to detect misbehaving or sanctioned users while preserving user privacy.
CanDID addresses these challenges by issuing credentials in a user-friendly way that draws securely and privately on data from existing, unmodified web service providers. Such legacy compatibility similarly enables CanDID users to leverage their existing online accounts for recovery of lost keys. Using a decentralized committee of nodes, CanDID provides strong confidentiality for user's keys, real-world identities, and data, yet prevents users from spawning multiple identities and allows identification (and blacklisting) of sanctioned users.
We present the CanDID architecture and its technical innovations and report on experiments demonstrating its practical performance.
Mohammad Zaheri
ePrint ReportAtul Chaturvedi Varun Shukla Manoj K.Misra
ePrint ReportKEYWORDS Data communication, Key agreement, Near ring, Twisted Conjugacy Search Problem (TCSP)
Charlotte Bonte, Ilia Iliashenko
ePrint ReportBen Marshall, G. Richard Newell, Dan Page, Markku-Juhani O. Saarinen, Claire Wolf
ePrint Report27 July 2020
University of Birmingham
Job PostingClosing date for applications:
Contact: Mark Ryan
More information: https://bham.taleo.net/careersection/external/jobdetail.ftl?job=200001T9&tz=GMT%2B01%3A00&tzname=Europe%2FLondon
ETH Zurich OR Crypto Quantique, London
Job Posting
The Project Crypto Quantique’s role is to develop a novel Key Provisioning Architecture (KPA) for the generation, distribution, and certification of cryptographic keys used by lnternet of Things (IoT) devices and cloud services. The aim is to build a quantum-driven security platform by combining the KPA with cryptographic keys generated through quantum tunnelling behaviour in semiconductor devices. The Applied Cryptography Group’s main role in the project is to lead an investigation of how to transition Crypto Quantique’s KPA to use post-quantum cryptographic algorithms in the KPA protocols. They will also assist Crypto Quantique in conducting formal security analysis of the constituent protocols currently used in the KPA, and in developing and analysing new cryptographic protocols where necessary.
How to Apply? We look forward to receiving your online application with the following documents: CV; list of scientific publications; pointers to relevant software development projects, if applicable; contact details for 3 referees.
If you would like to apply for a role at Crypto Quantique, please use this link where the CQ team look forward to reviewing your CV: https://bit.ly/2Ot5OSc
If you would like to apply for the role with ETH Zurich please apply online at: https://bit.ly/3j88Vgs
Closing date for applications:
Contact: Kenny Paterson (kenny.paterson@inf.ethz.ch) or Christian Saade (csaade@cryptoquantique.com)
More information: https://jobs.ethz.ch/job/view/3159?mw_source=ethz_aem