default search action
Alessio Meneghetti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Andrea Flamini, Riccardo Longo, Alessio Meneghetti:
Multidimensional Byzantine agreement in a synchronous setting. Appl. Algebra Eng. Commun. Comput. 35(2): 233-251 (2024) - [j7]Andrea Flamini
, Riccardo Longo
Cob: a leaderless protocol for parallel Byzantine agreement in incomplete networks. Distributed Parallel Databases 42(2): 179-216 (2024) - [c10]Alessio Meneghetti
History-Free Sequential Aggregation of Hash-and-Sign Signatures. CT-RSA 2024: 187-223 - [c9]Michele Battagliola
Cutting the GRASS: Threshold GRoup Action Signature Schemes. CT-RSA 2024: 460-489 - [i31]Giulia Cavicchioni, Eleonora Guerrini, Alessio Meneghetti:
A class of locally recoverable codes over finite chain rings. CoRR abs/2401.05286 (2024) - [i30]Giuseppe D'Alconzo, Alessio Meneghetti, Edoardo Signorini:
Group Factorisation for Smaller Signatures from Cryptographic Group Actions. IACR Cryptol. ePrint Arch. 2024: 1510 (2024) - [i29]Giulia Cavicchioni, Alessio Meneghetti, Giovanni Tognolini:
Information Set Decoding for Ring-Linear Code. IACR Cryptol. ePrint Arch. 2024: 1679 (2024) - [i28]Giuseppe D'Alconzo, Andrea Flamini, Alessio Meneghetti, Edoardo Signorini:
A Framework for Group Action-Based Multi-Signatures and Applications to LESS, MEDS, and ALTEQ. IACR Cryptol. ePrint Arch. 2024: 1691 (2024) - 2023
- [i27]Arianna Gringiani, Alessio Meneghetti, Edoardo Signorini, Ruggero Susella:
MAYO: Optimized Implementation with Revised Parameters for ARMv7-M. IACR Cryptol. ePrint Arch. 2023: 540 (2023) - [i26]Alessio Meneghetti, Edoardo Signorini:
History-Free Sequential Aggregate Signatures from Generic Trapdoor Functions. IACR Cryptol. ePrint Arch. 2023: 784 (2023) - [i25]Michele Battagliola, Giacomo Borin
Cutting the GRASS: Threshold GRoup Action Signature Schemes. IACR Cryptol. ePrint Arch. 2023: 859 (2023) - 2022
- [j6]Riccardo Longo
Adaptable Cryptographic Primitives in Blockchains via Smart Contracts. Cryptogr. 6(3): 32 (2022) - [j5]Alessio Meneghetti
A formula on the weight distribution of linear codes with applications to AMDS codes. Finite Fields Their Appl. 77: 101933 (2022) - [c8]Michele Battagliola, Alessio Galli, Riccardo Longo, Alessio Meneghetti:
A Provably-Unforgeable Threshold Schnorr Signature With an Offline Recovery Party. DLT@ITASEC 2022: 60-76 - [c7]Andrea Flamini, Riccardo Longo, Alessio Meneghetti:
Cob: A Consensus Layer Enabling Sustainable Sharding-Based Consensus Protocols. DLT@ITASEC 2022: 77-93 - [i24]Andrea Flamini, Riccardo Longo, Alessio Meneghetti:
Cob: a consensus layer enabling sustainable sharding-based consensus protocols. CoRR abs/2205.06384 (2022) - [i23]Giulia Cavicchioni, Alessio Meneghetti:
The weight distribution of codes over finite chain rings. CoRR abs/2210.15436 (2022) - [i22]Christian Picozzi, Alessio Meneghetti, Giovanni Tognolini:
A Post-Quantum Digital Signature Scheme from QC-LDPC Codes. IACR Cryptol. ePrint Arch. 2022: 1477 (2022) - [i21]Michele Battagliola, Riccardo Longo, Alessio Meneghetti:
Extensible Decentralized Secret Sharing and Application to Schnorr Signatures. IACR Cryptol. ePrint Arch. 2022: 1551 (2022) - 2021
- [i20]Andrea Flamini, Riccardo Longo, Alessio Meneghetti:
Multidimensional Byzantine Agreement in a Synchronous Setting. CoRR abs/2105.13487 (2021) - [i19]Nicola Di Chiano, Riccardo Longo, Alessio Meneghetti, Giordano Santilli:
A survey on NIST PQ signatures. CoRR abs/2107.11082 (2021) - [i18]Andrea Flamini, Riccardo Longo, Alessio Meneghetti:
Cob: a Multidimensional Byzantine Agreement Protocol for Asynchronous Incomplete Networks. CoRR abs/2108.11157 (2021) - [i17]Alessio Meneghetti, Alex Pellegrini, Massimiliano Sala:
On explicit reductions between two purely algebraic problems: MQ and MLD. CoRR abs/2109.05806 (2021) - [i16]Giuseppe D'Alconzo, Alessio Meneghetti, Paolo Piasenti:
Security issues of CFS-like digital signature algorithms. CoRR abs/2112.00429 (2021) - 2020
- [c6]Alessio Meneghetti, Massimiliano Sala, Daniele Taufer:
A Note on an ECDLP-based PoW Model. DLT@ITASEC 2020 - [i15]Alessio Meneghetti, Marco Pellegrini, Massimiliano Sala:
A formula on the weight distribution of linear codes with applications to AMDS codes. CoRR abs/2003.14063 (2020) - [i14]Alessio Meneghetti, Wrya K. Kadir
Characterisation of the parameters of maximum weight spectrum codes according to their spread. CoRR abs/2006.04567 (2020) - [i13]Michele Battagliola, Riccardo Longo, Alessio Meneghetti, Massimiliano Sala:
Threshold ECDSA with an Offline Recovery Party. CoRR abs/2007.04036 (2020) - [i12]Michele Battagliola, Riccardo Longo, Alessio Meneghetti, Massimiliano Sala:
A Provably-Unforgeable Threshold EdDSA with an Offline Recovery Party. CoRR abs/2009.01631 (2020) - [i11]Riccardo Longo, Alessio Meneghetti, Massimiliano Sala:
Threshold Multi-Signature with an Offline Recovery Party. IACR Cryptol. ePrint Arch. 2020: 23 (2020)
2010 – 2019
- 2019
- [j4]Riccardo Aragona
Type-preserving matrices and security of block ciphers. Adv. Math. Commun. 13(2): 235-251 (2019) - [j3]Hesong Xu
A SPAD-based random number generator pixel based on the arrival time of photons. Integr. 64: 22-28 (2019) - [c5]Nicola Massari, Leonardo Gasparini
A Compact TDC-based Quantum Random Number Generator. ICECS 2019: 815-818 - [c4]Alessio Meneghetti, Armanda Ottaviano Quintavalle, Massimiliano Sala, Alessandro Tomasi:
Two-tier blockchain timestamped notarization with incremental security. DLT@ITASEC 2019: 32-42 - [i10]Alessio Meneghetti, Armanda Ottaviano Quintavalle, Massimiliano Sala, Alessandro Tomasi:
Two-tier blockchain timestamped notarization with incremental security. CoRR abs/1902.03136 (2019) - [i9]Alessio Meneghetti, Tommaso Parise, Massimiliano Sala, Daniele Taufer:
A survey on efficient parallelization of blockchain-based smart contracts. CoRR abs/1904.00731 (2019) - [i8]Alessio Meneghetti, Massimiliano Sala, Daniele Taufer:
A new ECDLP-based PoW model. CoRR abs/1911.11287 (2019) - 2018
- [i7]Riccardo Aragona, Alessio Meneghetti:
Type-Preserving Matrices and Security of Block Ciphers. CoRR abs/1803.00965 (2018) - [i6]Alessio Meneghetti:
On linear codes and distinct weights. CoRR abs/1804.04373 (2018) - [i5]Alessandro Tomasi
Binary linear code weight distribution estimation by random bit stream compression. CoRR abs/1806.02099 (2018) - 2017
- [b1]Alessio Meneghetti:
Optimal Codes and Entropy Extractors. University of Trento, Italy, 2017 - [j2]Alessandro Tomasi
Code generator matrices as RNG conditioners. Finite Fields Their Appl. 47: 46-63 (2017) - [c3]Nicola Massari, Leonardo Gasparini
A SPAD-Based Random Number Generator Pixel Based on the Arrival Time of Photons. NGCAS 2017: 213-216 - 2016
- [j1]Eleonora Guerrini, Alessio Meneghetti
On Optimal Nonlinear Systematic Codes. IEEE Trans. Inf. Theory 62(6): 3103-3112 (2016) - [c2]Nicola Massari
16.3 A 16×16 pixels SPAD-based 128-Mb/s quantum random number generator with -74dB light rejection ratio and -6.7ppm/°C bias sensitivity on temperature. ISSCC 2016: 292-293 - 2015
- [i4]Alessandro Tomasi, Alessio Meneghetti, Massimiliano Sala:
Code generator matrices as entropy extractors. CoRR abs/1502.01494 (2015) - [i3]Emanuele Bellini, Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala:
On the Griesmer bound for nonlinear codes. CoRR abs/1502.07379 (2015) - [i2]Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala:
On optimal nonlinear systematic codes. CoRR abs/1506.03227 (2015) - 2014
- [i1]Alessio Meneghetti, Massimiliano Sala, Alessandro Tomasi:
A weight-distribution bound for entropy extractors using linear binary codes. CoRR abs/1405.2820 (2014) - 2013
- [c1]Alessio Meneghetti
Improved image copyright protection scheme exploiting visual cryptography in wavelet domain. Image Processing: Algorithms and Systems 2013: 865504
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-11-11 21:27 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: