Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin Thiry-Atighehchi
Person information
- affiliation: LIMOS Université Clermont Auvergne, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i15]Axel Durbet, Paul-Marie Grollemund, Kevin Thiry-Atighehchi:
Untargeted Near-collision Attacks in Biometric Recognition. CoRR abs/2304.01580 (2023)- [i14]Axel Durbet, Paul-Marie Grollemund, Kevin Thiry-Atighehchi:
A Comprehensive Analysis on the Leakage of Fuzzy Matchers. CoRR abs/2307.13717 (2023) - 2022
- [c9]Axel Durbet, Paul-Marie Grollemund, Pascal Lafourcade, Kevin Thiry-Atighehchi:
Near-collisions and Their Impact on Biometric Security. SECRYPT 2022: 382-389 - [c8]Axel Durbet, Paul-Marie Grollemund, Pascal Lafourcade, Denis Migdal, Kevin Thiry-Atighehchi:
Authentication Attacks on Projection-based Cancelable Biometric Schemes. SECRYPT 2022: 568-573 - [i13]Axel Durbet, Paul-Marie Grollemund, Pascal Lafourcade, Kevin Thiry-Atighehchi:
Near-collisions and their Impact on Biometric Security (long). CoRR abs/2205.04229 (2022) - 2021
- [i12]Axel Durbet, Pascal Lafourcade, Denis Migdal, Kevin Thiry-Atighehchi, Paul-Marie Grollemund:
Authentication Attacks on Projection-based Cancelable Biometric Schemes. CoRR abs/2110.15163 (2021) - 2020
- [j7]Kevin Atighehchi:
A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints. J. Parallel Distributed Comput. 137: 246-251 (2020) - [j6]Loubna Ghammam, Koray Karabina
, Patrick Lacharme, Kevin Atighehchi:
A Cryptanalysis of Two Cancelable Biometric Schemes Based on Index-of-Max Hashing. IEEE Trans. Inf. Forensics Secur. 15: 2869-2880 (2020) - [c7]Paul-Marie Grollemund, Pascal Lafourcade, Kevin Thiry-Atighehchi, Ariane Tichit:
Proof of Behavior (Short Paper). Tokenomics 2020: 11:1-11:6
2010 – 2019
- 2019
- [j5]Kevin Atighehchi, Loubna Ghammam, Morgan Barbier, Christophe Rosenberger:
GREYC-Hashing: Combining biometrics and secret for enhancing the security of protected templates. Future Gener. Comput. Syst. 101: 819-830 (2019) - [i11]Kevin Atighehchi, Loubna Ghammam, Koray Karabina, Patrick Lacharme:
A Cryptanalysis of Two Cancelable Biometric Schemes based on Index-of-Max Hashing. CoRR abs/1910.01389 (2019) - 2018
- [c6]Kevin Atighehchi, Morgan Barbier:
Signature Renewal for Low Entropy Data. TrustCom/BigDataSE 2018: 873-884 - [c5]Kevin Atighehchi:
On the Incremental Digital Signatures. TrustCom/BigDataSE 2018: 1605-1609 - 2017
- [j4]Kevin Atighehchi, Stéphane Ballet, Alexis Bonnecaze, Robert Rolland:
Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm. Math. Comput. 86(308): 2975-3000 (2017) - [j3]Kevin Atighehchi, Robert Rolland:
Optimization of Tree Modes for Parallel Hash Functions: A Case Study. IEEE Trans. Computers 66(9): 1585-1598 (2017) - [j2]Kevin Atighehchi, Alexis Bonnecaze:
Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3. IACR Trans. Symmetric Cryptol. 2017(4): 212-239 (2017) - [i10]Kevin Atighehchi, Alexis Bonnecaze:
Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3. CoRR abs/1708.05680 (2017) - 2016
- [i9]Kevin Atighehchi:
Note on Optimal Trees for Parallel Hash Functions. CoRR abs/1604.04206 (2016) - [i8]Kevin Atighehchi:
Optimal Tree Hash Modes: the Case of Trees Having their Leaves at All the Levels. CoRR abs/1607.00307 (2016) - [i7]Kevin Atighehchi:
Some observations on the optimization of a parallel SHAKE function using Sakura. CoRR abs/1608.00492 (2016) - [i6]Kevin Atighehchi, Alexis Bonnecaze:
On Plausible Tree Hash Modes for SHA-3. IACR Cryptol. ePrint Arch. 2016: 658 (2016) - 2015
- [j1]Kevin Atighehchi, Alexis Bonnecaze, Gabriel Risterucci:
New models for efficient authenticated dictionaries. Comput. Secur. 53: 203-214 (2015) - [i5]Kevin Atighehchi, Stéphane Ballet, Alexis Bonnecaze, Robert Rolland:
On Chudnovsky-Based Arithmetic Algorithms in Finite Fields. CoRR abs/1510.00090 (2015) - [i4]Kevin Atighehchi, Robert Rolland:
Optimization of Tree Modes for Parallel Hash Functions. CoRR abs/1512.05864 (2015) - 2014
- [c4]Kevin Atighehchi, Alexis Bonnecaze, Traian Muntean:
Authenticated Dictionary Based on Frequency. SEC 2014: 293-306 - [i3]Kevin Atighehchi:
On the Incremental Asymmetric Signatures. CoRR abs/1403.8150 (2014) - [i2]Kevin Atighehchi:
Space-efficient, byte-wise incremental and perfectly private encryption schemes. IACR Cryptol. ePrint Arch. 2014: 104 (2014) - 2013
- [c3]Kevin Atighehchi, Traian Muntean:
Towards fully incremental cryptographic schemes. AsiaCCS 2013: 505-510 - [c2]Kevin Atighehchi, Traian Muntean:
Generic Parallel Cryptography for Hashing Schemes. ISPDC 2013: 201-208 - 2010
- [c1]Kevin Atighehchi, Traian Muntean, Sylvain Parlanti, Robert Rolland, Laurent Vallet:
A Cryptographic Keys Transfer Protocol for Secure Communicating Systems. SYNASC 2010: 339-343 - [i1]Kevin Atighehchi, A. Enache, Traian Muntean, Gabriel Risterucci:
An Efficient Parallel Algorithm for Skein Hash Functions. IACR Cryptol. ePrint Arch. 2010: 432 (2010)
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-04-25 05:50 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:
