Daniel Augot

According to our database1, Daniel Augot authored at least 42 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Editorial: Special issue on coding and cryptography.
Des. Codes Cryptogr., 2019

Practical Solutions to Save Bitcoins Applied to an Identity System Proposal.
Proceedings of the 5th International Conference on Information Systems Security and Privacy, 2019

2018
Generalized Gabidulin codes over fields of any characteristic.
Des. Codes Cryptogr., 2018

2017
Identity Managenent on the Bitcoin Blockchain.
ERCIM News, 2017

Transforming Face-to-Face Identity Proofing into Anonymous Digital Identity Using the Bitcoin Blockchain.
Proceedings of the 15th Annual Conference on Privacy, Security and Trust, 2017

A User-Centric System for Verified Identities on the Bitcoin Blockchain.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2017

2015
Information sets of Multiplicity codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation.
IACR Cryptology ePrint Archive, 2014

Direct Construction of Recursive MDS Diffusion Layers using Shortened BCH Codes.
IACR Cryptology ePrint Archive, 2014

Generalization of Gabidulin Codes over Fields of Rational Functions.
CoRR, 2014

A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers.
Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

2013
Editorial.
Des. Codes Cryptogr., 2013

Rank metric and Gabidulin codes in characteristic zero.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Exhaustive search for small dimension recursive MDS diffusion layers for block ciphers and hash functions.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Discrete logarithm computations over finite fields using Reed-Solomon codes
CoRR, 2012

2011
An Interpolation Procedure for List Decoding Reed-Solomon Codes Based on Generalized Key Equations.
IEEE Trans. Information Theory, 2011

On Constructing Homomorphic Encryption Schemes from Coding Theory.
IACR Cryptology ePrint Archive, 2011

List-decoding of binary Goppa codes up to the binary Johnson bound.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Ensuring Message Embedding in Wet Paper Steganography.
Proceedings of the Cryptography and Coding - 13th IMA International Conference, 2011

2009
Foreword.
J. Symb. Comput., 2009

On the decoding of binary cyclic codes with the Newton identities.
J. Symb. Comput., 2009

A Note on the Generalisation of the Guruswami-Sudan List Decoding Algorithm to Reed-Muller Codes.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

An Introduction to Linear and Cyclic Codes.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
A three round authenticated group key agreement protocol for ad hoc networks.
Pervasive and Mobile Computing, 2007

On formulas for decoding binary cyclic codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Décodage des codes algébriques et cryptographie. (Decoding algorithms of algebraic codes and cryptography).
, 2007

2006
Efficient and Dynamic Group Key Agreement in Ad hoc Networks
CoRR, 2006

2005
An Efficient Group Key Agreement Protocol for Ad Hoc Networks.
Proceedings of the 2005 International Conference on a World of Wireless, 2005

A Family of Fast Syndrome Based Cryptographic Hash Functions.
Proceedings of the Progress in Cryptology, 2005

2003
A Fast Provably Secure Cryptographic Hash Function.
IACR Cryptology ePrint Archive, 2003

Using the Trace Operator to repair the Polynomial Reconstruction based Cryptosystem presented at Eurocrypt 2003.
IACR Cryptology ePrint Archive, 2003

A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem.
Proceedings of the Advances in Cryptology, 2003

2001
Preface: Volume 6.
Electronic Notes in Discrete Mathematics, 2001

2000
A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes.
IEEE Trans. Information Theory, 2000

1998
DHWM: A Scheme for Managing Watermarking Keys in the Aquarelle Multimedia Distributed System.
Proceedings of the Computer Security, 1998

Key issues for watermarking digital images.
Proceedings of the Electronic Imaging: Processing, 1998

1996
Bounds on the minimum distance of the duals of BCH codes.
IEEE Trans. Information Theory, 1996

1994
Idempotents and the BCH bound.
IEEE Trans. Information Theory, 1994

1993
Étude algèbrique des mots de poids minimum des codes cycliques, méthodes d'algèbre linéaire sur les corps finis.
PhD thesis, 1993

1992
Studying the locator polynomials of minimum weight codewords of BCH codes.
IEEE Trans. Information Theory, 1992

1990
The minimum distance of some binary codes via the Newton's identities.
Proceedings of the EUROCODE '90, 1990


  Loading...