default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Augot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Daniel Augot
, Sarah Bordage, Jade Nardi:
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes. Des. Codes Cryptogr. 91(3): 1111-1151 (2023)- 2021
- [j14]Daniel Augot, Alain Couvreur, Julien Lavauzelle, Alessandro Neri:
Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed-Muller Codes. SIAM J. Appl. Algebra Geom. 5(2): 165-199 (2021) - [c21]Lucas Benmouffok, Kalpana Singh, Nicolas Heulot, Daniel Augot:
Privacy-Preserving Initial Public Offering using SCALE-MAMBA and Hyperledger Fabric. WETICE 2021: 85-88 - [i23]Daniel Augot, Sarah Bordage, Jade Nardi:
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i22]Daniel Augot, Alain Couvreur, Julien Lavauzelle, Alessandro Neri:
Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes. CoRR abs/2006.14489 (2020)
2010 – 2019
- 2019
- [j13]Faina I. Solov'eva, Daniel Augot, Thomas Johansson, Marine Minier, Victor A. Zinoviev:
Editorial: Special issue on coding and cryptography. Des. Codes Cryptogr. 87(2-3): 183-184 (2019) - [c20]Daniel Augot, Hervé Chabanne, William George:
Practical Solutions to Save Bitcoins Applied to an Identity System Proposal. ICISSP 2019: 511-518 - 2018
- [j12]Daniel Augot, Pierre Loidreau, Gwezheneg Robert:
Generalized Gabidulin codes over fields of any characteristic. Des. Codes Cryptogr. 86(8): 1807-1848 (2018) - 2017
- [c19]Daniel Augot, Hervé Chabanne, Thomas Chenevier, William George, Laurent Lambert:
A User-Centric System for Verified Identities on the Bitcoin Blockchain. DPM/CBT@ESORICS 2017: 390-407 - [c18]Daniel Augot, Hervé Chabanne, Olivier Clémot, William George:
Transforming Face-to-Face Identity Proofing into Anonymous Digital Identity Using the Bitcoin Blockchain. PST 2017: 25-34 - [i21]Daniel Augot, Pierre Loidreau, Gwezheneg Robert:
Generalized Gabidulin codes over fields of any characteristic. CoRR abs/1703.09125 (2017) - [i20]Daniel Augot, Hervé Chabanne, Thomas Chenevier, William George, Laurent Lambert:
A User-Centric System for Verified Identities on the Bitcoin Blockchain. CoRR abs/1710.02019 (2017) - [i19]Daniel Augot, Hervé Chabanne, Olivier Clémot, William George:
Transforming face-to-face identity proofing into anonymous digital identity using the Bitcoin blockchain. CoRR abs/1710.02951 (2017) - [i18]Daniel Augot, Hervé Chabanne, William George:
Identity Managenent on the Bitcoin Blockchain. ERCIM News 2017(110) (2017) - 2015
- [c17]Daniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô:
Information sets of Multiplicity codes. ISIT 2015: 2401-2405 - [i17]Daniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô:
Information Sets of Multiplicity Codes. CoRR abs/1509.00279 (2015) - 2014
- [c16]Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa:
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers. CANS 2014: 222-239 - [c15]Daniel Augot, Matthieu Finiasz:
Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes. FSE 2014: 3-17 - [c14]Daniel Augot, Pierre-Alain Fouque, Pierre Karpman:
Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation. Selected Areas in Cryptography 2014: 243-260 - [i16]Daniel Augot, Matthieu Finiasz:
Direct Construction of Recursive MDS Diffusion Layers using Shortened BCH Codes. CoRR abs/1412.4626 (2014) - [i15]Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa:
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers. CoRR abs/1412.5012 (2014) - [i14]Daniel Augot:
Generalization of Gabidulin Codes over Fields of Rational Functions. CoRR abs/1412.6080 (2014) - [i13]Daniel Augot, Pierre-Alain Fouque, Pierre Karpman:
Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation. IACR Cryptol. ePrint Arch. 2014: 551 (2014) - [i12]Daniel Augot, Matthieu Finiasz:
Direct Construction of Recursive MDS Diffusion Layers using Shortened BCH Codes. IACR Cryptol. ePrint Arch. 2014: 566 (2014) - 2013
- [j11]Daniel Augot, Anne Canteaut, Gohar M. Kyureghyan, Faina I. Solov'eva, Øyvind Ytrehus:
Editorial. Des. Codes Cryptogr. 66(1-3): 1-2 (2013) - [c13]Daniel Augot, Pierre Loidreau, Gwezheneg Robert:
Rank metric and Gabidulin codes in characteristic zero. ISIT 2013: 509-513 - [c12]Daniel Augot, Matthieu Finiasz:
Exhaustive search for small dimension recursive MDS diffusion layers for block ciphers and hash functions. ISIT 2013: 1551-1555 - [i11]Daniel Augot, Matthieu Finiasz:
Exhaustive Search for Small Dimension Recursive MDS Diffusion Layers for Block Ciphers and Hash Functions. CoRR abs/1305.3396 (2013) - [i10]Gwezheneg Robert, Pierre Loidreau, Daniel Augot:
Rank metric and Gabidulin codes in characteristic zero. CoRR abs/1305.4047 (2013) - 2012
- [i9]Daniel Augot, François Morain:
Discrete logarithm computations over finite fields using Reed-Solomon codes. CoRR abs/1202.4361 (2012) - 2011
- [j10]Alexander Zeh, Christian Gentner, Daniel Augot:
An Interpolation Procedure for List Decoding Reed-Solomon Codes Based on Generalized Key Equations. IEEE Trans. Inf. Theory 57(9): 5946-5959 (2011) - [c11]Frederik Armknecht, Daniel Augot, Ludovic Perret, Ahmad-Reza Sadeghi:
On Constructing Homomorphic Encryption Schemes from Coding Theory. IMACC 2011: 23-40 - [c10]Daniel Augot, Morgan Barbier, Caroline Fontaine:
Ensuring Message Embedding in Wet Paper Steganography. IMACC 2011: 244-258 - [c9]Daniel Augot, Morgan Barbier, Alain Couvreur:
List-decoding of binary Goppa codes up to the binary Johnson bound. ITW 2011: 229-233 - [i8]Alexander Zeh, Christian Gentner, Daniel Augot:
An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations. CoRR abs/1110.3898 (2011) - [i7]Daniel Augot, Morgan Barbier, Caroline Fontaine:
Ensuring message embedding in wet paper steganography. CoRR abs/1111.2301 (2011) - [i6]Frederik Armknecht, Daniel Augot, Ludovic Perret, Ahmad-Reza Sadeghi:
On Constructing Homomorphic Encryption Schemes from Coding Theory. IACR Cryptol. ePrint Arch. 2011: 309 (2011) - 2010
- [i5]Daniel Augot, Morgan Barbier, Alain Couvreur:
List-decoding of binary Goppa codes up to the binary Johnson bound. CoRR abs/1012.3439 (2010)
2000 – 2009
- 2009
- [j9]Daniel Augot, Jean-Charles Faugère, Ludovic Perret:
Foreword. J. Symb. Comput. 44(12): 1605-1607 (2009) - [j8]Daniel Augot, Magali Bardet, Jean-Charles Faugère:
On the decoding of binary cyclic codes with the Newton identities. J. Symb. Comput. 44(12): 1608-1625 (2009) - [p2]Daniel Augot, Emanuele Betti, Emmanuela Orsini:
An Introduction to Linear and Cyclic Codes. Gröbner Bases, Coding, and Cryptography 2009: 47-68 - [p1]Daniel Augot, Michael Stepanov:
A Note on the Generalisation of the Guruswami-Sudan List Decoding Algorithm to Reed-Muller Codes. Gröbner Bases, Coding, and Cryptography 2009: 395-398 - 2008
- [c8]Daniel Augot, Alexander Zeh:
On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm. ISIT 2008: 2620-2624 - 2007
- [b2]Daniel Augot:
Décodage des codes algébriques et cryptographie. (Decoding algorithms of algebraic codes and cryptography). Pierre and Marie Curie University, Paris, France, 2007 - [j7]Daniel Augot, Raghav Bhaskar, Valérie Issarny, Daniele Sacchetti:
A three round authenticated group key agreement protocol for ad hoc networks. Pervasive Mob. Comput. 3(1): 36-52 (2007) - [c7]Daniel Augot, Magali Bardet, Jean-Charles Faugère:
On formulas for decoding binary cyclic codes. ISIT 2007: 2646-2650 - [i4]Daniel Augot, Magali Bardet, Jean-Charles Faugère:
On formulas for decoding binary cyclic codes. CoRR abs/cs/0701070 (2007) - 2006
- [i3]Raghav Bhaskar, Paul Mühlethaler, Daniel Augot, Cédric Adjih, Saadi Boudjit, Anis Laouiti:
Efficient and Dynamic Group Key Agreement in Ad hoc Networks. CoRR abs/cs/0611027 (2006) - 2005
- [c6]Daniel Augot, Matthieu Finiasz, Nicolas Sendrier:
A Family of Fast Syndrome Based Cryptographic Hash Functions. Mycrypt 2005: 64-83 - [c5]Daniel Augot, Raghav Bhaskar, Valérie Issarny, Daniele Sacchetti:
An Efficient Group Key Agreement Protocol for Ad Hoc Networks. WOWMOM 2005: 576-580 - 2003
- [c4]Daniel Augot, Matthieu Finiasz:
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem. EUROCRYPT 2003: 229-240 - [i2]Daniel Augot, Matthieu Finiasz, Pierre Loidreau:
Using the Trace Operator to repair the Polynomial Reconstruction based Cryptosystem presented at Eurocrypt 2003. IACR Cryptol. ePrint Arch. 2003: 209 (2003) - [i1]Daniel Augot, Matthieu Finiasz, Nicolas Sendrier:
A Fast Provably Secure Cryptographic Hash Function. IACR Cryptol. ePrint Arch. 2003: 230 (2003) - 2001
- [j6]Daniel Augot, Claude Carlet:
Preface: Volume 6. Electron. Notes Discret. Math. 6: 556-557 (2001) - 2000
- [j5]Daniel Augot, Lancelot Pecquet:
A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes. IEEE Trans. Inf. Theory 46(7): 2605-2614 (2000)
1990 – 1999
- 1999
- [j4]Daniel Augot, Jean-Marc Boucqueau, Jean-François Delaigle, Caroline Fontaine, Eddy Goray:
Secure delivery of images over open networks. Proc. IEEE 87(7): 1251-1266 (1999) - 1998
- [c3]Daniel Augot, Caroline Fontaine:
Key issues for watermarking digital images. Electronic Imaging 1998: 176-185 - [c2]Daniel Augot, Jean-François Delaigle, Caroline Fontaine:
DHWM: A Scheme for Managing Watermarking Keys in the Aquarelle Multimedia Distributed System. ESORICS 1998: 241-255 - 1996
- [j3]Daniel Augot, Françoise Levy-dit-Vehel:
Bounds on the minimum distance of the duals of BCH codes. IEEE Trans. Inf. Theory 42(4): 1257-1260 (1996) - 1994
- [j2]Daniel Augot, Nicolas Sendrier:
Idempotents and the BCH bound. IEEE Trans. Inf. Theory 40(1): 204-207 (1994) - 1993
- [b1]Daniel Augot:
Étude algèbrique des mots de poids minimum des codes cycliques, méthodes d'algèbre linéaire sur les corps finis. Pierre and Marie Curie University, Paris, France, 1993 - 1992
- [j1]Daniel Augot, Pascale Charpin, Nicolas Sendrier:
Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans. Inf. Theory 38(3): 960-973 (1992) - 1990
- [c1]Daniel Augot, Pascale Charpin, Nicolas Sendrier:
The minimum distance of some binary codes via the Newton's identities. EUROCODE 1990: 65-73
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
