Cryptographic Foundation for Secure and Scalable Distributed Systems

ERC (European Research Council)HORIZON-ERCID: 101116713
EC Contribution
€14,162
Consortium Size
2 orgs
Start Year
2023
Summary

Many of today’s criticaMany of today’s critical infrastructures such as power grids or cellular networks are distributed systems which arecomprised of autonomous nodes connected over a network. To avoid single points of failure, a central goal indistributed systems is to implement such systems in a fault-tolerant manner. Fault-tolerant systems remain secure andavailable even if some minority of nodes crash or spread incorrect information. To improve robustness and scalability,cutting-edge systems frequently rely on cryptography. In spite of its benefits, careless use of cryptography can incurperformance penalties or lead to vulnerabilities. Both of these aspects significantly complicate its use in practice. Asa result, many real-world systems use cryptography sparingly and therefore lack both robustness and scalability. Toimprove this unsatisfying state of affairs, the objectives of CRYPTOSYSTEMS are as follows:• New Formal Models. Established formal models from cryptography and distributed systems pursue independentsecurity goals and therefore lack compatibility. CRYPTOSYSTEMS will develop new, more appropriateformal models for analyzing the security of cryptographic distributed systems.• Efficient and Robust Distributed Algorithms. The use of cryptography is currently underexplored indistributed systems. CRYPTOSYSTEMS will present exciting new applications of cryptography that will leadto the development of more robust and scalable distributed systems.• Cryptography for Distributed Algorithms. Cryptography is seldom developed with distributed algorithms asits primary use-case in mind. This results in inefficient or unwieldy cryptography which hampers the efficiencyof distributed algorithms. To counteract this, CRYPTOSYSTEMS will develop cutting-edge cryptography suchas compact signatures and communication efficient distributed randomness generation routines. Importantly,these tools will be specifically geared toward use in distributed algorithms.

Consortium (2)

Project Results (15)

Source: CORDIS, the EU research results database.

Publications (15)
Adaptively Secure Three-Round Threshold Schnorr Signatures from DDH
Lecture Notes in Computer Science, Advances in Cryptology – CRYPTO 2025· 2025DOI
Renas Bacho, Sourav Das, Julian Loss, Ling Ren
Glacius: Threshold Schnorr Signatures from DDH with Full Adaptive Security
Lecture Notes in Computer Science, Advances in Cryptology – EUROCRYPT 2025· 2025DOI
Renas Bacho, Sourav Das, Julian Loss, Ling Ren
Leader Election with Poly-Logarithmic Communication Per Party
Lecture Notes in Computer Science, Advances in Cryptology – CRYPTO 2025· 2025DOI
Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak, Sravya Yandamuri
Nearly Optimal Parallel Broadcast in the Plain Public Key Model
· 2025DOI
Ran Gelles, Christoph Lenzen, Julian Loss, Sravya Yandamuri
Sublinear-Round Broadcast without Trusted Setup
· 2025DOI
Andreea B. Alexandru, Julian Loss, Charalampos Papamanthou, Giorgos Tsimos, Benedikt Wagner
A Holistic Security Analysis of Monero Transactions
Lecture Notes in Computer Science, Advances in Cryptology – EUROCRYPT 2024· 2024DOI
Cas Cremers, Julian Loss, Benedikt Wagner
Blind Multisignatures for Anonymous Tokens with Decentralized Issuance
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security· 2024DOI
Ioanna Karantaidou, Omar Renawi, Foteini Baldimtsi, Nikolaos Kamarinakis, Jonathan Katz, Julian Loss
Breaking RSA Generically Is Equivalent to Factoring, with Preprocessing.
· 2024DOI
Dachman-Soled, Dana; Loss, Julian; O'Neill, Adam
Consensus in the Presence of Overlapping Faults and Total Omission
Theory of Cryptography Conference (TCC)· 2024DOI
Julian Loss, Kecheng Shi,Gilad Stern
Early Stopping for Any Number of Corruptions
Lecture Notes in Computer Science, Advances in Cryptology – EUROCRYPT 2024· 2024DOI
Julian Loss, Jesper Buus Nielsen
Efficient Agreement Over Byzantine Gossip
Lecture Notes in Computer Science, Financial Cryptography and Data Security· 2024DOI
Ran Cohen, Julian Loss, Tal Moran
GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication Complexity
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security· 2024DOI
Renas Bacho, Christoph Lenzen, Julian Loss, Simon Ochsenreither, Dimitrios Papachristoudis
HARTS: High-Threshold, Adaptively Secure, and Robust Threshold Schnorr Signatures
Lecture Notes in Computer Science, Advances in Cryptology – ASIACRYPT 2024· 2024DOI
Renas Bacho, Julian Loss, Gilad Stern, Benedikt Wagner
Twinkle: Threshold Signatures from DDH with Full Adaptive Security
Lecture Notes in Computer Science, Advances in Cryptology – EUROCRYPT 2024· 2024DOI
Renas Bacho, Julian Loss, Stefano Tessaro, Benedikt Wagner, Chenzhi Zhu
Zombies and Ghosts: Optimal Byzantine Agreement in the Presence of Omission Faults
Theory of Cryptography· 2023DOI
Julian Loss & Gilad Stern