default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChiara Marcolla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Elena Kirshanova, Chiara Marcolla, Sergi Rovira:
Guidance for Efficient Selection of Secure Parameters for Fully Homomorphic Encryption. AFRICACRYPT 2024: 376-400- [i14]Elena Kirshanova, Chiara Marcolla, Sergi Rovira:
Guidance for Efficient Selection of Secure Parameters for Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2024: 1001 (2024) - 2023
- [c4]Johannes Mono
, Chiara Marcolla, Georg Land, Tim Güneysu, Najwa Aaraj:
Finding and Evaluating Parameters for BGV. AFRICACRYPT 2023: 370-394 - [i13]Beatrice Biasioli, Chiara Marcolla, Marco Calderini, Johannes Mono:
Improving and Automating BFV Parameters Selection: An Average-Case Approach. IACR Cryptol. ePrint Arch. 2023: 600 (2023) - [i12]Andrea Di Giusto, Chiara Marcolla:
Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings. IACR Cryptol. ePrint Arch. 2023: 783 (2023) - [i11]Najwa Aaraj, Abdelrahaman Aly, Tim Güneysu, Chiara Marcolla, Johannes Mono, Rogerio Paludo, Iván Santos-González, Mireia Scholz, Eduardo Soria-Vazquez, Victor Sucasas, Ajith Suresh:
FANNG-MPC: Framework for Artificial Neural Networks and Generic MPC. IACR Cryptol. ePrint Arch. 2023: 1918 (2023) - 2022
- [j8]Chiara Marcolla, Victor Sucasas, Marc Manzano, Riccardo Bassoli, Frank H. P. Fitzek, Najwa Aaraj:
Survey on Fully Homomorphic Encryption, Theory, and Applications. Proc. IEEE 110(10): 1572-1609 (2022) - [i10]Johannes Mono, Chiara Marcolla, Georg Land, Tim Güneysu, Najwa Aaraj:
Finding and Evaluating Parameters for BGV. IACR Cryptol. ePrint Arch. 2022: 706 (2022) - [i9]Chiara Marcolla, Victor Sucasas, Marc Manzano, Riccardo Bassoli, Frank H. P. Fitzek, Najwa Aaraj:
Survey on Fully Homomorphic Encryption, Theory, and Applications. IACR Cryptol. ePrint Arch. 2022: 1602 (2022) - 2021
- [j7]Emanuele Bellini, Chiara Marcolla, Nadir Murru:
On the decoding of 1-Fibonacci error correcting codes. Discret. Math. Algorithms Appl. 13(5): 2150056:1-2150056:18 (2021) - [j6]Carlos Aguilar Melchor, Nicolas Aragon, Emanuele Bellini, Florian Caullery, Rusydi H. Makarim, Chiara Marcolla:
Constant Time Algorithms for ROLLO-I-128. SN Comput. Sci. 2(5): 382 (2021) - [c3]Najwa Aaraj, Chiara Marcolla, Xiaojie Zhu:
Exipnos: An Efficient Verifiable Dynamic Symmetric Searchable Encryption Scheme with Forward and Backward Privacy. INDOCRYPT 2021: 487-509 - 2020
- [j5]Chiara Marcolla, Margherita Roggero:
Hermitian codes and complete intersections. Finite Fields Their Appl. 62: 101621 (2020) - [i8]Emanuele Bellini, Chiara Marcolla, Nadir Murru:
On the decoding of 1-Fibonacci error correcting codes. CoRR abs/2003.12991 (2020) - [i7]Carlos Aguilar Melchor, Nicolas Aragon, Emanuele Bellini, Florian Caullery, Rusydi H. Makarim, Chiara Marcolla:
Constant time algorithms for ROLLO-I-128. IACR Cryptol. ePrint Arch. 2020: 1066 (2020)
2010 – 2019
- 2019
- [c2]Emanuele Bellini, Florian Caullery, Rusydi H. Makarim, Marc Manzano, Chiara Marcolla, Víctor Mateu:
Advances and Challenges of Rank Metric Cryptography Implementations. ICCD 2019: 325-328 - 2016
- [j4]Edoardo Ballico, Chiara Marcolla:
Higher Hamming weights for locally recoverable codes on algebraic curves. Finite Fields Their Appl. 40: 61-72 (2016) - [j3]Chiara Marcolla, Marco Pellegrini, Massimiliano Sala:
On the small-weight codewords of some Hermitian codes. J. Symb. Comput. 73: 27-45 (2016) - [i6]Riccardo Longo, Chiara Marcolla, Massimiliano Sala:
Collaborative Multi-Authority KP-ABE for Shorter Keys and Parameters. IACR Cryptol. ePrint Arch. 2016: 262 (2016) - 2015
- [c1]Riccardo Longo, Chiara Marcolla, Massimiliano Sala:
Key-Policy Multi-authority Attribute-Based Encryption. CAI 2015: 152-164 - [i5]Edoardo Ballico, Chiara Marcolla:
Higher Hamming weights for locally recoverable codes on algebraic curves. CoRR abs/1505.05041 (2015) - 2014
- [j2]Franca Marinelli, Riccardo Aragona, Chiara Marcolla, Massimiliano Sala:
Some security bounds for the key sizes of DGHV scheme. Appl. Algebra Eng. Commun. Comput. 25(5): 383-392 (2014) - [j1]Chiara Marcolla, Marco Pellegrini, Massimiliano Sala:
On the Hermitian curve and its intersections with some conics. Finite Fields Their Appl. 28: 166-187 (2014) - [i4]Riccardo Longo, Chiara Marcolla, Massimiliano Sala:
Two novel applications of bilinear groups to ABE encryption. CoRR abs/1412.4234 (2014) - [i3]Franca Marinelli, Riccardo Aragona, Chiara Marcolla, Massimiliano Sala:
Some security bounds for the DGHV scheme. IACR Cryptol. ePrint Arch. 2014: 68 (2014) - [i2]Riccardo Longo, Chiara Marcolla, Massimiliano Sala:
Two novel applications of bilinear groups to ABE encryption. IACR Cryptol. ePrint Arch. 2014: 994 (2014) - 2011
- [i1]Claudio Fontanari, Chiara Marcolla:
On the geometry of small weight codewords of dual algebraic geometric codes. CoRR abs/1104.1320 (2011)
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-07-21 21:14 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:
