Остановите войну!
for scientists:
default search action
Daniel Cabarcas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i10]John Baena, Daniel Cabarcas, Sharwan K. Tiwari, Javier A. Verbel, Luis Villota:
Admissible Parameters for the Crossbred Algorithm and Semi-regular Sequences over Finite Fields. IACR Cryptol. ePrint Arch. 2024: 758 (2024) - 2023
- [j3]John B. Baena, Daniel Cabarcas, Javier A. Verbel:
On the complexity of solving generic overdetermined bilinear systems. Adv. Math. Commun. 17(5): 1210-1234 (2023) - [c15]Hernán Vanegas, Daniel Cabarcas, Diego F. Aranha:
Privacy-Preserving Edit Distance Computation Using Secret-Sharing Two-Party Computation. LATINCRYPT 2023: 67-86 - 2022
- [c14]John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow. CRYPTO (3) 2022: 376-405 - 2021
- [i9]John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Improving Support-Minors rank attacks: applications to GeMSS and Rainbow. IACR Cryptol. ePrint Arch. 2021: 1677 (2021) - 2020
- [c13]Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray A. Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, Javier A. Verbel:
Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems. ASIACRYPT (1) 2020: 507-536 - [i8]Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray A. Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, Javier A. Verbel:
Algebraic attacks for solving the Rank Decoding and MinRank problems without Gröbner basis. CoRR abs/2002.08322 (2020) - [i7]John B. Baena, Daniel Cabarcas, Javier A. Verbel:
On the Complexity of Solving Generic Over-determined Bilinear Systems. CoRR abs/2006.09442 (2020)
2010 – 2019
- 2019
- [j2]Felipe Cabarcas, Daniel Cabarcas, John Baena:
Efficient public-key operation in multivariate schemes. Adv. Math. Commun. 13(2): 343-371 (2019) - [c12]Javier A. Verbel, John Baena, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone:
On the Complexity of "Superdetermined" Minrank Instances. PQCrypto 2019: 167-186 - [i6]Javier A. Verbel, John Baena, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone:
On the Complexity of "Superdetermined" Minrank Instances. IACR Cryptol. ePrint Arch. 2019: 731 (2019) - 2018
- [c11]John Baena, Daniel Cabarcas, Daniel E. Escudero, Karan Khathuria, Javier A. Verbel:
Rank Analysis of Cubic Multivariate Cryptosystems. PQCrypto 2018: 355-374 - [i5]John Baena, Daniel Cabarcas, Daniel E. Escudero, Karan Khathuria, Javier A. Verbel:
Rank Analysis of Cubic Multivariate Cryptosystems. IACR Cryptol. ePrint Arch. 2018: 110 (2018) - 2017
- [c10]Daniel Cabarcas, Daniel Smith-Tone, Javier A. Verbel:
Key Recovery Attack for ZHFE. PQCrypto 2017: 289-308 - 2016
- [c9]John B. Baena, Daniel Cabarcas, Daniel E. Escudero, Jaiberth Porras-Barrera, Javier A. Verbel:
Efficient ZHFE Key Generation. PQCrypto 2016: 213-232 - 2015
- [j1]Martín A. Gagliotti Vigil, Johannes Buchmann, Daniel Cabarcas, Christian Weinert, Alexander Wiesmaier:
Integrity, authenticity, non-repudiation, and proof of existence for long-term archiving: A survey. Comput. Secur. 50: 16-32 (2015) - [i4]Daniel Cabarcas, Denise Demirel, Florian Göpfert, Jean Lancrenon, Thomas Wunderer:
An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme. IACR Cryptol. ePrint Arch. 2015: 628 (2015) - 2014
- [c8]Daniel Cabarcas, Florian Göpfert, Patrick Weiden:
Provably secure LWE encryption with smallish uniform noise and secret. AsiaPKC@AsiaCCS 2014: 33-42 - [c7]Matthias Geihs, Daniel Cabarcas:
Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms. LATINCRYPT 2014: 48-63 - [c6]Daniel Cabarcas, Patrick Weiden, Johannes Buchmann:
On the Efficiency of Provably Secure NTRU. PQCrypto 2014: 22-39 - 2013
- [c5]Martín A. Gagliotti Vigil, Daniel Cabarcas, Johannes Buchmann, Jingwei Huang:
Assessing trust in the long-term protection of documents. ISCC 2013: 185-191 - [c4]Johannes Buchmann, Daniel Cabarcas, Florian Göpfert, Andreas Hülsing, Patrick Weiden:
Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers. Selected Areas in Cryptography 2013: 402-417 - [i3]Patrick Weiden, Andreas Hülsing, Daniel Cabarcas, Johannes Buchmann:
Instantiating Treeless Signature Schemes. IACR Cryptol. ePrint Arch. 2013: 65 (2013) - [i2]Daniel Cabarcas, Florian Göpfert, Patrick Weiden:
Provably Secure LWE-Encryption with Uniform Secret. IACR Cryptol. ePrint Arch. 2013: 164 (2013) - [i1]Johannes Buchmann, Daniel Cabarcas, Florian Göpfert, Andreas Hülsing, Patrick Weiden:
Discrete Ziggurat: A Time-Memory Trade-off for Sampling from a Gaussian Distribution over the Integers. IACR Cryptol. ePrint Arch. 2013: 510 (2013) - 2011
- [c3]Daniel Cabarcas, Jintai Ding:
Linear algebra to compute syzygies and Gröbner bases. ISSAC 2011: 67-74 - 2010
- [c2]Johannes Buchmann, Daniel Cabarcas, Jintai Ding, Mohamed Saied Emam Mohamed:
Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over F2. AFRICACRYPT 2010: 69-81
2000 – 2009
- 2009
- [c1]Mohamed Saied Emam Mohamed, Daniel Cabarcas, Jintai Ding, Johannes Buchmann, Stanislav Bulygin:
MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals. ICISC 2009: 87-100
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-05-31 01:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint