default search action
Diana Maimut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [e2]Mark Manulis
, Diana Maimut
Innovative Security Solutions for Information Technology and Communications - 16th International Conference, SecITC 2023, Bucharest, Romania, November 23-24, 2023, Revised Selected Papers. Lecture Notes in Computer Science 14534, Springer 2024, ISBN 978-3-031-52946-7 [contents] - 2023
- [j5]Diana Maimut
Inferring Bivariate Polynomials for Homomorphic Encryption Application. Cryptogr. 7(2): 31 (2023) - [c19]Evgnosia-Alexandra Kelesidis
Searching for Gemstones: Flawed Stegosystems May Hide Promising Ideas. C2SI 2023: 242-260 - [i18]Diana Maimut, Evgnosia-Alexandra Kelesidis, Ilona Teodora Ciocan:
Searching for Gemstones: Flawed Stegosystems May Hide Promissing Ideas. IACR Cryptol. ePrint Arch. 2023: 293 (2023) - [i17]Diana Maimut, George Teseleanu:
Inferring Bivariate Polynomials for Homomorphic Encryption Application. IACR Cryptol. ePrint Arch. 2023: 844 (2023) - 2022
- [i16]Diana Maimut, Alexandru Cristian Matei:
Speeding-Up Elliptic Curve Cryptography Algorithm. IACR Cryptol. ePrint Arch. 2022: 1458 (2022) - 2021
- [c18]Ilona Teodora Ciocan, Evgnosia-Alexandra Kelesidis, Diana Maimut
A Modified Argon2i Using a Tweaked Variant of Blake3. APCC 2021: 271-274 - [c17]Diana Maimut
New Configurations of Grain Ciphers: Security Against Slide Attacks. SecITC 2021: 260-285 - [e1]Diana Maimut
Innovative Security Solutions for Information Technology and Communications - 13th International Conference, SecITC 2020, Bucharest, Romania, November 19-20, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12596, Springer 2021, ISBN 978-3-030-69254-4 [contents] - 2020
- [c16]Diana Maimut
A New Generalisation of the Goldwasser-Micali Cryptosystem Based on the Gap 2k-Residuosity Assumption. SECITC 2020: 24-40 - [i15]Diana Maimut, George Teseleanu:
A New Generalisation of the Goldwasser-Micali Cryptosystem Based on the Gap 2k-Residuosity Assumption. IACR Cryptol. ePrint Arch. 2020: 1399 (2020)
2010 – 2019
- 2019
- [c15]Marc Beunardeau, Fatima-Ezzahra El Orche, Diana Maimut
Authenticated Key Distribution: When the Coupon Collector is Your Enemy. SECITC 2019: 1-20 - [c14]Mariana Costiuc
Physical Cryptography. SECITC 2019: 156-171 - [c13]Diana Maimut
Speeding up OMD Instantiations in Hardware. SECITC 2019: 193-212 - [c12]Diana Maimut
A Generic View on the Unified Zero-Knowledge Protocol and Its Applications. WISTP 2019: 32-46 - [i14]Mariana Costiuc, Diana Maimut, George Teseleanu:
Physical Cryptography. IACR Cryptol. ePrint Arch. 2019: 1235 (2019) - [i13]Diana Maimut, Alexandru Stefan Mega:
Speeding Up OMD Instantiations in Hardware. IACR Cryptol. ePrint Arch. 2019: 1351 (2019) - [i12]Diana Maimut, George Teseleanu:
A Generic View on the Unified Zero-Knowledge Protocol and its Applications. IACR Cryptol. ePrint Arch. 2019: 1432 (2019) - [i11]Marc Beunardeau, Fatima-Ezzahra El Orche, Diana Maimut, David Naccache, Peter B. Rønne, Peter Y. A. Ryan:
Authenticated Key Distribution: When the Coupon Collector is Your Enemy. IACR Cryptol. ePrint Arch. 2019: 1499 (2019) - 2018
- [j4]Houda Ferradi, Rémi Géraud
Backtracking-assisted multiplication. Cryptogr. Commun. 10(1): 17-26 (2018) - [j3]Houda Ferradi, Rémi Géraud
Regulating the pace of von Neumann correctors. J. Cryptogr. Eng. 8(1): 85-91 (2018) - [c11]Diana Maimut
Post-quantum Cryptography and a (Qu)Bit More. SecITC 2018: 22-28 - [c10]Diana Maimut
A Unified Security Perspective on Legally Fair Contract Signing Protocols. SecITC 2018: 477-491 - [p1]Simon Cogliani, Feng Bao, Houda Ferradi, Rémi Géraud
Public Key-Based Lightweight Swarm Authentication. Cyber-Physical Systems Security 2018: 255-267 - [i10]Diana Maimut, George Teseleanu:
New Configurations of Grain Ciphers: Security Against Slide Attacks. IACR Cryptol. ePrint Arch. 2018: 692 (2018) - [i9]Diana Maimut, George Teseleanu:
A Unified Security Perspective on Legally Fair Contract Signing Protocols. IACR Cryptol. ePrint Arch. 2018: 1027 (2018) - 2017
- [c9]Diana Maimut, George Teseleanu
Secretly Embedding Trapdoors into Contract Signing Protocols. SECITC 2017: 166-186 - [i8]Diana Maimut, George Teseleanu:
Secretly Embedding Trapdoors into Contract Signing Protocols. IACR Cryptol. ePrint Arch. 2017: 446 (2017) - 2016
- [c8]Houda Ferradi, Rémi Géraud
Legally Fair Contract Signing Without Keystones. ACNS 2016: 175-190 - [c7]Rémi Géraud
Double-Speed Barrett Moduli. The New Codebreakers 2016: 148-158 - [i7]Houda Ferradi, Rémi Géraud, Diana Maimut, David Naccache, David Pointcheval:
Legally Fair Contract Signing Without Keystones. IACR Cryptol. ePrint Arch. 2016: 363 (2016) - [i6]Simon Cogliani, Feng Bao, Houda Ferradi, Rémi Géraud, Diana Maimut, David Naccache, Rodrigo Portella do Canto, Guilin Wang:
Public-Key Based Lightweight Swarm Authentication. IACR Cryptol. ePrint Arch. 2016: 750 (2016) - 2015
- [b1]Diana-Stefania Maimut:
Authentication and encryption protocols : design, attacks and algorithmic improvements. (Protocoles d'authentification et de chiffrement : conception, attaques et améliorations algorithmiques). École Normale Supérieure, Paris, France, 2015 - [c6]Eric Brier, Jean-Sébastien Coron, Rémi Géraud
A Number-Theoretic Error-Correcting Code. SECITC 2015: 25-35 - [c5]Rémi Géraud
Applying Cryptographic Acceleration Techniques to Error Correction. SECITC 2015: 150-168 - [i5]Eric Brier, Jean-Sébastien Coron, Rémi Géraud, Diana Maimut, David Naccache:
A Number-Theoretic Error-Correcting Code. CoRR abs/1509.00378 (2015) - [i4]Rémi Géraud, Diana Maimut, David Naccache:
Double-Speed Barrett Moduli. IACR Cryptol. ePrint Arch. 2015: 785 (2015) - [i3]Houda Ferradi, Rémi Géraud, Diana Maimut, David Naccache, Hang Zhou:
Backtracking-Assisted Multiplication. IACR Cryptol. ePrint Arch. 2015: 787 (2015) - [i2]Houda Ferradi, Rémi Géraud, Diana Maimut, David Naccache, Amaury de Wargny:
Regulating the Pace of von Neumann Correctors. IACR Cryptol. ePrint Arch. 2015: 849 (2015) - [i1]Rémi Géraud, Diana-Stefania Maimut, David Naccache, Rodrigo Portella do Canto, Emil Simion:
Applying Cryptographic Acceleration Techniques to Error Correction. IACR Cryptol. ePrint Arch. 2015: 886 (2015) - 2014
- [j2]Diana Maimut
Authenticated Encryption: Toward Next-Generation Algorithms. IEEE Secur. Priv. 12(2): 70-72 (2014) - [c4]Diana-Stefania Maimut
The relevance of second error probability in modern statistical analysis. ECAI 2014: 91-94 - [c3]Simon Cogliani, Diana-Stefania Maimut, David Naccache, Rodrigo Portella do Canto, Reza Reyhanitabar, Serge Vaudenay, Damian Vizár:
OMD: A Compression Function Mode of Operation for Authenticated Encryption. Selected Areas in Cryptography 2014: 112-128 - 2013
- [c2]Diana Maimut
Fault Attacks on Projective-to-Affine Coordinates Conversion. COSADE 2013: 46-61 - 2012
- [j1]Diana Maimut
Lightweight Cryptography for RFID Tags. IEEE Secur. Priv. 10(2): 76-79 (2012) - [c1]Alecsandru Patrascu, Diana Maimut
New directions in cloud computing. A security perspective. COMM 2012: 289-292
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-24 23:03 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: