Daniel Cabarcas

According to our database, Daniel Cabarcas authored at least 26 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Improved Attacks for SNOVA by Exploiting Stability under a Group Action.

Daniel Cabarcas, Peigen Li, Javier A. Verbel, Ricardo Villanueva-Polanco

IACR Cryptol. ePrint Arch., 2024

Admissible Parameters for the Crossbred Algorithm and Semi-regular Sequences over Finite Fields.

John Baena, Daniel Cabarcas, Sharwan K. Tiwari, Javier A. Verbel, Luis Villota

IACR Cryptol. ePrint Arch., 2024

2023

On the complexity of solving generic overdetermined bilinear systems.

John B. Baena, Daniel Cabarcas, Javier A. Verbel

Adv. Math. Commun., 2023

Privacy-Preserving Edit Distance Computation Using Secret-Sharing Two-Party Computation.

Hernán Vanegas, Daniel Cabarcas, Diego F. Aranha

Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

2022

Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow.

John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Improving Support-Minors rank attacks: applications to GeMSS and Rainbow.

John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel

IACR Cryptol. ePrint Arch., 2021

2020

On the Complexity of Solving Generic Over-determined Bilinear Systems.

John B. Baena, Daniel Cabarcas, Javier A. Verbel

CoRR, 2020

Algebraic attacks for solving the Rank Decoding and MinRank problems without Gröbner basis.

Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray A. Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, Javier A. Verbel

CoRR, 2020

Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems.

Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray A. Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, Javier A. Verbel

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

On the Complexity of "Superdetermined" Minrank Instances.

Javier A. Verbel, John Baena, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone

IACR Cryptol. ePrint Arch., 2019

Efficient public-key operation in multivariate schemes.

Felipe Cabarcas, Daniel Cabarcas, John Baena

Adv. Math. Commun., 2019

2018

Rank Analysis of Cubic Multivariate Cryptosystems.

John Baena, Daniel Cabarcas, Daniel E. Escudero, Karan Khathuria, Javier A. Verbel

IACR Cryptol. ePrint Arch., 2018

2017

Key Recovery Attack for ZHFE.

Daniel Cabarcas, Daniel Smith-Tone, Javier A. Verbel

Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

2016

Efficient ZHFE Key Generation.

John B. Baena, Daniel Cabarcas, Daniel E. Escudero, Jaiberth Porras-Barrera, Javier A. Verbel

Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

2015

An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme.

Daniel Cabarcas, Denise Demirel, Florian Göpfert, Jean Lancrenon, Thomas Wunderer

IACR Cryptol. ePrint Arch., 2015

Integrity, authenticity, non-repudiation, and proof of existence for long-term archiving: A survey.

Martín A. Gagliotti Vigil, Johannes Buchmann, Daniel Cabarcas, Christian Weinert, Alexander Wiesmaier

Comput. Secur., 2015

2014

On the Efficiency of Provably Secure NTRU.

Daniel Cabarcas, Patrick Weiden, Johannes Buchmann

Proceedings of the Post-Quantum Cryptography - 6th International Workshop, 2014

Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms.

Matthias Geihs, Daniel Cabarcas

Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

Provably secure LWE encryption with smallish uniform noise and secret.

Daniel Cabarcas, Florian Göpfert, Patrick Weiden

Proceedings of the ASIAPKC'14, 2014

2013

Instantiating Treeless Signature Schemes.

Patrick Weiden, Andreas Hülsing, Daniel Cabarcas, Johannes Buchmann

IACR Cryptol. ePrint Arch., 2013

Provably Secure LWE-Encryption with Uniform Secret.

Daniel Cabarcas, Florian Göpfert, Patrick Weiden

IACR Cryptol. ePrint Arch., 2013

Discrete Ziggurat: A Time-Memory Trade-off for Sampling from a Gaussian Distribution over the Integers.

Johannes Buchmann, Daniel Cabarcas, Florian Göpfert, Andreas Hülsing, Patrick Weiden

IACR Cryptol. ePrint Arch., 2013

Assessing trust in the long-term protection of documents.

Martín A. Gagliotti Vigil, Daniel Cabarcas, Johannes Buchmann, Jingwei Huang

Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

2011

Linear algebra to compute syzygies and Gröbner bases.

Daniel Cabarcas, Jintai Ding

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over <i>F</i>₂.

Johannes Buchmann, Daniel Cabarcas, Jintai Ding, Mohamed Saied Emam Mohamed

Proceedings of the Progress in Cryptology, 2010

2009

MXL₃: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals.

Mohamed Saied Emam Mohamed, Daniel Cabarcas, Jintai Ding, Johannes Buchmann, Stanislav Bulygin

Proceedings of the Information, Security and Cryptology, 2009