| Some fast algorithms multiplying a matrix by its adjoint | 0 | 0.34 | 2023 |
| Optimal threshold padlock systems. | 0 | 0.34 | 2022 |
| Dynamic proofs of retrievability with low server storage | 0 | 0.34 | 2021 |
| On fast multiplication of a matrix by its transpose | 0 | 0.34 | 2020 |
| A Faster Cryptographer's Conspiracy Santa | 0 | 0.34 | 2020 |
| Elimination-based certificates for triangular equivalence and rank profiles. | 0 | 0.34 | 2020 |
| Poster: Proofs of Retrievability with Low Server Storage | 1 | 0.36 | 2019 |
| Interactive Physical Zero-Knowledge Proof for Norinori. | 0 | 0.34 | 2019 |
| LU factorization with errors. | 0 | 0.34 | 2019 |
| A Cryptographer's Conspiracy Santa. | 0 | 0.34 | 2018 |
| Physical Zero-Knowledge Proof For Makaro | 0 | 0.34 | 2018 |
| Proof-of-work certificates that can be efficiently computed in the cloud. | 0 | 0.34 | 2018 |
| Symmetric Indefinite Triangular Factorization Revealing The Rank Profile Matrix | 0 | 0.34 | 2018 |
| Dual protocols for private multi-party matrix multiplication and trust computations. | 0 | 0.34 | 2017 |
| LocalPKI - An Interoperable and IoT Friendly PKI. | 0 | 0.34 | 2017 |
| Certificates for triangular equivalence and rank profiles. | 1 | 0.35 | 2017 |
| LOCALPKI: A User-Centric Formally Proven Alternative to PKIX. | 1 | 0.36 | 2017 |
| Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. | 0 | 0.34 | 2017 |
| Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. | 6 | 0.54 | 2016 |
| Fast computation of the rank profile matrix and the generalized Bruhat decomposition. | 4 | 0.47 | 2016 |
| Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen. | 1 | 0.35 | 2016 |
| Recursive Double-Size Fixed Precision Arithmetic. | 0 | 0.34 | 2016 |
| Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination | 2 | 0.39 | 2016 |
| Matrix Multiplication Over Word-Size Modular Rings Using Approximate Formulas. | 2 | 0.36 | 2016 |
| Fast Matrix Multiplication and Symbolic Computation. | 0 | 0.34 | 2016 |
| Private Multi-party Matrix Multiplication and Trust Computations. | 3 | 0.46 | 2016 |
| Relative Hilbert-Post Completeness for Exceptions. | 0 | 0.34 | 2015 |
| Brandt’s fully private auction protocol revisited | 2 | 0.37 | 2015 |
| Computing the Rank Profile Matrix. | 7 | 0.52 | 2015 |
| Hilbert-Post completeness for the state and the exception effects. | 0 | 0.34 | 2015 |
| Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices | 0 | 0.34 | 2015 |
| Elements of Design for Containers and Solutions in the LinBox Library. | 2 | 0.43 | 2014 |
| Essentially optimal interactive certificates in linear algebra | 7 | 0.66 | 2014 |
| Certified Proofs in Programs Involving Exceptions. | 2 | 0.39 | 2014 |
| Generating S-Boxes from Semi-fields Pseudo-extensions. | 0 | 0.34 | 2014 |
| Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract. | 0 | 0.34 | 2014 |
| Matrix Multiplication over Word-size Modular Fields Using Bini's Approximate Formula | 0 | 0.34 | 2014 |
| Program certification with computational effects. | 0 | 0.34 | 2014 |
| Parallel Computation of Echelon Forms. | 9 | 0.67 | 2014 |
| Breaking a monad-comonad symmetry between computational effects. | 0 | 0.34 | 2014 |
| Patterns for computational effects arising from a monad or a comonad. | 2 | 0.40 | 2013 |
| Formal verification in Coq of program properties involving the global state effect. | 2 | 0.38 | 2013 |
| A decorated proof system for exceptions. | 1 | 0.38 | 2013 |
| Simultaneous computation of the row and column rank profiles | 11 | 0.75 | 2013 |
| Adjunctions for exceptions | 0 | 0.34 | 2012 |
| Decorated proofs for computational effects: Exceptions | 0 | 0.34 | 2012 |
| Matrix Powers Algorithms for Trust Evaluation in Public-Key Infrastructures. | 1 | 0.37 | 2012 |
| Attacking Privacy in a Fully Private Auction Protocol | 0 | 0.34 | 2012 |
| A duality between exceptions and states | 8 | 0.65 | 2012 |
| Decorated Proofs For Computational Effects: States | 6 | 0.56 | 2012 |
