default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacques Patarin
Person information
SPARQL queries 
🛈 Please note that only 61% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c67]Benoît Cogliati, Gilles Macario-Rat, Jacques Patarin, Pierre Varjabedian:
State of the Art of HFE Variants - Is It Possible to Repair HFE with Appropriate Modifiers? PQCrypto (2) 2024: 144-167- [i41]Maya Chartouny, Benoit Cogliati, Jacques Patarin:
Classical and Quantum Generic Attacks on 6-round Feistel Schemes. IACR Cryptol. ePrint Arch. 2024: 458 (2024) - [i40]Benoit Cogliati, Gilles Macario-Rat, Jacques Patarin, Pierre Varjabedian:
State of the art of HFE variants Is it possible to repair HFE with appropriate perturbations? IACR Cryptol. ePrint Arch. 2024: 1706 (2024) - 2023
- [c66]Maya Chartouny, Jacques Patarin, Ambre Toulemonde:
Quantum Cryptanalysis of 5 Rounds Feistel Schemes and Benes Schemes. C2SI 2023: 196-203 - [c65]Benoît Cogliati, Avijit Dutta, Mridul Nandi, Jacques Patarin, Abishanka Saha:
Proof of Mirror Theory for a Wide Range of $\xi _{\max }$. EUROCRYPT (4) 2023: 470-501 - [i39]Gilles Macario-Rat, Jacques Patarin, Benoit Cogliati, Jean-Charles Faugère, Pierre-Alain Fouque, Louis Goubin, Robin Larrieu, Brice Minaud:
Rectangular Attack on VOX. IACR Cryptol. ePrint Arch. 2023: 1822 (2023) - 2022
- [c64]Ambre Toulemonde, Loïc Besson, Louis Goubin, Jacques Patarin:
Useful work: a new protocol to ensure usefulness of PoW-based consensus for blockchain. GoodIT 2022: 308-314 - [i38]Jean-Charles Faugère, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret:
A New Perturbation for Multivariate Public Key Schemes such as HFE and UOV. IACR Cryptol. ePrint Arch. 2022: 203 (2022) - [i37]Benoît Cogliati, Avijit Dutta, Mridul Nandi, Jacques Patarin, Abishanka Saha:
Proof of Mirror Theory for any $\xi_{\max}$. IACR Cryptol. ePrint Arch. 2022: 686 (2022) - [i36]Maya Chartouny, Jacques Patarin, Ambre Toulemonde:
Quantum Cryptanalysis of 5 rounds Feistel schemes and Benes schemes. IACR Cryptol. ePrint Arch. 2022: 1015 (2022) - 2021
- [c63]Aline Gouget, Jacques Patarin, Ambre Toulemonde:
Leader election protocol based on external RNG services. BRAINS 2021: 73-80 - [c62]Aline Gouget, Jacques Patarin, Ambre Toulemonde:
Unpredictability properties in Algorand consensus protocol. IEEE ICBC 2021: 1-3 - [i35]Gilles Macario-Rat, Jacques Patarin:
Ariadne Thread and Salt: New Multivariate Cryptographic Schemes with Public Keys in Degree 3. IACR Cryptol. ePrint Arch. 2021: 84 (2021) - [i34]Gilles Macario-Rat, Jacques Patarin:
UOV-Pepper: New Public Key Short Signature in Degree 3. IACR Cryptol. ePrint Arch. 2021: 1006 (2021) - [i33]Gilles Macario-Rat, Jacques Patarin:
Onyx: New Encryption and Signature Schemes with Multivariate Public Key in Degree 3. IACR Cryptol. ePrint Arch. 2021: 1070 (2021) - 2020
- [c61]Aline Gouget, Jacques Patarin, Ambre Toulemonde:
(Quantum) Cryptanalysis of Misty Schemes. ICISC 2020: 43-57 - [i32]Benoît Cogliati, Jacques Patarin:
Mirror Theory: A simple proof of the Pi+Pj Theorem with xi_max=2. IACR Cryptol. ePrint Arch. 2020: 734 (2020) - [i31]Jacques Patarin, Gilles Macario-Rat, Maxime Bros, Eliane Koussa:
Ultra-Short Multivariate Public Key Signatures. IACR Cryptol. ePrint Arch. 2020: 914 (2020)
2010 – 2019
- 2019
- [c60]Ward Beullens, Jean-Charles Faugère, Eliane Koussa, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret:
PKP-Based Signature Scheme. INDOCRYPT 2019: 3-22 - [i30]Eliane Koussa, Gilles Macario-Rat, Jacques Patarin:
On the complexity of the Permuted Kernel Problem. IACR Cryptol. ePrint Arch. 2019: 412 (2019) - 2018
- [j8]Valérie Nachef
, Jacques Patarin, Emmanuel Volte:
Generic attacks with standard deviation analysis on a-feistel schemes. Cryptogr. Commun. 10(1): 59-77 (2018) - [c59]Jacques Patarin:
Two Simple Composition Theorems with H-coefficients. AFRICACRYPT 2018: 72-86 - [c58]Gilles Macario-Rat, Jacques Patarin:
Two-Face: New Public Key Multivariate Schemes. AFRICACRYPT 2018: 252-265 - [c57]Eliane Koussa, Jean-Charles Faugère, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret:
Combinatorial Digital Signature Scheme. BDCSIntell 2018: 48-54 - [i29]Jean-Charles Faugère, Eliane Koussa, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret:
PKP-Based Signature Scheme. IACR Cryptol. ePrint Arch. 2018: 714 (2018) - 2017
- [b1]Valérie Nachef, Jacques Patarin, Emmanuel Volte:
Feistel Ciphers - Security Proofs and Cryptanalysis. Springer 2017, ISBN 978-3-319-49528-6, pp. 1-309 - [j7]Jacques Patarin:
Mirror theory and cryptography. Appl. Algebra Eng. Commun. Comput. 28(4): 321-338 (2017) - [c56]Jacques Patarin, Valérie Nachef:
Commutativity, Associativity, and Public Key Cryptography. NuTMiC 2017: 104-117 - [i28]Nicolas T. Courtois, Klaus Schmeh, Jörg Drobick, Jacques Patarin, Maria-Bristena Oprisanu, Matteo Scarlata, Om Bhallamudi:
Cryptographic Security Analysis of T-310. IACR Cryptol. ePrint Arch. 2017: 440 (2017) - [i27]Gilles Macario-Rat, Jacques Patarin:
Two-Face: New Public Key Multivariate Schemes. IACR Cryptol. ePrint Arch. 2017: 1210 (2017) - 2016
- [j6]Jean-Sébastien Coron, Thomas Holenstein, Robin Künzler, Jacques Patarin, Yannick Seurin, Stefano Tessaro:
How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction. J. Cryptol. 29(1): 61-114 (2016) - [c55]Valérie Nachef, Jacques Patarin, Armel Dubois-Nayt:
Mary of Guise's Enciphered Letters. The New Codebreakers 2016: 3-24 - [i26]Jacques Patarin, Valérie Nachef:
Commutativity, Associativity, and Public Key Cryptography. IACR Cryptol. ePrint Arch. 2016: 171 (2016) - [i25]Jacques Patarin:
Mirror Theory and Cryptography. IACR Cryptol. ePrint Arch. 2016: 702 (2016) - [i24]Jacques Patarin:
Two Simple Composition Theorems with H-coefficients. IACR Cryptol. ePrint Arch. 2016: 956 (2016) - 2014
- [c54]Benoit Cogliati, Rodolphe Lampe, Jacques Patarin:
The Indistinguishability of the XOR of k Permutations. FSE 2014: 285-302 - [c53]Benoit Cogliati, Jacques Patarin, Yannick Seurin:
Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results. Selected Areas in Cryptography 2014: 129-146 - [i23]Valérie Nachef, Jacques Patarin, Emmanuel Volte:
4-point Attacks with Standard Deviation Analysis on A-Feistel Schemes. IACR Cryptol. ePrint Arch. 2014: 446 (2014) - 2013
- [c52]Jacques Patarin:
Generic Attacks for the Xor of k Random Permutations. ACNS 2013: 154-169 - [c51]Valérie Nachef, Emmanuel Volte, Jacques Patarin:
Differential Attacks on Generalized Feistel Schemes. CANS 2013: 1-19 - [c50]Emmanuel Volte, Jacques Patarin, Valérie Nachef:
Zero Knowledge with Rubik's Cubes and Non-abelian Groups. CANS 2013: 74-91 - [i22]Jacques Patarin:
Security in O(2n) for the Xor of Two Random Permutations \\ - Proof with the standard H technique -. IACR Cryptol. ePrint Arch. 2013: 368 (2013) - 2012
- [j5]Jacques Patarin:
Transfinite Cryptography. Int. J. Unconv. Comput. 8(1): 61-72 (2012) - [c49]Rodolphe Lampe, Jacques Patarin, Yannick Seurin:
An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. ASIACRYPT 2012: 278-295 - [c48]Jacques Patarin, Benjamin Gittins, Joana Treger:
Increasing Block Sizes Using Feistel Networks: The Example of the AES. Cryptography and Security 2012: 67-82 - [c47]Jacques Patarin:
Some Transfinite Generalisations of Gödel's Incompleteness Theorem. Computation, Physics and Beyond 2012: 183-193 - [c46]Valérie Nachef, Jacques Patarin, Emmanuel Volte:
Zero-Knowledge for Multivariate Polynomials. LATINCRYPT 2012: 194-213 - [c45]Rodolphe Lampe, Jacques Patarin:
Analysis of Some Natural Variants of the PKP Algorithm. SECRYPT 2012: 209-214 - [c44]Avradip Mandal, Jacques Patarin, Yannick Seurin:
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. TCC 2012: 285-302 - [i21]Rodolphe Lampe, Jacques Patarin:
Security of Feistel Schemes with New and Various Tools. IACR Cryptol. ePrint Arch. 2012: 131 (2012) - [i20]Emmanuel Volte, Jacques Patarin, Valérie Nachef:
Zero Knowledge with Rubik's Cubes. IACR Cryptol. ePrint Arch. 2012: 174 (2012) - [i19]Valérie Nachef, Jacques Patarin, Emmanuel Volte:
Zero-Knowledge for Multivariate Polynomials. IACR Cryptol. ePrint Arch. 2012: 239 (2012) - 2011
- [r1]Louis Goubin, Jacques Patarin, Bo-Yin Yang:
Multivariate Cryptography. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 824-828 - [i18]Avradip Mandal, Jacques Patarin, Yannick Seurin:
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. IACR Cryptol. ePrint Arch. 2011: 496 (2011) - [i17]Rodolphe Lampe, Jacques Patarin:
Analysis of some natural variants of the PKP Algorithm. IACR Cryptol. ePrint Arch. 2011: 686 (2011) - [i16]Valérie Nachef, Emmanuel Volte, Jacques Patarin:
Differential Attacks on Generalized Feistel Schemes. IACR Cryptol. ePrint Arch. 2011: 705 (2011) - 2010
- [j4]Jacques Patarin, Valérie Nachef:
"I Shall Love You Until Death" (Marie-Antoinette to Axel von Fersen). Cryptologia 34(2): 104-114 (2010) - [c43]Emmanuel Volte, Valérie Nachef, Jacques Patarin:
Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. ASIACRYPT 2010: 94-111 - [c42]Avradip Mandal, Jacques Patarin, Valérie Nachef:
Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations. INDOCRYPT 2010: 69-81 - [c41]Valérie Nachef, Jacques Patarin, Joana Treger:
Generic Attacks on Misty Schemes. LATINCRYPT 2010: 222-240 - [i15]Jacques Patarin:
Transfinite Cryptography. IACR Cryptol. ePrint Arch. 2010: 1 (2010) - [i14]Jacques Patarin:
Introduction to Mirror Theory: Analysis of Systems of Linear Equalities and Linear Non Equalities for Cryptography. IACR Cryptol. ePrint Arch. 2010: 287 (2010) - [i13]Jacques Patarin:
Security of balanced and unbalanced Feistel Schemes with Linear Non Equalities. IACR Cryptol. ePrint Arch. 2010: 293 (2010)
2000 – 2009
- 2009
- [j3]Côme Berbain, Henri Gilbert, Jacques Patarin:
QUAD: A multivariate stream cipher with provable security. J. Symb. Comput. 44(12): 1703-1723 (2009) - [c40]Joana Treger, Jacques Patarin:
Generic Attacks on Feistel Networks with Internal Permutations. AFRICACRYPT 2009: 41-59 - [i12]Valérie Nachef, Jacques Patarin:
I shall love you up to the death. IACR Cryptol. ePrint Arch. 2009: 166 (2009) - [i11]Valérie Nachef, Jacques Patarin, Joana Treger:
Generic Attacks on Misty Schemes -5 rounds is not enough-. IACR Cryptol. ePrint Arch. 2009: 405 (2009) - [i10]Olivier Billet, Jacques Patarin, Yannick Seurin:
Analysis of Intermediate Field Systems. IACR Cryptol. ePrint Arch. 2009: 542 (2009) - 2008
- [j2]Paul Camion, Jacques Patarin:
t-resilient functions and the partial exposure problem. Appl. Algebra Eng. Commun. Comput. 19(2): 99-133 (2008) - [c39]Jacques Patarin:
A Proof of Security in O(2n) for the Benes Scheme. AFRICACRYPT 2008: 209-220 - [c38]Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin:
The Random Oracle Model and the Ideal Cipher Model Are Equivalent. CRYPTO 2008: 1-20 - [c37]Jacques Patarin:
A Proof of Security in O(2n) for the Xor of Two Random Permutations. ICITS 2008: 232-248 - [c36]Jacques Patarin, Yannick Seurin:
Building Secure Block Ciphers on Generic Attacks Assumptions. Selected Areas in Cryptography 2008: 66-81 - [c35]Jacques Patarin:
The "Coefficients H" Technique. Selected Areas in Cryptography 2008: 328-345 - [i9]Jacques Patarin:
Generic Attacks for the Xor of k random permutations. IACR Cryptol. ePrint Arch. 2008: 9 (2008) - [i8]Jacques Patarin:
A Proof of Security in O(2n) for the Xor of Two Random Permutations. IACR Cryptol. ePrint Arch. 2008: 10 (2008) - [i7]Jacques Patarin:
Generic Attacks on Feistel Schemes. IACR Cryptol. ePrint Arch. 2008: 36 (2008) - [i6]Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin:
The Random Oracle Model and the Ideal Cipher Model are Equivalent. IACR Cryptol. ePrint Arch. 2008: 246 (2008) - 2007
- [c34]Jacques Patarin, Valérie Nachef, Côme Berbain:
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. ASIACRYPT 2007: 325-341 - [i5]David Arditti, Côme Berbain, Olivier Billet, Henri Gilbert, Jacques Patarin:
QUAD: Overview and Recent Developments. Symmetric Cryptography 2007 - [i4]Jacques Patarin, Valérie Nachef, Côme Berbain:
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. IACR Cryptol. ePrint Arch. 2007: 449 (2007) - 2006
- [c33]Jacques Patarin, Valérie Nachef, Côme Berbain:
Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions. ASIACRYPT 2006: 396-411 - [c32]Côme Berbain, Henri Gilbert, Jacques Patarin:
QUAD: A Practical Stream Cipher with Provable Security. EUROCRYPT 2006: 109-128 - [c31]Aline Gouget, Jacques Patarin:
Probabilistic Multivariate Cryptography. VIETCRYPT 2006: 1-18 - 2005
- [c30]Jacques Patarin, Audrey Montreuil:
Benes and Butterfly Schemes Revisited. ICISC 2005: 92-116 - [c29]Jacques Patarin:
On Linear Systems of Equations with Distinct Variables and Small Block Size. ICISC 2005: 299-321 - [i3]Jacques Patarin, Audrey Montreuil:
Benes and Butterfly schemes revisited. IACR Cryptol. ePrint Arch. 2005: 4 (2005) - [i2]Jacques Patarin, Paul Camion:
Design of near-optimal pseudorandom functions and pseudorandom permutations in the information-theoretic model. IACR Cryptol. ePrint Arch. 2005: 135 (2005) - 2004
- [c28]Jacques Patarin:
Security of Random Feistel Schemes with 5 or More Rounds. CRYPTO 2004: 106-122 - [c27]Audrey Montreuil, Jacques Patarin:
The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations. INDOCRYPT 2004: 33-47 - 2003
- [c26]Jacques Patarin:
Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security. CRYPTO 2003: 513-529 - [c25]Nicolas T. Courtois, Jacques Patarin:
About the XL Algorithm over GF(2). CT-RSA 2003: 141-157 - [i1]Nicolas T. Courtois, Louis Goubin, Jacques Patarin:
SFLASHv3, a fast asymmetric signature scheme. IACR Cryptol. ePrint Arch. 2003: 211 (2003) - 2001
- [c24]Jacques Patarin:
Generic Attacks on Feistel Schemes. ASIACRYPT 2001: 222-238 - [c23]Jacques Patarin, Nicolas T. Courtois, Louis Goubin:
QUARTZ, 128-Bit Long Digital Signatures. CT-RSA 2001: 282-297 - [c22]Jacques Patarin, Nicolas T. Courtois, Louis Goubin:
FLASH, a Fast Multivariate Signature Algorithm. CT-RSA 2001: 298-307 - 2000
- [j1]Jacques Patarin:
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98. Des. Codes Cryptogr. 20(2): 175-209 (2000) - [c21]Nicolas T. Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir:
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. EUROCRYPT 2000: 392-407
1990 – 1999
- 1999
- [c20]Louis Goubin, Jacques Patarin:
DES and Differential Power Analysis (The "Duplication" Method). CHES 1999: 158-172 - [c19]Aviad Kipnis, Jacques Patarin, Louis Goubin:
Unbalanced Oil and Vinegar Signature Schemes. EUROCRYPT 1999: 206-222 - 1998
- [c18]Jacques Patarin, Louis Goubin, Nicolas T. Courtois:
C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai. ASIACRYPT 1998: 35-49 - [c17]Jacques Patarin, Louis Goubin, Nicolas T. Courtois:
Improved Algorithms for Isomorphisms of Polynomials. EUROCRYPT 1998: 184-200 - [c16]Jacques Patarin:
About Feistel Schemes with Six (or More) Rounds. FSE 1998: 103-121 - 1997
- [c15]Jacques Patarin:
Improved Security Bounds for Pseudorandom Permutations. CCS 1997: 142-150 - [c14]Jacques Patarin, Louis Goubin:
Trapdoor one-way permutations and multivariate polynominals. ICICS 1997: 356-368 - [c13]Jacques Patarin, Louis Goubin:
Asymmetric cryptography with S-Boxes. ICICS 1997: 369-380 - 1996
- [c12]Jacques Patarin:
Asymmetric Cryptography with a Hidden Monomial. CRYPTO 1996: 45-60 - [c11]Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter:
Low-Exponent RSA with Related Messages. EUROCRYPT 1996: 1-9 - [c10]Jacques Patarin:
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. EUROCRYPT 1996: 33-48 - 1995
- [c9]Jacques Patarin:
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88. CRYPTO 1995: 248-261 - 1994
- [c8]Jacques Patarin:
Collisions and Inversions for Damgård's Whole Hash Function. ASIACRYPT 1994: 307-321 - 1993
- [c7]Jacques Patarin, Pascal Chauvaud:
Improved Algorithms for the Permuted Kernel Problem. CRYPTO 1993: 391-402 - [c6]Jacques Patarin:
How to Find and Avoid Collisions for the Knapsack Hash Function. EUROCRYPT 1993: 305-317 - 1992
- [c5]Jacques Patarin:
How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function. EUROCRYPT 1992: 256-266 - 1991
- [c4]Jacques Patarin:
New Results on Pseudorandom Permutation Generators Based on the DES Scheme. CRYPTO 1991: 301-312 - [c3]Paul Camion, Jacques Patarin:
The Knapsack Hash Function proposed at Crypto'89 can be broken. EUROCRYPT 1991: 39-53 - 1990
- [c2]Jacques Patarin:
Pseudorandom Permutations Based on the D.E.S. Scheme. ESORICS 1990: 185-187 - [c1]Jacques Patarin:
Pseudorandom permutations based on the DES scheme. EUROCODE 1990: 193-204
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-11-11 22:28 CET 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:
