Julian Loss

Orcid: 0000-0002-7979-3810

Affiliations:
  • CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
  • Ruhr University Bochum, Germany (PhD 2019)


According to our database1, Julian Loss authored at least 77 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal Consensus in the Presence of Overlapping Faults and Total Omission.
IACR Cryptol. ePrint Arch., 2024

Blind Multisignatures for Anonymous Tokens with Decentralized Issuance.
IACR Cryptol. ePrint Arch., 2024

Kleptographic Attacks against Implicit Rejection.
IACR Cryptol. ePrint Arch., 2024

A Concrete Analysis of Wagner's k-List Algorithm over ℤ<sub>p</sub>.
IACR Cryptol. ePrint Arch., 2024

Early Stopping Byzantine Agreement in (1+ε)· f Rounds.
IACR Cryptol. ePrint Arch., 2024

Ipotane: Achieving the Best of All Worlds in Asynchronous BFT.
IACR Cryptol. ePrint Arch., 2024

Towards Optimal Parallel Broadcast under a Dishonest Majority.
IACR Cryptol. ePrint Arch., 2024

HARTS: High-Threshold, Adaptively Secure, and Robust Threshold Schnorr Signatures.
IACR Cryptol. ePrint Arch., 2024

Glacius: Threshold Schnorr Signatures from DDH with Full Adaptive Security.
IACR Cryptol. ePrint Arch., 2024

Sublinear-Round Broadcast without Trusted Setup.
IACR Cryptol. ePrint Arch., 2024

Consensus in the Presence of Overlapping Faults and Total Omission.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Breaking RSA Generically Is Equivalent to Factoring, with Preprocessing.
Proceedings of the 5th Conference on Information-Theoretic Cryptography, 2024

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, 2024

2023
Zombies and Ghosts: Optimal Byzantine Agreement in the Presence of Omission Faults.
IACR Cryptol. ePrint Arch., 2023

Early Stopping for Any Number of Corruptions.
IACR Cryptol. ePrint Arch., 2023

Concurrent Security of Anonymous Credentials Light, Revisited.
IACR Cryptol. ePrint Arch., 2023

BIP32-Compatible Threshold Wallets.
IACR Cryptol. ePrint Arch., 2023

A Holistic Security Analysis of Monero Transactions.
IACR Cryptol. ePrint Arch., 2023

Efficient Agreement Over Byzantine Gossip.
IACR Cryptol. ePrint Arch., 2023

Abraxas: Throughput-Efficient Hybrid Asynchronous Consensus.
IACR Cryptol. ePrint Arch., 2023

Analyzing the Real-World Security of the Algorand Blockchain.
IACR Cryptol. ePrint Arch., 2023

Twinkle: Threshold Signatures from DDH with Full Adaptive Security.
IACR Cryptol. ePrint Arch., 2023

GRandLine: Adaptively Secure DKG and Randomness Beacon with (Almost) Quadratic Communication Complexity.
IACR Cryptol. ePrint Arch., 2023

Adaptively Secure (Aggregatable) PVSS and Application to Distributed Randomness Beacons.
IACR Cryptol. ePrint Arch., 2023

Network-Agnostic Security Comes (Almost) for Free in DKG and MPC.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Analyzing the Real-World Security of the Algorand Blockchain.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum.
Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, 2023

2022
On the (in)Security of ROS.
J. Cryptol., 2022

PI-Cut-Choo! Parallel Instance Cut and Choose for Practical Blind Signatures.
IACR Cryptol. ePrint Arch., 2022

Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus.
IACR Cryptol. ePrint Arch., 2022

The Abe-Okamoto Partially Blind Signature Scheme Revisited.
IACR Cryptol. ePrint Arch., 2022

Rai-Choo! Evolving Blind Signatures to the Next Level.
IACR Cryptol. ePrint Arch., 2022

Token meets Wallet: Formalizing Privacy and Revocation for FIDO2.
IACR Cryptol. ePrint Arch., 2022

Sweep-UC: Swapping Coins Privately.
IACR Cryptol. ePrint Arch., 2022

A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum.
IACR Cryptol. ePrint Arch., 2022

Breaking RSA Generically is Equivalent to Factoring, with Preprocessing.
IACR Cryptol. ePrint Arch., 2022

On the Adaptive Security of the Threshold BLS Signature Scheme.
IACR Cryptol. ePrint Arch., 2022

Network-Agnostic Security Comes for Free in DKG and MPC.
IACR Cryptol. ePrint Arch., 2022

Sublinear-round Broadcast without trusted setup against dishonest majority.
IACR Cryptol. ePrint Arch., 2022

State Machine Replication under Changing Network Conditions.
IACR Cryptol. ePrint Arch., 2022

Round Efficient Byzantine Agreement from VDFs.
IACR Cryptol. ePrint Arch., 2022

(Nondeterministic) Hardness vs. Non-Malleability.
Electron. Colloquium Comput. Complex., 2022

Optimal Clock Synchronization with Signatures.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

On Pairing-Free Blind Signature Schemes in the Algebraic Group Model.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Gossiping for Communication-Efficient Broadcast.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Boosting the Security of Blind Signature Schemes.
IACR Cryptol. ePrint Arch., 2021

A New Way to Achieve Round-Efficient Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2021

How Byzantine is a Send Corruption?
IACR Cryptol. ePrint Arch., 2021

The Exact Security of BIP32 Wallets.
IACR Cryptol. ePrint Arch., 2021

Efficient Adaptively-Secure Byzantine Agreement for Long Messages.
IACR Cryptol. ePrint Arch., 2021

Algebraic Adversaries in the Universal Composability Framework.
IACR Cryptol. ePrint Arch., 2021

Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Nearly Quadratic Broadcast Without Trusted Setup Under Dishonest Majority.
IACR Cryptol. ePrint Arch., 2020

On the Security of Time-Locked Puzzles and Timed Commitments.
IACR Cryptol. ePrint Arch., 2020

On Pairing-Free Blind Signature Schemes in the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2020

Lattice-Based Blind Signatures, Revisited.
IACR Cryptol. ePrint Arch., 2020

Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback.
IACR Cryptol. ePrint Arch., 2020

Asynchronous Byzantine Agreement with Subquadratic Communication.
IACR Cryptol. ePrint Arch., 2020

Network-Agnostic State Machine Replication.
IACR Cryptol. ePrint Arch., 2020

A Classification of Computational Assumptions in the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2020

On the Security of Time-Lock Puzzles and Timed Commitments.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

MPC with Synchronous Security and Asynchronous Responsiveness.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
New techniques for the modular analysis of digital signature schemes.
PhD thesis, 2019

Robust MPC: Asynchronous Responsiveness yet Synchronous Security.
IACR Cryptol. ePrint Arch., 2019

A Modular Treatment of Blind Signatures from Identification Schemes.
IACR Cryptol. ePrint Arch., 2019

A Formal Treatment of Deterministic Wallets.
IACR Cryptol. ePrint Arch., 2019

Synchronous Consensus with Optimal Asynchronous Fallback Guarantees.
IACR Cryptol. ePrint Arch., 2019

On the Security of Two-Round Multi-Signatures.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

2018
Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds.
IACR Cryptol. ePrint Arch., 2018

Strong Separations Between Broadcast and Authenticated Channels.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

The Algebraic Group Model and its Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Tightly-Secure Signatures from Five-Move Identification Protocols.
IACR Cryptol. ePrint Arch., 2017

The Algebraic Group Model and its Applications.
IACR Cryptol. ePrint Arch., 2017

Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption.
IACR Cryptol. ePrint Arch., 2017

Efficient Algorithms for Broadcast and Consensus Based on Proofs of Work.
IACR Cryptol. ePrint Arch., 2017

2016
Hierarchy of three-party consistency specifications.
Proceedings of the IEEE International Symposium on Information Theory, 2016


  Loading...