default search action
Daniele Friolo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j3]Gennaro Avitabile, Vincenzo Botta, Daniele Friolo, Daniele Venturi, Ivan Visconti:
Compact Proofs of Partial Knowledge for Overlapping CNF Formulae. J. Cryptol. 38(1): 7 (2025) - 2024
- [j2]Danilo Francati, Daniele Friolo, Giulio Malavolta, Daniele Venturi:
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors. J. Cryptol. 37(3): 24 (2024) - [c11]Gennaro Avitabile, Vincenzo Botta, Daniele Friolo, Ivan Visconti:
Data Redaction in Smart-Contract-Enabled Permissioned Blockchains. DLT 2024 - [i14]Michele Kryston, Edoardo Marangone, Claudio Di Ciccio, Daniele Friolo, Eugenio Nerio Nemmi, Mattia Samory, Michele Spina, Daniele Venturi, Ingo Weber:
MARTSIA: Safeguarding Data Confidentiality in Blockchain-Driven Process Execution. CoRR abs/2407.10684 (2024) - [i13]Daniele Friolo, Geoffrey Goodell, Dann Toliver, Hazem Danny Al-Nakib:
Private Electronic Payments with Self-Custody and Zero-Knowledge Verified Reissuance. CoRR abs/2409.01958 (2024) - [i12]Gennaro Avitabile, Vincenzo Botta, Daniele Friolo, Daniele Venturi, Ivan Visconti:
Compact Proofs of Partial Knowledge for Overlapping CNF Formulae. IACR Cryptol. ePrint Arch. 2024: 1488 (2024) - [i11]Alberto Maria Mongardini, Daniele Friolo, Giuseppe Ateniese:
Stealth and Beyond: Attribute-Driven Accountability in Bitcoin Transactions. IACR Cryptol. ePrint Arch. 2024: 1789 (2024) - 2023
- [c10]Daniele Friolo
, Matteo Salvino, Daniele Venturi:
On the Complete Non-malleability of the Fujisaki-Okamoto Transform. ACNS 2023: 307-335 - [c9]Danilo Francati
Registered (Inner-Product) Functional Encryption. ASIACRYPT (5) 2023: 98-133 - [c8]Edoardo Marangone, Claudio Di Ciccio
MARTSIA: Enabling Data Confidentiality for Blockchain-Based Process Execution. EDOC 2023: 58-76 - [c7]Danilo Francati
Multi-key and Multi-input Predicate Encryption from Learning with Errors. EUROCRYPT (3) 2023: 573-604 - [i10]Edoardo Marangone, Claudio Di Ciccio, Daniele Friolo
MARTSIA: Enabling Data Confidentiality for Blockchain-based Process Execution. CoRR abs/2303.17977 (2023) - [i9]Edoardo Marangone, Claudio Di Ciccio, Daniele Friolo
Enabling Data Confidentiality with Public Blockchains. CoRR abs/2308.03791 (2023) - [i8]Danilo Francati, Daniele Friolo, Monosij Maitra, Giulio Malavolta, Ahmadreza Rahimi, Daniele Venturi:
Registered (Inner-Product) Functional Encryption. IACR Cryptol. ePrint Arch. 2023: 395 (2023) - 2022
- [j1]Daniele Friolo
Cryptographic and Financial Fairness. IEEE Trans. Inf. Forensics Secur. 17: 3391-3406 (2022) - [c6]Gennaro Avitabile
Efficient Proofs of Knowledge for Threshold Relations. ESORICS (3) 2022: 42-62 - [i7]Daniele Friolo
Cryptographic and Financial Fairness. CoRR abs/2207.10780 (2022) - [i6]Gennaro Avitabile, Vincenzo Botta, Daniele Friolo, Ivan Visconti:
Efficient Proofs of Knowledge for Threshold Relations. IACR Cryptol. ePrint Arch. 2022: 746 (2022) - [i5]Danilo Francati, Daniele Friolo, Giulio Malavolta, Daniele Venturi:
Multi-key and Multi-input Predicate Encryption from Learning with Errors. IACR Cryptol. ePrint Arch. 2022: 806 (2022) - [i4]Daniele Friolo, Matteo Salvino, Daniele Venturi:
On the Complete Non-Malleability of the Fujisaki-Okamoto Transform. IACR Cryptol. ePrint Arch. 2022: 1654 (2022) - 2021
- [b1]Daniele Friolo:
New perspectives in multi-party computation: low round complexity from new assumptions, financial fairness and public verifiability. Sapienza University of Rome, Italy, 2021 - [c5]Gennaro Avitabile
Terrorist Attacks for Fake Exposure Notifications in Contact Tracing Systems. ACNS (1) 2021: 220-247 - [c4]Vincenzo Botta
Shielded Computations in Smart Contracts Overcoming Forks. Financial Cryptography (1) 2021: 73-92 - 2020
- [c3]Chan Nam Ngo, Daniele Friolo
Vision: What If They All Die? Crypto Requirements For Key People. EuroS&P Workshops 2020: 178-183 - [i3]Gennaro Avitabile, Daniele Friolo, Ivan Visconti:
TEnK-U: Terrorist Attacks for Fake Exposure Notifications in Contact Tracing Systems. IACR Cryptol. ePrint Arch. 2020: 1150 (2020)
2010 – 2019
- 2019
- [c2]Daniele Friolo
Affordable Security or Big Guy vs Small Guy - Does the Depth of Your Pockets Impact Your Protocols? Security Protocols Workshop 2019: 135-147 - [c1]Daniele Friolo
A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement. TCC (1) 2019: 111-130 - [i2]Vincenzo Botta, Daniele Friolo, Daniele Venturi, Ivan Visconti:
The Rush Dilemma: Attacking and Repairing Smart Contracts on Forking Blockchains. IACR Cryptol. ePrint Arch. 2019: 891 (2019) - 2018
- [i1]Daniele Friolo, Daniel Masny, Daniele Venturi:
Secure Multi-Party Computation from Strongly Uniform Key Agreement. IACR Cryptol. ePrint Arch. 2018: 473 (2018)
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-11 20:41 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: