default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Zanolini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Orestis Alpos, Christian Cachin, Björn Tackmann, Luca Zanolini:
Asymmetric distributed trust. Distributed Comput. 37(3): 247-277 (2024)- [c12]Sarisht Wadhwa
, Luca Zanolini, Aditya Asgaonkar, Francesco D'Amato, Chengrui Fang, Fan Zhang, Kartik Nayak:
Data Independent Order Policy Enforcement: Limitations and Solutions. CCS 2024: 378-392 - [c11]Francesco D'Amato, Luca Zanolini:
Recent Latest Message Driven GHOST: Balancing Dynamic Availability With Asynchrony Resilience. CSF 2024: 127-142 - [c10]Francesco D'Amato, Giuliano Losa, Luca Zanolini:
Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols. PODC 2024: 247-256 - [i15]Aditya Asgaonkar, Francesco D'Amato, Roberto Saltini, Luca Zanolini, Chenyi Zhang:
A Confirmation Rule for the Ethereum Consensus Protocol. CoRR abs/2405.00549 (2024) - [i14]Francesco D'Amato, Roberto Saltini, Thanh-Hai Tran, Luca Zanolini:
3-Slot-Finality Protocol for Ethereum. CoRR abs/2411.00558 (2024) - 2023
- [c9]Francesco D'Amato, Luca Zanolini:
A Simple Single Slot Finality Protocol for Ethereum. ESORICS Workshops (1) 2023: 376-393 - [i13]Francesco D'Amato, Luca Zanolini:
Recent Latest Message Driven GHOST: Balancing Dynamic Availability With Asynchrony Resilience. CoRR abs/2302.11326 (2023) - [i12]Francesco D'Amato, Luca Zanolini:
A Simple Single Slot Finality Protocol For Ethereum. CoRR abs/2302.12745 (2023) - [i11]Francesco D'Amato, Giuliano Losa, Luca Zanolini:
Improving Asynchrony Resilience in Dynamically Available Total-Order Broadcast Protocols. CoRR abs/2309.05347 (2023) - [i10]Francesco D'Amato, Luca Zanolini:
Streamlining Sleepy Consensus: Total-Order Broadcast with Single-Vote Decisions in the Sleepy Model. CoRR abs/2310.11331 (2023) - [i9]Francesco D'Amato, Luca Zanolini:
Recent Latest Message Driven GHOST: Balancing Dynamic Availability With Asynchrony Resilience. IACR Cryptol. ePrint Arch. 2023: 279 (2023) - [i8]Francesco D'Amato, Luca Zanolini:
A Simple Single Slot Finality Protocol For Ethereum. IACR Cryptol. ePrint Arch. 2023: 280 (2023) - [i7]Sarisht Wadhwa, Luca Zanolini, Francesco D'Amato, Aditya Asgaonkar, Fan Zhang, Kartik Nayak:
Breaking the Chains of Rationality: Understanding the Limitations to and Obtaining Order Policy Enforcement. IACR Cryptol. ePrint Arch. 2023: 868 (2023) - 2022
- [c8]Christian Cachin, Jovana Micic, Nathalie Steinhauer, Luca Zanolini:
Quick Order Fairness. Financial Cryptography 2022: 316-333 - [c7]Christian Cachin, Giuliano Losa, Luca Zanolini:
Quorum Systems in Permissionless Networks. OPODIS 2022: 17:1-17:22 - [c6]Sarah Azouvi, Christian Cachin, Duc V. Le, Marko Vukolic, Luca Zanolini:
Modeling Resources in Permissionless Longest-Chain Total-Order Broadcast. OPODIS 2022: 19:1-19:23 - [i6]Christian Cachin, Giuliano Losa, Luca Zanolini:
Quorum Systems in Permissionless Network. CoRR abs/2211.05630 (2022) - [i5]Sarah Azouvi, Christian Cachin, Duc V. Le, Marko Vukolic, Luca Zanolini:
Modeling Resources in Permissionless Longest-chain Total-order Broadcast. CoRR abs/2211.12050 (2022) - 2021
- [c5]Christian Cachin, Luca Zanolini:
Asymmetric Asynchronous Byzantine Consensus. DPM/CBT@ESORICS 2021: 192-207 - [c4]Orestis Alpos, Christian Cachin, Giorgia Azzurra Marson, Luca Zanolini:
On the Synchronization Power of Token Smart Contracts. ICDCS 2021: 640-651 - [c3]Orestis Alpos, Christian Cachin, Luca Zanolini:
How to Trust Strangers: Composition of Byzantine Quorum Systems. SRDS 2021: 120-131 - [c2]Orestis Alpos, Christian Cachin, Luca Zanolini:
Brief Announcement: How to Trust Strangers - Composition of Byzantine Quorum Systems. DISC 2021: 44:1-44:4 - [c1]Christian Cachin, Luca Zanolini:
Brief Announcement: Revisiting Signature-Free Asynchronous Byzantine Consensus. DISC 2021: 51:1-51:4 - [i4]Orestis Alpos, Christian Cachin, Giorgia Azzurra Marson, Luca Zanolini:
On the Synchronization Power of Token Smart Contracts. CoRR abs/2101.05543 (2021) - [i3]Orestis Alpos, Christian Cachin, Luca Zanolini:
How to Trust Strangers: Composition of Byzantine Quorum Systems. CoRR abs/2107.11331 (2021) - 2020
- [i2]Alex Pellegrini, Luca Zanolini:
An Algebraic Model For Quorum Systems. CoRR abs/2005.08536 (2020) - [i1]Christian Cachin, Luca Zanolini:
Asymmetric Byzantine Consensus. CoRR abs/2005.08795 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
