Research

My research focuses in algebraic algorithms, cryptography and machine learning. In particular I have worked on assesing the security of cryptographic algorithms; on improving the efficiency of cryptografic algorithms based on lattices and based on multivariate polynomials; on the long-term protection of digital archives; on learning strategies on video games; and on improving the efficiency of Groebner basis computation. I am in general interested on applying theoretical algebra to develop practical algorithms and solve fundamental problems in computation and complexity theory .

Publications

Baena, John B., Daniel Cabarcas, and Javier Verbel. On the Complexity of Solving Generic Over-determined Bilinear Systems. ArXiv preprint arXiv:2006.09442 (2020).

Bardet M. et al. (2020) Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems. In: Moriai S., Wang H. (eds) Advances in Cryptology – ASIACRYPT 2020. ASIACRYPT 2020. Lecture Notes in Computer Science, vol 12491. Springer, Cham.

N. Justesen, M. González-Duque, D. Cabarcas, J. -B. Mouret and S. Risi. Learning a Behavioral Repertoire from Demonstrations. 2020 IEEE Conference on Games (CoG), Osaka, Japan, 2020, pp. 383-390.

Verbel J., Baena J., Cabarcas D., Perlner R., Smith-Tone D. (2019) On the Complexity of “Superdetermined” Minrank Instances. In: Ding J., Steinwandt R. (eds) Post-Quantum Cryptography. PQCrypto 2019. Lecture Notes in Computer Science, vol 11505. Springer, Cham.

F Cabarcas, D Cabarcas, J Baena. Efficient public-key operation in multivariate schemes. Advances in Mathematics of Communications 13 (2), 343-371.

Baena J., Cabarcas D., Escudero D.E., Khathuria K., Verbel J. Rank Analysis of Cubic Multivariate Cryptosystems. In: Lange T., Steinwandt R. (eds) Post-Quantum Cryptography. PQCrypto 2018. Lecture Notes in Computer Science, vol 10786. Springer, Cham, 2018.

Daniel Cabarcas, Daniel Smith-Tone, and Javier A. Verbel. Key recovery attack for zhfe.

In Tanja Lange and Tsuyoshi Takagi, editors, Post-Quantum Cryptography, volume 10346 of

Lecture Notes in Computer Science, pages 289–308. Springer International Publishing, Cham,

2017.

John B. Baena, Daniel Cabarcas, Daniel E. Escudero, Jaiberth Porras-Barrera, Javier A. Verbel. Efficient ZHFE Key Generation. In Tsuyoshi Takagi editor, Post-Quantum Cryptography, volume 9606 of Lecture Notes in Computer Science, pages 213-232. Springer International Publishing, 2016.

Daniel Cabarcas. El voto electrnico y retos criptogrficos relacionados. Revista Facultad de

Ciencias Universidad Nacional de Colombia, 4(2):83 – 102, 2016.

Martín Vigil, Johannes Buchmann, Daniel Cabarcas, Christian Weinert, Alexander Wiesmaier, Integrity, authenticity, non-repudiation, and proof of existence for long-term archiving: A survey, Computers & Security, Volume 50, May 2015, Pages 16-32.

Matthias Geihs and Daniel Cabarcas. Efficient integer encoding for homomorphic encryption via ring isomorphisms. In Aranha, Diego F. and Menezes, Alfred, editor, Progress in Cryptology - LATINCRYPT 2014, volume 8895 of Lecture Notes in Computer Science, pages 48-63. Springer International Publishing, 2015.

Daniel Cabarcas, Patrick Weiden, and Johannes Buchmann. On the efficiency of provably secure NTRU. In Michele Mosca, editor, Post-Quantum Cryptography, volume 8772 of Lecture Notes in Computer Science, pages 22–39. Springer International Publishing, 2014.

Daniel Cabarcas, Florian Gopfert, and Patrick Weiden. Provably secure LWE encryption with smallish uniform noise and secret. In Proceedings of the 2Nd ACM Workshop on ASIA Public-key Cryptography, ASIAPKC '14, pages 33-42, New York, NY, USA, 2014. ACM.

J. Buchmann, D. Cabarcas, F. Göpfert, A. Hülsing y P. Weiden. Discrete Ziggurat: A Time-Memory Trade-off for Sampling from a Gaussian Distribution over the Integers. Selected Areas in Cryptography 2013, Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2013.

M. Vigil, D. Cabarcas, J. Huang and J. Buchmann. Assessing Trust in the Long-Term Protection of Documents. In 18th IEEE Symposium on Computers and Communications (IEEE ISCC 2013). 2013.

R. Bansarkhani, D. Cabarcas, P. Kuo, P. Schmidt, M. Schneider. A Selection of Recent Lattice-Based Signature and Encryption Schemes. Tatra Mountains Math. Publ. 53, páginas 81-102. 2012.

D. Cabarcas and J. Ding. Linear Algebra to Compute Syzygies and Gr\"obner Bases. Proceedings of the 2011 International Symposium on Symbolic and Algebraic Computation, ACM New York, NY, USA. 2011.

J. Buchmann, D. Cabarcas, J. Ding, M. Mohamed. Flexible Partial Enlargement to Accelerate Gr\"obner Basis Computation over $\mathbb{F}_2$. Progress in Cryptology – Africacrypt 2010, Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2010.

M. S. E. Mohamed, D. Cabarcas, J. Ding, J. Buchmann, and S. Bulygin. MXL3: An Efficient Algorithm for Computing Gr\"obner Bases of Zero-Dimensional Ideals, in proceedings of the 12th International Conference on Information Security and Cryptology (ICISC 2009), Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2009.

J. Ding, D. Cabarcas, D. Schmidt, J. Buchmann, S. Tohaneanu. Mutant Gr\"obner Basis Algorithm, in proceedings of the 1st International Conference on Symbolic Computation and Cryptography (SCC08), LMIB, Beijing, China, 2008.

D. Cabarcas, F. Arango, C. M. Zapata. Establecimiento y verificación de la consistencia en DOME: un caso de estudio, Revista DYNA, No. 141, 2006.

Presentations

See slides from presentations here.