J. Loss

发表

Round Efficient Byzantine Agreement from VDFs

Sebastian Faust, Lisa Eckey, Poulami Das, 2022, IACR Cryptol. ePrint Arch..

Round E(cid:30)cient Byzantine Agreement from VDFs

Sebastian Faust, Lisa Eckey, Poulami Das, 2022 .

Algebraic Adversaries in the Universal Composability Framework

Jonathan Katz, Manuel Barbosa, Jiayu Xu, 2021, IACR Cryptol. ePrint Arch..

On the Adaptive Security of the Threshold BLS Signature Scheme

J. Loss, Renas Bacho, 2022, IACR Cryptol. ePrint Arch..

Breaking RSA Generically is Equivalent to Factoring, with Preprocessing

Dana Dachman-Soled, Adam O'Neill, J. Loss, 2022, IACR Cryptol. ePrint Arch..

Network-Agnostic Security Comes for Free in DKG and MPC

Chen-Da Liu-Zhang, Daniels Collins, J. Loss, 2022, IACR Cryptol. ePrint Arch..

Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback

Chen-Da Liu Zhang, Julian Loss, Erica Blum, 2020, IACR Cryptol. ePrint Arch..

Robust MPC: Asynchronous Responsiveness yet Synchronous Security

Ueli Maurer, Daniel Tschudi, Chen-Da Liu Zhang, 2019, IACR Cryptol. ePrint Arch..

Asynchronous Byzantine Agreement with Subquadratic Communication

Chen-Da Liu Zhang, Jonathan Katz, Julian Loss, 2020, IACR Cryptol. ePrint Arch..

On the Security of Two-Round Multi-Signatures

Eike Kiltz, Gregory Neven, Manu Drijvers, 2019, 2019 IEEE Symposium on Security and Privacy (SP).

Gossiping for Communication-Eﬃcient Broadcast

Charalampos Papamanthou, J. Loss, Georgios Tsimos, 2021 .

Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption

Julian Loss, Eduard Hauck, J. Loss, 2017, IACR Cryptol. ePrint Arch..

A Classification of Computational Assumptions in the Algebraic Group Model

Georg Fuchsbauer, Julian Loss, Balthazar Bauer, 2020, IACR Cryptol. ePrint Arch..

The Algebraic Group Model and its Applications

Eike Kiltz, Julian Loss, Eike Kiltz, 2018, IACR Cryptol. ePrint Arch..

Optimal Clock Synchronization with Signatures

C. Lenzen, J. Loss, 2022, PODC.

A Modular Treatment of Blind Signatures from Identification Schemes

Eike Kiltz, Julian Loss, Eduard Hauck, 2019, IACR Cryptol. ePrint Arch..

PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More

Anna Lysyanskaya, L. Hanzlik, J. Loss, 2022, CRYPTO.

New techniques for the modular analysis of digital signature schemes

Julian Loss, J. Loss, 2019 .

A Formal Treatment of Deterministic Wallets

Sebastian Faust, Poulami Das, Julian Loss, 2019, IACR Cryptol. ePrint Arch..

MPC with Synchronous Security and Asynchronous Responsiveness

Ueli Maurer, Chen-Da Liu-Zhang, Daniel Tschudi, 2020, ASIACRYPT.

On the Security of Time-Locked Puzzles and Timed Commitments

Jiayu Xu, Jonathan Katz, Julian Loss, 2020, IACR Cryptol. ePrint Arch..

A New Way to Achieve Round-Efficient Byzantine Agreement

Matthias Fitzi, Chen-Da Liu-Zhang, Julian Loss, 2021, IACR Cryptol. ePrint Arch..

The Abe-Okamoto Partially Blind Signature Scheme Revisited

J. Kastner, J. Loss, Jiayu Xu, 2022, IACR Cryptol. ePrint Arch..

BIP32-Compatible Threshold Wallets

Sebastian Faust, S. Riahi, Poulami Das, 2023, IACR Cryptol. ePrint Arch..

The Exact Security of BIP32 Wallets

Sebastian Faust, Julian Loss, Andreas Erwig, 2021, IACR Cryptol. ePrint Arch..

Abraxas: Throughput-Efficient Hybrid Asynchronous Consensus

Jonathan Katz, Kartik Nayak, J. Loss, 2023, IACR Cryptol. ePrint Arch..

Zombies and Ghosts: Optimal Byzantine Agreement in the Presence of Omission Faults

Gilad Stern, J. Loss, 2023, IACR Cryptol. ePrint Arch..

Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions

Jonathan Katz, Julian Loss, Erica Blum, 2021, ASIACRYPT.

Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds

Tal Moran, Julian Loss, T. Moran, 2018, IACR Cryptol. ePrint Arch..

Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus

Sri Aravinda Krishnan Thyagarajan, Kartik Nayak, Charalampos Papamanthou, 2022, IACR Cryptol. ePrint Arch..

Synchronous Consensus with Optimal Asynchronous Fallback Guarantees

Jonathan Katz, Julian Loss, Erica Blum, 2019, IACR Cryptol. ePrint Arch..

Efficient Adaptively-Secure Byzantine Agreement for Long Messages

Kartik Nayak, Chen-Da Liu-Zhang, Amey Bhangale, 2021, IACR Cryptol. ePrint Arch..

Nearly Quadratic Broadcast Without Trusted Setup Under Dishonest Majority

Charalampos Papamanthou, Julian Loss, Georgios Tsimos, 2020, IACR Cryptol. ePrint Arch..

Lattice-Based Blind Signatures, Revisited

Eike Kiltz, Ngoc Khanh Nguyen, Julian Loss, 2020, IACR Cryptol. ePrint Arch..

Concurrent Security of Anonymous Credentials Light, Revisited

J. Kastner, J. Loss, Omar Renawi, 2023, IACR Cryptol. ePrint Arch..

PI-Cut-Choo! Parallel Instance Cut and Choose for Practical Blind Signatures

Lucjan Hanzlik, Julian Loss, Benedikt Wagner, 2022, IACR Cryptol. ePrint Arch..

Boosting the Security of Blind Signature Schemes

Jonathan Katz, Julian Loss, Jonathan Katz, 2021, IACR Cryptol. ePrint Arch..

On Pairing-Free Blind Signature Schemes in the Algebraic Group Model

Jiayu Xu, Julian Loss, Julia Kastner, 2020, IACR Cryptol. ePrint Arch..

Efficient Algorithms for Broadcast and Consensus Based on Proofs of Work

Sebastian Faust, Lisa Eckey, Julian Loss, 2017, IACR Cryptol. ePrint Arch..

On the Security of Time-Lock Puzzles and Timed Commitments

Jonathan Katz, J. Loss, Jiayu Xu, 2020, TCC.

(Nondeterministic) Hardness vs. Non-Malleability

Dana Dachman-Soled, J. Loss, Marshall Ball, 2022, Electron. Colloquium Comput. Complex..

Sublinear-round Broadcast without trusted setup against dishonest majority

Charalampos Papamanthou, J. Loss, A. Alexandru, 2022, IACR Cryptol. ePrint Arch..

Gossiping for Communication-Efficient Broadcast

Charalampos Papamanthou, J. Loss, Georgios Tsimos, 2022, CRYPTO.