default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Pintore
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Roberto La Scala
, Federico Pintore, Sharwan K. Tiwari, Andrea Visconti:
A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium. Finite Fields Their Appl. 98: 102452 (2024)- [j5]Wissam Ghantous, Federico Pintore, Mattia Veroni:
Efficiency of SIDH-based signatures (yes, SIDH). J. Math. Cryptol. 18(1) (2024) - [i13]Michele Battagliola, Riccardo Longo, Federico Pintore, Edoardo Signorini, Giovanni Tognolini:
Security of Fixed-Weight Repetitions of Special-Sound Multi-Round Proofs. IACR Cryptol. ePrint Arch. 2024: 884 (2024) - 2023
- [j4]Ward Beullens, Samuel Dobson, Shuichi Katsumata, Yi-Fu Lai, Federico Pintore:
Group signatures and more from isogenies and lattices: generic, simple, and efficient. Des. Codes Cryptogr. 91(6): 2141-2200 (2023) - [i12]Roberto La Scala, Federico Pintore, Sharwan K. Tiwari, Andrea Visconti:
A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium. CoRR abs/2304.07820 (2023) - [i11]Wissam Ghantous, Federico Pintore, Mattia Veroni:
Efficiency of SIDH-based signatures (yes, SIDH). IACR Cryptol. ePrint Arch. 2023: 433 (2023) - [i10]Roberto La Scala, Federico Pintore, Sharwan K. Tiwari, Andrea Visconti:
A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium. IACR Cryptol. ePrint Arch. 2023: 542 (2023) - 2022
- [j3]Alessandro Budroni, Federico Pintore:
Efficient hash maps to ${\mathbb {G}}_2$ on BLS curves. Appl. Algebra Eng. Commun. Comput. 33(3): 261-281 (2022) - [c5]Ward Beullens, Samuel Dobson, Shuichi Katsumata, Yi-Fu Lai, Federico Pintore:
Group Signatures and More from Isogenies and Lattices: Generic, Simple, and Efficient. EUROCRYPT (2) 2022: 95-126 - [i9]Marzio Mula, Nadir Murru, Federico Pintore:
Random sampling of supersingular elliptic curves. IACR Cryptol. ePrint Arch. 2022: 528 (2022) - 2021
- [i8]Wissam Ghantous, Federico Pintore, Mattia Veroni:
Collisions in Supersingular Isogeny Graphs and the SIDH-based Identification Protocol. IACR Cryptol. ePrint Arch. 2021: 1051 (2021) - [i7]Ward Beullens, Samuel Dobson, Shuichi Katsumata, Yi-Fu Lai, Federico Pintore:
Group Signatures and More from Isogenies and Lattices: Generic, Simple, and Efficient. IACR Cryptol. ePrint Arch. 2021: 1366 (2021) - 2020
- [c4]Shuichi Katsumata, Kris Kwiatkowski, Federico Pintore, Thomas Prest:
Scalable Ciphertext Compression Techniques for Post-quantum KEMs and Their Applications. ASIACRYPT (1) 2020: 289-320 - [c3]Ward Beullens, Shuichi Katsumata, Federico Pintore:
Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices. ASIACRYPT (2) 2020: 464-492 - [c2]Ali El Kaafarani, Shuichi Katsumata, Federico Pintore:
Lossy CSI-FiSh: Efficient Signature Scheme with Tight Reduction to Decisional CSIDH-512. Public Key Cryptography (2) 2020: 157-186 - [e3]Andrea Bracciali, Jeremy Clark, Federico Pintore, Peter B. Rønne, Massimiliano Sala:
Financial Cryptography and Data Security - FC 2019 International Workshops, VOTING and WTSC, St. Kitts, St. Kitts and Nevis, February 18-22, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11599, Springer 2020, ISBN 978-3-030-43724-4 [contents] - [i6]Ali El Kaafarani, Shuichi Katsumata, Federico Pintore:
Lossy CSI-FiSh: Efficient Signature Scheme with Tight Reduction to Decisional CSIDH-512. IACR Cryptol. ePrint Arch. 2020: 124 (2020) - [i5]Ward Beullens, Shuichi Katsumata, Federico Pintore:
Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices. IACR Cryptol. ePrint Arch. 2020: 646 (2020) - [i4]Shuichi Katsumata, Kris Kwiatkowski, Federico Pintore, Thomas Prest:
Scalable Ciphertext Compression Techniques for Post-Quantum KEMs and their Applications. IACR Cryptol. ePrint Arch. 2020: 1107 (2020)
2010 – 2019
- 2019
- [e2]Aviv Zohar, Ittay Eyal, Vanessa Teague, Jeremy Clark, Andrea Bracciali, Federico Pintore, Massimiliano Sala:
Financial Cryptography and Data Security - FC 2018 International Workshops, BITCOIN, VOTING, and WTSC, Nieuwpoort, Curaçao, March 2, 2018, Revised Selected Papers. Lecture Notes in Computer Science 10958, Springer 2019, ISBN 978-3-662-58819-2 [contents] - 2018
- [j2]Alessandro Budroni, Federico Pintore:
Hashing to G2 on BLS pairing-friendly curves. ACM Commun. Comput. Algebra 52(3): 63-66 (2018) - [j1]Alessandro Amadori, Federico Pintore, Massimiliano Sala:
On the discrete logarithm problem for prime-field elliptic curves. Finite Fields Their Appl. 51: 168-182 (2018) - 2017
- [c1]Riccardo Longo, Federico Pintore, Giancarlo Rinaldo, Massimiliano Sala:
On the security of the blockchain BIX protocol and certificates. CyCon 2017: 1-16 - [e1]Michael Brenner, Kurt Rohloff, Joseph Bonneau, Andrew Miller, Peter Y. A. Ryan, Vanessa Teague, Andrea Bracciali, Massimiliano Sala, Federico Pintore, Markus Jakobsson:
Financial Cryptography and Data Security - FC 2017 International Workshops, WAHC, BITCOIN, VOTING, WTSC, and TA, Sliema, Malta, April 7, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10323, Springer 2017, ISBN 978-3-319-70277-3 [contents] - [i3]Alessandro Budroni, Federico Pintore:
Efficient hash maps to 픾2 on BLS curves. IACR Cryptol. ePrint Arch. 2017: 419 (2017) - [i2]Alessandro Amadori, Federico Pintore, Massimiliano Sala:
On the discrete logarithm problem for prime-field elliptic curves. IACR Cryptol. ePrint Arch. 2017: 609 (2017) - 2016
- [i1]Riccardo Longo, Federico Pintore, Giancarlo Rinaldo, Massimiliano Sala:
On the security of the Blockchain Bix Protocol and Certificates. CoRR abs/1607.08401 (2016) - 2015
- [b1]Federico Pintore:
Binary quadratic forms, elliptic curves and Schoof's algorithm. University of Trento, Italy, 2015
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-10-07 21:22 CEST 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:
