Daniel Augot
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Interests
Daniel Augot has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Pierre Loidreau
DGA MI Univ Rennes CNRS IRMAR -UMR 6625 F-35000 Rennes France
2 shared publications - William George
Kleros Cooperative, Paris, France
2 shared publications - Anne Canteaut
INRIA Paris-Rocquencourt
1 shared publication Emanuele Betti
University of Florence
1 shared publication- Emmanuela Orsini
Bocconi University
1 shared publication - Faina I. Solov’eva
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
1 shared publication
Latest Publications
- 13 November 2022
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (3) , 1111-1151
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- 13 November 2022
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (3) , 1111-1151
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- Open Access
- 12 January 2019
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 87 (2-3) , 183-184
Editorial: Special issue on coding and cryptography
- 12 January 2019
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 87 (2-3) , 183-184
Open AccessEditorial: Special issue on coding and cryptography
- Open Access
- 1 January 2019
- Published by INSTICC
- p. 511-518
Practical Solutions to Save Bitcoins Applied to an Identity System Proposal
- 1 January 2019
- Published by INSTICC
- p. 511-518
Open AccessPractical Solutions to Save Bitcoins Applied to an Identity System Proposal
- 27 October 2017
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (8) , 1807-1848
Generalized Gabidulin codes over fields of any characteristic
- 27 October 2017
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (8) , 1807-1848
Generalized Gabidulin codes over fields of any characteristic
- Open Access
A User-Centric System for Verified Identities on the Bitcoin Blockchain
We present an identity management scheme built into the Bitcoin blockchain, allowing for identities that are as indelible as the blockchain itself. Moreover, we take advantage of Bitcoin's decentralized nature to facilitate a shared control between users and identity providers, allowing users to directly manage their own identities, fluidly coordinating identities from different providers, even as identity providers can revoke identities and impose controls.
Open AccessA User-Centric System for Verified Identities on the Bitcoin Blockchain
We present an identity management scheme built into the Bitcoin blockchain, allowing for identities that are as indelible as the blockchain itself. Moreover, we take advantage of Bitcoin's decentralized nature to facilitate a shared control between users and identity providers, allowing users to directly manage their own identities, fluidly coordinating identities from different providers, even as identity providers can revoke identities and impose controls.
- Open Access
Generalized Gabidulin codes over fields of any characteristic
We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the automorphism to be able to have a proper notion of rank metric which is in coherence with linearized polynomials. Under these conditions, we generalize Gabidulin codes and provide a decoding algorithm which decode both errors and erasures. Then, we focus on codes over integer rings and how to decode them. We are then faced with the problem of the exponential growth of intermediate values, and to circumvent the problem, it is natural to propose to do computations modulo a prime ideal. For this, we study the reduction of generalized Gabidulin codes over number ideals codes modulo a prime ideal, and show they are classical Gabidulin codes. As a consequence, knowing side information on the size of the errors or the message, we can reduce the decoding problem over the integer ring to a decoding problem over a finite field. We also give examples and timings.
Open AccessGeneralized Gabidulin codes over fields of any characteristic
We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the automorphism to be able to have a proper notion of rank metric which is in coherence with linearized polynomials. Under these conditions, we generalize Gabidulin codes and provide a decoding algorithm which decode both errors and erasures. Then, we focus on codes over integer rings and how to decode them. We are then faced with the problem of the exponential growth of intermediate values, and to circumvent the problem, it is natural to propose to do computations modulo a prime ideal. For this, we study the reduction of generalized Gabidulin codes over number ideals codes modulo a prime ideal, and show they are classical Gabidulin codes. As a consequence, knowing side information on the size of the errors or the message, we can reduce the decoding problem over the integer ring to a decoding problem over a finite field. We also give examples and timings.
- Open Access
Information Sets of Multiplicity Codes
We here provide a method for systematic encoding of the Multiplicity codes introduced by Kopparty, Saraf and Yekhanin in 2011. The construction is built on an idea of Kop-party. We properly define information sets for these codes and give detailed proofs of the validity of Kopparty's construction, that use generating functions. We also give a complexity estimate of the associated encoding algorithm.
Open AccessInformation Sets of Multiplicity Codes
We here provide a method for systematic encoding of the Multiplicity codes introduced by Kopparty, Saraf and Yekhanin in 2011. The construction is built on an idea of Kop-party. We properly define information sets for these codes and give detailed proofs of the validity of Kopparty's construction, that use generating functions. We also give a complexity estimate of the associated encoding algorithm.
- 28 July 2012
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 66 (1-3) , 1-2
Editorial
- 28 July 2012
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 66 (1-3) , 1-2
Editorial
- Open Access
Discrete logarithm computations over finite fields using Reed-Solomon codes
Cheng and Wan have related the decoding of Reed-Solomon codes to the computation of discrete logarithms over finite fields, with the aim of proving the hardness of their decoding. In this work, we experiment with solving the discrete logarithm over GF(q^h) using Reed-Solomon decoding. For fixed h and q going to infinity, we introduce an algorithm (RSDL) needing O (h! q^2) operations over GF(q), operating on a q x q matrix with (h+2) q non-zero coefficients. We give faster variants including an incremental version and another one that uses auxiliary finite fields that need not be subfields of GF(q^h); this variant is very practical for moderate values of q and h. We include some numerical results of our first implementations.
Open AccessDiscrete logarithm computations over finite fields using Reed-Solomon codes
Cheng and Wan have related the decoding of Reed-Solomon codes to the computation of discrete logarithms over finite fields, with the aim of proving the hardness of their decoding. In this work, we experiment with solving the discrete logarithm over GF(q^h) using Reed-Solomon decoding. For fixed h and q going to infinity, we introduce an algorithm (RSDL) needing O (h! q^2) operations over GF(q), operating on a q x q matrix with (h+2) q non-zero coefficients. We give faster variants including an incremental version and another one that uses auxiliary finite fields that need not be subfields of GF(q^h); this variant is very practical for moderate values of q and h. We include some numerical results of our first implementations.