Jean-Guillaume Dumas
Publications
Publications
|
|
Optimal Communication Unbalanced Private Set Union23rd International Conference on Applied Cryptography and Network Security, Jun 2025, Munich, Germany. pp.107-135, ⟨10.1007/978-3-031-95764-2_5⟩ |
|
|
Strassen's algorithm is not optimally accurate49th International Symposium on Symbolic and Algebraic Computation (ISSAC'24), ACM SIGSAM, Jul 2024, Raleigh, NC, United States. pp.254-263, ⟨10.1145/3666000.3669697⟩ |
|
|
In-place fast polynomial modular remainderProceedings of the 49th International Symposium on Symbolic and Algebraic Computation (ISSAC'24), ACM SIGSAM, Jul 2024, Raleigh, NC, United States. pp.26-35, ⟨10.1145/3666000.3669672⟩ |
|
|
In-place accumulation of fast multiplication formulaeProceedings of the 49th International Symposium on Symbolic and Algebraic Computation (ISSAC'24), ACM SIGSAM, Jul 2024, Raleigh, NC, United States. pp.16-25, ⟨10.1145/3666000.3669671⟩ |
|
|
VESPo: Verified Evaluation of Secret PolynomialsPrivacy Enhancing Technologies Symposium (PETS 2023), Jul 2023, Lausanne, Switzerland. pp.354--374, ⟨10.56553/popets-2023-0085⟩ |
The return of (I)DeFiX38th International Conference of the French Finance Association, May 2022, Saint-Malo, France |
|
The forking effectWorld Finance Conference, Aug 2021, Virtual, Norway |
|
|
|
Risk analyses of the crypto-market: A literature review12th International Conference on Complexity, Informatics and Cybernetics (IMCIC 2021), International Institution of Informatics and Systemics, Mar 2021, Orlando, United States. pp.30--37, ⟨10.2139/ssrn.4762603⟩ |
|
|
Dynamic proofs of retrievability with low server storage30th USENIX Security Symposium, Aug 2021, virtual event, United States. pp.537--554 |
|
|
On fast multiplication of a matrix by its transposeProceedings of the 45th International Symposium on Symbolic and Algebraic Computation (ISSAC 2020), ACM SIGSAM, Jul 2020, Kalamata, Greece. pp.162-169, ⟨10.1145/3373207.3404021⟩ |
|
|
Interactive Physical Zero-Knowledge Proof for NorinoriThe 25th International Computing and Combinatorics Conference (COCOON 2019), Jul 2019, Xian, China. pp.166-177, ⟨10.1007/978-3-030-26176-4_14⟩ |
|
|
Secure Multi-Party Matrix Multiplication Based on Strassen-Winograd AlgorithmThe 14th International Workshop on Security (IWSEC 2019), Aug 2019, Tokyo, Japan. pp.67-88, ⟨10.1007/978-3-030-26834-3_5⟩ |
|
|
LU factorization with errorsInternational Symposium on Symbolic and Algebraic Computation - ISSAC'19, Jul 2019, Beijing, China. pp.131-138, ⟨10.1145/3326229.3326244⟩ |
|
|
A Cryptographer's Conspiracy SantaFUN 2018 - 9th International Conference on Fun with Algorithms, Jun 2018, La Maddalena, Italy. pp.13:1--13:13, ⟨10.4230/LIPIcs.FUN.2018.13⟩ |
|
|
Physical Zero-Knowledge Proof for MakaroSSS 2018 - 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2018, Tokyo, Japan. pp.111-125, ⟨10.1007/978-3-030-03232-6_8⟩ |
|
|
Symmetric indefinite triangular factorization revealing the rank profile matrixISSAC'18, Jul 2018, New York, United States. pp.151-158, ⟨10.1145/3208976.3209019⟩ |
|
|
Proof-of-work certificates that can be efficiently computed in the cloudThe 20th International Workshop on Computer Algebra in Scientific Computing (CASC 2018), Sep 2018, Lille, France. pp.1-17, ⟨10.1007/978-3-319-99639-4_1⟩ |
|
|
Prover efficient public verification of dense or sparse/structured matrix-vector multiplicationACISP 2017 - 22nd Australasian Conference on Information Security and Privacy, Jul 2017, Auckland, New Zealand. pp.115-134, ⟨10.1007/978-3-319-59870-3_7⟩ |
|
|
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time CircuitsISSAC 2017 - 42nd International Symposium on Symbolic and Algebraic Computation, Jul 2017, Kaiserslautern, Germany. pp.125-132, ⟨10.1145/3087604.3087640⟩ |
|
|
Security Architecture for Point-to-Point Splitting ProtocolsWCICSS 2017 - IEEE World Congress on Industrial Control Systems Security, Dec 2017, Cambridge, United Kingdom |
|
|
LOCALPKI: A User-Centric Formally Proven Alternative to PKIX14th International Conference on Security and Cryptography SECRYPT, Jul 2017, Madrid, Spain. ⟨10.5220/0006461101870199⟩ |
|
|
Certificates for triangular equivalence and rank profilesACM International Symposium on Symbolic and Algebraic Computations - ISSAC'17, Jul 2017, Kaiserslautern, Germany. pp.133-140, ⟨10.1145/3087604.3087609⟩ |
|
|
Recursive double-size fixed precision arithmeticICMS: International Congress of Mathematical Software, Jul 2016, Berlin, Germany. pp.223--231, ⟨10.1007/978-3-319-42432-3_28⟩ |
|
|
Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen8th International Conference on Fun with Algorithms, Jun 2016, La Maddalena, Italy. pp.8:1-8:20, ⟨10.4230/LIPIcs.FUN.2016.8⟩ |
|
|
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse MatrixISSAC’2016, Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. pp.199-206, ⟨10.1145/2930889.2930908⟩ |
|
|
Private Multi-party Matrix Multiplication and Trust Computations13th International Conference on Security and Cryptography SECRYPT 16, Jul 2016, Lisbon, Portugal. pp.61-72, ⟨10.5220/0005957200610072⟩ |
|
|
Computing the Rank Profile MatrixISSAC, Steve Linton, Jul 2015, Bath, United Kingdom. pp.146--153, ⟨10.1145/2755996.2756682⟩ |
|
|
Hilbert-Post completeness for the state and the exception effectsSixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2015), Nov 2015, Berlin, Germany. pp.596-610, ⟨10.1007/978-3-319-32859-1_51⟩ |
|
|
Formal verification in Coq of program properties involving the global state effectJFLA 2014 - Journées Francophones des Langages Applicatifs, Jan 2014, Fréjus, France. pp.1-17 |
|
|
Certified proofs in programs involving exceptionsConference on Intelligent Computer Mathematics Work in Progress (CICM 2014), Jul 2014, Coimbra, Portugal. pp.16 |
|
|
Parallel computation of echelon formsEuroPar-2014 - 20th International Conference on Parallel Processing, Aug 2014, Porto, Portugal. pp.499-510, ⟨10.1007/978-3-319-09873-9_42⟩ |
|
|
Elements of Design for Containers and Solutions in the LinBox LibraryICMS: International Congress on Mathematical Software, Aug 2014, Seoul, South Korea. pp.654-662, ⟨10.1007/978-3-662-44199-2_98⟩ |
|
|
Essentially optimal interactive certificates in linear algebraACM International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), Jul 2014, Kobe, Japan. pp.146-153, ⟨10.1145/2608628.2608644⟩ |
|
|
Brandt's Fully Private Auction Protocol RevisitedAfricacrypt 2013, Jun 2013, Le Caire, Egypt. pp.88-106, ⟨10.1007/978-3-642-38553-7_5⟩ |
|
|
Matrix powers algorithms for trust evaluation in PKI architecturesSTM 2012 - 8th International Workshop on Security and Trust Management (co-ESORICS 2012), Sep 2012, Pise, Italy. pp16 |
|
|
Simultaneous computation of the row and column rank profilesISSAC 2013 - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, MA, United States. pp.181-188, ⟨10.1145/2465506.2465517⟩ |
Decorated proofs for computational effects: StatesACCAT, 2012, -, Estonia |
|
|
|
Generic design of Chinese remaindering schemesPASCO '10 - 4th International Symposium on Parallel Symbolic Computation, Jul 2010, Grenoble, France. pp.26-34, ⟨10.1145/1837210.1837218⟩ |
|
|
Exact Sparse Matrix-Vector Multiplication on GPU's and Multicore ArchitecturesPASCO'10: 4th International Symposium on Parallel Symbolic Computation, Jul 2010, Grenoble, France. pp.80-88, ⟨10.1145/1837210.1837224⟩ |
|
|
LinBox founding scope allocation, parallel building blocks, and separate compilationICMS 2010 - 3rd International Congress on Mathematical Software, Sep 2010, Kobe, Japan. pp.77-83, ⟨10.1007/978-3-642-15582-6_16⟩ |
|
|
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithmISSAC 2009 - International Symposium on Symbolic and Algebraic Computation, Jul 2009, Séoul, South Korea. pp.55-62, ⟨10.1145/1576702.1576713⟩ |
|
|
Fault Attacks on RSA Public Keys: Left-To-Right Implementations are also VulnerableRSA Conference 2009 - Cryptographers' Track, Apr 2009, San Francisco, United States. pp.414--428, ⟨10.1007/978-3-642-00862-7_28⟩ |
|
|
On finding multiplicities of characteristic polynomial factors of black-box matricesISSAC 2009 - International Symposium on Symbolic and Algebraic Computation, Jul 2009, Séoul, South Korea. pp.135-142, ⟨10.1145/1576702.1576723⟩ |
Sequential products for effectsACCAT'09 - Applied and Computational Category Theory, Mar 2009, York, United Kingdom |
|
Compromis temps/mémoire en algèbre linéaire dense sur des corps finisJournée nationale du GDR Informatique Mathématique, Jan 2008, Paris, France |
|
Arithmétique compressée pour des petits corps finisRencontres Arithmétique de l'Informatique Mathématique, Jun 2008, Lille, France |
|
|
|
Q-adic Transform revisitedISSAC '08 - 21st International Symposium on Symbolic and Algebraic Computation 2008, Jul 2008, Hagenberg, Austria. pp.63-70, ⟨10.1145/1390768.1390780⟩ |
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite FieldsSage Days 10, Oct 2008, Nancy, France |
|
|
|
Compressed Modular Matrix MultiplicationMICA'2008 - Milestones in Computer Algebra, May 2008, Tobago, Trinidad and Tobago. pp.133-140 |
Outils pour un intergiciel générique en calcul formelJCNF 2007 - Journées Nationales de Calcul Formel, Jan 2007, Marseille, France |
|
|
|
Parallel computation of the rank of large sparse matrices from algebraic K-theoryPASCO '07 - International Workshop on Parallel Symbolic Computation, Jul 2007, London, Canada. pp.43-52, ⟨10.1145/1278177.1278186⟩ |
Sequential products in effect categoriesJournées ARROWS, Jun 2007, Nancy, France |
|
LinBoxInternational Congress on Mathematical Software, ICMS'2006, Sep 2006, Castro Urdiales, Spain |
|
|
|
Adaptive triangular system solvingChallenges in Symbolic Computation Software - Dagstuhl Seminar 06271, Jul 2006, Dagstuhl, Germany. pp.770 |
Adaptive algorithms: theory and applicationSIAM Parallel Processing 2006, Mini-Symposium MS1: Adaptive algorithms for scientific computing, Feb 2006, San Francisco, United States. pp.49--50 |
|
|
|
Towards a diagrammatic modeling of the LinBox C++ linear algebra libraryLangages et Modèles à Objets, Mar 2006, Nîmes, France. pp.117-132 |
|
|
An introspective algorithm for the integer determinantTransgressive Computing 2006, Apr 2006, Grenade, Spain. pp.185-202 |
|
|
Adaptive and Hybrid Algorithms: classification and illustration on triangular system solvingTransgressive Computing 2006, Apr 2006, Grenade, Spain. pp.131-148 |
Vers une modélisation diagrammatique de la bibliothèque C++ d'algèbre linéaire LinBoxLangages et Modèles à Objet (LMO'06), Mar 2006, Nimes, France. p.117-132 |
|
|
|
Efficient Computation of the Characteristic PolynomialInternational Symposium on Symbolic and Algebraic Computation (ISSAC'15), Jul 2005, Beijing, China. pp.140-147 |
|
|
Algorithms for Symbolic/Numeric Control of Affine Dynamical Systems *International Symposium on Symbolic and Algebraic Computation (ISSAC), Jul 2005, Beijing, China. ⟨10.1145/1073884.1073923⟩ |
|
|
Efficient dot product over word-size finite fieldsComputer Algebra in Scientific Computing, Jul 2004, Saint Petersburg, Russia. pp.139--154 |
FFPACK: finite field linear algebra packageInternational Symposium on Symbolic and Algebraic Computation (ISSAC'04), Jul 2004, Santander, Spain. pp.119-126, ⟨10.1145/1005285.1005304⟩ |
|
|
|
Modeling the electrical activity of a neuron by a continuous and piecewise affine hybrid systemHybrid Systems: Computation and Control , Apr 2003, Prague, Czech Republic. pp.156-171, ⟨10.1007/3-540-36580-X_14⟩ |
|
|
Computing the Rank of Large Sparse Matrices over Finite FieldsComputer Algebra in Scientific Computing (CASC) 2002, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov, Sep 2002, Yalta, Ukraine. pp.47--62 |
Finite field linear algebra subroutinesInternational Symposium on Symbolic and Algebraic Computation (ISSAC'02), Jul 2002, Lille, France. pp.63-74, ⟨10.1145/780506.780515⟩ |
|
|
|
Integer Smith form via the valenceInternational Symposium on Symbolic and Algebraic Computation (ISSAC'00), 2000, St. Andrews, United Kingdom. pp.95-105, ⟨10.1145/345542.345590⟩ |
|
|
Les codes détecteurs et correcteurs d'erreurs pour la fiabilité des calculsMokrane Bouzeghoub; Michel Daydé; Christian Jutten. Le calcul à découvert, CNRS, pp.51-59, 2025, 9782271153739 |
La sécurité de bitcoin et des blockchainsGildas Avoine; Marc-Olivier Killijian. Treize défis de la cybersécurité, CNRS Éditions, pp.213-232, 2020, 2271130611 |
|
|
|
Les crypto-monnaies, une réalité virtuelle ?Les Big Data à l’échelle de la société, CNRS EDITIONS, 2020, 978-2271130617 |
|
|
Bitcoin : une monnaie dématérialiséeLes Big Data à découvert, CNRS Editions, pp.298--299, 2017 |
|
|
Computational linear algebra over finite fieldsGary L. Mullen and Daniel Panario. Handbook of Finite Fields, Chapman & Hall / CRC, pp.514-528, 2013, Discrete Mathematics and Its Applications, 9781439873786 |
Cryptographie à clef publiqueTouradj Ebrahimi; Franck Leprevost; Bertrand Warusfeld. Cryptographie et sécurité des systèmes et réseaux, Hermès, pp.103-186, 2006, Collection Traité IC2 - Informatique et systèmes d'information |
|
Architectures PKIT. Ebrahimi, F. Leprevost, and B. Warusfeld. Cryptographie et sécurité des systèmes et réseaux, Hermès, pp.187-210, 2006 |
|
Cryptographie à clef secrèteT. Ebrahimi, F. Leprevost, and B. Warusfeld. Cryptographie et sécurité des systèmes et réseaux, Hermès, pp.23-102, 2006 |
|
|
Computational Explorations on Semifields2026 |
|
|
A more accurate rational non-commutative algorithm for multiplying 4×4 matrices using 48 multiplications2026 |
|
|
Algorithms for the local and the global postage stamp problem2026 |
|
|
A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications2025 |
|
|
Fuzzy Private Set Union via Oblivious Key Homomorphic Encryption Retrieval2025 |
|
|
A non-commutative algorithm for multiplying a 3×4 matrix by a 4×7 matrix using 63 non-complex multiplications2025 |
|
|
Contributions au calcul exact intensifCalcul formel [cs.SC]. Université de Grenoble, 2010 |
|
|
Algorithmes parallèles efficaces pour le calcul formel : algèbre linéaire creuse et extensions algébriquesModélisation et simulation. Institut National Polytechnique de Grenoble - INPG, 2000. Français. ⟨NNT : ⟩ |
|
|
Fast Matrix Multiplication and Symbolic Computation[Research Report] Université Grenoble Alpes (UGA). 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[Research Report] Université Grenoble Alpes (UGA). 2015 |
|
|
Breaking a monad-comonad symmetry between computational effects[Research Report] arXiV. 2014 |
|
|
Generating S-Boxes from Semi-fields Pseudo-extensions[Research Report] Université Grenoble Alpes (UGA). 2014 |
|
|
Patterns for computational effects arising from a monad or a comonad[Research Report] LJK. 2013 |
|
|
Decorated proofs for computational effects: Exceptions[Research Report] Université Grenoble Alpes (UGA). 2012 |
|
|
Adjunctions for exceptions[Research Report] LJK. 2012 |
|
|
States and exceptions considered as dual effects[Research Report] Université Grenoble Alpes. 2011 |
|
|
An hybrid system approach to nonlinear optimal control problems[Research Report] Université Grenoble Alpes (UGA). 2008 |
|
|
Sequential products in effect categories[Research Report] Université Grenoble Alpes (UGA). 2007 |
|
|
FFPACK: Finite field linear algebra package[Research Report] LIP RR-2004-2, Laboratoire de l'informatique du parallélisme. 2004, 2+17p |
|
|
LinBox: A Generic Library for Exact Linear Algebra[Research Report] LIp RR-2002-15, Laboratoire de l'informatique du parallélisme. 2002, 2+12p |