Daniel Cabarcas

According to our database1, Daniel Cabarcas authored at least 24 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the complexity of solving generic overdetermined bilinear systems.
Adv. Math. Commun., 2023

Privacy-Preserving Edit Distance Computation Using Secret-Sharing Two-Party Computation.
Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

2022
Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Improving Support-Minors rank attacks: applications to GeMSS and Rainbow.
IACR Cryptol. ePrint Arch., 2021

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

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

Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
On the Complexity of "Superdetermined" Minrank Instances.
IACR Cryptol. ePrint Arch., 2019

Efficient public-key operation in multivariate schemes.
Adv. Math. Commun., 2019

2018
Rank Analysis of Cubic Multivariate Cryptosystems.
IACR Cryptol. ePrint Arch., 2018

2017
Key Recovery Attack for ZHFE.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

2016
Efficient ZHFE Key Generation.
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

2015
An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme.
IACR Cryptol. ePrint Arch., 2015

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

2014
On the Efficiency of Provably Secure NTRU.
Proceedings of the Post-Quantum Cryptography - 6th International Workshop, 2014

Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms.
Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

Provably secure LWE encryption with smallish uniform noise and secret.
Proceedings of the ASIAPKC'14, 2014

2013
Instantiating Treeless Signature Schemes.
IACR Cryptol. ePrint Arch., 2013

Provably Secure LWE-Encryption with Uniform Secret.
IACR Cryptol. ePrint Arch., 2013

Discrete Ziggurat: A Time-Memory Trade-off for Sampling from a Gaussian Distribution over the Integers.
IACR Cryptol. ePrint Arch., 2013

Assessing trust in the long-term protection of documents.
Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

2011
Linear algebra to compute syzygies and Gröbner bases.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010
Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over <i>F</i><sub>2</sub>.
Proceedings of the Progress in Cryptology, 2010

2009
MXL<sub>3</sub>: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals.
Proceedings of the Information, Security and Cryptology, 2009


  Loading...