default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAgnese Gini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Agnese Gini, Pierrick Méaux
:
S0-equivalence classes, a new direction to find better weightwise perfectly balanced functions, and more. Cryptogr. Commun. 16(6): 1211-1234 (2024)- [c5]François Gérard, Agnese Gini, Pierrick Méaux:
TooLIP: How to Find New Instances of FiLIP Cipher with Smaller Key Size and New Filters. AFRICACRYPT 2024: 21-45 - [i10]Qiongxiu Li, Lixia Luo, Agnese Gini, Changlong Ji, Zhanhao Hu, Xiao Li, Chengfang Fang, Jie Shi, Xiaolin Hu:
Perfect Gradient Inversion in Federated Learning: A New Paradigm from the Hidden Subset Sum Problem. CoRR abs/2409.14260 (2024) - 2023
- [c4]Agnese Gini, Pierrick Méaux:
Weightwise Perfectly Balanced Functions and Nonlinearity. C2SI 2023: 338-359 - [c3]Agnese Gini, Pierrick Méaux:
On the Algebraic Immunity of Weightwise Perfectly Balanced Functions. LATINCRYPT 2023: 3-23 - [i9]Agnese Gini, Pierrick Méaux:
On the algebraic immunity of weightwise perfectly balanced functions. IACR Cryptol. ePrint Arch. 2023: 495 (2023) - [i8]Agnese Gini, Pierrick Méaux:
S0-equivalent classes, a new direction to find better weightwise perfectly balanced functions, and more. IACR Cryptol. ePrint Arch. 2023: 1101 (2023) - 2022
- [j2]Agnese Gini, Pierrick Méaux:
On the weightwise nonlinearity of weightwise perfectly balanced functions. Discret. Appl. Math. 322: 320-341 (2022) - [c2]Agnese Gini, Pierrick Méaux:
Weightwise Almost Perfectly Balanced Functions: Secondary Constructions for All n and Better Weightwise Nonlinearities. INDOCRYPT 2022: 492-514 - [i7]Agnese Gini, Pierrick Méaux:
On the weightwise nonlinearity of weightwise perfecty balanced functions. IACR Cryptol. ePrint Arch. 2022: 408 (2022) - [i6]Agnese Gini, Pierrick Méaux:
Weightwise almost perfectly balanced functions: secondary constructions for all n and better weightwise nonlinearities. IACR Cryptol. ePrint Arch. 2022: 1434 (2022) - [i5]Agnese Gini, Pierrick Méaux:
Weightwise perfectly balanced functions and nonlinearity. IACR Cryptol. ePrint Arch. 2022: 1777 (2022) - 2021
- [i4]Jean-Sébastien Coron, Agnese Gini:
Provably Solving the Hidden Subset Sum Problem via Statistical Learning. IACR Cryptol. ePrint Arch. 2021: 1007 (2021) - 2020
- [j1]Jean-Sébastien Coron, Agnese Gini:
Improved cryptanalysis of the AJPS Mersenne based cryptosystem. J. Math. Cryptol. 14(1): 218-223 (2020) - [c1]Jean-Sébastien Coron, Agnese Gini:
A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem. CRYPTO (2) 2020: 3-31 - [i3]Jean-Sébastien Coron, Agnese Gini:
A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem. IACR Cryptol. ePrint Arch. 2020: 461 (2020)
2010 – 2019
- 2019
- [i2]Jean-Sébastien Coron, Agnese Gini:
Improved Cryptanalysis of the AJPS Mersenne Based Cryptosystem. IACR Cryptol. ePrint Arch. 2019: 610 (2019) - [i1]Rajeev Anand Sahu, Agnese Gini, Ankan Pal:
Supersingular Isogeny-Based Designated Verifier Blind Signature. IACR Cryptol. ePrint Arch. 2019: 1498 (2019)
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 2025-01-26 23:42 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:
